| /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()");
86 assert(Entries == 0 && "Can only call layout() once");
90 I->second = Entries;
92 Entries += I->first.size() + 1;
98 assert(Entries && "Call layout() before get()");
110 assert(Entries && "Call layout() before emit()")
[all...] |
| EDEmitter.cpp | 41 std::vector<std::string> Entries;
46 Entries.push_back(std::string(e));
47 return Entries.size() - 1;
54 unsigned int numEntries = Entries.size();
56 o.indent(i) << Entries[index];
71 unsigned int numEntries = Entries.size();
74 o.indent(i) << Entries[index] << " = " << format("0x%x", flag);
123 std::vector<ConstantEmitter *> Entries;
128 Entries.push_back(e);
133 while (Entries.size())
[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/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();
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 | 114 // much memory. Instead, a fixed number of cache entries are used in a round-
125 // The actual cache entries.
126 Entry Entries[CacheEntries];
|
| /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/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;
|
| DwarfDebug.cpp | [all...] |
| /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 | 196 std::vector<LineEntry> &Entries = LineEntries[FID];
198 assert((Entries.empty() || Entries.back().FileOffset < Offset) &&
199 "Adding line entries out of order!");
204 if (!Entries.empty()) {
208 FilenameID = Entries.back().FilenameID;
212 Kind = Entries.back().FileKind;
213 IncludeOffset = Entries.back().IncludeOffset;
216 Entries.push_back(LineEntry::get(Offset, LineNo, FilenameID, Kind,
231 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 | 85 /// LineEntries - This is a map from FileIDs to a list of line entries (sorted
125 void AddEntry(int 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();
|
| jumplist_win.cc | 737 const TabRestoreService::Entries& entries = tab_restore_service->entries(); local
738 for (TabRestoreService::Entries::const_iterator it = entries.begin();
739 it != entries.end(); ++it) {
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CStringChecker.cpp | [all...] |
| /external/clang/lib/AST/ |
| ExprConstant.cpp | 154 /// The entries on the path from the glvalue to the designated subobject.
155 SmallVector<PathEntry, 8> Entries;
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()
[all...] |
| /external/llvm/lib/MC/ |
| MCDwarf.cpp | 102 // Add the line entry to this section's entries.
128 // This emits the Dwarf line table for the specified section from the entries
483 // entries (just the default .text in our case) and a terminating pair of zeros.
610 // and file table entries.
647 const std::vector<const MCGenDwarfLabelEntry *> &Entries =
650 Entries.begin(), ie = Entries.end(); it != ie;
684 Entries.begin(), ie = Entries.end(); it != ie;
717 // If there are no line table entries then do not emit any section contents
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/ |
| autoboot | 461 grep -F "/$file/" $dir/CVS/Entries 2>/dev/null |
|
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractMultimap.java | 264 for (Map.Entry<? extends K, ? extends V> entry : multimap.entries()) {
1048 private transient Collection<Map.Entry<K, V>> entries;
1067 public Collection<Map.Entry<K, V>> entries() {
1068 Collection<Map.Entry<K, V>> result = entries;
1069 return (result == null) ? entries = createEntries() : result;
1084 return new Multimaps.Entries<K, V>() {
1096 * Returns an iterator across all key-value map entries, used by {@code
1097 * entries().iterator()} and {@code values().iterator()}. The default
1101 * @return an iterator across map entries
[all...] |
| Multimaps.java | 406 for (Map.Entry<? extends V, ? extends K> entry : source.entries()) {
490 transient Collection<Entry<K, V>> entries; field in class:Multimaps.UnmodifiableMultimap
552 @Override public Collection<Entry<K, V>> entries() { method in class:Multimaps.UnmodifiableMultimap
553 Collection<Entry<K, V>> result = entries;
555 entries = result = unmodifiableEntries(delegate.entries());
693 @Override public Set<Map.Entry<K, V>> entries() {
694 return Maps.unmodifiableEntrySet(delegate().entries());
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Multimaps.java | 317 for (Map.Entry<? extends V, ? extends K> entry : source.entries()) {
401 transient Collection<Entry<K, V>> entries; field in class:Multimaps.UnmodifiableMultimap
463 @Override public Collection<Entry<K, V>> entries() { method in class:Multimaps.UnmodifiableMultimap
464 Collection<Entry<K, V>> result = entries;
466 entries = result = unmodifiableEntries(delegate.entries());
604 @Override public Set<Map.Entry<K, V>> entries() {
605 return Maps.unmodifiableEntrySet(delegate().entries());
838 * Returns an unmodifiable view of the specified collection of entries. The
843 * @param entries the entries for which to return an unmodifiable vie
[all...] |
