/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;
|
/external/syslinux/com32/sysdump/ |
rbtree.c | 51 struct rbtree *best = NULL; local 59 best = tree; 63 return best;
|
/external/syslinux/core/thread/ |
schedule.c | 16 struct thread *st, *nt, *best; local 48 best = NULL; 60 if (!best || nt->prio < best->prio) 61 best = nt; 68 if (!best) 71 if (best != curr) { 76 dprintf("@ %llu -> %p (%s)\n", tsc, best, best->name); 77 __switch_to(best); [all...] |
/bionic/libc/upstream-openbsd/lib/libc/net/ |
inet_ntop.c | 105 struct { int base, len; } best, cur; local 118 best.base = -1; 128 if (best.base == -1 || cur.len > best.len) 129 best = cur; 135 if (best.base == -1 || cur.len > best.len) 136 best = cur; 138 if (best.base != -1 && best.len < 2 [all...] |
/device/linaro/bootloader/edk2/StdLib/LibC/NetUtil/ |
inet_ntop.c | 140 struct { int base, len; } best, cur;
local 156 best.base = -1;
157 best.len = 0;
168 if (best.base == -1 || cur.len > best.len)
169 best = cur;
175 if (best.base == -1 || cur.len > best.len)
176 best = cur;
178 if (best.base != -1 && best.len < 2) [all...] |
/external/curl/lib/ |
inet_ntop.c | 91 } best, cur; local 103 best.base = -1; 105 best.len = 0; 116 if(best.base == -1 || cur.len > best.len) 117 best = cur; 121 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) 122 best = cur; 123 if(best.base != -1 && best.len < 2 [all...] |
/external/mesa3d/src/gallium/state_trackers/clover/util/ |
factor.hpp | 117 auto best = std::make_pair(T(1), std::vector<T>(grid.size(), T(1))); local 119 for (auto block = best; 120 block.first != 0 && best.first != product_limit; 122 if (block.first > best.first) 123 best = block; 126 return best.second;
|
/frameworks/compile/mclinker/lib/Support/ |
TargetRegistry.cpp | 35 Target* best = NULL, * ambiguity = NULL; local 41 if (best == NULL || highest < quality) { 43 best = *target; 51 if (best == NULL) { 57 pError = std::string("Ambiguous targets: \"") + best->name() + "\" and \"" + 62 return best;
|
/frameworks/support/compat/src/main/java/androidx/core/graphics/ |
TypefaceCompatBaseImpl.java | 55 T best = null; local 62 if (best == null || bestScore > score) { 63 best = font; 67 return best; 140 FontFileResourceEntry best = findBestEntry(entry, style); 141 if (best == null) { 145 context, resources, best.getResourceId(), best.getFileName(), style);
|
/external/selinux/python/sepolgen/src/sepolgen/ |
matching.py | 60 def best(self): member in class:MatchList
|
/external/tcpdump/ |
addrtostr.c | 115 } best, cur; local 126 best.len = 0; 127 best.base = -1; 140 if (best.base == -1 || cur.len > best.len) 141 best = cur; 145 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) 146 best = cur; 147 if (best.base != -1 && best.len < 2 [all...] |
/frameworks/minikin/libs/minikin/ |
Measurement.cpp | 101 size_t best = searchStart; local 111 best = i; 118 return best;
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/sepolgen/ |
matching.py | 60 def best(self): member in class:MatchList
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
MultiDirectional.java | 71 final RealPointValuePair best = original[0]; local 75 if (comparator.compare(reflected, best) < 0) { 91 if (comparator.compare(contracted, best) < 0) { 113 * @param comparator comparator to use to sort simplex vertices from best to poorest 114 * @return best point in the transformed simplex
|
/external/fio/ |
workqueue.c | 25 struct submit_worker **best) 33 if (!(*best) || sw->seq < (*best)->seq) 34 *best = sw; 44 struct submit_worker *sw, *best = NULL; local 48 sw = __get_submit_worker(wq, next, wq->max_workers - 1, &best); 50 sw = __get_submit_worker(wq, 0, next - 1, &best); 53 * No truly idle found, use best match 56 sw = best;
|
/external/skia/src/pathops/ |
SkIntersections.cpp | 142 SkDVector best = fPt[result] - origin; local 144 if (test.crossCheck(best) < 0) {
|
/external/skia/tests/ |
StrokerTest.cpp | 151 int best = 0; local 162 if (best < gMaxRecursion[2]) { 170 best = gMaxRecursion[2]; 179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 230 int best = 0; local 254 if (best < gMaxRecursion[2]) { 262 best = gMaxRecursion[2]; 271 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 340 int best = 0; local 358 if (best < gMaxRecursion[2]) 385 int best[2] = { 0 }; local [all...] |
/external/skqp/src/pathops/ |
SkIntersections.cpp | 142 SkDVector best = fPt[result] - origin; local 144 if (test.crossCheck(best) < 0) {
|
/external/skqp/tests/ |
StrokerTest.cpp | 151 int best = 0; local 162 if (best < gMaxRecursion[2]) { 170 best = gMaxRecursion[2]; 179 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 230 int best = 0; local 254 if (best < gMaxRecursion[2]) { 262 best = gMaxRecursion[2]; 271 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); 340 int best = 0; local 358 if (best < gMaxRecursion[2]) 385 int best[2] = { 0 }; local [all...] |
/external/syslinux/extlinux/ |
mountinfo.c | 199 const struct mountinfo *m, *best; local 221 best = NULL; 236 best = m; 240 if (best && subpath) { 241 if (real_path[best->pathlen] == '\0') 244 *subpath = strdup(real_path + best->pathlen); 247 return best;
|
/external/webrtc/talk/media/base/ |
videocapturer_unittest.cc | 343 cricket::VideoFormat best; local 344 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); 345 EXPECT_EQ(640, best.width); 346 EXPECT_EQ(480, best.height); 347 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval); 350 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best)); 353 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); 360 cricket::VideoFormat best; local 362 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); 363 EXPECT_EQ(1280, best.width) 418 cricket::VideoFormat best; local 510 cricket::VideoFormat best; local 548 cricket::VideoFormat best; local 585 cricket::VideoFormat best; local 616 cricket::VideoFormat best; local 681 cricket::VideoFormat best; local [all...] |
/frameworks/base/core/java/android/text/util/ |
Rfc822Tokenizer.java | 216 int best = 0; local 230 best = i; 235 return best;
|
/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...] |
/art/test/1911-get-local-var-table/src/art/ |
Breakpoint.java | 59 int best = -1; local 64 best = l.line; 67 return best; 174 int best = -1; local 179 best = l.line; 182 return best;
|
/art/test/1912-get-set-local-primitive/src/art/ |
Breakpoint.java | 59 int best = -1; local 64 best = l.line; 67 return best; 174 int best = -1; local 179 best = l.line; 182 return best;
|