Searched refs:best (Results 1 - 25 of 39) sorted by relevance

12

/haiku-fatelf/src/add-ons/kernel/network/protocols/ipv6/
H A Dipv6_utils.cpp61 struct { int base, len; } best, cur; local
74 best.base = -1;
75 best.len = 0;
86 if (best.base == -1 || cur.len > best.len)
87 best = cur;
93 if (best.base == -1 || cur.len > best.len)
94 best = cur;
96 if (best
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dinet_ntop.c146 } best, cur; local
158 best.base = -1;
173 if (best.base == -1 || cur.len > best.len)
174 best = cur;
181 if (best.base == -1 || cur.len > best.len)
182 best = cur;
184 if (best.base != -1 && best
[all...]
/haiku-fatelf/src/kits/network/libbind/inet/
H A Dinet_ntop.c127 struct { int base, len; } best, cur; local
139 best.base = -1;
140 best.len = 0;
151 if (best.base == -1 || cur.len > best.len)
152 best = cur;
158 if (best.base == -1 || cur.len > best.len)
159 best = cur;
161 if (best
[all...]
H A Dinet_cidr_ntop.c163 struct { int base, len; } best, cur; local
180 best.base = -1;
181 best.len = 0;
192 if (best.base == -1 || cur.len > best.len)
193 best = cur;
199 if (best.base == -1 || cur.len > best.len)
200 best = cur;
202 if (best
[all...]
/haiku-fatelf/src/bin/network/tcpdump/missing/
H A Dinet_ntop.c117 } best, cur; local
129 best.base = -1;
141 if (best.base == -1 || cur.len > best.len)
142 best = cur;
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
147 best = cur;
148 if (best.base != -1 && best
[all...]
/haiku-fatelf/src/bin/bash/lib/sh/
H A Dspell.c67 char guess[PATH_MAX + 1], best[PATH_MAX + 1]; local
92 if (mindist(newname, guess, best) >= 3)
98 for (p = best; *np = *p++; np++)
107 mindist(dir, guess, best)
110 char *best;
134 strcpy(best, dp->d_name);
143 if (best[0] == '.' && best[1] == '\0')
/haiku-fatelf/src/servers/app/
H A DClientMemoryAllocator.cpp71 // Search best matching free block from the list
75 struct block* best = NULL; local
78 if (block->size >= size && (best == NULL || block->size < best->size))
79 best = block;
82 if (best == NULL) {
85 best = _AllocateChunk(size, newArea);
86 if (best == NULL)
94 if (best->size == size) {
96 fFreeBlocks.Remove(best);
[all...]
/haiku-fatelf/src/add-ons/accelerants/matrox/engine/
H A Dmga_dac.c346 int best[3]; local
410 /* note the setting if best yet */
414 best[0]=m;
415 best[1]=n;
416 best[2]=p;
422 m = best[0];
423 n = best[1];
424 p = best[2];
464 int best[3]; local
558 /* note the setting if best ye
623 int best[3]; local
755 int best[3]; local
962 int best[3]; local
[all...]
H A Dmga_maven.c338 int best[3]; local
414 /* note the setting if best yet */
418 best[0]=m;
419 best[1]=n;
420 best[2]=p;
427 m=best[0] - 1;
428 n=best[1] - 1;
429 p=best[2] - 1;
568 int best[3]; local
629 /* note the setting if best ye
[all...]
H A Dmga_maventv.c34 int best[5], h_total_mod; local
168 /* remember this best match */
170 best[0] = m;
171 best[1] = n;
172 best[2] = p;
175 best[3] = *ht_new - 2;
178 best[4] = *ht_last_line - 2;
187 m = best[0] - 1;
188 n = best[1] - 1;
189 p = best[
[all...]
/haiku-fatelf/src/add-ons/accelerants/neomagic/engine/
H A Dnm_dac.c208 int best[2]; local
287 /* note the setting if best yet */
291 best[0] = m;
292 best[1] = n;
297 n = best[1] - 1;
300 if (best[0] <= (m_max / 2))
302 m = best[0] - 1;
307 m = (best[0] / 2) - 1;
312 *calc_pclk = (si->ps.f_ref / best[0]) * best[
[all...]
/haiku-fatelf/src/add-ons/accelerants/nvidia/engine/
H A Dnv_dac.c331 int best[3]; local
419 /* note the setting if best yet */
423 best[0]=m;
424 best[1]=n;
425 best[2]=p;
432 m = best[0];
433 n = best[1];
434 p = best[2];
480 int best[3]; local
593 /* note the setting if best ye
[all...]
H A Dnv_dac2.c289 int best[3]; local
376 /* note the setting if best yet */
380 best[0]=m;
381 best[1]=n;
382 best[2]=p;
389 m = best[0];
390 n = best[1];
391 p = best[2];
/haiku-fatelf/src/add-ons/accelerants/nvidia_gpgpu/engine/
H A Dnv_dac.c237 int best[3]; local
335 /* note the setting if best yet */
339 best[0]=m;
340 best[1]=n;
341 best[2]=p;
348 m = best[0];
349 n = best[1];
350 p = best[2];
396 int best[3]; local
471 /* note the setting if best ye
[all...]
H A Dnv_dac2.c234 int best[3]; local
331 /* note the setting if best yet */
335 best[0]=m;
336 best[1]=n;
337 best[2]=p;
344 m = best[0];
345 n = best[1];
346 p = best[2];
/haiku-fatelf/src/add-ons/accelerants/skeleton/engine/
H A Ddac.c225 int best[3]; local
331 /* note the setting if best yet */
335 best[0]=m;
336 best[1]=n;
337 best[2]=p;
344 m = best[0];
345 n = best[1];
346 p = best[2];
392 int best[3]; local
505 /* note the setting if best ye
[all...]
H A Ddac2.c233 int best[3]; local
338 /* note the setting if best yet */
342 best[0]=m;
343 best[1]=n;
344 best[2]=p;
351 m = best[0];
352 n = best[1];
353 p = best[2];
H A Dtvout.c42 int best[5], h_total_mod; local
176 /* remember this best match */
178 best[0] = m;
179 best[1] = n;
180 best[2] = p;
183 best[3] = *ht_new - 2;
186 best[4] = *ht_last_line - 2;
195 m = best[0] - 1;
196 n = best[1] - 1;
197 p = best[
[all...]
/haiku-fatelf/src/add-ons/accelerants/via/engine/
H A Ddac.c252 int best[3]; local
343 /* note the setting if best yet */
347 best[0]=m;
348 best[1]=n;
349 best[2]=p;
356 m = best[0];
357 n = best[1];
358 p = best[2];
399 int best[3]; local
512 /* note the setting if best ye
[all...]
H A Ddac2.c233 int best[3]; local
338 /* note the setting if best yet */
342 best[0]=m;
343 best[1]=n;
344 best[2]=p;
351 m = best[0];
352 n = best[1];
353 p = best[2];
H A Dtvout.c42 int best[5], h_total_mod; local
176 /* remember this best match */
178 best[0] = m;
179 best[1] = n;
180 best[2] = p;
183 best[3] = *ht_new - 2;
186 best[4] = *ht_last_line - 2;
195 m = best[0] - 1;
196 n = best[1] - 1;
197 p = best[
[all...]
/haiku-fatelf/src/bin/gdb/bfd/
H A Dcpu-sh.c370 unsigned int best = ~arch_set; local
394 if (((try & ~arch_set) < (best & ~arch_set)
395 || ((try & ~arch_set) == (best & ~arch_set)
396 && (~try & arch_set) < (~best & arch_set)))
400 best = try;
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dm68k-dis.c187 /* Try to match the current instruction to best and if so, return the
192 const struct m68k_opcode * best, struct private * priv)
211 for (d = best->args; *d; d += 2)
251 if (p - buffer < 4 && (best->match & 0xFFFF) != 0)
257 && (best->match & 0xffff) == 0xffff
258 && best->args[0] == '#'
259 && best->args[1] == 'w')
273 d = best->args;
298 best->name, best
189 match_insn_m68k(bfd_vma memaddr, disassemble_info * info, const struct m68k_opcode * best, struct private * priv) argument
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dsymtab.c779 such best match symbol. This can help in cases
818 struct partial_symbol *best = NULL, *p, **pp;
852 best = p;
876 best = p;
880 return best;
1469 searching the static block here seems best: it's correct and it's
1977 /* Info on best line seen so far, and where it starts, and its file. */
1979 struct linetable_entry *best = NULL;
1991 /* Info on best line seen in this file. */
2103 /* Find the best lin
815 struct partial_symbol *best = NULL, *p, **pp; local
1974 struct linetable_entry *best = NULL; local
2255 int best; local
2387 int best = 0; local
[all...]
/haiku-fatelf/src/bin/diffutils/src/
H A Danalyze.c187 lin best; local
189 best = 0;
198 if (v > best
202 /* We have a good enough best diagonal;
209 best = v;
217 if (best > 0)
224 best = 0;
233 if (v > best
237 /* We have a good enough best diagonal;
244 best
[all...]

Completed in 229 milliseconds

12