HomeSort by: relevance | last modified time | path
    Searched defs:LR (Results 1 - 25 of 37) sorted by relevancy

1 2

  /src/sys/arch/bebox/include/
kgdb.h 35 #define LR 32
  /src/sys/arch/ibmnws/include/
kgdb.h 35 #define LR 32
  /src/sys/arch/mvmeppc/include/
kgdb.h 35 #define LR 32
  /src/sys/arch/prep/include/
kgdb.h 35 #define LR 32
  /src/sys/arch/rs6000/include/
kgdb.h 35 #define LR 32
  /src/sys/arch/sandpoint/include/
kgdb.h 35 #define LR 32
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
PointerSubChecker.cpp 44 const MemRegion *LR = LV.getAsRegion();
47 if (!(LR && RR))
50 const MemRegion *BaseLR = LR->getBaseRegion();
  /src/sys/arch/hppa/hppa/
kobj_machdep.c 89 LR(unsigned int x, unsigned int constant)
169 /* LR(symbol, addend) */
171 value = LR(addr, value);
189 /* LR(symbol - GP, addend) */
191 value = LR(addr - GP, value);
  /src/sys/external/bsd/gnu-efi/dist/inc/aarch64/
efisetjmp_arch.h 21 UINT64 LR;
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
LiveRangeCalc.h 76 /// By convention, EntryInfoMap[&LR] = { Defined, Undefined }.
104 LiveRange &LR;
118 LiveInBlock(LiveRange &LR, MachineDomTreeNode *node, SlotIndex kill)
119 : LR(LR), DomNode(node), Kill(kill) {}
129 /// in @p LR. Return true if none of the defs reach the entry to @p MBB.
130 bool isDefOnEntry(LiveRange &LR, ArrayRef<SlotIndex> Undefs,
138 /// all paths from the def to @p UseMBB are added to @p LR, and the function
141 /// If multiple values can reach @p UseMBB, the blocks that need @p LR to be
144 /// The array @p Undef provides the locations where the range @p LR become
    [all...]
LiveIntervalUnion.h 114 const LiveRange *LR = nullptr;
115 LiveRange::const_iterator LRI; ///< current position in LR
125 Query(const LiveRange &LR, const LiveIntervalUnion &LIU)
126 : LiveUnion(&LIU), LR(&LR) {}
133 LR = &NewLR;
143 if (UserTag == NewUserTag && LR == &NewLR && LiveUnion == &NewLiveUnion &&
LiveIntervals.h 172 /// Extend the live range \p LR to reach all points in \p Indices. The
174 /// of the existing defs in \p LR and points in \p Undefs.
178 /// If a SlotIndex in \p Indices is the end index of a basic block, \p LR
184 void extendToIndices(LiveRange &LR, ArrayRef<SlotIndex> Indices,
187 void extendToIndices(LiveRange &LR, ArrayRef<SlotIndex> Indices) {
188 extendToIndices(LR, Indices, /*Undefs=*/{});
191 /// If \p LR has a live value at \p Kill, prune its live range by removing
198 void pruneValue(LiveRange &LR, SlotIndex Kill,
245 bool isLiveInToMBB(const LiveRange &LR,
247 return LR.liveAt(getMBBStartIdx(mbb))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
InterferenceCache.cpp 233 LiveRange *LR = RegUnits[i].Fixed;
234 if (I == LR->end() || I->start >= Stop)
236 I = LR->advanceTo(I, Stop);
237 bool Backup = I == LR->end() || I->start >= Stop;
LiveRegMatrix.cpp 178 LiveIntervalUnion::Query &LiveRegMatrix::query(const LiveRange &LR,
181 Q.init(UserTag, LR, Matrix[RegUnit]);
200 [&](MCRegister Unit, const LiveRange &LR) {
201 return query(LR, Unit).checkInterference();
214 LiveRange LR;
215 LR.addSegment(Seg);
219 // LR is stack-allocated. LiveRegMatrix caches queries by a key that
223 // the cached query - the LR address seen the second time may well be the
232 Q.reset(UserTag, LR, Matrix[*Units]);
LiveInterval.cpp 67 LiveRange *LR;
70 CalcLiveRangeUtilBase(LiveRange *LR) : LR(LR) {}
94 VNInfo *VNI = ForVNI ? ForVNI : LR->getNextValue(Def, *VNInfoAllocator);
115 VNInfo *VNI = ForVNI ? ForVNI : LR->getNextValue(Def, *VNInfoAllocator);
142 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
145 return std::make_pair(nullptr, LR->isUndefIn(Undefs, StartIdx, BeforeUse));
147 if (LR->isUndefIn(Undefs, I->end, BeforeUse))
288 CalcLiveRangeUtilVector(LiveRange *LR) : CalcLiveRangeUtilVectorBase(LR) {
    [all...]
RegisterPressure.cpp 425 bool (*Property)(const LiveRange &LR, SlotIndex Pos)) {
441 const LiveRange *LR = LIS.getCachedRegUnit(RegUnit);
444 if (LR == nullptr)
446 return Property(*LR, Pos) ? LaneBitmask::getAll() : LaneBitmask::getNone();
456 [](const LiveRange &LR, SlotIndex Pos) {
457 return LR.liveAt(Pos);
586 const LiveRange *LR = getLiveRange(LIS, Reg);
587 if (LR != nullptr) {
588 LiveQueryResult LRQ = LR->Query(SlotIdx);
1250 [](const LiveRange &LR, SlotIndex Pos)
    [all...]
LiveRangeCalc.cpp 83 Updater.setDest(&I.LR);
89 void LiveRangeCalc::extend(LiveRange &LR, SlotIndex Use, unsigned PhysReg,
99 auto EP = LR.extendInBlock(Undefs, Indexes->getMBBStartIdx(UseMBB), Use);
107 if (findReachingDefs(LR, *UseMBB, Use, PhysReg, Undefs))
124 bool LiveRangeCalc::isDefOnEntry(LiveRange &LR, ArrayRef<SlotIndex> Undefs,
158 // If LR has a segment S that starts at the next block, i.e. [End, ...),
161 LiveRange::iterator UB = upper_bound(LR, End.getPrevSlot());
162 if (UB != LR.begin()) {
169 if (LR.isUndefIn(Undefs, Seg.end, End))
177 if (UndefOnEntry[N] || LR.isUndefIn(Undefs, Begin, End))
    [all...]
LiveIntervals.cpp 118 for (LiveRange *LR : RegUnitRanges)
119 delete LR;
160 if (LiveRange *LR = RegUnitRanges[Unit])
161 OS << printRegUnit(Unit, TRI) << ' ' << *LR << '\n';
278 void LiveIntervals::computeRegUnitRange(LiveRange &LR, unsigned Unit) {
294 LICalc->createDeadDefs(LR, Reg);
305 // Now extend LR to reach all uses.
313 LICalc->extendToUses(LR, Reg);
320 LR.flushSegmentSet();
345 LiveRange *LR = RegUnitRanges[Unit]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/
FunctionInfo.cpp 158 LookupResult LR;
159 LR.LookupAddr = Addr;
160 LR.FuncRange.Start = FuncAddr;
162 LR.FuncRange.End = FuncAddr + Data.getU32(&Offset);
173 if (LR.FuncRange.size() > 0 && !LR.FuncRange.contains(Addr))
181 LR.FuncName = GR.getString(NameOffset);
225 SrcLoc.Name = LR.FuncName;
227 LR.Locations.push_back(SrcLoc);
228 return LR;
    [all...]
DwarfTransformer.cpp 506 auto LR = Gsym->lookup(Addr);
507 if (!LR)
508 return LR.takeError();
525 NumDwarfInlineInfos != LR->Locations.size()) {
528 << LR->Locations.size() << "\n";
535 Log << " " << LR->Locations.size() << " GSYM frames:\n";
536 for (size_t Idx = 0, count = LR->Locations.size();
538 const auto &gii = LR->Locations[Idx];
547 for (size_t Idx = 0, count = LR->Locations.size(); Idx < count;
549 const auto &gii = LR->Locations[Idx]
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
ScaledNumber.cpp 27 uint64_t UL = getU(LHS), LL = getL(LHS), UR = getU(RHS), LR = getL(RHS);
30 uint64_t P1 = UL * UR, P2 = UL * LR, P3 = LL * UR, P4 = LL * LR;
  /src/external/gpl3/binutils/dist/opcodes/
mcore-opc.h 26 OMa, SI, I7, LS, BR, BL, LR, LJ,
162 { "lrw", LR, 0, 0x7000 },
  /src/external/gpl3/binutils.old/dist/opcodes/
mcore-opc.h 26 OMa, SI, I7, LS, BR, BL, LR, LJ,
162 { "lrw", LR, 0, 0x7000 },
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
ImmutableSet.h 507 TreeTy *LR = getRight(L);
509 if (getHeight(LL) >= getHeight(LR))
510 return createNode(LL, L, createNode(LR,V,R));
512 assert(!isEmpty(LR) && "LR cannot be empty because it has a height >= 1");
514 TreeTy *LRL = getLeft(LR);
515 TreeTy *LRR = getRight(LR);
517 return createNode(createNode(LL,L,LRL), LR, createNode(LRR,V,R));
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonExpandCondsets.cpp 1112 LiveRange::Segment &LR = *I;
1114 if (!LR.start.isRegister())
1117 if (!LR.end.isRegister() && !LR.end.isDead())

Completed in 70 milliseconds

1 2