| /external/llvm/lib/DebugInfo/ |
| DWARFDebugRangeList.cpp | 19 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))
|
| DWARFDebugFrame.h | 39 EntryVector Entries;
|
| DWARFDebugLoc.h | 38 SmallVector<Entry, 2> Entries;
|
| DWARFDebugLoc.cpp | 21 for (SmallVectorImpl<Entry>::const_iterator I2 = I->Entries.begin(), E2 = I->Entries.end(); I2 != E2; ++I2) {
22 if (I2 != I->Entries.begin())
71 Loc.Entries.push_back(llvm_move(E));
|
| DWARFDebugRangeList.h | 45 // subsequent entries of the location list.
63 std::vector<RangeListEntry> Entries;
|
| DWARFDebugFrame.cpp | 25 /// entries implement.
291 for (EntryVector::iterator I = Entries.begin(), E = Entries.end();
369 Entries.push_back(Entry);
383 for (EntryVector::const_iterator I = Entries.begin(), E = Entries.end();
|
| /external/llvm/utils/TableGen/ |
| SequenceToOffsetTable.h | 30 /// reusing entries.
55 // Entries in the final table, or 0 before layout was called.
56 unsigned Entries;
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()")
[all...] |
| /external/chromium_org/chrome/browser/sessions/ |
| tab_restore_service_helper.h | 35 typedef TabRestoreService::Entries Entries;
45 // Invoked before the entries are cleared.
51 Entries::const_iterator entry_iterator);
61 // Max number of entries we'll keep around.
82 const Entries& entries() const;
99 // Adds |entry| to the list of entries and takes ownership. If |prune| is true
106 // entries.
113 Entries::iterator GetEntryIteratorById(SessionID::id_type id)
[all...] |
| persistent_tab_restore_service.h | 35 virtual const Entries& entries() const OVERRIDE;
56 Entries* mutable_entries();
|
| tab_restore_service.h | 39 // To listen for changes to the set of entries managed by the TabRestoreService
71 // Is this entry from the last session? This is set to true for entries that
72 // were closed during the last session, and false for entries that were
125 typedef std::list<Entry*> Entries;
135 // entries has changed.
140 // at least one tab, a Window is created, added to entries and observers are
147 // Removes all entries from the list and notifies observers the list
151 // Returns the entries, ordered with most recently closed entries at the
153 virtual const Entries& entries() const = 0
[all...] |
| in_memory_tab_restore_service.cc | 51 const TabRestoreService::Entries& InMemoryTabRestoreService::entries() const { function in class:InMemoryTabRestoreService
52 return helper_.entries();
|
| in_memory_tab_restore_service.h | 35 virtual const Entries& entries() const OVERRIDE;
|
| /external/chromium_org/chrome/browser/ui/webui/ntp/ |
| recently_closed_tabs_handler.h | 44 // Converts a list of TabRestoreService entries to the JSON format required
47 const TabRestoreService::Entries& entries,
|
| recently_closed_tabs_handler.cc | 138 TabRestoreService::Entries entries = service->entries(); local
139 CreateRecentlyClosedValues(entries, &list_value);
151 const TabRestoreService::Entries& entries, ListValue* entry_list_value) {
154 // We filter the list of recently closed to only show 'interesting' entries,
157 for (TabRestoreService::Entries::const_iterator it = entries.begin();
158 it != entries.end() && added_count < max_count; ++it)
[all...] |
| /external/chromium_org/ppapi/cpp/ |
| directory_entry.cc | 65 typedef std::vector<PP_DirectoryEntry> Entries;
66 for (Entries::iterator it = temp_storage_.begin();
|
| /external/chromium_org/ui/views/ |
| view_model.h | 80 typedef std::vector<Entry> Entries;
91 Entries entries_;
|
| /external/llvm/lib/Transforms/Utils/ |
| SpecialCaseList.cpp | 104 Entries[Prefix][Category].Strings.insert(Regexp);
135 Entries[I->getKey()][II->getKey()].RegEx = new Regex(II->getValue());
141 for (StringMap<StringMap<Entry> >::iterator I = Entries.begin(),
142 E = Entries.end();
199 StringMap<StringMap<Entry> >::const_iterator I = Entries.find(Section);
200 if (I == Entries.end()) return false;
217 StringMap<StringMap<Entry> >::const_iterator I = Entries.find(Section);
218 if (I == Entries.end()) return false;
|
| /external/llvm/lib/Support/ |
| YAMLTraits.cpp | 139 return SQ->Entries.size();
152 CurrentNode = SQ->Entries[Index];
164 return SQ->Entries.size();
174 CurrentNode = SQ->Entries[index];
212 BitValuesUsed.insert(BitValuesUsed.begin(), SQ->Entries.size(), false);
225 for (std::vector<HNode *>::iterator i = SQ->Entries.begin(),
226 End = SQ->Entries.end(); i != End; ++i) {
247 assert(BitValuesUsed.size() == SQ->Entries.size());
248 for (unsigned i = 0; i < SQ->Entries.size(); ++i) {
250 setError(SQ->Entries[i], "unknown bit value")
[all...] |
| /external/chromium/chrome/browser/sessions/ |
| tab_restore_service.h | 35 // To listen for changes to the set of entries managed by the TabRestoreService
67 // Is this entry from the last session? This is set to true for entries that
68 // were closed during the last session, and false for entries that were
115 typedef std::list<Entry*> Entries;
129 // entries has changed.
133 // at least one tab, a Window is created, added to entries and observers are
140 // Removes all entries from the list and notifies observers the list
144 // Returns the entries, ordered with most recently closed entries at the
146 virtual const Entries& entries() const
[all...] |
| /external/clang/include/clang/Frontend/ |
| LogDiagnosticPrinter.h | 51 SmallVector<DiagEntry, 8> Entries;
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SpecialCaseList.h | 93 StringMap<StringMap<Entry> > Entries;
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.cpp | 35 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];
50 // Skip entries that are in use.
51 if (Entries[E].hasRefs()) {
56 Entries[E].reset(PhysReg, LIUArray, TRI, MF);
58 return &Entries[E];
60 llvm_unreachable("Ran out of interference cache entries.")
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 43 Entries(Allocator) { }
51 DataArray &DIEs = Entries[Name];
82 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
84 // Unique the entries.
241 O << "Entries: \n";
243 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
|
| /external/chromium/chrome/browser/ui/webui/ |
| new_tab_ui.h | 50 // Converts a list of TabRestoreService entries to the JSON format required
53 const TabRestoreService::Entries& entries,
|
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 199 std::vector<LineEntry> &Entries = LineEntries[FID];
201 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
202 "Adding line entries out of order!");
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]
[all...] |
