Home
last modified time | relevance | path

Searched refs:best_count (Results 1 – 3 of 3) sorted by relevance

/external/llvm-project/llvm/test/Transforms/StructurizeCFG/
Dpost-order-traversal-bug.ll23 %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/llvm/test/Transforms/StructurizeCFG/
Dpost-order-traversal-bug.ll23 %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/e2fsprogs/misc/
De4defrag.c161 int best_count; /* the best file's extents count */ member
1254 frag_rank[j].best_count = in file_statistic()
1255 frag_rank[j - 1].best_count; in file_statistic()
1266 frag_rank[i].best_count = best_ext_count; in file_statistic()
1899 frag_rank[j].best_count, in main()
1909 frag_rank[j].best_count, in main()