Searched defs:Entry (Results 201 - 225 of 347) sorted by relevance

1234567891011>>

/external/clang/include/clang/Basic/
H A DIdentifierTable.h74 llvm::StringMapEntry<IdentifierInfo*> *Entry; member in class:clang::IdentifierInfo
97 if (Entry) return Entry->getKeyData();
110 if (Entry) return Entry->getKeyLength();
447 llvm::StringMapEntry<IdentifierInfo*> &Entry = local
450 IdentifierInfo *II = Entry.getValue();
458 Entry.setValue(II);
466 Entry.setValue(II);
470 II->Entry
489 llvm::StringMapEntry<IdentifierInfo*> &Entry = local
[all...]
/external/clang/lib/CodeGen/
H A DCGVTables.cpp325 llvm::GlobalValue *Entry; local
330 Entry = cast<llvm::GlobalValue>(CE->getOperand(0));
332 Entry = cast<llvm::GlobalValue>(C);
337 if (Entry->getType()->getElementType() !=
339 llvm::GlobalValue *OldThunkFn = Entry;
347 Entry = cast<llvm::GlobalValue>(CGM.GetAddrOfThunk(GD, Thunk));
352 llvm::ConstantExpr::getBitCast(Entry, OldThunkFn->getType());
360 llvm::Function *ThunkFn = cast<llvm::Function>(Entry);
/external/clang/lib/Sema/
H A DJumpDiagnostics.cpp570 IndirectGotoStmt *&Entry = JumpScopesMap[IGScope]; local
571 if (!Entry) Entry = IG;
/external/clang/lib/StaticAnalyzer/Core/
H A DHTMLDiagnostics.cpp176 const FileEntry* Entry = SMgr.getFileEntryForID(FID); local
184 if (llvm::sys::path::is_relative(Entry->getName())) {
202 << html::EscapeText(Entry->getName())
242 os << "\n<!-- BUGFILE " << DirName << Entry->getName() << " -->\n";
244 os << "\n<!-- FILENAME " << llvm::sys::path::filename(Entry->getName()) << " -->\n";
267 html::AddHeaderFooterInternalBuiltinCSS(R, FID, Entry->getName());
299 << llvm::sys::path::filename(Entry->getName()).str()
/external/guava/guava/src/com/google/common/collect/
H A DStandardTable.java36 import java.util.Map.Entry;
202 Iterator<Entry<R, Map<C, V>>> iterator
205 Entry<R, Map<C, V>> entry = iterator.next();
307 final Iterator<Entry<R, Map<C, V>>> rowIterator
309 Entry<R, Map<C, V>> rowEntry;
310 Iterator<Entry<C, V>> columnIterator
322 Entry<C, V> columnEntry = columnIterator.next();
432 Set<Entry<C, V>> entrySet;
435 public Set<Entry<C, V>> entrySet() {
436 Set<Entry<
541 removePredicate(Predicate<? super Entry<R, V>> predicate) argument
[all...]
/external/lldb/include/lldb/Core/
H A DMappedHash.h186 struct Entry struct in class:MappedHash::ExportTable
212 Entry entry;
349 typedef std::vector<Entry> collection;
H A DRangeMap.h175 typedef Range<B,S> Entry; typedef in class:lldb_private::RangeArray
176 typedef llvm::SmallVector<Entry, N> Collection;
188 Append (const Entry &entry)
216 // First we determine if we can combine any of the Entry objects so we
240 // First we determine if we can combine any of the Entry objects so we
324 const Entry *
333 const Entry &
339 Entry *
347 const Entry *
356 BaseLessThan (const Entry
455 typedef Range<B,S> Entry; typedef in class:lldb_private::RangeVector
799 typedef RangeData<B,S,T> Entry; typedef in class:lldb_private::RangeDataArray
1061 typedef RangeData<B,S,T> Entry; typedef in class:lldb_private::RangeDataVector
1410 typedef AddressData<B,T> Entry; typedef in class:lldb_private::AddressDataArray
[all...]
/external/llvm/include/llvm/Bitcode/
H A DBitstreamReader.h313 BitstreamEntry Entry = advance(Flags); local
314 if (Entry.Kind != BitstreamEntry::SubBlock)
315 return Entry;
/external/llvm/include/llvm/Support/
H A DGenericDomTree.h444 NodeT &Entry = A->getParent()->front(); local
445 if (A == &Entry || B == &Entry)
446 return &Entry;
/external/llvm/lib/Analysis/
H A DRegionInfo.cpp54 Region::Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RInfo, argument
56 : RegionNode(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
/external/llvm/lib/AsmParser/
H A DLLParser.cpp377 std::pair<Type*, LocTy> &Entry = NumberedTypes[TypeID]; local
378 if (Entry.first)
380 Entry.first = Result;
381 Entry.second = SMLoc();
404 std::pair<Type*, LocTy> &Entry = NamedTypes[Name]; local
405 if (Entry.first)
407 Entry.first = Result;
408 Entry.second = SMLoc();
1756 std::pair<Type*, LocTy> &Entry = NamedTypes[Lex.getStrVal()];
1760 if (!Entry
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDIE.h414 DIE &Entry; member in class:llvm::DIEEntry
417 explicit DIEEntry(DIE &E) : DIEValue(isEntry), Entry(E) {
420 DIE &getEntry() const { return Entry; }
H A DDwarfUnit.cpp80 DIEEntry *DwarfUnit::createDIEEntry(DIE &Entry) { argument
81 DIEEntry *Value = new (DIEValueAllocator) DIEEntry(Entry);
360 void DwarfUnit::addDIEEntry(DIE &Die, dwarf::Attribute Attribute, DIE &Entry) { argument
361 addDIEEntry(Die, Attribute, createDIEEntry(Entry));
376 DIEEntry *Entry) {
378 const DIE *EntryCU = Entry->getEntry().getUnitOrNull();
386 Entry);
624 the variable's Debug Information Entry as its real type. So far, so good.
1018 DIEEntry *Entry = getDIEEntry(Ty);
1020 if (Entry) {
375 addDIEEntry(DIE &Die, dwarf::Attribute Attribute, DIEEntry *Entry) argument
[all...]
/external/llvm/lib/CodeGen/
H A DExecutionDepsFix.cpp746 MachineBasicBlock *Entry = MF->begin(); local
747 ReversePostOrderTraversal<MachineBasicBlock*> RPOT(Entry);
H A DLiveVariables.cpp525 MachineBasicBlock *Entry = MF->begin(); local
529 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
H A DMachineModuleInfo.cpp103 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB]; local
106 if (!Entry.Symbols.isNull()) {
107 assert(BB->getParent() == Entry.Fn && "Parent changed");
108 if (Entry.Symbols.is<MCSymbol*>())
109 return Entry.Symbols.get<MCSymbol*>();
110 return (*Entry.Symbols.get<std::vector<MCSymbol*>*>())[0];
117 Entry.Index = BBCallbacks.size()-1;
118 Entry.Fn = BB->getParent();
120 Entry.Symbols = Result;
128 AddrLabelSymEntry &Entry local
163 AddrLabelSymEntry Entry = AddrLabelSymbols[BB]; local
[all...]
/external/llvm/lib/CodeGen/SelectionDAG/
H A DLegalizeTypes.cpp772 std::pair<SDValue, SDValue> &Entry = ExpandedIntegers[Op]; local
773 RemapValue(Entry.first);
774 RemapValue(Entry.second);
775 assert(Entry.first.getNode() && "Operand isn't expanded");
776 Lo = Entry.first;
777 Hi = Entry.second;
791 std::pair<SDValue, SDValue> &Entry = ExpandedIntegers[Op]; local
792 assert(!Entry.first.getNode() && "Node already expanded");
793 Entry.first = Lo;
794 Entry
799 std::pair<SDValue, SDValue> &Entry = ExpandedFloats[Op]; local
818 std::pair<SDValue, SDValue> &Entry = ExpandedFloats[Op]; local
826 std::pair<SDValue, SDValue> &Entry = SplitVectors[Op]; local
847 std::pair<SDValue, SDValue> &Entry = SplitVectors[Op]; local
1040 TargetLowering::ArgListEntry Entry; local
[all...]
/external/llvm/lib/IR/
H A DMetadata.cpp41 StringMapEntry<Value*> &Entry = local
43 Value *&S = Entry.getValue();
45 S->setValueName(&Entry);
/external/llvm/lib/Support/
H A DYAMLTraits.cpp320 HNode *Entry = this->createHNodes(&SN); local
323 SQHNode->Entries.push_back(Entry);
/external/llvm/lib/Target/ARM/
H A DThumb2SizeReduction.cpp152 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,
291 Thumb2SizeReduce::VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, argument
294 if ((is2Addr && Entry.PredCC2 == 0) ||
295 (!is2Addr && Entry.PredCC1 == 0)) {
314 } else if ((is2Addr && Entry.PredCC2 == 2) ||
315 (!is2Addr && Entry
365 ReduceLoadStore(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry) argument
526 ReduceSpecial(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument
628 ReduceTo2Addr(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument
746 ReduceToNarrow(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) argument
895 const ReduceEntry &Entry = ReduceTable[OPI->second]; local
[all...]
/external/llvm/tools/llvm-readobj/
H A DARMEHABIPrinter.h334 void PrintOpcodes(const uint8_t *Entry, size_t Length, off_t Offset) const;
453 void PrinterContext<ET>::PrintOpcodes(const uint8_t *Entry, argument
456 OpcodeDecoder(OCC.W).Decode(Entry, Offset, Length);
481 for (unsigned Entry = 0; Entry < Entries; ++Entry) {
482 DictScope E(SW, "Entry");
485 Data[Entry * (IndexTableEntrySize / sizeof(*Data)) + 0];
487 Data[Entry * (IndexTableEntrySize / sizeof(*Data)) + 1];
510 PrintOpcodes(Contents->data() + Entry * IndexTableEntrySiz
[all...]
/external/llvm/utils/TableGen/
H A DRegisterInfoEmitter.cpp608 CodeGenSubRegIndex *&Entry = Vec[I->first->EnumValue - 1]; local
609 if (Entry && Entry != I->second)
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/
H A DDiskLruCache.java148 private final LinkedHashMap<String, Entry> lruEntries =
149 new LinkedHashMap<String, Entry>(0, 0.75f, true);
294 Entry entry = lruEntries.get(key);
296 entry = new Entry(key);
320 for (Iterator<Entry> i = lruEntries.values().iterator(); i.hasNext(); ) {
321 Entry entry = i.next();
358 for (Entry entry : lruEntries.values()) {
402 Entry entry = lruEntries.get(key);
451 Entry entry = lruEntries.get(key);
457 entry = new Entry(ke
867 private final class Entry { class in class:DiskLruCache
882 private Entry(String key) { method in class:DiskLruCache.Entry
[all...]
/external/clang/lib/Basic/
H A DVirtualFileSystem.cpp361 class Entry { class in namespace:__anon17804
366 virtual ~Entry();
367 Entry(EntryKind K, StringRef Name) : Kind(K), Name(Name) {} function in class:__anon17804::Entry
372 class DirectoryEntry : public Entry {
373 std::vector<Entry *> Contents;
378 DirectoryEntry(StringRef Name, std::vector<Entry *> Contents, Status S)
379 : Entry(EK_Directory, Name), Contents(std::move(Contents)),
382 typedef std::vector<Entry *>::iterator iterator;
385 static bool classof(const Entry *E) { return E->getKind() == EK_Directory; }
388 class FileEntry : public Entry {
1107 const YAMLVFSEntry &Entry = Entries.front(); local
[all...]
/external/chromium_org/content/browser/quota/
H A Dquota_manager_unittest.cc1917 typedef std::pair<TypedOrigin, int> Entry; typedef
1918 const Entry kEntries[] = {
1922 std::set<Entry> entries

Completed in 2630 milliseconds

1234567891011>>