HomeSort by relevance Sort by last modified time
    Searched defs:Curr (Results 1 - 7 of 7) sorted by null

  /external/clang/lib/ARCMigrate/
TransProtectedScope.cpp 64 SwitchCase *Curr = S->getSwitchCaseList();
65 if (!Curr)
67 Stmt *Parent = getCaseParent(Curr);
68 Curr = Curr->getNextSwitchCase();
70 while (Curr) {
71 if (getCaseParent(Curr) != Parent)
73 Curr = Curr->getNextSwitchCase();
77 Curr = S->getSwitchCaseList()
    [all...]
  /external/llvm/tools/llvm-readobj/
StreamWriter.h 130 uint64_t Curr = Value;
131 while (Curr > 0) {
132 if (Curr & 1)
134 Curr >>= 1;
  /external/llvm/tools/llvm-stress/
llvm-stress.cpp 674 BasicBlock *Curr = Instr->getParent();
676 BasicBlock *Next = Curr->splitBasicBlock(Loc, "CF");
677 Instr->moveBefore(Curr->getTerminator());
678 if (Curr != &F->getEntryBlock()) {
679 BranchInst::Create(Curr, Next, Instr, Curr->getTerminator());
680 Curr->getTerminator()->eraseFromParent();
  /external/llvm/include/llvm/TableGen/
Record.h     [all...]
  /external/llvm/lib/CodeGen/
CodeGenPrepare.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
GVN.cpp 637 LeaderTableEntry &Curr = LeaderTable[N];
638 if (!Curr.Val) {
639 Curr.Val = V;
640 Curr.BB = BB;
647 Node->Next = Curr.Next;
648 Curr.Next = Node;
655 LeaderTableEntry* Curr = &LeaderTable[N];
657 while (Curr->Val != I || Curr->BB != BB) {
658 Prev = Curr;
    [all...]
  /external/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp     [all...]

Completed in 244 milliseconds