Searched refs:Entries (Results 1 - 25 of 32) sorted by relevance

12

/external/llvm/lib/DebugInfo/
H A DDWARFDebugRangeList.cpp19 Entries.clear();
42 Entries.push_back(entry);
48 for (int i = 0, n = Entries.size(); i != n; ++i) {
52 OS << format(format_str, Offset, Entries[i].StartAddress,
53 Entries[i].EndAddress);
60 for (int i = 0, n = Entries.size(); i != n; ++i) {
61 if (Entries[i].isBaseAddressSelectionEntry(AddressSize))
62 BaseAddress = Entries[i].EndAddress;
63 else if (Entries[i].containsAddress(BaseAddress, Address))
H A DDWARFDebugRangeList.h63 std::vector<RangeListEntry> Entries; member in class:llvm::DWARFDebugRangeList
/external/llvm/utils/TableGen/
H A DSequenceToOffsetTable.h55 // Entries in the final table, or 0 before layout was called.
56 unsigned Entries; member in class:llvm::SequenceToOffsetTable
64 SequenceToOffsetTable() : Entries(0) {}
69 assert(Entries == 0 && "Cannot call add() after layout()");
88 assert(Entries == 0 && "Can only call layout() once");
92 I->second = Entries;
94 Entries += I->first.size() + 1;
100 assert(Entries && "Call layout() before get()");
112 assert(Entries && "Call layout() before emit()");
H A DEDEmitter.cpp43 std::vector<std::string> Entries; member in class:__anon9317::EnumEmitter
48 Entries.push_back(std::string(e));
49 return Entries.size() - 1;
56 unsigned int numEntries = Entries.size();
58 o.indent(i) << Entries[index];
73 unsigned int numEntries = Entries.size();
76 o.indent(i) << Entries[index] << " = " << format("0x%x", flag);
131 std::vector<ConstantEmitter *> Entries; member in class:__anon9321::CompoundConstantEmitter
136 Entries.push_back(e);
141 while (Entries
[all...]
H A DDAGISelMatcherOpt.cpp480 Matcher *Entries[2] = { PrevMatcher, MatcherWithoutCTM }; local
481 Cases[Entry-1].second = new ScopeMatcher(Entries, 2);
/external/llvm/lib/Transforms/Instrumentation/
H A DBlackList.h50 StringMap<Regex*> Entries; member in class:llvm::BlackList
H A DBlackList.cpp76 Entries[I->getKey()] = new Regex(I->getValue());
98 Regex *FunctionRegex = Entries[Section];
/external/chromium/chrome/browser/sessions/
H A Dtab_restore_service.h115 typedef std::list<Entry*> Entries; typedef in class:TabRestoreService
146 virtual const Entries& entries() const;
219 Entries::iterator GetEntryIteratorById(SessionID::id_type id);
256 // Populates |loaded_entries| with Entries from |request|.
305 Entries entries_;
H A Dtab_restore_service.cc277 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i)
293 const TabRestoreService::Entries& TabRestoreService::entries() const {
308 Entries::iterator i = GetEntryIteratorById(id);
315 for (Entries::iterator j = entries_.begin(); j != i && j != entries_.end();
456 Entries::reverse_iterator i = entries_.rbegin();
544 TabRestoreService::Entries::iterator TabRestoreService::GetEntryIteratorById(
546 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i) {
987 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i) {
/external/clang/include/clang/Frontend/
H A DLogDiagnosticPrinter.h51 SmallVector<DiagEntry, 8> Entries; member in class:clang::LogDiagnosticPrinter
/external/llvm/lib/CodeGen/
H A DInterferenceCache.cpp35 Entries[i].clear(mf, indexes, lis);
40 if (E < CacheEntries && Entries[E].getPhysReg() == PhysReg) {
41 if (!Entries[E].valid(LIUArray, TRI))
42 Entries[E].revalidate(LIUArray, TRI);
43 return &Entries[E];
51 if (Entries[E].hasRefs()) {
56 Entries[E].reset(PhysReg, LIUArray, TRI, MF);
58 return &Entries[E];
H A DInterferenceCache.h144 Entry Entries[CacheEntries]; member in class:llvm::InterferenceCache
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.cpp43 Entries(Allocator) { }
51 DataArray &DIEs = Entries[Name];
82 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
241 O << "Entries: \n";
243 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
H A DDwarfAccelTable.h261 StringEntries Entries; member in class:llvm::DwarfAccelTable
H A DDwarfDebug.cpp2000 StringMapEntry<std::pair<MCSymbol*, unsigned> >*>, 64> Entries; local
2004 Entries.push_back(std::make_pair(I->second.second, &*I));
2006 array_pod_sort(Entries.begin(), Entries.end());
2008 for (unsigned i = 0, e = Entries.size(); i != e; ++i) {
2010 Asm->OutStreamer.EmitLabel(Entries[i].second->getValue().first);
2013 Asm->OutStreamer.EmitBytes(StringRef(Entries[i].second->getKeyData(),
2014 Entries[i].second->getKeyLength()+1),
2160 /// Entries (one "entry" for each function that was inlined):
/external/clang/lib/Basic/
H A DSourceManager.cpp199 std::vector<LineEntry> &Entries = LineEntries[FID]; local
201 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
207 if (!Entries.empty()) {
211 FilenameID = Entries.back().FilenameID;
215 Kind = Entries.back().FileKind;
216 IncludeOffset = Entries.back().IncludeOffset;
219 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
234 std::vector<LineEntry> &Entries = LineEntries[FID]; local
236 assert((Entries
264 const std::vector<LineEntry> &Entries = LineEntries[FID]; local
281 AddEntry(FileID FID, const std::vector<LineEntry> &Entries) argument
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/
H A Dplugin.properties17 descriptionMap=Map Entries
/external/chromium/chrome/browser/ui/webui/
H A Dnew_tab_ui.h53 const TabRestoreService::Entries& entries,
H A Dnew_tab_ui.cc542 const TabRestoreService::Entries& entries, ListValue* entry_list_value) {
549 for (TabRestoreService::Entries::const_iterator it = entries.begin();
/external/clang/include/clang/Basic/
H A DSourceManagerInternals.h128 void AddEntry(FileID FID, const std::vector<LineEntry> &Entries);
/external/chromium/chrome/browser/
H A Dplugin_exceptions_table_model_unittest.cc112 typedef std::vector<PluginExceptionsTableModel::SettingsEntry> Entries; typedef
113 const Entries& settings = table_model_->settings_;
123 for (Entries::const_iterator it = settings.begin();
H A Djumplist_win.cc737 const TabRestoreService::Entries& entries = tab_restore_service->entries();
738 for (TabRestoreService::Entries::const_iterator it = entries.begin();
/external/clang/lib/StaticAnalyzer/Checkers/
H A DCStringChecker.cpp1881 CStringLength::EntryMap Entries = state->get<CStringLength>(); local
1882 return !Entries.isEmpty();
1891 CStringLength::EntryMap Entries = state->get<CStringLength>(); local
1892 if (Entries.isEmpty())
1914 for (CStringLength::EntryMap::iterator I = Entries.begin(),
1915 E = Entries.end(); I != E; ++I) {
1920 Entries = F.remove(Entries, MR);
1929 Entries = F.remove(Entries, M
1941 CStringLength::EntryMap Entries = state->get<CStringLength>(); local
1959 CStringLength::EntryMap Entries = state->get<CStringLength>(); local
[all...]
/external/clang/lib/AST/
H A DExprConstant.cpp155 SmallVector<PathEntry, 8> Entries; member in struct:__anon3489::SubobjectDesignator
169 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end());
180 Entries.clear();
188 Entries[MostDerivedPathLength - 1].ArrayIndex == MostDerivedArraySize)
207 Entries.push_back(Entry);
212 MostDerivedPathLength = Entries.size();
220 Entries.push_back(Entry);
226 MostDerivedPathLength = Entries.size();
233 Entries
[all...]
/external/llvm/lib/MC/
H A DMCDwarf.cpp650 const std::vector<const MCGenDwarfLabelEntry *> &Entries = local
653 Entries.begin(), ie = Entries.end(); it != ie;
687 Entries.begin(), ie = Entries.end(); it != ie;

Completed in 567 milliseconds

12