HomeSort by: relevance | last modified time | path
    Searched refs:CurrentIndex (Results 1 - 6 of 6) sorted by relevancy

  /src/sys/external/bsd/acpica/dist/disassembler/
dmbuffer.c 108 UINT32 CurrentIndex;
131 CurrentIndex = i + j;
132 if (CurrentIndex >= ByteCount)
140 AcpiOsPrintf (" 0x%2.2X", ByteData[CurrentIndex]);
144 if (CurrentIndex < (ByteCount - 1))
159 CurrentIndex = i + j;
160 if (CurrentIndex >= ByteCount)
165 BufChar = ByteData[CurrentIndex];
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/
DWARFAcceleratorTable.h 488 const NameIndex *CurrentIndex = nullptr;
490 /// Whether this is a local iterator (searches in CurrentIndex only) or not
533 return A.CurrentIndex == B.CurrentIndex && A.DataOffset == B.DataOffset;
543 const NameIndex *CurrentIndex;
549 assert(CurrentName <= CurrentIndex->getNameCount());
561 /// CurrentIndex.
562 NameIterator(const NameIndex *CurrentIndex, uint32_t CurrentName)
563 : CurrentIndex(CurrentIndex), CurrentName(CurrentName) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFAcceleratorTable.cpp 799 const Header &Hdr = CurrentIndex->Hdr;
802 for (NameTableEntry NTE : *CurrentIndex) {
814 uint32_t Index = CurrentIndex->getBucketArrayEntry(Bucket);
819 uint32_t Hash = CurrentIndex->getHashArrayEntry(Index);
823 NameTableEntry NTE = CurrentIndex->getNameTableEntry(Index);
831 auto EntryOr = CurrentIndex->getEntry(&DataOffset);
849 for (const NameIndex *End = CurrentIndex->Section.NameIndices.end();
850 CurrentIndex != End; ++CurrentIndex) {
858 assert(CurrentIndex && "Incrementing an end() iterator?")
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
StratifiedSets.h 318 auto CurrentIndex = getHighestParentAbove(I);
319 if (!Visited.insert(CurrentIndex).second)
322 while (Links[CurrentIndex].hasBelow()) {
323 auto &CurrentBits = Links[CurrentIndex].Attrs;
324 auto NextIndex = Links[CurrentIndex].Below;
327 CurrentIndex = NextIndex;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
CodeGenPrepare.cpp 3204 size_t CurrentIndex = 0;
3299 /// Updates the CurrentIndex so that it will point to a valid element.
3301 /// If the element of NodeList at CurrentIndex is valid, it does not
3302 /// change it. If there are no more valid elements, it updates CurrentIndex
3304 void SkipRemovedElements(size_t &CurrentIndex) {
3305 while (CurrentIndex < NodeList.size()) {
3306 auto it = NodeMap.find(NodeList[CurrentIndex]);
3308 // point to a different index, so CurrentIndex will still be invalid.
3309 if (it != NodeMap.end() && it->second == CurrentIndex)
3311 ++CurrentIndex;
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/IR/
Instructions.cpp 376 unsigned CurrentIndex = BeginIndex;
382 BOI.Begin = CurrentIndex;
383 BOI.End = CurrentIndex + BI->input_size();
384 CurrentIndex = BOI.End;

Completed in 27 milliseconds