| /external/llvm/lib/CodeGen/ |
| MachineCopyPropagation.cpp | 110 static bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,
113 if (Def == SrcSrc)
115 if (TRI->isSubRegister(SrcSrc, Def)) {
117 unsigned SubIdx = TRI->getSubRegIndex(SrcSrc, Def);
128 DenseMap<unsigned, MachineInstr*> AvailCopyMap; // Def -> available copies map
129 DenseMap<unsigned, MachineInstr*> CopyMap; // Def -> copies map
130 SourceMap SrcMap; // Src -> Def map
138 unsigned Def = MI->getOperand(0).getReg();
141 if (TargetRegisterInfo::isVirtualRegister(Def) ||
149 if (!ReservedRegs.test(Def) &
[all...] |
| ExecutionDepsFix.cpp | 119 int Def;
351 LiveRegs[rx].Def = -(1 << 20);
364 LiveRegs[rx].Def = -1;
381 // Use the most recent predecessor def for each register.
382 LiveRegs[rx].Def = std::max(LiveRegs[rx].Def, fi->second[rx].Def);
422 LiveRegs[i].Def -= CurInstr;
451 // Update def-ages for registers defined by MI.
475 unsigned Clearance = CurInstr - LiveRegs[rx].Def;
[all...] |
| LiveInterval.cpp | 52 VNInfo *LiveInterval::createDeadDef(SlotIndex Def,
54 assert(!Def.isDead() && "Cannot define a value at the dead slot");
55 iterator I = find(Def);
57 VNInfo *VNI = getNextValue(Def, VNInfoAllocator);
58 ranges.push_back(LiveRange(Def, Def.getDeadSlot(), VNI));
61 if (SlotIndex::isSameInstr(Def, I->start)) {
62 assert(I->start == Def && "Cannot insert def, already live");
63 assert(I->valno->def == Def && "Inconsistent existing value def")
[all...] |
| LiveVariables.cpp | 114 assert(MBB != &MF->front() && "Can't find reaching def for virtreg");
133 assert(MRI->getVRegDef(reg) && "Register use before def!");
190 /// FindLastPartialDef - Return the last partial def of the specified register.
199 MachineInstr *Def = PhysRegDef[SubReg];
200 if (!Def)
202 unsigned Dist = DistanceMap[Def];
205 LastDef = Def;
228 /// HandlePhysRegUse - Turn previous partial def's into read/mod/writes. Add
229 /// implicit defs to a machine instruction if there was an earlier def of its
233 // If there was a previous use or a "full" def all is well
[all...] |
| /external/llvm/lib/VMCore/ |
| Dominators.cpp | 96 // dominates - Return true if Def dominates a use in User. This performs
97 // the special checks necessary if Def and User are in the same basic block.
98 // Note that Def doesn't dominate a use in Def itself!
99 bool DominatorTree::dominates(const Instruction *Def,
102 const BasicBlock *DefBB = Def->getParent();
104 // Any unreachable use is dominated, even if Def == User.
113 if (Def == User)
120 if (isa<InvokeInst>(Def) || isa<PHINode>(User))
121 return dominates(Def, UseBB)
[all...] |
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter2/ |
| token.ml | 9 | Def | Extern
|
| toplevel.ml | 18 | Token.Def ->
|
| lexer.ml | 45 | "def" -> [< 'Token.Def; stream >]
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter3/ |
| token.ml | 9 | Def | Extern
|
| toplevel.ml | 20 | Token.Def ->
|
| lexer.ml | 45 | "def" -> [< 'Token.Def; stream >]
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter4/ |
| token.ml | 9 | Def | Extern
|
| lexer.ml | 45 | "def" -> [< 'Token.Def; stream >]
|
| toplevel.ml | 21 | Token.Def ->
|
| /external/chromium/testing/gtest/test/ |
| gtest_list_tests_unittest_.cc | 58 TEST(Abc, Def) {
|
| /external/gtest/test/ |
| gtest_list_tests_unittest_.cc | 58 TEST(Abc, Def) {
|
| /external/protobuf/gtest/test/ |
| gtest_list_tests_unittest_.cc | 58 TEST(Abc, Def) {
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter5/ |
| token.ml | 9 | Def | Extern
|
| lexer.ml | 45 | "def" -> [< 'Token.Def; stream >]
|
| toplevel.ml | 21 | Token.Def ->
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter6/ |
| token.ml | 9 | Def | Extern
|
| lexer.ml | 45 | "def" -> [< 'Token.Def; stream >]
|
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| token.ml | 9 | Def | Extern
|
| /external/valgrind/main/memcheck/tests/ |
| origin1-yes.stderr.exp | 57 Def 1 of 3
59 Def 2 of 3
61 Def 3 of 3
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyIndVar.cpp | 266 /// pushIVUsers - Add all uses of Def to the current IV's worklist.
269 Instruction *Def,
273 for (Value::use_iterator UI = Def->use_begin(), E = Def->use_end();
279 // If Def is a LoopPhi, it may not be in the Simplified set, so check for
281 if (User != Def && Simplified.insert(User))
282 SimpleIVUsers.push_back(std::make_pair(User, Def));
326 // Use-def pairs if IV users waiting to be processed for CurrIV.
|
