Searched defs:best (Results 1 - 25 of 67) sorted by relevance

123

/external/ppp/pppd/plugins/pppoatm/
H A Dmisc.c24 int i,best; local
30 best = -1;
35 best = i;
40 if (best > -1) (*pos) += best_len;
41 return best;
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DCubicBounds.cpp20 int best = -1; local
25 if (best < 0) {
26 best = index;
32 best = 1;
35 if (best >= 0) {
36 return leftTs[best];
H A DCubicParameterizationCode.cpp360 int best[bestCount][4]; local
361 bzero(best, sizeof(best));
369 if (best[w][0] < count[x][y][z]) {
370 best[w][0] = count[x][y][z];
371 best[w][1] = x;
372 best[w][2] = y;
373 best[w][3] = z;
381 printf("%c%c%c=%d\n", 'a' + best[w][1], 'a' + best[
[all...]
/external/skia/experimental/Intersection/
H A DCubicBounds.cpp20 int best = -1; local
25 if (best < 0) {
26 best = index;
32 best = 1;
35 if (best >= 0) {
36 return leftTs[best];
H A DCubicParameterizationCode.cpp360 int best[bestCount][4]; local
361 bzero(best, sizeof(best));
369 if (best[w][0] < count[x][y][z]) {
370 best[w][0] = count[x][y][z];
371 best[w][1] = x;
372 best[w][2] = y;
373 best[w][3] = z;
381 printf("%c%c%c=%d\n", 'a' + best[w][1], 'a' + best[
[all...]
/external/chromium_org/net/http/
H A Dhttp_auth.cc37 scoped_ptr<HttpAuthHandler> best; local
50 if (cur.get() && (!best.get() || best->score() < cur->score()) &&
52 best.swap(cur);
54 handler->swap(best);
/external/tcpdump/missing/
H A Dinet_ntop.c117 } 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/chromium_org/third_party/libjingle/source/talk/media/base/
H A Dvideocapturer_unittest.cc311 cricket::VideoFormat best; local
312 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
313 EXPECT_EQ(640, best.width);
314 EXPECT_EQ(480, best.height);
315 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval);
318 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best));
321 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
328 cricket::VideoFormat best; local
330 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
331 EXPECT_EQ(1280, best
386 cricket::VideoFormat best; local
478 cricket::VideoFormat best; local
516 cricket::VideoFormat best; local
553 cricket::VideoFormat best; local
584 cricket::VideoFormat best; local
649 cricket::VideoFormat best; local
[all...]
H A Dvideocapturer.cc267 std::vector<VideoFormat>::const_iterator best = supported_formats->end(); local
276 best = i;
279 if (supported_formats->end() == best) {
285 best_format->width = best->width;
286 best_format->height = best->height;
287 best_format->fourcc = best->fourcc;
288 best_format->interval = best->interval;
598 // Any fourcc is OK for the desired. Use preference to find best fourcc.
/external/eigen/bench/
H A DBenchTimer.h41 /** 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
/external/skia/src/gpu/gl/unix/
H A DSkNativeGLContext_unix.cpp139 int best = -1, best_num_samp = -1; local
148 if (best < 0 || (samp_buf && samples > best_num_samp))
149 best = i, best_num_samp = samples;
152 XVisualInfo temp = visReturn[best];
/external/chromium_org/components/search_engines/
H A Dutil.cc79 // For each group of prepopulated URLs with one ID, find the best URL to use
83 // Find the best URL.
88 UncheckedURLMap::iterator best = unchecked_urls.begin(); local
102 best = i;
106 // Otherwise, a URL is best if it matches the prepopulated data's keyword;
113 best = i;
115 } else if (i->second->id() < best->second->id()) {
116 best = i;
120 // Add the best URL to the checked group and delete the rest.
121 checked_urls.push_back(best
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dpage_heap.cc111 // find the best span (closest to n in size).
112 // The following loops implements address-ordered best-fit.
113 Span *best = NULL; local
120 if ((best == NULL)
121 || (span->length < best->length)
122 || ((span->length == best->length) && (span->start < best->start))) {
123 best = span;
124 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
134 if ((best
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dpage_heap.cc110 // find the best span (closest to n in size).
111 // The following loops implements address-ordered best-fit.
112 Span *best = NULL; local
119 if ((best == NULL)
120 || (span->length < best->length)
121 || ((span->length == best->length) && (span->start < best->start))) {
122 best = span;
123 ASSERT(best->location == Span::ON_NORMAL_FREELIST);
133 if ((best
[all...]
/external/zopfli/src/zopfli/
H A Dblocksplitter.c46 double best = ZOPFLI_LARGE_FLOAT; local
51 if (v < best) {
52 best = v;
64 double best; local
76 best = vp[0];
78 if (vp[i] < best) {
79 best = vp[i];
83 if (best > lastbest) break;
89 lastbest = best;
/external/chromium_org/courgette/
H A Ddisassembler_win32_x64.cc678 const Section* best = 0; local
683 if (best == 0 ||
684 section->file_offset_of_raw_data < best->file_offset_of_raw_data) {
685 best = section;
690 return best;
H A Ddisassembler_win32_x86.cc678 const Section* best = 0; local
683 if (best == 0 ||
684 section->file_offset_of_raw_data < best->file_offset_of_raw_data) {
685 best = section;
690 return best;
/external/chromium_org/media/video/capture/linux/
H A Dvideo_capture_device_linux.cc241 std::list<int>::iterator best = v4l2_formats.end(); local
244 best = std::find(v4l2_formats.begin(), best, fmtdesc.pixelformat);
248 if (best == v4l2_formats.end()) {
260 video_fmt.fmt.pix.pixelformat = *best;
/external/chromium_org/third_party/libwebp/enc/
H A Dalpha.c32 // prediction modes 0 to 3 and pick the best one.
196 // Quick estimate of the best candidate.
205 // For large number of colors, try FILTER_NONE in addition to the best
230 FilterTrial best; local
233 InitFilterTrial(&best);
244 if (ok && trial.score < best.score) {
245 VP8BitWriterWipeOut(&best.bw);
246 best = trial;
255 reduce_levels, effort_level, NULL, &best);
258 if (stats != NULL) *stats = best
[all...]
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/
H A Dpitch_estimator.c112 int32_t best[4]= {-100, -100, -100, -100}; local
116 if (in[k] > best[3]) {
117 if (in[k] > best[2]) {
118 if (in[k] > best[1]) {
119 if (in[k] > best[0]) { // The Best
120 best[3] = best[2];
122 best[2] = best[1];
124 best[
[all...]
/external/libvorbis/vq/
H A Dbookutil.c52 int best=-1; local
63 if(best==-1 || this<best){
64 best=this;
/external/webp/src/enc/
H A Dalpha.c32 // prediction modes 0 to 3 and pick the best one.
196 // Quick estimate of the best candidate.
205 // For large number of colors, try FILTER_NONE in addition to the best
230 FilterTrial best; local
233 InitFilterTrial(&best);
244 if (ok && trial.score < best.score) {
245 VP8BitWriterWipeOut(&best.bw);
246 best = trial;
255 reduce_levels, effort_level, NULL, &best);
258 if (stats != NULL) *stats = best
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
H A Dencodemb.c252 int best; local
318 /* And pick the best. */
319 best = rd_cost1 < rd_cost0;
323 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
324 tokens[i][0].error = d2 + (best ? error1 : error0);
328 best_mask[0] |= best << i;
384 /* And pick the best. */
385 best = rd_cost1 < rd_cost0;
393 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
394 tokens[i][1].error = d2 + (best
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_encodemb.c126 int best, band, pt, i, final_eob; local
170 /* And pick the best. */
171 best = rd_cost1 < rd_cost0;
175 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
176 tokens[i][0].error = d2 + (best ? error1 : error0);
180 best_index[i][0] = best;
223 /* And pick the best. */
224 best = rd_cost1 < rd_cost0;
231 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
232 tokens[i][1].error = d2 + (best
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/windows/gdi/
H A Dwgl.c239 int i,best = -1,bestdelta = 0x7FFFFFFF,delta; local
282 best = i + 1;
288 if(best == -1)
293 return(best);

Completed in 691 milliseconds

123