/external/freetype/src/pshinter/ |
pshglob.c | 90 FT_Pos best = 64 + 32 + 2; 104 if ( dist < best ) 106 best = dist;
|
/external/v8/benchmarks/ |
raytrace.js | 713 var best = new Flog.RayTracer.IntersectionInfo(); 714 best.distance = 2000; 721 if(info.isHit && info.distance >= 0 && info.distance < best.distance){ 722 best = info; 727 best.hitCount = hits; 728 return best;
|
/external/webkit/SunSpider/tests/v8-v4/ |
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/bluetooth/glib/tests/ |
queue-test.c | 87 gint *best = user_data; local 90 if (element > *best) 91 *best = element; 97 gint *best = user_data; local 100 if (element < *best) 101 *best = element;
|
/external/quake/quake/src/QW/client/ |
gl_draw.c | 123 int best, best2; local 128 best = BLOCK_HEIGHT; 136 if (scrap_allocated[texnum][i+j] >= best) 144 *y = best = best2; 148 if (best + h > BLOCK_HEIGHT) 152 scrap_allocated[texnum][*x + i] = best + h; [all...] |
gl_rsurf.c | 1435 int best, best2; local 1440 best = BLOCK_HEIGHT; 1448 if (allocated[texnum][i+j] >= best) 1456 *y = best = best2; 1460 if (best + h > BLOCK_HEIGHT) 1464 allocated[texnum][*x + i] = best + h; [all...] |
gl_screen.c | 756 int best = 0; local 774 best = i; 778 lastbest = best; 779 return best;
|
/external/zlib/contrib/masm686/ |
match.asm | 118 bestlen = 28 ; size of best match so far
339 ;/* then automatically accept it as the best possible match and leave. */
347 ;/* If the length of the match is not longer than the best match we */
|
/packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
OpenWnnClauseConverterJAJP.java | 179 /* there may be no way to be the best sequence from the 'start' */ 184 /* there may be no way to be the best sequence from the 'start' */ 215 /* update the best sub-sentence on the cache buffer */ 349 /* reserve only the best clause */ 350 WnnClause best = (WnnClause)clauseList.get(0); local 351 if (best.frequency < clause.frequency) {
|
/external/webkit/JavaScriptCore/wtf/ |
FastMalloc.cpp | [all...] |
/dalvik/vm/reflect/ |
Proxy.c | 454 bool best, dupe; local 461 * assignable to our return type, then we're not the best. 467 best = true; 487 best = false; 492 * If this is the best of a set of duplicates, copy it over and 499 if (best) { 500 LOGV("BEST %d %s.%s -> %d\n", i, 577 LOGV("BEST not %d\n", i); [all...] |
/external/v8/src/ |
d8.cc | 60 LineEditor* best = current; local 62 if (current->type_ > best->type_) 63 best = current; 66 return best;
|
/external/quake/quake/src/WinQuake/ |
gl_draw.cpp | 435 int best, best2; local 441 best = BLOCK_HEIGHT; 449 if (scrap_allocated[texnum][i+j] >= best) 457 *y = best = best2; 461 if (best + h > BLOCK_HEIGHT) 465 scrap_allocated[texnum][*x + i] = best + h; [all...] |
gl_rsurf.cpp | 1503 int best, best2; local [all...] |
/external/qemu/distrib/sdl-1.2.12/src/video/x11/ |
SDL_x11video.c | 1310 int best = 0; local [all...] |
/external/tremolo/Tremolo/ |
vorbisfile.c | 1193 ogg_int64_t best=begin; local [all...] |
/external/webkit/WebKit/android/nav/ |
CachedFrame.h | 94 const CachedNode* findBestAt(const WebCore::IntRect& , int* best,
|
/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 */
|
/frameworks/base/services/java/com/android/server/ |
LocationManagerService.java | 742 private LocationProviderInterface best(List<String> providerNames) { method in class:LocationManagerService 793 * Returns the name of the provider that best meets the given criteria. Only providers 795 * returned. If several providers meet the criteria, the one with the best 812 * @return name of the provider that best matches the requirements 817 return best(goodProviders).getName(); 831 return best(goodProviders).getName(); 842 return best(goodProviders).getName(); 849 return best(goodProviders).getName(); 856 return best(goodProviders).getName(); [all...] |
/external/zlib/contrib/masmx64/ |
gvmat64.asm | 77 ;bestlen equ rsp + xx - LocalVarsSize ; size of best match so far -> r11d
472 ;;; then automatically accept it as the best possible match and leave.
479 ;;; If the length of the match is not longer than the best match we
|
/external/zlib/contrib/masmx86/ |
match686.asm | 128 bestlen equ esp + 28 ; size of best match so far
388 ;;; then automatically accept it as the best possible match and leave.
396 ;;; If the length of the match is not longer than the best match we
|
/external/zlib/contrib/pascal/ |
zlibpas.pas | 43 data_type: Integer; (* best guess about the data type: ascii or binary *)
|
/external/libxml2/ |
relaxng.c | 9279 int best = -1; local 9546 int best = -1; local 9583 int best; local [all...] |
/external/freetype/src/autofit/ |
aflatin.c | 1448 FT_Pos best = 64 + 32 + 2; local [all...] |
aflatin2.c | 1531 FT_Pos best = 64 + 32 + 2; local [all...] |