/freebsd-9.3-release/contrib/llvm/include/llvm/Support/ |
H A D | PredIteratorCache.h | 43 BasicBlock **&Entry = BlockToPredsMap[BB]; local 44 if (Entry) return Entry; 51 Entry = Memory.Allocate<BasicBlock*>(PredCache.size()); 52 std::copy(PredCache.begin(), PredCache.end(), Entry); 53 return Entry;
|
H A D | ArrayRecycler.h | 46 FreeList *Entry = Bucket[Idx]; 47 if (!Entry) 49 Bucket[Idx] = Entry->Next; 50 return reinterpret_cast<T*>(Entry); 58 FreeList *Entry = reinterpret_cast<FreeList*>(Ptr); local 61 Entry->Next = Bucket[Idx]; 62 Bucket[Idx] = Entry;
|
H A D | Registry.h | 49 static const char *nameof(const entry &Entry) { return Entry.getName(); } argument 50 static const char *descof(const entry &Entry) { return Entry.getDesc(); } argument 195 entry Entry; member in class:llvm::Registry::Add 202 : Entry(Name, Desc, CtorFn), Node(Entry) {}
|
/freebsd-9.3-release/contrib/llvm/include/llvm/ADT/ |
H A D | StringSet.h | 36 StringMapEntry<char> &Entry = this->GetOrCreateValue(Key); local 37 if (Entry.getValue() == '+') 39 Entry.setValue('+');
|
H A D | UniqueVector.h | 36 unsigned insert(const T &Entry) { argument 38 unsigned &Val = Map[Entry]; 47 Vector.push_back(Entry); 53 unsigned idFor(const T &Entry) const { 55 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/ |
H A D | cond_dealtor.hpp | 57 template<typename Entry, class Allocator> 61 Entry, \ 64 template<typename Entry, class Allocator> 69 typename Allocator::template rebind<Entry>::other
|
/freebsd-9.3-release/contrib/llvm/lib/DebugInfo/ |
H A D | DWARFDebugLoc.h | 23 struct Entry { struct in class:llvm::DWARFDebugLoc 38 SmallVector<Entry, 2> Entries;
|
/freebsd-9.3-release/contrib/llvm/lib/IR/ |
H A D | DebugLoc.cpp | 236 std::pair<DebugRecVH, DebugRecVH> &Entry = Ctx->ScopeInlinedAtRecords[-Idx-1]; local 237 assert((this == &Entry.first || this == &Entry.second) && 240 MDNode *OldScope = Entry.first.get(); 241 MDNode *OldInlinedAt = Entry.second.get(); 243 "Entry should be non-canonical if either val dropped to null"); 253 Entry.first.Idx = Entry.second.Idx = 0; 290 std::pair<DebugRecVH, DebugRecVH> &Entry = Ctx->ScopeInlinedAtRecords[-Idx-1]; local 291 assert((this == &Entry 312 std::pair<DebugRecVH, DebugRecVH> &Entry=Ctx->ScopeInlinedAtRecords[-Idx-1]; local [all...] |
H A D | Value.cpp | 557 ValueHandleBase *&Entry = pImpl->ValueHandles[VP.getPointer()]; local 558 assert(Entry != 0 && "Value doesn't have any handles?"); 559 AddToExistingUseList(&Entry); 571 ValueHandleBase *&Entry = Handles[VP.getPointer()]; local 572 assert(Entry == 0 && "Value really did already have handles?"); 573 AddToExistingUseList(&Entry); 626 ValueHandleBase *Entry = pImpl->ValueHandles[V]; local 627 assert(Entry && "Value bit set but no entries exist"); 638 for (ValueHandleBase Iterator(Assert, *Entry); Entry; Entr 684 ValueHandleBase *Entry = pImpl->ValueHandles[Old]; local [all...] |
H A D | ValueSymbolTable.cpp | 80 ValueName &Entry = vmap.GetOrCreateValue(Name); local 81 if (Entry.getValue() == 0) { 82 Entry.setValue(V); 83 //DEBUG(dbgs() << " Inserted value: " << Entry.getKeyData() << ": " 85 return &Entry;
|
/freebsd-9.3-release/contrib/llvm/include/llvm/TableGen/ |
H A D | StringToOffsetTable.h | 31 StringMapEntry<unsigned> &Entry = StringOffset.GetOrCreateValue(Str, -1U); local 32 if (Entry.getValue() == -1U) { 34 Entry.setValue(AggregateString.size()); 40 return Entry.getValue();
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Index/ |
H A D | SimpleFormatContext.h | 52 const FileEntry *Entry = local 54 Sources.overrideFileContents(Entry, Source, true); 55 assert(Entry != NULL); 56 return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);
|
/freebsd-9.3-release/contrib/llvm/lib/Target/ARM/ |
H A D | Thumb2SizeReduction.cpp | 152 bool VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, 157 const ReduceEntry &Entry); 160 const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop); 165 const ReduceEntry &Entry, bool LiveCPSR, 171 const ReduceEntry &Entry, bool LiveCPSR, 293 Thumb2SizeReduce::VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, argument 296 if ((is2Addr && Entry.PredCC2 == 0) || 297 (!is2Addr && Entry.PredCC1 == 0)) { 316 } else if ((is2Addr && Entry.PredCC2 == 2) || 317 (!is2Addr && Entry 367 ReduceLoadStore(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry) argument 528 ReduceSpecial(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument 630 ReduceTo2Addr(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument 748 ReduceToNarrow(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument 899 const ReduceEntry &Entry = ReduceTable[OPI->second]; local [all...] |
H A D | ARMSelectionDAGInfo.cpp | 155 TargetLowering::ArgListEntry Entry; local 159 Entry.Node = Dst; 160 Entry.Ty = IntPtrTy; 161 Args.push_back(Entry); 164 Entry.Node = Size; 165 Entry.Ty = IntPtrTy; 166 Entry.isSExt = false; 167 Args.push_back(Entry); 176 Entry.Node = Src; 177 Entry [all...] |
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/AsmPrinter/ |
H A D | ARMException.cpp | 108 int Entry = 0; local 113 Entry = TypeInfos.size(); 120 Asm->OutStreamer.AddComment("TypeInfo " + Twine(Entry--)); 128 Entry = 0; 134 --Entry; 136 Asm->OutStreamer.AddComment("FilterInfo " + Twine(Entry));
|
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
H A D | InterferenceCache.h | 38 /// Entry - A cache entry containing interference information for all aliases 40 class Entry { class in class:llvm::InterferenceCache 48 /// RefCount - The total number of Cursor instances referring to this Entry. 96 Entry() : PhysReg(0), Tag(0), RefCount(0), Indexes(0), LIS(0) {} function in class:llvm::InterferenceCache::Entry 144 Entry Entries[CacheEntries]; 147 Entry *get(unsigned PhysReg); 162 Entry *CacheEntry; 166 void setEntry(Entry *E) {
|
/freebsd-9.3-release/contrib/llvm/lib/Support/ |
H A D | PrettyStackTrace.cpp | 33 static unsigned PrintStack(const PrettyStackTraceEntry *Entry, raw_ostream &OS){ argument 35 if (Entry->getNextEntry()) 36 NextID = PrintStack(Entry->getNextEntry(), OS); 40 Entry->print(OS);
|
H A D | IntervalMap.cpp | 21 path.front() = Entry(Root, Size, Offsets.first); 22 path.insert(path.begin() + 1, Entry(subtree(0), Offsets.second)); 61 path.resize(Level + 1, Entry(0, 0, 0)); 69 path[l] = Entry(NR, NR.size() - 1); 72 path[l] = Entry(NR, NR.size() - 1); 113 path[l] = Entry(NR, 0); 116 path[l] = Entry(NR, 0);
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Lex/ |
H A D | HeaderSearchOptions.h | 47 struct Entry { struct in class:clang::HeaderSearchOptions 57 Entry(StringRef path, frontend::IncludeDirGroup group, bool isFramework, function in struct:clang::HeaderSearchOptions::Entry 80 std::vector<Entry> UserEntries; 153 UserEntries.push_back(Entry(Path, Group, IsFramework, IgnoreSysRoot));
|
/freebsd-9.3-release/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | const_iterator.hpp | 60 binary_heap_const_iterator_<Value_Type, Entry, Simple, Allocator> 63 binary_heap_const_point_iterator_<Value_Type, Entry, Simple, Allocator> 67 typename Entry,
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Analysis/ |
H A D | CFGStmtMap.cpp | 57 CFGBlock *&Entry = SM[CS->getStmt()]; local 58 // If 'Entry' is already initialized (e.g., a terminator was already), 60 if (Entry) 63 Entry = B;
|
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Basic/ |
H A D | SourceManager.cpp | 183 llvm::StringMapEntry<unsigned> &Entry = local 185 if (Entry.getValue() != ~0U) 186 return Entry.getValue(); 189 Entry.setValue(FilenamesByID.size()); 190 FilenamesByID.push_back(&Entry); 303 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid); local 304 if (!Entry.isFile() || Invalid) 307 const SrcMgr::FileInfo &FileInfo = Entry.getFile(); 333 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid); local 334 if (!Entry 439 ContentCache *&Entry = FileInfos[FileEnt]; local 479 ContentCache *Entry = ContentCacheAlloc.Allocate<ContentCache>(1, EntryAlign); local 1124 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &CharDataInvalid); local 1314 const SLocEntry &Entry = getSLocEntry(FID, &MyInvalid); local 1464 const LineEntry *Entry = local 1500 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid); local 1570 const SLocEntry &Entry = getSLocEntry(LocInfo.first, &Invalid); local 1589 const SrcMgr::SLocEntry &Entry = getSLocEntry(FID, &Invalid); local 1735 const FileEntry *Entry =FileContentCache? FileContentCache->OrigEntry : 0; local 1768 const SLocEntry &Entry = getSLocEntry(FID, &Invalid); local 1845 const SrcMgr::SLocEntry &Entry = getSLocEntryByID(ID, &Invalid); local 1898 const SLocEntry &Entry = getSLocEntry(SpellFID); local 2012 const SrcMgr::SLocEntry &Entry = getSLocEntry(FID, &Invalid); local [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Rewrite/Frontend/ |
H A D | HTMLPrint.cpp | 67 const FileEntry* Entry = R.getSourceMgr().getFileEntryForID(FID); local 72 if (Entry) 73 Name = Entry->getName();
|
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Basic/ |
H A D | IdentifierTable.h | 77 llvm::StringMapEntry<IdentifierInfo*> *Entry; member in class:clang::IdentifierInfo 100 if (Entry) return Entry->getKeyData(); 113 if (Entry) return Entry->getKeyLength(); 450 llvm::StringMapEntry<IdentifierInfo*> &Entry = local 453 IdentifierInfo *II = Entry.getValue(); 461 Entry.setValue(II); 469 Entry.setValue(II); 473 II->Entry 492 llvm::StringMapEntry<IdentifierInfo*> &Entry = local [all...] |
/freebsd-9.3-release/contrib/llvm/tools/clang/lib/Lex/ |
H A D | MacroArgs.cpp | 35 for (MacroArgs **Entry = &PP.MacroArgCache; *Entry; 36 Entry = &(*Entry)->ArgCache) 37 if ((*Entry)->NumUnexpArgTokens >= UnexpArgTokens.size() && 38 (*Entry)->NumUnexpArgTokens < ClosestMatch) { 39 ResultEnt = Entry; 42 if ((*Entry)->NumUnexpArgTokens == UnexpArgTokens.size()) 45 ClosestMatch = (*Entry)->NumUnexpArgTokens;
|