| /external/llvm/lib/Target/Hexagon/ |
| HexagonSelectionDAGInfo.cpp | 36 TargetLowering::ArgListEntry Entry;
37 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
38 Entry.Node = Dst;
39 Args.push_back(Entry);
40 Entry.Node = Src;
41 Args.push_back(Entry);
42 Entry.Node = Size;
43 Args.push_back(Entry);
|
| /external/llvm/lib/Target/XCore/ |
| XCoreSelectionDAGInfo.cpp | 29 TargetLowering::ArgListEntry Entry;
30 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
31 Entry.Node = Dst; Args.push_back(Entry);
32 Entry.Node = Src; Args.push_back(Entry);
33 Entry.Node = Size; Args.push_back(Entry);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugMacro.h | 22 /// A single macro entry within a macro list.
23 struct Entry {
24 /// The type of the macro entry.
34 /// The string (name, value) of the macro entry.
43 using MacroList = SmallVector<Entry, 4>;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/XCore/ |
| XCoreSelectionDAGInfo.cpp | 29 TargetLowering::ArgListEntry Entry;
30 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
31 Entry.Node = Dst; Args.push_back(Entry);
32 Entry.Node = Src; Args.push_back(Entry);
33 Entry.Node = Size; Args.push_back(Entry);
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| CatchHandlerList.java | 48 public Entry get(int n) {
49 return (Entry) get0(n);
75 Entry entry = get(i); local
86 sb.append(entry.getExceptionType().toHuman());
90 sb.append(Hex.u2or4(entry.getHandler()));
110 Entry last = get(size - 1);
115 * Sets the entry at the given index.
122 set0(n, new Entry(exceptionType, handler));
126 * Sets the entry at the given index
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| CatchHandlerList.java | 48 public Entry get(int n) {
49 return (Entry) get0(n);
76 Entry entry = get(i); local
87 sb.append(entry.getExceptionType().toHuman());
91 sb.append(Hex.u2or4(entry.getHandler()));
111 Entry last = get(size - 1);
116 * Sets the entry at the given index.
123 set0(n, new Entry(exceptionType, handler));
127 * Sets the entry at the given index
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfStringPool.cpp | 31 auto &Entry = I.first->second;
32 Entry.Index = Pool.size() - 1;
33 Entry.Offset = NumBytes;
34 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
37 assert(NumBytes > Entry.Offset && "Unexpected overflow");
51 // table. The header consists of an entry with the contribution's
79 for (const auto &Entry : Entries) {
80 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
81 "Mismatch between setting and entry");
85 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol)
[all...] |
| /art/runtime/interpreter/ |
| interpreter_cache.h | 33 // Presence of entry might imply some pre-conditions.
48 // Aligned since we load the whole entry in single assembly instruction.
49 typedef std::pair<const void*, size_t> Entry ALIGNED(2 * sizeof(size_t));
59 data_.fill(Entry{});
67 Entry& entry = data_[IndexOf(key)]; local
68 if (LIKELY(entry.first == key)) {
69 *value = entry.second;
77 data_[IndexOf(key)] = Entry{key, value};
90 std::array<Entry, kSize> data_
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Core/PiSmmCore/ |
| Page.c | 84 Internal function. Deque a descriptor entry from the mFreeMemoryMapEntryList.
100 MEMORY_MAP* Entry;
135 Entry = CR (mFreeMemoryMapEntryList.ForwardLink, MEMORY_MAP, Link, MEMORY_MAP_SIGNATURE);
136 RemoveEntryList (&Entry->Link);
138 return Entry;
152 MEMORY_MAP *Entry;
169 // Deque an memory map entry from mFreeMemoryMapEntryList
171 Entry = AllocateMemoryMapEntry ();
172 ASSERT (Entry);
175 // Update to proper entry
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableMapEntrySet.java | 21 import java.util.Map.Entry;
32 abstract class ImmutableMapEntrySet<K, V> extends ImmutableSet<Entry<K, V>> {
44 if (object instanceof Entry) {
45 Entry<?, ?> entry = (Entry<?, ?>) object; local
46 V value = map().get(entry.getKey());
47 return value != null && value.equals(entry.getValue());
|
| AbstractSortedMultiset.java | 66 public Entry<E> firstEntry() {
67 Iterator<Entry<E>> entryIterator = entryIterator();
72 public Entry<E> lastEntry() {
73 Iterator<Entry<E>> entryIterator = descendingEntryIterator();
78 public Entry<E> pollFirstEntry() {
79 Iterator<Entry<E>> entryIterator = entryIterator();
81 Entry<E> result = entryIterator.next();
90 public Entry<E> pollLastEntry() {
91 Iterator<Entry<E>> entryIterator = descendingEntryIterator();
93 Entry<E> result = entryIterator.next()
[all...] |
| /external/robolectric-shadows/shadows/framework/src/main/java/org/robolectric/shadows/ |
| ShadowDropBoxManager.java | 4 import android.os.DropBoxManager.Entry;
13 private final SortedMap<Long, Entry> entries = new TreeMap<>();
20 * Adds entry to the DropboxManager with the flag indicating data is text.
28 * DropBoxManager.Entry#getText} can be used.
35 entries.put(timestamp, new DropBoxManager.Entry(tag, timestamp, data, DropBoxManager.IS_TEXT));
46 protected DropBoxManager.Entry getNextEntry(String tag, long millis) {
47 for (DropBoxManager.Entry entry : entries.tailMap(millis).values()) {
48 if ((tag != null && !entry.getTag().equals(tag)) || entry.getTimeMillis() <= millis)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| UniqueVector.h | 21 /// unique entry that is added. T is the type of entries in the vector. This
23 /// Entries can be fetched using operator[] with the entry ID.
26 // Map - Used to handle the correspondence of entry to ID.
34 /// insert - Append entry to the vector if it doesn't already exist. Returns
35 /// the entry's index + 1 to be used as a unique ID.
36 unsigned insert(const T &Entry) {
37 // Check if the entry is already in the map.
38 unsigned &Val = Map[Entry];
40 // See if entry exists, if so return prior ID.
43 // Compute ID for entry
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| hash.c | 9 * Entry **newHashTable(); Create and return initialized hash table
10 * Entry *hash_add(Entry **, char *, Entry *)
11 * Entry *hash_get(Entry **, char *)
68 Entry **
75 Entry **table;
77 table = (Entry **) calloc(size, sizeof(Entry *));
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/EhciPei/ |
| EhcPeim.h | 71 #define EFI_LIST_FOR_EACH(Entry, ListHead) \
72 for(Entry = (ListHead)->ForwardLink; Entry != (ListHead); Entry = Entry->ForwardLink)
78 #define EFI_LIST_FOR_EACH_SAFE(Entry, NextEntry, ListHead) \
79 for(Entry = (ListHead)->ForwardLink, NextEntry = Entry->ForwardLink;\
80 Entry != (ListHead); Entry = NextEntry, NextEntry = Entry->ForwardLink)
[all...] |
| /external/perfetto/src/profiling/memory/ |
| interner.h | 35 struct Entry {
37 Entry(Interner<T>* in, uint64_t i, U... args)
40 bool operator<(const Entry& other) const { return data < other.data; }
41 bool operator==(const Entry& other) const { return data == other.data; }
44 size_t operator()(const Entry& e) const noexcept {
59 Interned(Entry* entry) : entry_(entry) {}
95 Interner::Entry* entry_;
100 Entry item(this, next_id, std::forward<U...>(args...))
110 Entry& entry = const_cast<Entry&>(*it); local
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Core/Dxe/DxeMain/ |
| DxeProtocolNotify.c | 25 // entry.
90 EFI_CORE_PROTOCOL_NOTIFY_ENTRY *Entry;
92 for (Entry = mArchProtocols; Entry->ProtocolGuid != NULL; Entry++) {
93 if (!Entry->Present) {
104 updates mArchProtocol[] array entry with protocol instance data and sets it's
120 EFI_CORE_PROTOCOL_NOTIFY_ENTRY *Entry;
128 // Get Entry from Context
130 Entry = (EFI_CORE_PROTOCOL_NOTIFY_ENTRY *)Context;
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 27 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
61 m_buckets = new Entry [initialCapacity];
87 final Entry [] buckets = m_buckets;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
93 if (key == entry.m_key) return true;
111 final Entry [] buckets = m_buckets
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| DerivedGoogleCollectionGenerators.java | 33 import java.util.Map.Entry;
46 private final OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> generator;
49 OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> oneSizeTestContainerGenerator) {
54 public SampleElements<Map.Entry<K, V>> samples() {
64 public Map.Entry<K, V>[] createArray(int length) {
69 public Iterable<Map.Entry<K, V>> order(List<Map.Entry<K, V>> insertionOrder) {
93 private final OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> generator;
96 OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> oneSizeTestContainerGenerator) {
101 public SampleElements<Map.Entry<V, K>> samples()
[all...] |
| /external/libchrome/mojo/core/ |
| handle_table.h | 66 struct Entry {
67 Entry();
68 explicit Entry(scoped_refptr<Dispatcher> dispatcher);
69 Entry(const Entry& other);
70 ~Entry();
76 using HandleMap = base::hash_map<MojoHandle, Entry>;
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/ |
| WebAssemblyPrepareForLiveIntervals.cpp | 82 MachineBasicBlock &Entry = *MF.begin();
92 // uses provide a definition. Insert IMPLICIT_DEFs in the entry block to
108 BuildMI(Entry, Entry.begin(), DebugLoc(),
113 // Move ARGUMENT_* instructions to the top of the entry block, so that their
115 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE; ) {
119 Entry.insert(Entry.begin(), &MI);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/dsymutil/ |
| NonRelocatableStringpool.cpp | 20 auto &Entry = I.first->second;
21 if (I.second || Entry.Index == -1U) {
22 Entry.Index = NumEntries++;
23 Entry.Offset = CurrentEndOffset;
24 Entry.Symbol = nullptr;
31 DwarfStringPoolEntry Entry{nullptr, 0, -1U};
32 auto InsertResult = Strings.insert({S, Entry});
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/OrderedCollectionTest/ |
| OrderedCollectionTest.c | 144 ORDERED_COLLECTION_ENTRY *Entry;
146 Entry = OrderedCollectionMin (Collection);
147 while (Entry != NULL) {
152 Next = OrderedCollectionNext (Entry);
153 OrderedCollectionDelete (Collection, Entry, &Ptr);
159 Entry = Next;
177 ORDERED_COLLECTION_ENTRY *Entry;
179 Entry = OrderedCollectionMax (Collection);
180 while (Entry != NULL) {
185 Prev = OrderedCollectionPrev (Entry);
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/dece/ |
| TrickPlayBox.java | 24 private List<Entry> entries = new ArrayList<Entry>();
30 public void setEntries(List<Entry> entries) {
34 public List<Entry> getEntries() {
38 public static class Entry {
40 public Entry() {
43 public Entry(int value) {
71 sb.append("Entry");
88 entries.add(new Entry(IsoTypeReader.readUInt8(content)));
95 for (Entry entry : entries) {
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| AbstractSortedMultiset.java | 66 public Entry<E> firstEntry() {
67 Iterator<Entry<E>> entryIterator = entryIterator();
72 public Entry<E> lastEntry() {
73 Iterator<Entry<E>> entryIterator = descendingEntryIterator();
78 public Entry<E> pollFirstEntry() {
79 Iterator<Entry<E>> entryIterator = entryIterator();
81 Entry<E> result = entryIterator.next();
90 public Entry<E> pollLastEntry() {
91 Iterator<Entry<E>> entryIterator = descendingEntryIterator();
93 Entry<E> result = entryIterator.next()
[all...] |
