HomeSort by relevance Sort by last modified time
    Searched refs:member_end (Results 1 - 8 of 8) sorted by null

  /external/llvm/include/llvm/ADT/
EquivalenceClasses.h 47 /// MI != EC.member_end(); ++MI) // Loop over members in this set.
129 for (++MI; MI != member_end(); ++MI)
153 member_iterator member_end() const { function in class:llvm::EquivalenceClasses
168 assert(MI != member_end() && "Value is not in the set!");
177 assert(MI != member_end() && "Value is not in the set!");
206 if (I == TheMapping.end()) return member_end();
221 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!");
  /external/vboot_reference/firmware/lib21/
common.c 66 uint32_t member_end = member_offset + member_size; local
69 if (member_end < member_offset)
86 if (member_end > c->total_size)
90 *min_offset = member_end;
  /external/llvm/lib/Transforms/Scalar/
Float2Int.cpp 370 for (auto MI = ECs.member_begin(It), ME = ECs.member_end();
401 if (ECs.member_begin(It) == ECs.member_end() || Fail ||
433 for (auto MI = ECs.member_begin(It), ME = ECs.member_end();
LoopDistribute.cpp 341 ToBeMerged.member_end())) {
  /external/llvm/lib/Analysis/
VectorUtils.cpp 547 for (auto MI = ECs.member_begin(I), ME = ECs.member_end(); MI != ME; ++MI)
555 for (auto MI = ECs.member_begin(I), ME = ECs.member_end(); MI != ME; ++MI) {
LoopAccessAnalysis.cpp 313 for (auto MI = DepCands.member_begin(LeaderI), ME = DepCands.member_end();
    [all...]
  /external/llvm/lib/Transforms/IPO/
LowerBitSets.cpp     [all...]
  /external/llvm/lib/Target/AArch64/
AArch64A57FPLoadBalancing.cpp 369 std::vector<Chain*> Cs(EC.member_begin(I), EC.member_end());

Completed in 547 milliseconds