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

123

/external/syslinux/core/thread/
H A Dschedule.c16 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...]
/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/syslinux/com32/sysdump/
H A Drbtree.c51 struct rbtree *best = NULL; local
59 best = tree;
63 return best;
/external/curl/lib/
H A Dinet_ntop.c91 } 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
[all...]
/external/mesa3d/src/gallium/state_trackers/clover/util/
H A Dfactor.hpp117 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;
/external/selinux/python/sepolgen/src/sepolgen/
H A Dmatching.py60 def best(self): member in class:MatchList
/external/tcpdump/
H A Daddrtostr.c115 } 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
[all...]
/external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/
H A Ddecision-tree-resource.cc53 void DecisionTreeResource::SplitNode(int32 node_id, SplitCandidate* best, argument
64 model_op_->ExportModel(best->left_stats(), left_leaf);
71 model_op_->ExportModel(best->right_stats(), right_leaf);
74 node->mutable_binary_node()->Swap(best->mutable_split());
H A Dfertile-stats-resource.cc59 bool FertileStatsResource::BestSplit(int32 node_id, SplitCandidate* best, argument
61 return collection_op_->BestSplit(node_id, best, depth);
H A Dgraph_collection_operator.cc38 SplitCandidate* best,
60 *best = SplitCandidate();
62 runner->GetLeftStats(best->mutable_left_stats());
63 runner->GetRightStats(best->mutable_right_stats());
64 runner->GetSplit(best->mutable_split());
37 BestSplit(int32 node_id, SplitCandidate* best, int32* depth) const argument
H A Dsplit_collection_operators.cc139 bool SplitCollectionOperator::BestSplit(int32 node_id, SplitCandidate* best, argument
143 return slot->BestSplit(best);
/external/eigen/bench/
H A DBenchTimer.h48 /** Elapsed time timer keeping the best try.
105 /** Return the best elapsed time in seconds
107 inline double best(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
/external/fio/
H A Dworkqueue.c25 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;
22 __get_submit_worker(struct workqueue *wq, unsigned int start, unsigned int end, struct submit_worker **best) argument
/external/skia/src/pathops/
H A DSkIntersections.cpp142 SkDVector best = fPt[result] - origin; local
144 if (test.crossCheck(best) < 0) {
/external/skia/tests/
H A DStrokerTest.cpp151 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 < gMaxRecursio
385 int best[2] = { 0 }; local
[all...]
/external/skqp/src/pathops/
H A DSkIntersections.cpp142 SkDVector best = fPt[result] - origin; local
144 if (test.crossCheck(best) < 0) {
/external/skqp/tests/
H A DStrokerTest.cpp151 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 < gMaxRecursio
385 int best[2] = { 0 }; local
[all...]
/external/syslinux/extlinux/
H A Dmountinfo.c199 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/
H A Dvideocapturer_unittest.cc343 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
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...]
/external/linux-kselftest/tools/testing/selftests/bpf/
H A Dtest_lpm_map.c83 struct tlpm_node *best = NULL; local
87 * entries and match each prefix against @key. Remember the "best"
100 if (!best || i > best->n_bits)
101 best = list;
105 return best;
112 struct tlpm_node *best = tlpm_match(list, key, n_bits); local
115 if (!best || best->n_bits != n_bits)
118 if (best
[all...]
/external/syslinux/com32/lib/syslinux/
H A Dzonelist.c199 struct syslinux_memmap *best = NULL; local
205 best = list;
212 if (!best)
215 *start = best->start;
235 addr_t size, best; local
237 for (best = 0; list->type != SMT_END; list = list->next) {
250 best = ALIGN_DOWN(list->start + size - len, align);
252 best = ALIGN_DOWN(ceiling - len, align);
254 if (best < *start)
255 best
[all...]
/external/tensorflow/tensorflow/compiler/xla/service/
H A Dheap_simulator.cc508 // First try to allocate from the best-fitting free chunk.
512 const Chunk best = *best_fit_it; local
513 const int64 new_offset = RoundUpToNearest(best.offset, alignment_);
515 if (new_end > best.chunk_end()) {
520 // The buffer is allocated a chunk out of the best-fitting free chunk.
523 // Add remaining portions of the best-fitting free chunk back into free_.
524 AddFreeChunk(best.offset, new_offset - best.offset);
525 AddFreeChunk(new_end, best.chunk_end() - new_end);
H A Dhlo_scheduling.cc249 const HloInstruction* best = best_it->second.instruction; local
251 ready_instructions.erase(best);
252 schedule.push_back(best);
253 scheduled_instructions_.insert(best);
257 for (const LogicalBuffer* buffer : buffer_uses_.at(best)) {
276 for (HloInstruction* user : best->users()) {
279 for (HloInstruction* succ : best->control_successors()) {
286 for (HloInstruction* operand : best->operands()) {
/external/webp/src/enc/
H A Dalpha_enc.c33 // prediction modes 0 to 3 and pick the best one.
206 // Quick estimate of the best candidate.
216 // For large number of colors, try FILTER_NONE in addition to the best
241 FilterTrial best; local
244 InitFilterTrial(&best);
256 if (ok && trial.score < best.score) {
257 VP8BitWriterWipeOut(&best.bw);
258 best = trial;
267 reduce_levels, effort_level, NULL, &best);
272 stats->lossless_features = 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;

Completed in 1311 milliseconds

123