| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 70 // Returns the first and last non-abstract subrecords
80 Record *First = nullptr, *Last = nullptr;
84 First = Last = Base;
109 Last = Result.second;
112 Last = R;
123 assert (Last && "Got a first node but not a last node for a range!");
129 << Last->getName() << ")\n\n";
132 return std::make_pair(First, Last);
145 << macroName(Root.getName()) << "_RANGE(Base, First, Last)\n"
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonBlockRanges.h | 129 IndexType First, Last;
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
| armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s | 89 Last RN 7
125 MOV Last,#0
132 STM pDst!,{temp2,temp1,Last,LR}
134 STM pDst!,{temp2,temp1,Last,LR}
136 STM pDst!,{temp2,temp1,Last,LR}
138 STM pDst!,{temp2,temp1,Last,LR}
140 STM pDst!,{temp2,temp1,Last,LR}
142 STM pDst!,{temp2,temp1,Last,LR}
144 STM pDst!,{temp2,temp1,Last,LR}
145 STM pDst!,{temp2,temp1,Last,LR
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
| armVCM4P2_DecodeVLCZigzag_AC_unsafe_s.s | 89 Last RN 7
125 MOV Last,#0
132 STM pDst!,{temp2,temp1,Last,LR}
134 STM pDst!,{temp2,temp1,Last,LR}
136 STM pDst!,{temp2,temp1,Last,LR}
138 STM pDst!,{temp2,temp1,Last,LR}
140 STM pDst!,{temp2,temp1,Last,LR}
142 STM pDst!,{temp2,temp1,Last,LR}
144 STM pDst!,{temp2,temp1,Last,LR}
145 STM pDst!,{temp2,temp1,Last,LR
[all...] |
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Csm/BiosThunk/Snp16Dxe/ |
| BiosSnp16.h | 53 UINT32 Last;
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Tcp4Dxe/ |
| Tcp4Misc.c | 191 INTN Last;
194 Last = 4;
223 if (Cur < Last) {
228 Last = Cur;
|
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
| BaseOrderedCollectionRedBlackTreeLib.c | 604 // First look for a collision, saving the last examined node for the case
[all...] |
| /device/linaro/bootloader/edk2/NetworkPkg/TcpDxe/ |
| TcpMisc.c | 252 INTN Last;
255 Last = 4;
286 if (Cur < Last) {
291 Last = Cur;
|
| /device/linaro/bootloader/edk2/Nt32Pkg/WinNtSerialIoDxe/ |
| WinNtSerialIo.h | 56 UINT32 Last;
|
| /device/linaro/bootloader/edk2/SourceLevelDebugPkg/Library/DebugAgent/DxeDebugAgent/ |
| SerialIo.c | 228 // Last UINT8: The index, which you can put a new data into array Data[].
234 UINT8 Last;
314 Fifo->Data[Fifo->Last] = Data;
316 Fifo->Last++;
317 if (Fifo->Last == DEBGU_SERIAL_IO_FIFO_DEPTH) {
318 Fifo->Last = 0;
|
| /external/llvm/lib/Bitcode/Writer/ |
| ValueEnumerator.h | 93 unsigned Last = 0;
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 35 SlotIndex Last;
71 /// Tag of the LIU last time we looked.
226 /// last - Return the ending index of the last interfering range in the
228 SlotIndex last() { function in class:llvm::InterferenceCache::Cursor
229 return Current->Last;
|
| MachineRegisterInfo.cpp | 206 // Next is NULL on the last list element.
207 // Prev pointers are circular, so Head->Prev == Last.
218 // Insert MO between Last and Head in the circular Prev chain.
219 MachineOperand *Last = Head->Contents.Reg.Prev;
220 assert(Last && "Inconsistent use list");
221 assert(MO->getReg() == Last->getReg() && "Different regs on the same list!");
223 MO->Contents.Reg.Prev = Last;
234 Last->Contents.Reg.Next = MO;
|
| VirtRegMap.cpp | 149 // The VirtRegRewriter is the last of the register allocator passes.
253 SlotIndex Last;
258 if (!Last.isValid() || SR.segments.back().end > Last)
259 Last = SR.segments.back().end;
262 // Check all mbb start positions between First and Last while
265 MBBI != Indexes->MBBIndexEnd() && MBBI->first <= Last; ++MBBI) {
|
| /external/llvm/lib/DebugInfo/PDB/Raw/ |
| MappedBlockStream.cpp | 78 // We really only have to check the last item in the list, since we append
128 uint32_t Last = First;
131 while (Last < Pdb.getBlockCount() - 1) {
132 if (BlockList[Last] != BlockList[Last + 1] - 1)
134 ++Last;
139 uint32_t BlockSpan = Last - First + 1;
|
| /external/llvm/lib/ExecutionEngine/Interpreter/ |
| ExternalFunctions.cpp | 349 char Last = *FB++ = *FmtStr++;
351 while (Last != 'c' && Last != 'd' && Last != 'i' && Last != 'u' &&
352 Last != 'o' && Last != 'x' && Last != 'X' && Last != 'e' &&
353 Last != 'E' && Last != 'g' && Last != 'G' && Last != 'f' &
[all...] |
| /external/llvm/lib/IR/ |
| AttributeImpl.h | 265 const std::pair<unsigned, AttributeSetNode *> &Last = Slots.back();
266 if (Last.first == AttributeSet::FunctionIndex) {
267 const AttributeSetNode *Node = Last.second;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64AddressTypePromotion.cpp | 451 Value *Last;
457 Last = Inst->getOperand(OpdIdx);
458 Inst = dyn_cast<Instruction>(Last);
461 DEBUG(dbgs() << "Head of the chain:\n" << *Last << '\n');
463 SeenChains.find(Last);
470 SeenChains[Last] = nullptr;
474 SeenChains[Last] = SExt;
|
| /external/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| HexagonMCCodeEmitter.cpp | 40 uint32_t HexagonMCCodeEmitter::parseBits(size_t Instruction, size_t Last,
47 assert(Instruction != Last);
54 assert(Instruction != Last);
59 assert(Instruction == Last);
62 if(Instruction == Last)
78 size_t Last = HexagonMCInstrInfo::bundleSize(HMB) - 1;
82 parseBits(Instruction, Last, HMB, HMI),
261 // Last bit is moved to bit position 13
|
| /external/llvm/lib/Target/Lanai/ |
| LanaiMemAluCombiner.cpp | 337 MbbIterator Last = Decrement ? BB->begin() : BB->end();
339 while (First != Last) {
351 if (First != Last) {
|
| /external/llvm/lib/Target/X86/ |
| X86OptimizeLEAs.cpp | 236 int calcInstrDist(const MachineInstr &First, const MachineInstr &Last);
252 /// \brief Returns true if the \p Last LEA instruction can be replaced by the
255 /// replacement of the \p Last LEA's uses with the \p First's def register.
256 bool isReplaceable(const MachineInstr &First, const MachineInstr &Last,
284 const MachineInstr &Last) {
287 assert(Last.getParent() == First.getParent() &&
290 InstrPos.find(&Last) != InstrPos.end() &&
293 return InstrPos[&Last] - InstrPos[&First];
382 // Check that the Last LEA can be replaced by the First LEA. To be so,
386 // 3) All uses of the Last LEA def register are replaceable, thus th
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| InterferenceCache.h | 33 SlotIndex Last;
193 /// last - Return the ending index of the last interfering range in the
195 SlotIndex last() { function in class:llvm::InterferenceCache::Cursor
196 return Current->Last;
|
| /external/swiftshader/third_party/LLVM/lib/ExecutionEngine/Interpreter/ |
| ExternalFunctions.cpp | 359 char Last = *FB++ = *FmtStr++;
361 while (Last != 'c' && Last != 'd' && Last != 'i' && Last != 'u' &&
362 Last != 'o' && Last != 'x' && Last != 'X' && Last != 'e' &&
363 Last != 'E' && Last != 'g' && Last != 'G' && Last != 'f' &
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Library/DxeNetLib/ |
| NetBuffer.c | 546 UINT32 Last;
559 // First find the first and last BlockOp that contains
561 // BlockOp and length of the last BlockOp
582 Last = 0;
591 Last = Index;
600 Last = First;
605 ASSERT (Last >= First);
606 BlockOpNum = Last - First + 1;
655 // Set all the BlockOp up, the first and last one are special
665 for (Index = First + 1; Index < Last; Index++) {
[all...] |
| /external/clang/lib/Analysis/ |
| ReachableCode.cpp | 63 // 'S' is a substatement. The 'return' may not be the last element in the
117 SourceLocation Last;
119 Last = Loc;
122 return Last;
|
