| /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/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...] |
| /external/c-ares/ |
| inet_ntop.c | 129 struct { int base, len; } best, cur; local
141 best.base = -1;
142 best.len = 0;
153 if (best.base == -1 || cur.len > best.len)
154 best = cur;
160 if (best.base == -1 || cur.len > best.len)
161 best = cur;
163 if (best.base != -1 && best.len < 2
[all...] |
| /external/curl/lib/ |
| inet_ntop.c | 92 } best, cur; local
104 best.base = -1;
106 best.len = 0;
117 if(best.base == -1 || cur.len > best.len)
118 best = cur;
122 if((cur.base != -1) && (best.base == -1 || cur.len > best.len))
123 best = cur;
124 if(best.base != -1 && best.len < 2
[all...] |
| /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/opt/net/wifi/service/java/com/android/server/wifi/anqp/ |
| NAIRealmElement.java | 54 int best = AuthMatch.None; local
57 if (match > best) {
58 best = match;
59 if (best == AuthMatch.Exact) {
60 return best;
64 return best;
|
| NAIRealmData.java | 80 int best = AuthMatch.None; local
83 if (match > best) {
84 best = match;
85 if (best == AuthMatch.Exact) {
86 return best;
90 return best;
|
| /external/tcpdump/missing/ |
| inet_ntop.c | 113 } best, cur; local
125 best.len = 0;
126 best.base = -1;
139 if (best.base == -1 || cur.len > best.len)
140 best = cur;
144 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
145 best = cur;
146 if (best.base != -1 && best.len < 2
[all...] |
| /development/perftests/panorama/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/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
|
| NelderMead.java | 83 final RealPointValuePair best = simplex[0]; local
88 // compute the centroid of the best vertices
109 if ((comparator.compare(best, reflected) <= 0) &&
115 } else if (comparator.compare(reflected, best) < 0) {
|
| /external/selinux/sepolgen/src/sepolgen/ |
| matching.py | 60 def best(self): member in class:MatchList
|
| /external/skia/src/pathops/ |
| SkIntersections.cpp | 138 SkDVector best = fPt[result] - origin; local
140 if (test.crossCheck(best) < 0) {
|
| /external/skia/tests/ |
| StrokerTest.cpp | 134 int best = 0; local
145 if (best < gMaxRecursion[2]) {
153 best = gMaxRecursion[2];
162 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
213 int best = 0; local
237 if (best < gMaxRecursion[2]) {
245 best = gMaxRecursion[2];
254 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
323 int best = 0; local
341 if (best < gMaxRecursion[2])
368 int best[2] = { 0 }; local
[all...] |
| /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;
|
| /frameworks/minikin/libs/minikin/ |
| Measurement.cpp | 102 size_t best = searchStart; local
112 best = i;
119 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...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/sepolgen/ |
| matching.py | 60 def best(self): member in class:MatchList
|
| /device/google/contexthub/firmware/src/ |
| heap.c | 24 #define TIDX_HEAP_EXTRA 2 // must be >= 0; best if > 0, don't make it > 7, since it unnecessarily limits max heap size we can manage
117 struct HeapNode *node, *best = NULL; local
130 if (!node->used && node->size >= sz && (!best || best->size > node->size)) {
131 best = node;
132 if (best->size == sz)
139 if (!best) //alloc failed
142 if (best->size - sz > sizeof(struct HeapNode)) { //there is a point to split up the chunk
144 node = (struct HeapNode*)(best->data + sz);
148 node->size = best->size - sz - sizeof(struct HeapNode)
[all...] |
| /external/eigen/bench/ |
| BenchTimer.h | 41 /** Elapsed time timer keeping the best try.
98 /** Return the best elapsed time in seconds
100 inline double best(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /hardware/intel/common/libwsbm/src/ |
| wsbm_mm.c | 221 struct _WsbmMMNode *best; local
225 best = NULL;
247 best = entry;
253 return best;
|
| /libcore/luni/src/test/java/libcore/icu/ |
| ICUTest.java | 86 private String best(Locale l, String skeleton) { method in class:ICUTest
93 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-M-dd"))));
94 assertEquals("[y, d, M]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-MMM-dd"))));
95 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "MMM-dd"))));
97 assertEquals("[y, M, d]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-M-dd"))));
98 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-MMM-dd"))));
99 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "MMM-dd"))));
103 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-M-dd"))));
104 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-MMM-dd"))));
105 assertEquals("[M, d, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "MMM-dd"))))
[all...] |
| /libcore/ojluni/src/main/java/sun/misc/ |
| RegexpPool.java | 91 RegexpNode best = p; local
107 best = p;
119 best = p;
126 if (re.equals(best.re)) {
127 o = best.result;
128 best.result = null;
132 if (re.equals(best.re)) {
133 o = best.result;
134 best.result = null;
142 would match the string, the best match is returned first
193 RegexpNode best = p; local
[all...] |
| /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...] |
