/external/ppp/pppd/plugins/pppoatm/ |
misc.c | 24 int i,best; local 30 best = -1; 35 best = i; 40 if (best > -1) (*pos) += best_len; 41 return best;
|
/bionic/libc/inet/ |
inet_ntop.c | 110 struct { int base, len; } best, cur; local 123 best.base = -1; 124 best.len = 0; 135 if (best.base == -1 || cur.len > best.len) 136 best = cur; 142 if (best.base == -1 || cur.len > best.len) 143 best = cur; 145 if (best.base != -1 && best.len < 2 [all...] |
/external/openssh/openbsd-compat/ |
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.len < 2 [all...] |
/external/tcpdump/missing/ |
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.len < 2 [all...] |
/external/chromium/net/http/ |
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);
|
/frameworks/base/core/java/android/text/util/ |
Rfc822Tokenizer.java | 216 int best = 0; local 230 best = i; 235 return best;
|
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_utilities_indexing.h | 96 double best; local 99 best=s[0];pos=0; 100 if(s[1]>best){best=s[1];pos=1;} 101 if(s[2]>best){best=s[2];pos=2;} 107 double best; local 110 best=s[0];pos=0; 111 if(s[1]>best){best=s[1];pos=1; 119 double best; local 132 double best; local 146 double best; local 161 double best; local 176 double best; local 193 double t,best; local 204 double t,best; local [all...] |
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_utilities_indexing.h | 96 double best; local 99 best=s[0];pos=0; 100 if(s[1]>best){best=s[1];pos=1;} 101 if(s[2]>best){best=s[2];pos=2;} 107 double best; local 110 best=s[0];pos=0; 111 if(s[1]>best){best=s[1];pos=1; 119 double best; local 132 double best; local 146 double best; local 161 double best; local 176 double best; local 193 double t,best; local 204 double t,best; local [all...] |
/external/openssh/ |
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/quake/quake/src/WinQuake/ |
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);
|
/ndk/sources/host-tools/make-3.81/ |
strcache.c | 60 struct strcache *best = NULL; local 71 the blocks and choose the one with the best fit (the one that leaves the 74 if (sp->bytesfree > len && (!best || best->bytesfree > sp->bytesfree)) 75 best = sp; 78 if (!best) 79 best = new_cache(); 81 assert (best->bytesfree > len); 83 /* Add the string to the best cache. */ 84 res = best->end [all...] |
/external/libvorbis/vq/ |
bookutil.c | 52 int best=-1; local 63 if(best==-1 || this<best){ 64 best=this;
|
/external/llvm/lib/Analysis/ |
PathProfileInfo.cpp | 124 BallLarusEdge* best = 0; local 131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 132 best = *next; 135 return best;
|
/external/quake/quake/src/QW/server/ |
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);
|
/dalvik/vm/reflect/ |
Proxy.cpp | 394 bool best, dupe; local 401 * assignable to our return type, then we're not the best. 407 best = true; 427 best = false; 432 * If this is the best of a set of duplicates, copy it over and 439 if (best) { 440 ALOGV("BEST %d %s.%s -> %d", i, 517 ALOGV("BEST not %d", i); [all...] |
/external/libvpx/vp8/encoder/ |
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 ? error1 : error0) [all...] |
/frameworks/base/core/java/android/util/ |
TimeUtils.java | 64 TimeZone best = null; local 91 if (best == null) { 94 best = tz; 99 return best;
|
/ndk/sources/host-tools/sed-4.2.1/sed/ |
fmt.c | 40 "best". Adjust to taste, subject to the caveats given. */ 131 short line_length; /* length of the best line starting here */ 132 COST best_cost; /* cost of best paragraph starting here */ 438 register COST wcost, best; local 447 best = MAXCOST; 463 if (wcost < best) 465 best = wcost; 472 start->best_cost = best + base_cost (start);
|
/packages/apps/Settings/src/com/android/settings/ |
DisplaySettings.java | 160 int best = 0; local 164 best = i; 168 entries[best]);
|
/external/jdiff/src/jdiff/ |
DiffMyers.java | 207 int best = 0; local 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 > 0 [all...] |
/external/libvorbis/lib/ |
res0.c | 357 int best=-1; local 368 if(best==-1 || this<best){ 370 best=this;
|
/external/qemu/distrib/sdl-1.2.15/src/video/ |
SDL_video.c | 467 int best; local 475 best=0; 479 /* Mode with any dimension smaller or equal than current best ? */ 480 if ((sizes[i]->w <= sizes[best]->w) || (sizes[i]->h <= sizes[best]->h)) { 482 if ((sizes[i]->w * sizes[i]->h) <= (sizes[best]->w * sizes[best]->h)) { 483 best=i; 490 *w=sizes[best]->w; 491 *h=sizes[best]->h [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/x11/ |
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]->hdisplay != mode.hdisplay) | [all...] |
SDL_x11video.c | 1335 int best = 0; local [all...] |
/external/speex/libspeex/ |
jitter.c | 185 int best = 0; local 231 best = latest; 257 deltaT = best-worst; 260 /*fprintf(stderr, "auto_tradeoff = %d (%d %d %d)\n", jitter->auto_tradeoff, best, worst, i);*/ 521 /* Searching for the packet that fits best */
|