Searched refs:best_count (Results 1 – 4 of 4) sorted by relevance
/external/llvm/test/Transforms/StructurizeCFG/ |
D | post-order-traversal-bug.ll | 23 %best_count.025 = phi i32 [ %best_count.025.be, %for.body.backedge ], [ 0, %entry ] 65 %best_count.231 = phi i32 [ %sub4, %if.then ], [ %best_count.025, %lor.lhs.false ] 80 %cmp5.6 = icmp slt i32 %best_count.231, %sub4.6 97 %best_count.025.be = phi i32 [ %sub4.6, %if.then6.6 ], [ %best_count.231, %for.body.6 ]
|
/external/opencv/ml/src/ |
D | mlknearest.cpp | 238 int prev_start = 0, best_count = 0, cur_count; in write_results() local 263 if( best_count < cur_count ) in write_results() 265 best_count = cur_count; in write_results()
|
/external/opencv3/modules/ml/src/ |
D | knearest.cpp | 260 int best_count = 0; in findNearestCore() local 266 if( best_count < count ) in findNearestCore() 268 best_count = count; in findNearestCore()
|
/external/e2fsprogs/misc/ |
D | e4defrag.c | 160 int best_count; /* the best file's extents count */ member 1297 frag_rank[j].best_count = in file_statistic() 1298 frag_rank[j - 1].best_count; in file_statistic() 1309 frag_rank[i].best_count = best_ext_count; in file_statistic() 1941 frag_rank[j].best_count, in main() 1951 frag_rank[j].best_count, in main()
|