Home
last modified time | relevance | path

Searched refs:fch (Results 1 – 25 of 501) sorted by relevance

12345678910>>...21

/dports/archivers/unzip/unzip60/vms/
H A Dvmsdefs.h254 #define fch$v_nobackup fch$r_fch_union.fch$r_fill_1_bits.fch$v_nobackup
258 #define fch$v_contigb fch$r_fch_union.fch$r_fill_1_bits.fch$v_contigb
259 #define fch$v_locked fch$r_fch_union.fch$r_fill_1_bits.fch$v_locked
260 #define fch$v_contig fch$r_fch_union.fch$r_fill_1_bits.fch$v_contig
261 #define fch$v_badacl fch$r_fch_union.fch$r_fill_1_bits.fch$v_badacl
262 #define fch$v_spool fch$r_fch_union.fch$r_fill_1_bits.fch$v_spool
265 #define fch$v_markdel fch$r_fch_union.fch$r_fill_1_bits.fch$v_markdel
267 #define fch$v_erase fch$r_fch_union.fch$r_fill_1_bits.fch$v_erase
268 #define fch$v_shelved fch$r_fch_union.fch$r_fill_1_bits.fch$v_shelved
269 #define fch$v_scratch fch$r_fch_union.fch$r_fill_1_bits.fch$v_scratch
[all …]
/dports/archivers/zip/zip30/vms/
H A Dvmsdefs.h254 #define fch$v_nobackup fch$r_fch_union.fch$r_fill_1_bits.fch$v_nobackup
258 #define fch$v_contigb fch$r_fch_union.fch$r_fill_1_bits.fch$v_contigb
259 #define fch$v_locked fch$r_fch_union.fch$r_fill_1_bits.fch$v_locked
260 #define fch$v_contig fch$r_fch_union.fch$r_fill_1_bits.fch$v_contig
261 #define fch$v_badacl fch$r_fch_union.fch$r_fill_1_bits.fch$v_badacl
262 #define fch$v_spool fch$r_fch_union.fch$r_fill_1_bits.fch$v_spool
265 #define fch$v_markdel fch$r_fch_union.fch$r_fill_1_bits.fch$v_markdel
267 #define fch$v_erase fch$r_fch_union.fch$r_fill_1_bits.fch$v_erase
268 #define fch$v_shelved fch$r_fch_union.fch$r_fill_1_bits.fch$v_shelved
269 #define fch$v_scratch fch$r_fch_union.fch$r_fill_1_bits.fch$v_scratch
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/test/jdk/java/nio/channels/FileChannel/
H A DTruncateRAF.java45 long fchLength = fch.size(); in checkState()
46 long fchOffset = fch.position(); in checkState()
68 checkState(raf, fch, 0, 0); in main()
75 fch.position(84); in main()
91 fch.position(32); in main()
95 fch.truncate(42); in main()
99 fch.truncate(16); in main()
131 fch.truncate(42); in main()
143 fch.truncate(256); in main()
147 fch.truncate(42); in main()
[all …]
/dports/devel/cmph/cmph-2.0/src/
H A Dfch.c30 fch->m = fch->b = 0; in fch_config_new()
31 fch->c = fch->p1 = fch->p2 = 0.0; in fch_config_new()
91 fch->h1 = hash_state_new(fch->hashfuncs[0], fch->m); in mapping()
92 fch->b = fch_calc_b(fch->c, fch->m); in mapping()
93 fch->p1 = fch_calc_p1(fch->m); in mapping()
94 fch->p2 = fch_calc_p2(fch->b); in mapping()
105 h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1); in mapping()
168 if (fch->g) free (fch->g); in searching()
184 fch->h2 = hash_state_new(fch->hashfuncs[1], fch->m); in searching()
404 h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1); in fch_search()
[all …]
/dports/devel/gobject-introspection/gobject-introspection-1.70.0/girepository/cmph/
H A Dfch.c32 fch->m = fch->b = 0; in fch_config_new()
33 fch->c = fch->p1 = fch->p2 = 0.0; in fch_config_new()
93 fch->h1 = hash_state_new(fch->hashfuncs[0], fch->m); in mapping()
94 fch->b = fch_calc_b(fch->c, fch->m); in mapping()
95 fch->p1 = fch_calc_p1(fch->m); in mapping()
96 fch->p2 = fch_calc_p2(fch->b); in mapping()
107 h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1); in mapping()
170 if (fch->g) free (fch->g); in searching()
186 fch->h2 = hash_state_new(fch->hashfuncs[1], fch->m); in searching()
420 h1 = mixh10h11h12 (fch->b, fch->p1, fch->p2, h1); in fch_search()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/IO/
H A DTriangulation_off_ostream.h70 for( ; vit != fch->vertices_end(); ++vit )
155 fch != tr.finite_full_cells_end() ; ++fch)
159 vit != fch->vertices_end() ; ++vit)
173 fch != tr.full_cells_end() ; ++fch)
175 if (tr.is_infinite(fch))
179 vit != fch->vertices_end() ; ++vit)
193 fch != tr.finite_full_cells_end() ; ++fch)
198 << index_of_vertex[fch->vertex(2)]
203 << index_of_vertex[fch->vertex(3)]
208 << index_of_vertex[fch->vertex(3)]
[all …]
/dports/devel/cvs-devel/cvs-1.12.13/vms/
H A Dvmsmunch_private.h134 unsigned fch$v_nobackup : 1 ;
135 unsigned fch$v_writeback : 1;
138 unsigned fch$v_contigb : 1;
139 unsigned fch$v_locked : 1;
140 unsigned fch$v_contig : 1;
142 unsigned fch$v_badacl : 1;
143 unsigned fch$v_spool : 1;
145 unsigned fch$v_badblock : 1;
146 unsigned fch$v_markdel : 1;
147 unsigned fch$v_nocharge : 1;
[all …]
/dports/math/spooles-mpich/spooles.2.2/Tree/src/
H A Djustify.c59 int *fch, *metric, *par, *sib ; in Tree_leftJustifyI() local
75 fch = tree->fch ; in Tree_leftJustifyI()
83 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyI()
85 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyI()
92 fch[k] = i ; in Tree_leftJustifyI()
139 int *fch, *par, *sib ; in Tree_leftJustifyD() local
156 fch = tree->fch ; in Tree_leftJustifyD()
164 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyD()
166 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyD()
173 fch[k] = i ; in Tree_leftJustifyD()
H A Dinit.c42 tree->fch = IVinit(size, -1) ; in Tree_init1()
106 int fch[], in Tree_init3() argument
115 || par == NULL || fch == NULL || sib == NULL ) { in Tree_init3()
117 "\n bad input\n", tree, size, par, fch, sib) ; in Tree_init3()
132 IVcopy(size, tree->fch, fch) ; in Tree_init3()
156 int *fch, *par, *sib ; in Tree_setFchSibRoot() local
172 fch = tree->fch ; in Tree_setFchSibRoot()
179 IVfill(n, tree->fch, -1) ; in Tree_setFchSibRoot()
190 sib[u] = fch[v] ; in Tree_setFchSibRoot()
191 fch[v] = u ; in Tree_setFchSibRoot()
/dports/math/spooles-mpich/spooles.2.2_SHARED/Tree/src/
H A Djustify.c59 int *fch, *metric, *par, *sib ; in Tree_leftJustifyI() local
75 fch = tree->fch ; in Tree_leftJustifyI()
83 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyI()
85 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyI()
92 fch[k] = i ; in Tree_leftJustifyI()
139 int *fch, *par, *sib ; in Tree_leftJustifyD() local
156 fch = tree->fch ; in Tree_leftJustifyD()
164 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyD()
166 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyD()
173 fch[k] = i ; in Tree_leftJustifyD()
H A Dinit.c42 tree->fch = IVinit(size, -1) ; in Tree_init1()
106 int fch[], in Tree_init3() argument
115 || par == NULL || fch == NULL || sib == NULL ) { in Tree_init3()
117 "\n bad input\n", tree, size, par, fch, sib) ; in Tree_init3()
132 IVcopy(size, tree->fch, fch) ; in Tree_init3()
156 int *fch, *par, *sib ; in Tree_setFchSibRoot() local
172 fch = tree->fch ; in Tree_setFchSibRoot()
179 IVfill(n, tree->fch, -1) ; in Tree_setFchSibRoot()
190 sib[u] = fch[v] ; in Tree_setFchSibRoot()
191 fch[v] = u ; in Tree_setFchSibRoot()
/dports/math/spooles/spooles.2.2_SHARED/Tree/src/
H A Djustify.c59 int *fch, *metric, *par, *sib ; in Tree_leftJustifyI() local
75 fch = tree->fch ; in Tree_leftJustifyI()
83 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyI()
85 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyI()
92 fch[k] = i ; in Tree_leftJustifyI()
139 int *fch, *par, *sib ; in Tree_leftJustifyD() local
156 fch = tree->fch ; in Tree_leftJustifyD()
164 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyD()
166 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyD()
173 fch[k] = i ; in Tree_leftJustifyD()
H A Dinit.c42 tree->fch = IVinit(size, -1) ; in Tree_init1()
106 int fch[], in Tree_init3() argument
115 || par == NULL || fch == NULL || sib == NULL ) { in Tree_init3()
117 "\n bad input\n", tree, size, par, fch, sib) ; in Tree_init3()
132 IVcopy(size, tree->fch, fch) ; in Tree_init3()
156 int *fch, *par, *sib ; in Tree_setFchSibRoot() local
172 fch = tree->fch ; in Tree_setFchSibRoot()
179 IVfill(n, tree->fch, -1) ; in Tree_setFchSibRoot()
190 sib[u] = fch[v] ; in Tree_setFchSibRoot()
191 fch[v] = u ; in Tree_setFchSibRoot()
/dports/math/spooles/spooles.2.2/Tree/src/
H A Djustify.c59 int *fch, *metric, *par, *sib ; in Tree_leftJustifyI() local
75 fch = tree->fch ; in Tree_leftJustifyI()
83 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyI()
85 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyI()
92 fch[k] = i ; in Tree_leftJustifyI()
139 int *fch, *par, *sib ; in Tree_leftJustifyD() local
156 fch = tree->fch ; in Tree_leftJustifyD()
164 for ( i = fch[k], fch[k] = -1 ; i != -1 ; i = nexti ) { in Tree_leftJustifyD()
166 for ( j = fch[k], prev = -1 ; j != -1 ; j = sib[j] ) { in Tree_leftJustifyD()
173 fch[k] = i ; in Tree_leftJustifyD()
H A Dinit.c42 tree->fch = IVinit(size, -1) ; in Tree_init1()
106 int fch[], in Tree_init3() argument
115 || par == NULL || fch == NULL || sib == NULL ) { in Tree_init3()
117 "\n bad input\n", tree, size, par, fch, sib) ; in Tree_init3()
132 IVcopy(size, tree->fch, fch) ; in Tree_init3()
156 int *fch, *par, *sib ; in Tree_setFchSibRoot() local
172 fch = tree->fch ; in Tree_setFchSibRoot()
179 IVfill(n, tree->fch, -1) ; in Tree_setFchSibRoot()
190 sib[u] = fch[v] ; in Tree_setFchSibRoot()
191 fch[v] = u ; in Tree_setFchSibRoot()
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gdb/gdb/rdi-share/
H A Dlogging.c87 char fch = *(++format); /* get format character (skipping '%') */ in va_warn0() local
100 if ((fch >= '0') && (fch <= '9')) in va_warn0()
102 if (fch == '0') in va_warn0()
106 fch = *(++format); in va_warn0()
109 while ((fch >= '0') && (fch <= '9')) in va_warn0()
111 width = ((width * 10) + (fch - '0')); in va_warn0()
112 fch = *(++format); in va_warn0()
116 if (fch == 'l') in va_warn0()
118 fch = *(++format); in va_warn0()
120 switch (fch) in va_warn0()
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gdb/gdb/rdi-share/
H A Dlogging.c87 char fch = *(++format); /* get format character (skipping '%') */ in va_warn0() local
100 if ((fch >= '0') && (fch <= '9')) in va_warn0()
102 if (fch == '0') in va_warn0()
106 fch = *(++format); in va_warn0()
109 while ((fch >= '0') && (fch <= '9')) in va_warn0()
111 width = ((width * 10) + (fch - '0')); in va_warn0()
112 fch = *(++format); in va_warn0()
116 if (fch == 'l') in va_warn0()
118 fch = *(++format); in va_warn0()
120 switch (fch) in va_warn0()
/dports/math/spooles-mpich/spooles.2.2_SHARED/DSTree/src/
H A Dutil.c91 if ( (K = tree->fch[J]) != -1 ) { in DSTree_renumberViaPostOT()
97 IVcopy(n, tree->fch, temp) ; in DSTree_renumberViaPostOT()
139 int *fch, *map ; in DSTree_domainWeight() local
155 fch = tree->fch ; in DSTree_domainWeight()
159 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
166 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
187 int *fch, *map ; in DSTree_separatorWeight() local
203 fch = tree->fch ; in DSTree_separatorWeight()
207 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()
214 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()
/dports/math/spooles-mpich/spooles.2.2/DSTree/src/
H A Dutil.c91 if ( (K = tree->fch[J]) != -1 ) { in DSTree_renumberViaPostOT()
97 IVcopy(n, tree->fch, temp) ; in DSTree_renumberViaPostOT()
139 int *fch, *map ; in DSTree_domainWeight() local
155 fch = tree->fch ; in DSTree_domainWeight()
159 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
166 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
187 int *fch, *map ; in DSTree_separatorWeight() local
203 fch = tree->fch ; in DSTree_separatorWeight()
207 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()
214 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()
/dports/math/spooles/spooles.2.2/DSTree/src/
H A Dutil.c91 if ( (K = tree->fch[J]) != -1 ) { in DSTree_renumberViaPostOT()
97 IVcopy(n, tree->fch, temp) ; in DSTree_renumberViaPostOT()
139 int *fch, *map ; in DSTree_domainWeight() local
155 fch = tree->fch ; in DSTree_domainWeight()
159 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
166 if ( fch[ireg] == -1 ) { in DSTree_domainWeight()
187 int *fch, *map ; in DSTree_separatorWeight() local
203 fch = tree->fch ; in DSTree_separatorWeight()
207 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()
214 if ( fch[ireg] != -1 ) { in DSTree_separatorWeight()

12345678910>>...21