| /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;
|
| 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...] |
| DAGISelMatcherOpt.cpp | 402 // Check to see if all of the leading entries are now opcode checks. If so,
480 Matcher *Entries[2] = { PrevMatcher, MatcherWithoutCTM };
481 Cases[Entry-1].second = new ScopeMatcher(Entries, 2);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BlackList.h | 53 StringMap<Regex*> Entries;
|
| /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/llvm/lib/Transforms/Instrumentation/ |
| BlackList.cpp | 83 Entries[I->getKey()] = new Regex(I->getValue());
118 StringMap<Regex*>::const_iterator I = Entries.find(Section);
119 if (I == Entries.end()) return false;
|
| /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...] |
| tab_restore_service.cc | 78 // Number of entries (not commands) before we clobber the file and write
121 // deleted and removed from both |id_to_entry| and |entries|. This is used
122 // when creating entries from the backend file.
125 std::vector<TabRestoreService::Entry*>* entries) {
130 entries->erase(std::find(entries->begin(), entries->end(), i->second));
277 for (Entries::iterator i = entries_.begin(); i != entries_.end(); ++i)
293 const TabRestoreService::Entries& TabRestoreService::entries() const function in class:TabRestoreService
715 std::vector<Entry*> entries; local
732 ScopedVector<Entry> entries; local
1000 std::vector<Entry*> entries; local
[all...] |
| /external/clang/include/clang/Frontend/ |
| LogDiagnosticPrinter.h | 51 SmallVector<DiagEntry, 8> 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...] |
| InterferenceCache.h | 132 // much memory. Instead, a fixed number of cache entries are used in a round-
143 // The actual cache entries.
144 Entry Entries[CacheEntries];
|
| /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) {
|
| DwarfAccelTable.h | 261 StringEntries Entries;
|
| /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,
|
| new_tab_ui.cc | 154 NewTabUI::AddRecentlyClosedEntries(service->entries(), &list_value);
542 const TabRestoreService::Entries& entries, ListValue* entry_list_value) {
546 // We filter the list of recently closed to only show 'interesting' entries,
549 for (TabRestoreService::Entries::const_iterator it = entries.begin();
550 it != entries.end() && added_count < max_count; ++it) {
|
| /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...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.jdt.debug_3.6.1.v20100715_r361/ |
| plugin.properties | 17 descriptionMap=Map Entries
|
| /external/clang/include/clang/Basic/ |
| SourceManagerInternals.h | 87 /// \brief Map from FileIDs to a list of line entries (sorted by the offset
128 void AddEntry(FileID FID, const std::vector<LineEntry> &Entries);
|
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model_unittest.cc | 112 typedef std::vector<PluginExceptionsTableModel::SettingsEntry> Entries;
113 const Entries& settings = table_model_->settings_;
123 for (Entries::const_iterator it = settings.begin();
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CStringChecker.cpp | [all...] |
| /external/bison/build-aux/ |
| vc-list-files | 93 if (f ~ /CVS\/Entries$/) \
97 `find "$dir" -name Entries -print` /dev/null' $postprocess
|
| /external/clang/lib/AST/ |
| ExprConstant.cpp | 155 /// The entries on the path from the glvalue to the designated subobject.
156 SmallVector<PathEntry, 8> Entries;
170 Entries.insert(Entries.end(), VEntries.begin(), VEntries.end());
181 Entries.clear();
189 Entries[MostDerivedPathLength - 1].ArrayIndex == MostDerivedArraySize)
208 Entries.push_back(Entry);
213 MostDerivedPathLength = Entries.size();
221 Entries.push_back(Entry);
227 MostDerivedPathLength = Entries.size()
[all...] |
