Home
last modified time | relevance | path

Searched refs:Entry (Results 1 - 25 of 659) sorted by relevance

12345678910>>...27

/third_party/rust/crates/syn/src/
H A Dbuffer.rs16 enum Entry { enum
33 entries: Box<[Entry]>,
37 fn recursive_new(entries: &mut Vec<Entry>, stream: TokenStream) { in recursive_new()
40 TokenTree::Ident(ident) => entries.push(Entry::Ident(ident)), in recursive_new()
41 TokenTree::Punct(punct) => entries.push(Entry::Punct(punct)), in recursive_new()
42 TokenTree::Literal(literal) => entries.push(Entry::Literal(literal)), in recursive_new()
45 entries.push(Entry::End(0)); // we replace this below in recursive_new()
48 entries.push(Entry::End(-(group_end_index as isize))); in recursive_new()
50 entries[group_start_index] = Entry::Group(group, group_end_offset); in recursive_new()
69 entries.push(Entry in new2()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfStringPool.cpp29 auto &Entry = I.first->second; in getEntryImpl() local
31 Entry.Index = EntryTy::NotIndexed; in getEntryImpl()
32 Entry.Offset = NumBytes; in getEntryImpl()
33 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr; in getEntryImpl()
36 assert(NumBytes > Entry.Offset && "Unexpected overflow"); in getEntryImpl()
97 for (const auto &Entry : Entries) { in emit()
98 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) && in emit()
103 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol); in emit()
107 Twine(Entry->getValue().Offset)); in emit()
109 StringRef(Entry in emit()
[all...]
H A DDbgEntityHistoryCalculator.cpp68 Entries.emplace_back(&MI, Entry::DbgValue); in startDbgValue()
80 Entries.emplace_back(&MI, Entry::Clobber); in startClobber()
84 void DbgValueHistoryMap::Entry::endEntry(EntryIndex Index) { in endEntry()
145 auto &Entry = HistMap.getEntry(Var, Index); in clobberRegEntries() local
146 assert(Entry.isDbgValue() && "Not a DBG_VALUE in LiveEntries"); in clobberRegEntries()
147 if (isDescribedByReg(*Entry.getInstr()) == RegNo) { in clobberRegEntries()
149 Entry.endEntry(ClobberIndex); in clobberRegEntries()
172 auto &Entry = HistMap.getEntry(Var, Index); in handleNewDebugValue() local
173 assert(Entry.isDbgValue() && "Not a DBG_VALUE in LiveEntries"); in handleNewDebugValue()
174 const MachineInstr &DV = *Entry in handleNewDebugValue()
360 const auto &Entry = E.value(); dump() local
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DSmallSortedMap.java49 * access to the corresponding {@code Entry}s without the need to create an Iterator. The remaining
57 * for (Map.Entry<K, V> entry : fieldMap.getOverflowEntries()) {
101 final Map.Entry<FieldDescriptorType, Object> entry = getArrayEntryAt(i); in newFieldMap()
107 for (Map.Entry<FieldDescriptorType, Object> entry : getOverflowEntries()) { in newFieldMap()
133 private List<Entry> entryList;
183 public Map.Entry<K, V> getArrayEntryAt(int index) { in getArrayEntryAt()
193 public Iterable<Map.Entry<K, V>> getOverflowEntries() { in getOverflowEntries()
195 ? EmptySet.<Map.Entry<K, V>>iterable() in getOverflowEntries()
199 Iterable<Map.Entry<K, V>> getOverflowEntriesDescending() { in getOverflowEntriesDescending()
201 ? EmptySet.<Map.Entry< in getOverflowEntriesDescending()
399 private class Entry implements Map.Entry<K, V>, Comparable<Entry> { global() class in SmallSortedMap
404 Entry(Map.Entry<K, V> copy) { Entry() method in SmallSortedMap.Entry
408 Entry(K key, V value) { Entry() method in SmallSortedMap.Entry
[all...]
H A DLazyField.java34 import java.util.Map.Entry;
91 static class LazyEntry<K> implements Entry<K, Object> {
92 private Entry<K, LazyField> entry;
94 private LazyEntry(Entry<K, LazyField> entry) { in LazyEntry()
127 static class LazyIterator<K> implements Iterator<Entry<K, Object>> {
128 private Iterator<Entry<K, Object>> iterator;
130 public LazyIterator(Iterator<Entry<K, Object>> iterator) { in LazyIterator()
141 public Entry<K, Object> next() { in next()
142 Entry<K, ?> entry = iterator.next(); in next()
144 return new LazyEntry<K>((Entry< in next()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp74 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
75 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
79 if (MBB != Entry) { in ReachabilityGraph()
113 MachineBasicBlock *Entry; member in __anon24866::ReachabilityGraph
133 if (Succ != Entry && inRegion(Succ)) { in calculate()
143 assert(inRegion(MBB) && Succ != Entry && inRegion(Succ)); in calculate()
144 if (MBB != Entry) { in calculate()
161 assert(!Loopers.count(Entry)); in calculate()
182 LoopBlocks(MachineBasicBlock *Entry, cons argument
190 MachineBasicBlock *Entry; global() member in __anon24866::LoopBlocks
241 processRegion( MachineBasicBlock *Entry, BlockSet &Blocks, MachineFunction &MF) processRegion() argument
[all...]
/third_party/skia/src/core/
H A DSkLRUCache.h21 struct Entry { struct in SkLRUCache
22 Entry(const K& key, V&& value) in Entry() function
29 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Entry);
37 Entry* node = fLRU.head(); in ~SkLRUCache()
46 Entry** value = fMap.find(key); in find()
50 Entry* entry = *value; in find()
61 Entry* entry = new Entry(key, std::move(value)); in insert()
85 typename SkTInternalLList<Entry>::Iter iter; in foreach()
86 for (Entry* in foreach()
[all...]
/third_party/skia/third_party/externals/swiftshader/src/System/
H A DLRUCache.hpp31 struct Entry;
42 inline view(Entry *);
48 Entry *entry;
54 inline iterator(Entry *);
61 Entry *entry;
105 struct Entry : Keyed struct in sw::LRUCache
108 Entry *next = nullptr;
109 Entry *prev = nullptr;
122 // find() returns the Entry* for the given key, or nullptr.
127 // unordered_map<Key, Entry*> an
[all...]
/third_party/node/deps/v8/src/heap/cppgc/
H A Dfree-list.cc25 class FreeList::Entry : public HeapObjectHeader { class in cppgc::internal::FreeList
27 static Entry& CreateAt(void* memory, size_t size) { in CreateAt()
29 // needed as we write the whole payload of Entry. in CreateAt()
30 ASAN_UNPOISON_MEMORY_REGION(memory, sizeof(Entry)); in CreateAt()
31 return *new (memory) Entry(size); in CreateAt()
34 Entry* Next() const { return next_; } in Next()
35 void SetNext(Entry* next) { next_ = next; } in SetNext()
37 void Link(Entry** previous_next) { in Link()
41 void Unlink(Entry** previous_next) { in Unlink()
47 explicit Entry(size_ function in cppgc::internal::FreeList::Entry
[all...]
/third_party/node/deps/v8/src/base/
H A Dhashmap.h37 using Entry = TemplateHashMapEntry<Key, Value>;
66 Entry* Lookup(const Key& key, uint32_t hash) const;
71 Entry* LookupOrInsert(const Key& key, uint32_t hash);
77 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func);
90 Entry* LookupOrInsert(const LookupKey& lookup_key, uint32_t hash,
93 Entry* InsertNew(const Key& key, uint32_t hash);
120 // for (Entry* p = map.Start(); p != nullptr; p = map.Next(p)) {
126 Entry* Start() const;
127 Entry* Next(Entry* entr
365 DCHECK(i < capacity()); DCHECK(occupancy() < capacity()); Entry* map = impl_.map_; while (map[i].exists() && !impl_.match()(hash, map[i].hash, key, map[i].key)) { i = (i + 1) & (capacity() - 1); } return &map[i]; } template <typename Key, typename Value, typename MatchFun, class AllocationPolicy> typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry* TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::FillEmptyEntry( Entry* entry, const Key& key, const Value& value, uint32_t hash) { DCHECK(!entry->exists()); new (entry) Entry(key, value, hash); impl_.occupancy_++; if (occupancy() + occupancy() / 4 >= capacity()) Probe() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
H A DMicroMipsSizeReduction.cpp124 const ReduceEntry &Entry; // Entry field member
130 : MI(argMI), Entry(argEntry), NextMII(argNextMII) {} in ReduceEntryFunArgs()
196 static bool ReplaceInstruction(MachineInstr *MI, const ReduceEntry &Entry,
337 static bool ImmInRange(MachineInstr *MI, const ReduceEntry &Entry) { in ImmInRange() argument
341 if (!GetImm(MI, Entry.ImmField(), offset)) in ImmInRange()
344 if (!InRange(offset, Entry.Shift(), Entry.LBound(), Entry.HBound())) in ImmInRange()
352 const ReduceEntry &Entry) { in CheckXWPInstr()
351 CheckXWPInstr(MachineInstr *MI, bool ReduceToLwp, const ReduceEntry &Entry) CheckXWPInstr() argument
443 const ReduceEntry &Entry = Arguments->Entry; ReduceXWtoXWSP() local
456 const ReduceEntry &Entry = Arguments->Entry; ReduceXWtoXWP() local
498 const ReduceEntry &Entry = Arguments->Entry; ReduceArithmeticInstructions() local
512 const ReduceEntry &Entry = Arguments->Entry; ReduceADDIUToADDIUR1SP() local
526 const ReduceEntry &Entry = Arguments->Entry; ReduceADDIUToADDIUSP() local
544 const ReduceEntry &Entry = Arguments->Entry; ReduceLXUtoLXU16() local
559 const ReduceEntry &Entry = Arguments->Entry; ReduceSXtoSX16() local
613 const ReduceEntry &Entry = Arguments->Entry; ReduceMoveToMovep() local
657 const ReduceEntry &Entry = Arguments->Entry; ReduceXORtoXOR16() local
693 ReplaceInstruction(MachineInstr *MI, const ReduceEntry &Entry, MachineInstr *MI2, bool ConsecutiveForward) ReplaceInstruction() argument
[all...]
/third_party/node/deps/v8/src/interpreter/
H A Dconstant-array-builder.h114 class Entry { class in v8::internal::interpreter::final
119 explicit Entry(Smi smi) : smi_(smi), tag_(Tag::kSmi) {}
120 explicit Entry(double heap_number) in Entry() function in v8::internal::interpreter::final::Entry
122 explicit Entry(const AstRawString* raw_string) in Entry() function in v8::internal::interpreter::final::Entry
124 explicit Entry(AstBigInt bigint) : bigint_(bigint), tag_(Tag::kBigInt) {} in Entry() function in v8::internal::interpreter::final::Entry
125 explicit Entry(const Scope* scope) : scope_(scope), tag_(Tag::kScope) {} in Entry() function in v8::internal::interpreter::final::Entry
128 static Entry NAME() { return Entry(Tag::k##NAME); }
132 static Entry Deferred() { return Entry(Ta
161 explicit Entry(Tag tag) : tag_(tag) {} Entry() function in v8::internal::interpreter::final::Entry
[all...]
H A Dconstant-array-builder.cc43 ConstantArrayBuilder::Entry entry, size_t count) { in Allocate()
53 ConstantArrayBuilder::Entry& ConstantArrayBuilder::ConstantArraySlice::At( in At()
60 const ConstantArrayBuilder::Entry& ConstantArrayBuilder::ConstantArraySlice::At( in At()
77 for (const Entry& entry : constants_) { in CheckAllElementsAreUnique()
80 case Entry::Tag::kSmi: in CheckAllElementsAreUnique()
83 case Entry::Tag::kHeapNumber: in CheckAllElementsAreUnique()
86 case Entry::Tag::kRawString: in CheckAllElementsAreUnique()
89 case Entry::Tag::kBigInt: in CheckAllElementsAreUnique()
92 case Entry::Tag::kScope: in CheckAllElementsAreUnique()
95 case Entry in CheckAllElementsAreUnique()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceRegistersX8664.h298 const auto &Entry = X8664RegTable[ii]; in initRegisterSet() local
302 (*RegisterAliases)[Entry.Val].resize(Reg_NUM); in initRegisterSet()
303 for (Ice::SizeT J = 0; J < Entry.NumAliases; ++J) { in initRegisterSet()
304 SizeT Alias = Entry.Aliases[J]; in initRegisterSet()
305 assert(!(*RegisterAliases)[Entry.Val][Alias] && "Duplicate alias"); in initRegisterSet()
306 (*RegisterAliases)[Entry.Val].set(Alias); in initRegisterSet()
309 (*RegisterAliases)[Entry.Val].set(Entry.Val); in initRegisterSet()
311 (IntegerRegistersI64)[Entry.Val] = Entry in initRegisterSet()
[all...]
H A DIceRegistersX8632.h300 const auto &Entry = X8632RegTable[ii]; in initRegisterSet() local
301 (IntegerRegistersI32)[Entry.Val] = Entry.Is32; in initRegisterSet()
302 (IntegerRegistersI16)[Entry.Val] = Entry.Is16; in initRegisterSet()
303 (IntegerRegistersI8)[Entry.Val] = Entry.Is8; in initRegisterSet()
304 (FloatRegisters)[Entry.Val] = Entry.IsXmm; in initRegisterSet()
305 (VectorRegisters)[Entry in initRegisterSet()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/PDB/Native/
H A DNativeEnumInjectedSources.cpp36 const SrcHeaderBlockEntry &Entry; member in llvm::pdb::__anon24161::final
41 NativeInjectedSource(const SrcHeaderBlockEntry &Entry, in NativeInjectedSource() argument
43 : Entry(Entry), Strings(Strings), File(File) {} in NativeInjectedSource()
45 uint32_t getCrc32() const override { return Entry.CRC; }
46 uint64_t getCodeByteSize() const override { return Entry.FileSize; }
49 StringRef Ret = cantFail(Strings.getStringForID(Entry.FileNI),
55 StringRef Ret = cantFail(Strings.getStringForID(Entry.ObjNI),
61 StringRef Ret = cantFail(Strings.getStringForID(Entry.VFileNI),
66 uint32_t getCompression() const override { return Entry
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Object/
H A DWindowsResource.cpp182 const ResourceEntryRef &Entry, StringRef File1, StringRef File2) { in makeDuplicateResourceError()
189 if (Entry.checkTypeString()) { in makeDuplicateResourceError()
191 if (!convertUTF16LEToUTF8String(Entry.getTypeString(), UTF8)) in makeDuplicateResourceError()
195 printResourceTypeName(Entry.getTypeID(), OS); in makeDuplicateResourceError()
198 if (Entry.checkNameString()) { in makeDuplicateResourceError()
200 if (!convertUTF16LEToUTF8String(Entry.getNameString(), UTF8)) in makeDuplicateResourceError()
204 OS << "ID " << Entry.getNameID(); in makeDuplicateResourceError()
207 OS << "/language " << Entry.getLanguage() << ", in " << File1 << " and in " in makeDuplicateResourceError()
313 const ResourceEntryRef &Entry) const { in shouldIgnoreDuplicate()
314 return MinGW && !Entry in shouldIgnoreDuplicate()
181 makeDuplicateResourceError( const ResourceEntryRef &Entry, StringRef File1, StringRef File2) makeDuplicateResourceError() argument
347 ResourceEntryRef Entry = EntryOrErr.get(); parse() local
381 addEntry( const ResourceEntryRef &Entry, uint32_t Origin, std::vector<std::vector<uint8_t>> &Data, std::vector<std::vector<UTF16>> &StringTable, TreeNode *&Result) addEntry() argument
483 addTypeNode( const ResourceEntryRef &Entry, std::vector<std::vector<UTF16>> &StringTable) addTypeNode() argument
492 addNameNode( const ResourceEntryRef &Entry, std::vector<std::vector<UTF16>> &StringTable) addNameNode() argument
501 addLanguageNode( const ResourceEntryRef &Entry, uint32_t Origin, std::vector<std::vector<uint8_t>> &Data, TreeNode *&Result) addLanguageNode() argument
899 auto *Entry = reinterpret_cast<coff_resource_dir_entry *>(BufferStart + writeDirectoryTree() local
919 auto *Entry = reinterpret_cast<coff_resource_dir_entry *>(BufferStart + writeDirectoryTree() local
942 auto *Entry = reinterpret_cast<coff_resource_data_entry *>(BufferStart + writeDirectoryTree() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARM/
H A DThumb2SizeReduction.cpp185 bool VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry,
190 const ReduceEntry &Entry);
193 const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop);
198 const ReduceEntry &Entry, bool LiveCPSR,
204 const ReduceEntry &Entry, bool LiveCPSR,
332 Thumb2SizeReduce::VerifyPredAndCC(MachineInstr *MI, const ReduceEntry &Entry, in VerifyPredAndCC() argument
335 if ((is2Addr && Entry.PredCC2 == 0) || in VerifyPredAndCC()
336 (!is2Addr && Entry.PredCC1 == 0)) { in VerifyPredAndCC()
355 } else if ((is2Addr && Entry.PredCC2 == 2) || in VerifyPredAndCC()
356 (!is2Addr && Entry in VerifyPredAndCC()
404 ReduceLoadStore(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry) ReduceLoadStore() argument
622 ReduceSpecial(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) ReduceSpecial() argument
735 ReduceTo2Addr(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) ReduceTo2Addr() argument
850 ReduceToNarrow(MachineBasicBlock &MBB, MachineInstr *MI, const ReduceEntry &Entry, bool LiveCPSR, bool IsSelfLoop) ReduceToNarrow() argument
1010 const ReduceEntry &Entry = ReduceTable[OPI->second]; ReduceMI() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/
H A DX86TargetTransformInfo.cpp193 if (const auto *Entry = CostTableLookup(GLMCostTable, ISD, in getArithmeticInstrCost()
195 return LT.first * Entry->Cost; in getArithmeticInstrCost()
242 if (const auto *Entry = CostTableLookup(SLMCostTable, ISD, in getArithmeticInstrCost()
244 return LT.first * Entry->Cost; in getArithmeticInstrCost()
298 if (const auto *Entry = CostTableLookup(AVX512BWUniformConstCostTable, ISD, in getArithmeticInstrCost()
300 return LT.first * Entry->Cost; in getArithmeticInstrCost()
311 if (const auto *Entry = CostTableLookup(AVX512UniformConstCostTable, ISD, in getArithmeticInstrCost()
313 return LT.first * Entry->Cost; in getArithmeticInstrCost()
326 if (const auto *Entry = CostTableLookup(AVX2UniformConstCostTable, ISD, in getArithmeticInstrCost()
328 return LT.first * Entry in getArithmeticInstrCost()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/XCore/
H A DXCoreSelectionDAGInfo.cpp28 TargetLowering::ArgListEntry Entry; in EmitTargetCodeForMemcpy() local
29 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext()); in EmitTargetCodeForMemcpy()
30 Entry.Node = Dst; Args.push_back(Entry); in EmitTargetCodeForMemcpy()
31 Entry.Node = Src; Args.push_back(Entry); in EmitTargetCodeForMemcpy()
32 Entry.Node = Size; Args.push_back(Entry); in EmitTargetCodeForMemcpy()
/third_party/node/deps/v8/src/ast/
H A Dmodules.cc59 Entry* entry = zone->New<Entry>(loc); in AddImport()
71 Entry* entry = zone->New<Entry>(loc); in AddStarImport()
88 Entry* entry = zone->New<Entry>(loc); in AddExport()
101 Entry* entry = zone->New<Entry>(loc); in AddExport()
113 Entry* entry = zone->New<Entry>(lo in AddStarExport()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.h38 class Entry { class in llvm::DWARFAcceleratorTable
42 Entry() = default;
45 Entry(const Entry &) = default;
46 Entry(Entry &&) = default;
47 Entry &operator=(const Entry &) = default;
48 Entry &operator=(Entry
[all...]
/third_party/skia/src/gpu/
H A DGrThreadSafeCache.h190 struct Entry { struct in GrThreadSafeCache
191 Entry(const GrUniqueKey& key, const GrSurfaceProxyView& view) in Entry() function
194 , fTag(Entry::kView) { in Entry()
197 Entry(const GrUniqueKey& key, sk_sp<VertexData> vertData) in Entry() function
200 , fTag(Entry::kVertData) { in Entry()
203 ~Entry() { in ~Entry()
270 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Entry);
273 static const GrUniqueKey& GetKey(const Entry& e) { in GetKey()
294 void makeExistingEntryMRU(Entry*) SK_REQUIRES(fSpinLock);
295 Entry* makeNewEntryMR
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dcircular-queue.h51 struct alignas(PROCESSOR_CACHE_LINE_SIZE) Entry {
52 Entry() : marker(kEmpty) {} in Entry() function
57 Entry* Next(Entry* entry);
59 Entry buffer_[Length];
60 alignas(PROCESSOR_CACHE_LINE_SIZE) Entry* enqueue_pos_;
61 alignas(PROCESSOR_CACHE_LINE_SIZE) Entry* dequeue_pos_;
/third_party/skia/src/gpu/gradients/
H A DGrGradientBitmapCache.cpp18 struct GrGradientBitmapCache::Entry { struct in GrGradientBitmapCache
19 Entry* fPrev;
20 Entry* fNext;
26 Entry(const void* buffer, size_t size, const SkBitmap& bm) in Entry() function
35 ~Entry() { sk_free(fBuffer); } in ~Entry()
54 Entry* entry = fHead; in ~GrGradientBitmapCache()
56 Entry* next = entry->fNext; in ~GrGradientBitmapCache()
62 GrGradientBitmapCache::Entry* GrGradientBitmapCache::release(Entry* entry) const { in release()
80 void GrGradientBitmapCache::attachToHead(Entry* entr
[all...]

Completed in 16 milliseconds

12345678910>>...27