/dports/cad/scotch/scotch-6.0.4/src/libscotch/ |
H A D | kgraph_map_df_loop.c | 320 if (sorttab[partnum].partval == partval) { in KGRAPHMAPDFLOOPNAME() 322 sorttab[partnum].edlosum += edloval; in KGRAPHMAPDFLOOPNAME() 328 sorttab[partnbr].diffval = diffval; in KGRAPHMAPDFLOOPNAME() 329 sorttab[partnbr].edlosum = edloval; in KGRAPHMAPDFLOOPNAME() 337 sorttab[partnum].diffval *= sorttab[partnum].distval; in KGRAPHMAPDFLOOPNAME() 339 sorttab[partnum].diffval /= sorttab[partnum].distval; in KGRAPHMAPDFLOOPNAME() 349 soplval = sorttab[partnum].edlosum; in KGRAPHMAPDFLOOPNAME() 359 sfplval += sorttab[partnum].edlosum; in KGRAPHMAPDFLOOPNAME() 361 dfplval += sorttab[partnum].edlosum * sorttab[partnum].distval; in KGRAPHMAPDFLOOPNAME() 363 dfplval += sorttab[partnum].edlosum / sorttab[partnum].distval; in KGRAPHMAPDFLOOPNAME() [all …]
|
H A D | graph_io_mmkt.c | 90 GraphGeomMmktEdge * sorttab; in graphGeomLoadMmkt() local 171 if ((intLoad (filesrcptr, &sorttab[sortnbr].vertnum[0]) != 1) || /* Read edge ends */ in graphGeomLoadMmkt() 172 (intLoad (filesrcptr, &sorttab[sortnbr].vertnum[1]) != 1) || in graphGeomLoadMmkt() 179 …if ((sorttab[sortnbr].vertnum[0] < baseval) || (sorttab[sortnbr].vertnum[0] >= (mrownbr + baseval)… in graphGeomLoadMmkt() 180 … (sorttab[sortnbr].vertnum[1] < baseval) || (sorttab[sortnbr].vertnum[1] >= (mrownbr + baseval))) { in graphGeomLoadMmkt() 186 if (sorttab[sortnbr].vertnum[0] != sorttab[sortnbr].vertnum[1]) { /* If not loop edge */ in graphGeomLoadMmkt() 187 sorttab[sortnbr + 1].vertnum[0] = sorttab[sortnbr].vertnum[1]; /* Add symmetric edge */ in graphGeomLoadMmkt() 188 sorttab[sortnbr + 1].vertnum[1] = sorttab[sortnbr].vertnum[0]; in graphGeomLoadMmkt() 193 intSort2asc2 (sorttab, sortnbr); /* Sort edges by increasing indices */ in graphGeomLoadMmkt() 208 while (vertnum < sorttab[sortnum].vertnum[0]) /* Fill gaps with isolated vertices */ in graphGeomLoadMmkt() [all …]
|
H A D | bdgraph_bipart_ex.c | 106 BdgraphBipartExSort * sorttab; in bdgraphBipartEx() local 154 &sorttab, (size_t) (sortsiz), NULL) == NULL) { in bdgraphBipartEx() 290 sorttab[sortnbr].veloval = loadglbtab[procnum]; in bdgraphBipartEx() 291 sorttab[sortnbr].procnum = (Gnum) procnum; in bdgraphBipartEx() 298 sorttab[sortnum].prioval = (sorttab[sortnum].procnum + procglbnbr - procmax) % procglbnbr; in bdgraphBipartEx() 300 intSort3asc2 (sorttab, sortnbr); /* Sort contributions array unambiguously */ in bdgraphBipartEx() 306 compglbloadtmp = compglbloaddlt - sorttab[sortnum].veloval; in bdgraphBipartEx() 313 if (sorttab[sortnum].procnum != proclocnum) /* If this is not our job to handle it */ in bdgraphBipartEx() 316 movetab = (BdgraphBipartExMove *) sorttab; /* TRICK: recycle sorttab array as move array */ in bdgraphBipartEx() 347 if (sorttab[sortnum].procnum == proclocnum) { /* If we are the process to do it */ in bdgraphBipartEx() [all …]
|
H A D | kgraph_map_ex.c | 80 KgraphMapExSort * restrict sorttab; in kgraphMapEx() local 107 &sorttab, (size_t) (sortnbr * sizeof (KgraphMapExSort)), in kgraphMapEx() 173 sorttab[sortnbr].veloval = veloval; /* Record it for sorting */ in kgraphMapEx() 174 sorttab[sortnbr].vertnum = vertnum; in kgraphMapEx() 187 intSort2asc1 (sorttab, sortnbr); in kgraphMapEx() 194 vertnum = sorttab[sortnum].vertnum; in kgraphMapEx() 195 veloval = sorttab[sortnum].veloval; in kgraphMapEx()
|
/dports/cad/scotch/scotch-6.0.4/src/scotch/ |
H A D | amk_grf.c | 111 C_VertSort * sorttab; /* Vertex label sort area */ in main() local 210 if ((sorttab = (C_VertSort *) memAlloc (vertnbr * sizeof (C_VertSort))) == NULL) { in main() 216 sorttab[vertnum].vlblnum = vlbltab[vertnum]; in main() 217 sorttab[vertnum].vertnum = vertnum; in main() 219 intSort2asc1 (sorttab, vertnbr); /* Sort by ascending labels */ in main() 222 while ((vertnum < vertnbr) && (sorttab[vertnum].vlblnum < listtab[listnum])) in main() 225 (sorttab[vertnum].vlblnum > listtab[listnum])) { in main() 227 memFree (sorttab); in main() 231 listtab[listnum] = sorttab[vertnum ++].vertnum; /* Replace label by number */ in main() 233 memFree (sorttab); /* Free sort area */ in main()
|
/dports/devel/arm-elf-binutils/binutils-2.37/libctf/ |
H A D | ctf-string.c | 430 ctf_str_atom_t **sorttab; member 482 s->sorttab[s->i++] = atom; in ctf_str_populate_sorttab() 507 ctf_str_atom_t **sorttab; in ctf_str_write_strtab() local 532 if (!sorttab) in ctf_str_write_strtab() 535 sorttab[0] = nullstr; in ctf_str_write_strtab() 537 s.sorttab = sorttab; in ctf_str_write_strtab() 554 ctf_str_update_refs (sorttab[i], sorttab[i]->csa_external_offset); in ctf_str_write_strtab() 555 sorttab[i]->csa_offset = sorttab[i]->csa_external_offset; in ctf_str_write_strtab() 563 sorttab[i]->csa_offset = cur_stroff; in ctf_str_write_strtab() 568 free (sorttab); in ctf_str_write_strtab() [all …]
|
/dports/devel/gdb/gdb-11.1/libctf/ |
H A D | ctf-string.c | 430 ctf_str_atom_t **sorttab; member 482 s->sorttab[s->i++] = atom; in ctf_str_populate_sorttab() 507 ctf_str_atom_t **sorttab; in ctf_str_write_strtab() local 532 if (!sorttab) in ctf_str_write_strtab() 535 sorttab[0] = nullstr; in ctf_str_write_strtab() 537 s.sorttab = sorttab; in ctf_str_write_strtab() 554 ctf_str_update_refs (sorttab[i], sorttab[i]->csa_external_offset); in ctf_str_write_strtab() 555 sorttab[i]->csa_offset = sorttab[i]->csa_external_offset; in ctf_str_write_strtab() 563 sorttab[i]->csa_offset = cur_stroff; in ctf_str_write_strtab() 568 free (sorttab); in ctf_str_write_strtab() [all …]
|
/dports/devel/gnulibiberty/binutils-2.37/libctf/ |
H A D | ctf-string.c | 430 ctf_str_atom_t **sorttab; member 482 s->sorttab[s->i++] = atom; in ctf_str_populate_sorttab() 507 ctf_str_atom_t **sorttab; in ctf_str_write_strtab() local 532 if (!sorttab) in ctf_str_write_strtab() 535 sorttab[0] = nullstr; in ctf_str_write_strtab() 537 s.sorttab = sorttab; in ctf_str_write_strtab() 554 ctf_str_update_refs (sorttab[i], sorttab[i]->csa_external_offset); in ctf_str_write_strtab() 555 sorttab[i]->csa_offset = sorttab[i]->csa_external_offset; in ctf_str_write_strtab() 563 sorttab[i]->csa_offset = cur_stroff; in ctf_str_write_strtab() 568 free (sorttab); in ctf_str_write_strtab() [all …]
|
/dports/devel/binutils/binutils-2.37/libctf/ |
H A D | ctf-string.c | 430 ctf_str_atom_t **sorttab; member 482 s->sorttab[s->i++] = atom; in ctf_str_populate_sorttab() 507 ctf_str_atom_t **sorttab; in ctf_str_write_strtab() local 532 if (!sorttab) in ctf_str_write_strtab() 535 sorttab[0] = nullstr; in ctf_str_write_strtab() 537 s.sorttab = sorttab; in ctf_str_write_strtab() 554 ctf_str_update_refs (sorttab[i], sorttab[i]->csa_external_offset); in ctf_str_write_strtab() 555 sorttab[i]->csa_offset = sorttab[i]->csa_external_offset; in ctf_str_write_strtab() 563 sorttab[i]->csa_offset = cur_stroff; in ctf_str_write_strtab() 568 free (sorttab); in ctf_str_write_strtab() [all …]
|
/dports/audio/gtkpod/gtkpod-1.0.0/src/ |
H A D | display_sorttabs.c | 327 st = sorttab[inst]; in sp_remove_all_members() 376 st = sorttab[inst]; in sp_update_date_interval_from_string() 542 st = sorttab[inst]; in st_add_track_special() 630 st = sorttab[inst]; in sp_store_sp_entries() 654 st = sorttab[inst]; in sp_go() 676 st = sorttab[inst]; in st_remove_track_special() 700 st = sorttab[inst]; in st_track_changed_special() 746 st = sorttab[inst]; in sp_conditions_changed() 922 if (sorttab[i] && (sorttab[i]->notebook == notebook)) in st_get_instance_from_notebook() 939 if (sorttab[i] && (sorttab[i]->treeview[cat] == tv)) in st_get_instance_from_treeview() [all …]
|
/dports/converters/p5-Cstools/Cstools-3.44/t/ |
H A D | cssort.t | 24 my $sorttab = 'sort.tab'; 25 $sorttab = 't/' . $sorttab if -d 't'; 27 open FILE, $sorttab or die "Error reading $sorttab: $!\n"; 61 open FILE, $sorttab or die "Error reading $sorttab: $!\n";
|
/dports/cad/scotch/scotch-6.0.4/src/esmumps/ |
H A D | symbol_fax.c | 262 sorttab = (INT *) ((byte *) hashtab + sortoft); in symbolFax() 288 sorttab[sortnbr ++] = colend; /* Add end column to sort array */ in symbolFax() 295 intSort1asc1 (sorttab, sortnbr); /* Sort neighbor array */ in symbolFax() 310 colend = sorttab[sortnum]; in symbolFax() 328 (sorttab[sortnum] - 1 == sorttab[sortnum - 1]) && in symbolFax() 329 (sorttab[sortnum] < rangtax[cblkctr + 1])) ; in symbolFax() 330 bloktax[bloknum].lrownum = sorttab[sortnum - 1]; /* Set end of block */ in symbolFax() 350 colend = sorttab[sortnum]; in symbolFax() 367 (sorttab[sortnum] - 1 == sorttab[sortnum - 1]) && in symbolFax() 368 (sorttab[sortnum] < rangtax[cblkctr + 1])) ; in symbolFax() [all …]
|
/dports/editors/vim/vim-8.2.3745/src/ |
H A D | profiler.c | 477 ufunc_T **sorttab, in prof_sort_list() argument 489 fp = sorttab[i]; in prof_sort_list() 725 ufunc_T **sorttab; in func_dump_profile() local 734 sorttab = ALLOC_MULT(ufunc_T *, todo); in func_dump_profile() 744 if (sorttab != NULL) in func_dump_profile() 745 sorttab[st_len++] = fp; in func_dump_profile() 784 if (sorttab != NULL && st_len > 0) in func_dump_profile() 786 qsort((void *)sorttab, (size_t)st_len, sizeof(ufunc_T *), in func_dump_profile() 788 prof_sort_list(fd, sorttab, st_len, "TOTAL", FALSE); in func_dump_profile() 791 prof_sort_list(fd, sorttab, st_len, "SELF", TRUE); in func_dump_profile() [all …]
|
/dports/devel/plan9port/plan9port-1f098efb7370a0b28306d10681e21883fb1c1507/src/cmd/compress/ |
H A D | compress.c | 893 code_int sorttab[1<<BITS]; /* sorted pointers into htab */ variable 907 sorttab[codetabof(i)] = i; in dump_tab() 915 stack_top = in_stack((htabof(sorttab[i])>>maxbits)&0xff, in dump_tab() 917 for(ent=htabof(sorttab[i]) & ((1<<maxbits)-1); in dump_tab() 919 ent=htabof(sorttab[ent]) & ((1<<maxbits)-1)) { in dump_tab() 920 stack_top = in_stack(htabof(sorttab[ent]) >> maxbits, in dump_tab()
|
/dports/games/omega/omega/ |
H A D | compress.c | 1139 code_int sorttab[1<<BITS]; /* sorted pointers into htab */ variable 1154 sorttab[codetabof(i)] = i; 1162 stack_top = in_stack((htabof(sorttab[i])>>maxbits)&0xff, 1164 for(ent=htabof(sorttab[i]) & ((1<<maxbits)-1); 1166 ent=htabof(sorttab[ent]) & ((1<<maxbits)-1)) { 1167 stack_top = in_stack(htabof(sorttab[ent]) >> maxbits,
|
/dports/misc/bible-kjv/bible-kjv/ |
H A D | squish.c | 1317 code_int sorttab[1<<BITS]; /* sorted pointers into htab */ variable 1332 sorttab[codetabof(i)] = i; 1340 stack_top = in_stack((htabof(sorttab[i])>>maxbits)&0xff, 1342 for(ent=htabof(sorttab[i]) & ((1<<maxbits)-1); 1344 ent=htabof(sorttab[ent]) & ((1<<maxbits)-1)) { 1345 stack_top = in_stack(htabof(sorttab[ent]) >> maxbits,
|
H A D | TAGS | 282 code_int sorttab[1416,39313
|
/dports/devel/R-cran-bit64/bit64/man/ |
H A D | sortnut.rd | 32 \alias{sorttab} 33 \alias{sorttab.integer64} 73 sorttab(sorted, nunique, \dots) 95 \method{sorttab}{integer64}(sorted, nunique, \dots) 132 …\code{sorttab} \tab \code{ordertab} \tab \code{sortordertab} \tab \code{\link[=table.integer64]{ta…
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gdb/sim/sh/ |
H A D | gencode.c | 2244 sorttab () in sorttab() function 2261 sorttab (); in gengastab() 2443 sorttab ();
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gdb/sim/sh/ |
H A D | gencode.c | 2244 sorttab () in sorttab() function 2261 sorttab (); in gengastab() 2443 sorttab ();
|
/dports/devel/avr-gdb/gdb-7.3.1/sim/sh/ |
H A D | gencode.c | 2559 sorttab () in sorttab() function 2576 sorttab (); in gengastab() 2812 sorttab ();
|
/dports/devel/gdb761/gdb-7.6.1/sim/sh/ |
H A D | gencode.c | 2559 sorttab () in sorttab() function 2576 sorttab (); in gengastab() 2812 sorttab ();
|
/dports/devel/R-cran-bit64/bit64/ |
H A D | NAMESPACE | 250 , sorttab 251 , sorttab.integer64 513 S3method("sorttab", integer64)
|
/dports/archivers/snappy-java/snappy-java-1.1.7.5/src/test/resources/org/xerial/snappy/testdata/calgary/ |
H A D | progc | 1181 code_int sorttab[1<<BITS]; /* sorted pointers into htab */ 1196 sorttab[codetabof(i)] = i; 1204 stack_top = in_stack((htabof(sorttab[i])>>maxbits)&0xff, 1206 for(ent=htabof(sorttab[i]) & ((1<<maxbits)-1); 1208 ent=htabof(sorttab[ent]) & ((1<<maxbits)-1)) { 1209 stack_top = in_stack(htabof(sorttab[ent]) >> maxbits,
|
/dports/devel/R-cran-bit64/bit64/R/ |
H A D | sortuse64.R | 462 sorttab <- function(sorted, nunique, ...)UseMethod("sorttab") function
|