Home
last modified time | relevance | path

Searched refs:bestnode (Results 1 – 25 of 28) sorted by relevance

12

/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake3/q3data/
H A Dcompress.c163 int best, bestnode;
166 bestnode = -1;
176 bestnode = i;
180 if (bestnode == -1)
183 hnodes[bestnode].used = true;
184 return bestnode;
517 int best, bestnode;
520 bestnode = -1;
530 bestnode = i;
534 if (bestnode == -1)
[all …]
/dports/games/netradiant/netradiant-20150621-src/tools/quake3/q3data/
H A Dcompress.c165 int best, bestnode;
168 bestnode = -1;
179 bestnode = i;
183 if ( bestnode == -1 ) {
187 hnodes[bestnode].used = true;
188 return bestnode;
525 int best, bestnode;
528 bestnode = -1;
539 bestnode = i;
543 if ( bestnode == -1 ) {
[all …]
/dports/games/gtkradiant/GPL/Q2Tools/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
447 bestnode = -1; in SmallestNode()
457 bestnode = i; in SmallestNode()
461 if (bestnode == -1) in SmallestNode()
464 hnodes[bestnode].used = true; in SmallestNode()
465 return bestnode; in SmallestNode()
799 int best, bestnode; in SmallestNode1() local
802 bestnode = -1; in SmallestNode1()
812 bestnode = i; in SmallestNode1()
816 if (bestnode == -1) in SmallestNode1()
[all …]
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
447 bestnode = -1; in SmallestNode()
457 bestnode = i; in SmallestNode()
461 if (bestnode == -1) in SmallestNode()
464 hnodes[bestnode].used = true; in SmallestNode()
465 return bestnode; in SmallestNode()
799 int best, bestnode; in SmallestNode1() local
802 bestnode = -1; in SmallestNode1()
812 bestnode = i; in SmallestNode1()
816 if (bestnode == -1) in SmallestNode1()
[all …]
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/qdata/
H A Dvideo.c435 int best, bestnode; in SmallestNode() local
438 bestnode = -1; in SmallestNode()
449 bestnode = i; in SmallestNode()
453 if ( bestnode == -1 ) { in SmallestNode()
457 hnodes[bestnode].used = true; in SmallestNode()
458 return bestnode; in SmallestNode()
796 int best, bestnode; in SmallestNode1() local
799 bestnode = -1; in SmallestNode1()
810 bestnode = i; in SmallestNode1()
814 if ( bestnode == -1 ) { in SmallestNode1()
[all …]
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/extra/qdata/
H A Dvideo.c444 int best, bestnode; in SmallestNode() local
447 bestnode = -1; in SmallestNode()
457 bestnode = i; in SmallestNode()
461 if (bestnode == -1) in SmallestNode()
464 hnodes[bestnode].used = true; in SmallestNode()
465 return bestnode; in SmallestNode()
799 int best, bestnode; in SmallestNode1() local
802 bestnode = -1; in SmallestNode1()
812 bestnode = i; in SmallestNode1()
816 if (bestnode == -1) in SmallestNode1()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
441 bestnode = node; in memory_less_node_alloc()
446 if (bestnode == NUMA_NO_NODE) in memory_less_node_alloc()
447 bestnode = anynode; in memory_less_node_alloc()
452 bestnode); in memory_less_node_alloc()
455 __func__, pernodesize, PERCPU_PAGE_SIZE, bestnode, in memory_less_node_alloc()
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
441 bestnode = node; in memory_less_node_alloc()
446 if (bestnode == NUMA_NO_NODE) in memory_less_node_alloc()
447 bestnode = anynode; in memory_less_node_alloc()
452 bestnode); in memory_less_node_alloc()
455 __func__, pernodesize, PERCPU_PAGE_SIZE, bestnode, in memory_less_node_alloc()
/dports/multimedia/libv4l/linux-5.13-rc2/arch/ia64/mm/
H A Ddiscontig.c434 int bestnode = NUMA_NO_NODE, node, anynode = 0; in memory_less_node_alloc() local
441 bestnode = node; in memory_less_node_alloc()
446 if (bestnode == NUMA_NO_NODE) in memory_less_node_alloc()
447 bestnode = anynode; in memory_less_node_alloc()
452 bestnode); in memory_less_node_alloc()
455 __func__, pernodesize, PERCPU_PAGE_SIZE, bestnode, in memory_less_node_alloc()
/dports/devel/fossil/fossil-src-2.17/tools/cvs2fossil/lib/
H A Dc2f_cyclebreaker.tcl346 set bestnode {}
361 set bestnode $cset
365 set bestnode $cset
371 log write 5 cyclebreaker "Breaking $label by splitting changeset [$bestnode str]"
372 set ID [$bestnode id]
382 Replace $dg $bestnode $newcsets
/dports/games/quake2max/Quake2maX_0.45-src_unix/ref_gl/
H A Dgl_cin.c106 int best, bestnode; in SmallestNode1() local
109 bestnode = -1; in SmallestNode1()
119 bestnode = i; in SmallestNode1()
123 if (bestnode == -1) in SmallestNode1()
126 cin->h_used[bestnode] = true; in SmallestNode1()
127 return bestnode; in SmallestNode1()
/dports/games/quake2lnx/quake2-r0.16.2/src/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
218 bestnode = -1; in SmallestNode1()
228 bestnode = i; in SmallestNode1()
232 if (bestnode == -1) in SmallestNode1()
235 cin.h_used[bestnode] = true; in SmallestNode1()
236 return bestnode; in SmallestNode1()
/dports/games/quake2-source/quake2-r0.16.2/src/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
218 bestnode = -1; in SmallestNode1()
228 bestnode = i; in SmallestNode1()
232 if (bestnode == -1) in SmallestNode1()
235 cin.h_used[bestnode] = true; in SmallestNode1()
236 return bestnode; in SmallestNode1()
/dports/games/q2p/Q2P-0.2-2006-12-31/client/
H A Dcl_cin.c212 int best, bestnode; in SmallestNode1() local
215 bestnode = -1; in SmallestNode1()
223 bestnode = i; in SmallestNode1()
227 if (bestnode == -1) in SmallestNode1()
230 cin.h_used[bestnode] = true; in SmallestNode1()
231 return bestnode; in SmallestNode1()
/dports/games/r1q2/r1q2-8012_5/client/
H A Dcl_cin.c216 int best, bestnode; in SmallestNode1() local
219 bestnode = -1; in SmallestNode1()
229 bestnode = i; in SmallestNode1()
233 if (bestnode == -1) in SmallestNode1()
236 cin.h_used[bestnode] = true; in SmallestNode1()
237 return bestnode; in SmallestNode1()
/dports/games/qudos/QuDos-0.40.1-src/src/client/
H A Dcl_cin.c188 int best , bestnode; in SmallestNode1() local
191 bestnode = -1; in SmallestNode1()
199 bestnode = i; in SmallestNode1()
203 if (bestnode == -1) in SmallestNode1()
206 cin.h_used[bestnode] = true; in SmallestNode1()
207 return bestnode; in SmallestNode1()
/dports/games/quake2max/Quake2maX_0.45-src_unix/client/
H A Dcl_cin.c215 int best, bestnode; in SmallestNode1() local
218 bestnode = -1; in SmallestNode1()
228 bestnode = i; in SmallestNode1()
232 if (bestnode == -1) in SmallestNode1()
235 cin.h_used[bestnode] = true; in SmallestNode1()
236 return bestnode; in SmallestNode1()
/dports/games/q2pro/q2pro/source/
H A Dcl_cin.c217 int best, bestnode; in SmallestNode1() local
220 bestnode = -1; in SmallestNode1()
230 bestnode = i; in SmallestNode1()
234 if (bestnode == -1) in SmallestNode1()
237 cin.h_used[bestnode] = qtrue; in SmallestNode1()
238 return bestnode; in SmallestNode1()
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/blossom/concorde97/EDGEGEN/
H A Dxnear.c599 int j, bestnode = 0; local
617 bestnode = j;
630 bestnode = j;
634 return xn->nodenames[bestnode];
721 int j, bestnode = 0; local
732 bestnode = j;
742 bestnode = j;
752 bestnode = j;
761 bestnode = j;
767 return bestnode;
/dports/games/xonotic/Xonotic/source/qcsrc/server/pathlib/
H A Dmain.qc224 entity bestnode = NULL;
229 if(!bestnode || it.pathlib_node_f < bestnode.pathlib_node_f)
230 bestnode = it;
233 return bestnode;
/dports/math/concorde/concorde/TSP/
H A Dddecker.c80 int marker, int *bestnode, double *bestval),
82 int marker, int *bestnode, double *bestval),
1149 int *marks, int marker, int *bestnode, double *bestval) in find_smallest_marked() argument
1154 *bestnode = -1; in find_smallest_marked()
1160 *bestnode = j; in find_smallest_marked()
1172 *bestnode = -1; in find_largest_marked()
1178 *bestnode = j; in find_largest_marked()
1274 int i, j, k, bestnode, hits, al, acount; in comb_to_star() local
1379 add_x_to_node_neighbors (g, x, bestnode, values); in comb_to_star()
1380 marks[bestnode] = 1; in comb_to_star()
[all …]
/dports/games/gtkradiant/GPL/GtkRadiant/tools/quake2/qdata_heretic2/
H A Dvideo.c768 int best, bestnode;
771 bestnode = -1;
781 bestnode = i;
785 if (bestnode == -1)
788 hnodes[bestnode].used = true;
789 return(bestnode);
/dports/games/netradiant/netradiant-20150621-src/tools/quake2/qdata_heretic2/
H A Dvideo.c767 int best, bestnode;
770 bestnode = -1;
781 bestnode = i;
785 if ( bestnode == -1 ) {
789 hnodes[bestnode].used = true;
790 return( bestnode );
/dports/math/concorde/concorde/EDGEGEN/
H A Dxnear.c562 int j, bestnode = 0; in CCedgegen_x_node_nearest() local
580 bestnode = j; in CCedgegen_x_node_nearest()
593 bestnode = j; in CCedgegen_x_node_nearest()
597 return xn->nodenames[bestnode]; in CCedgegen_x_node_nearest()
661 int j, bestnode = 0; in CCedgegen_junk_node_nearest() local
672 bestnode = j; in CCedgegen_junk_node_nearest()
682 bestnode = j; in CCedgegen_junk_node_nearest()
692 bestnode = j; in CCedgegen_junk_node_nearest()
701 bestnode = j; in CCedgegen_junk_node_nearest()
707 return bestnode; in CCedgegen_junk_node_nearest()
/dports/math/gap/gap-4.11.0/pkg/images-1.3.0/gap/set_smallest_image/
H A Dnsi_horriblesetsethack.g63 newnode, image, dict, seen, he, bestim, bestnode,
454 bestnode := node;
460 bestnode := node;
465 return [bestnode.image,l];

12