/external/openssh/openbsd-compat/ |
H A D | inet_ntop.c | 119 struct { int base, len; } best, cur; local 132 best.base = -1; 142 if (best.base == -1 || cur.len > best.len) 143 best = cur; 149 if (best.base == -1 || cur.len > best.len) 150 best = cur; 152 if (best.base != -1 && best [all...] |
/external/tcpdump/missing/ |
H A D | inet_ntop.c | 117 } 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...] |
/external/ppp/pppd/plugins/pppoatm/ |
H A D | misc.c | 24 int i,best; local 30 best = -1; 35 best = i; 40 if (best > -1) (*pos) += best_len; 41 return best;
|
/external/openssh/ |
H A D | dh.c | 129 int best, bestcount, which; local 141 best = bestcount = 0; 152 if ((dhg.size > wantbits && dhg.size < best) || 153 (dhg.size > best && best < wantbits)) { 154 best = dhg.size; 157 if (dhg.size == best) 174 dhg.size != best ||
|
/external/chromium/net/http/ |
H A D | http_auth.cc | 36 scoped_ptr<HttpAuthHandler> best; local 49 if (cur.get() && (!best.get() || best->score() < cur->score()) && 51 best.swap(cur); 53 handler->swap(best);
|
/external/clang/utils/ |
H A D | FindSpecRefs | 604 best = None 625 if best is None or dist < best[0]: 626 best = (dist, (section, name, page)) 627 return best[1] 637 best = None 641 if best is None or dist < best[0]: 642 best = (dist,'l'+m.group(1)) 644 if best i [all...] |
H A D | CmpDriver | 48 best = None 52 if best is None or candidate < best[0]: 53 best = (candidate, a_0, j) 54 a = best[1]
|
/external/libvpx/vp8/encoder/ |
H A D | encodemb.c | 288 int best; local 361 /* And pick the best. */ 362 best = rd_cost1 < rd_cost0; 366 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); 367 tokens[i][0].error = d2 + (best ? error1 : error0); 371 best_mask[0] |= best << i; 427 /* And pick the best. */ 428 best = rd_cost1 < rd_cost0; 436 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); 437 tokens[i][1].error = d2 + (best [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
H A D | SDL_x11modes.c | 126 int best = -1; local 133 best = i; 138 if ( best < 0 || 139 (modes[i]->hdisplay < modes[best]->hdisplay && 140 modes[i]->vdisplay <= modes[best]->vdisplay) || 141 (modes[i]->vdisplay < modes[best]->vdisplay && 142 modes[i]->hdisplay <= modes[best]->hdisplay) ) { 143 best = i; 147 if ( best >= 0 && 148 ((modes[best] [all...] |
/external/quake/quake/src/WinQuake/ |
H A D | pr_exec.cpp | 224 dfunction_t *f, *best; local 233 best = NULL; 240 best = f; 243 if (best) 246 Con_Printf ("%7i %s\n", best->profile, pr_strings+best->s_name); 248 best->profile = 0; 250 } while (best);
|
/external/libvpx/vp8/common/ |
H A D | findnearmv.h | 59 MV *nearest, MV *nearby, MV *best,
|
/external/llvm/lib/Analysis/ |
H A D | PathProfileInfo.cpp | 124 BallLarusEdge* best = 0; local 131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 132 best = *next; 135 return best;
|
/external/jdiff/src/jdiff/ |
H A D | DiffMyers.java | 207 int best = 0; 215 if (fd[fdiagoff + d] * 2 - dd > best 222 /* We have a good enough best diagonal; 230 best = fd[fdiagoff + d] * 2 - dd; 236 if (best > 0) 242 best = 0; 248 if ((xlim - bd[bdiagoff + d]) * 2 + dd > best 252 /* We have a good enough best diagonal; 262 best = (xlim - bd[bdiagoff + d]) * 2 + dd; 268 if (best > [all...] |
/external/llvm/test/Bindings/Ocaml/ |
H A D | analysis.ml | 9 (* Note that this takes a moment to link, so it's best to keep the number of
|
H A D | bitwriter.ml | 7 (* Note that this takes a moment to link, so it's best to keep the number of
|
H A D | bitreader.ml | 7 (* Note that this takes a moment to link, so it's best to keep the number of
|
/external/quake/quake/src/QW/server/ |
H A D | pr_exec.c | 224 dfunction_t *f, *best; local 233 best = NULL; 240 best = f; 243 if (best) 246 Con_Printf ("%7i %s\n", best->profile, PR_GetString(best->s_name)); 248 best->profile = 0; 250 } while (best);
|
/external/libvorbis/vq/ |
H A D | bookutil.c | 52 int best=-1; local 63 if(best==-1 || this<best){ 64 best=this;
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
H A D | statetracker.py | 355 best = None 357 # Deletion is best. 358 best = deletion 363 # Insertion is best. 364 best = insertion 370 # Substitution is best. 371 best = substitution 379 distance[i+1].append(best)
|
/external/webp/src/enc/ |
H A D | backward_references.c | 486 // We loop one pixel at a time, but store all currently best points to 725 VP8LBackwardRefs* const best) { 733 VP8LInitBackwardRefs(best); 767 *best = refs_lz77; // default guess: lz77 is better 778 *best = refs_trace; 783 *best = refs_rle; 786 if (use_2d_locality) BackwardReferences2DLocality(width, best); 792 VP8LClearBackwardRefs(best); 722 VP8LGetBackwardReferences(int width, int height, const uint32_t* const argb, int quality, int cache_bits, int use_2d_locality, VP8LBackwardRefs* const best) argument
|
H A D | backward_references.h | 196 // Evaluates best possible backward references for specified quality. 201 VP8LBackwardRefs* const best);
|
/external/quake/quake/src/QW/client/ |
H A D | screen.c | 706 int best;
local 724 best = i;
728 lastbest = best;
729 return best;
|
/external/v8/benchmarks/ |
H A D | raytrace.js | 682 var best = new Flog.RayTracer.IntersectionInfo(); 683 best.distance = 2000; 690 if(info.isHit && info.distance >= 0 && info.distance < best.distance){ 691 best = info; 696 best.hitCount = hits; 697 return best;
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-raytrace.js | 708 var best = new Flog.RayTracer.IntersectionInfo(); 709 best.distance = 2000; 716 if(info.isHit && info.distance >= 0 && info.distance < best.distance){ 717 best = info; 722 best.hitCount = hits; 723 return best;
|
/external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-raytrace.js | 708 var best = new Flog.RayTracer.IntersectionInfo(); 709 best.distance = 2000; 716 if(info.isHit && info.distance >= 0 && info.distance < best.distance){ 717 best = info; 722 best.hitCount = hits; 723 return best;
|