| /external/emma/core/java12/com/vladium/util/ |
| ObjectIntMap.java | 29 // TODO: optimize key comparisons using key.hash == entry.key.hash condition
63 m_buckets = new Entry [initialCapacity];
91 final Entry [] buckets = m_buckets;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
98 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)
[all...] |
| /external/google-breakpad/src/common/ |
| stabs_reader.h | 85 // field in each entry in bytes.
118 // The contents of a STABS entry, adjusted for the host's endianness,
120 struct Entry {
121 // True if this iterator has reached the end of the entry array. When
125 // The number of this entry within the list.
128 // The current entry's name offset. This is the offset within the
132 // The current entry's type, 'other' field, descriptor, and value.
141 // otherwise. Assume each entry has a 'value' field whose size is
148 // For the record: on Linux, STABS entry values are always 32 bits,
150 // Mac, they are 32 or 64 bits long. Oddly, the section header's entry
[all...] |
| /external/libmojo/mojo/public/cpp/bindings/ |
| binding_set.h | 50 // the |context_| field of a BindingSetBase::Entry with void context. The
159 friend class Entry;
161 class Entry {
163 Entry(ImplPointerType impl,
175 base::Bind(&Entry::OnConnectionError, base::Unretained(this)));
183 explicit DispatchFilter(Entry* entry) : entry_(entry) {}
193 Entry* entry_;
215 DISALLOW_COPY_AND_ASSIGN(Entry);
230 auto entry = base::MakeUnique<Entry>(std::move(impl), std::move(request), local
243 std::unique_ptr<Entry> entry = std::move(it->second); local
[all...] |
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFUnitIndex.h | 44 class Entry {
72 std::unique_ptr<Entry[]> Rows;
82 const Entry *getFromOffset(uint32_t Offset) const;
86 ArrayRef<Entry> getRows() const {
|
| /external/llvm/include/llvm/Support/ |
| Registry.h | 24 /// A simple registry entry which provides only a name, description, and
47 typedef SimpleRegistryEntry<T> entry; typedef in class:llvm::Registry
66 const entry& Val;
69 node(const entry &V) : Next(nullptr), Val(V) {}
91 const entry &operator*() const { return Cur->Val; }
92 const entry *operator->() const { return &Cur->Val; }
112 entry Entry;
119 : Entry(Name, Desc, CtorFn), Node(Entry) {
[all...] |
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.h | 79 /// BorderConstraint - A basic block has separate constraints for entry and
83 PrefReg, ///< Block entry/exit prefers a register.
84 PrefSpill, ///< Block entry/exit prefers a stack slot.
85 PrefBoth, ///< Block entry prefers both register and stack.
89 /// BlockConstraint - Entry and exit constraints for a basic block.
92 BorderConstraint Entry : 8; ///< Constraint on block entry.
118 /// Entry = Exit = PrefSpill, and ChangesValue = false.
163 void setThreshold(const BlockFrequency &Entry);
|
| /external/llvm/lib/Target/ARM/ |
| ARMSelectionDAGInfo.cpp | 76 TargetLowering::ArgListEntry Entry;
77 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
78 Entry.Node = Dst;
79 Args.push_back(Entry);
81 Entry.Node = Size;
82 Args.push_back(Entry);
87 Entry.Node = Size;
88 Args.push_back(Entry);
96 Entry.Node = Src;
97 Entry.Ty = Type::getInt32Ty(*DAG.getContext())
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonGenExtract.cpp | 253 BasicBlock *Entry = GraphTraits<Function*>::getEntryNode(&F);
254 Changed = visitBlock(Entry);
|
| /external/llvm/lib/Target/X86/ |
| X86SelectionDAGInfo.cpp | 71 // Check to see if there is a specialized entry-point for memory zeroing.
80 TargetLowering::ArgListEntry Entry;
81 Entry.Node = Dst;
82 Entry.Ty = IntPtrTy;
83 Args.push_back(Entry);
84 Entry.Node = Size;
85 Args.push_back(Entry);
|
| /external/llvm/tools/dsymutil/ |
| DebugMap.cpp | 41 typedef std::pair<StringRef, SymbolMapping> Entry;
42 std::vector<Entry> Entries;
48 [](const Entry &LHS, const Entry &RHS) { return LHS.first < RHS.first; });
207 for (auto &Entry : Obj.Symbols)
208 Entries.push_back(std::make_pair(Entry.getKey(), Entry.getValue()));
246 for (auto &Entry : Entries) {
247 auto &Mapping = Entry.second;
251 auto AddressIt = SymbolAddresses.find(Entry.first)
[all...] |
| /external/llvm/tools/llvm-link/ |
| llvm-link.cpp | 257 auto &Entry = ModuleToGlobalsToImportMap[SrcModule.getModuleIdentifier()];
258 Entry.insert(F);
|
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 243 // If we found an entry that matches out matcher, merge it into the set to
276 // Otherwise, we don't know how to handle this entry, we have to bail.
301 // Factor these checks by pulling the first node off each entry and
302 // discarding it. Take the first one off the first entry to reuse.
406 unsigned &Entry = TypeEntry[CTMTy];
407 if (Entry != 0) {
409 Matcher *PrevMatcher = Cases[Entry-1].second;
419 Cases[Entry-1].second = Case.release();
423 Entry = Cases.size()+1;
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/ |
| CompositionTimeToSample.java | 38 * CT(n) = DT(n) + CTTS(n) where CTTS(n) is the (uncompressed) table entry for sample n.
48 List<Entry> entries = Collections.emptyList();
58 public List<Entry> getEntries() {
62 public void setEntries(List<Entry> entries) {
70 entries = new ArrayList<Entry>(numberOfEntries);
72 Entry e = new Entry(l2i(IsoTypeReader.readUInt32(content)), content.getInt());
82 for (Entry entry : entries) {
83 IsoTypeWriter.writeUInt32(byteBuffer, entry.getCount())
[all...] |
| EditListBox.java | 37 * This box contains an explicit timeline map. Each entry defines part of the track time-line: by mapping part of
48 * <li>Entry-count = 2</li>
57 private List<Entry> entries = new LinkedList<Entry>();
65 public List<Entry> getEntries() {
69 public void setEntries(List<Entry> entries) {
88 entries = new LinkedList<Entry>();
90 entries.add(new Entry(this, content));
99 for (Entry entry : entries)
[all...] |
| SampleToChunkBox.java | 38 List<Entry> entries = Collections.emptyList();
46 public List<Entry> getEntries() {
50 public void setEntries(List<Entry> entries) {
63 entries = new ArrayList<Entry>(entryCount);
65 entries.add(new Entry(
76 for (Entry entry : entries) {
77 IsoTypeWriter.writeUInt32(byteBuffer, entry.getFirstChunk());
78 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSamplesPerChunk());
79 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSampleDescriptionIndex())
[all...] |
| TimeToSampleBox.java | 33 * Other tables give sample sizes and pointers, from the sample number. Each entry in the table gives the
37 * is the (uncompressed) table entry for sample n.<br>
47 List<Entry> entries = Collections.emptyList();
62 entries = new ArrayList<Entry>(entryCount);
65 entries.add(new Entry(IsoTypeReader.readUInt32(content), IsoTypeReader.readUInt32(content)));
74 for (Entry entry : entries) {
75 IsoTypeWriter.writeUInt32(byteBuffer, entry.getCount());
76 IsoTypeWriter.writeUInt32(byteBuffer, entry.getDelta());
80 public List<Entry> getEntries()
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
| EC3SpecificBox.java | 15 List<Entry> entries = new LinkedList<Entry>();
26 for (Entry entry : entries) {
27 if (entry.num_dep_sub > 0) {
46 Entry e = new Entry();
68 for (Entry e : entries) {
85 public List<Entry> getEntries() {
89 public void setEntries(List<Entry> entries)
[all...] |
| /external/python/cpython3/Lib/idlelib/idle_test/ |
| mock_tk.py | 300 class Entry:
301 "Mock for tkinter.Entry."
|
| /external/swiftshader/third_party/LLVM/lib/Bitcode/Writer/ |
| ValueEnumerator.cpp | 389 unsigned &Entry = AttributeMap[PAL.getRawPointer()];
390 if (Entry == 0) {
393 Entry = Attributes.size();
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LocalStackSlotAllocation.cpp | 276 MachineBasicBlock *Entry = Fn.begin();
330 // MachineBasicBlock::iterator InsertionPt = Entry->begin();
331 TRI->materializeFrameBaseRegister(Entry, BaseReg, FrameIdx,
|
| ProcessImplicitDefs.cpp | 98 MachineBasicBlock *Entry = fn.begin();
100 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
| StackProtector.cpp | 160 // Insert code into the entry block that stores the __stack_chk_guard
163 // entry:
180 BasicBlock &Entry = F->getEntryBlock();
181 Instruction *InsPt = &Entry.front();
|
| /external/swiftshader/third_party/LLVM/lib/MC/ |
| MCContext.cpp | 69 // key if we are creating the entry.
70 StringMapEntry<MCSymbol*> &Entry = Symbols.GetOrCreateValue(Name);
71 MCSymbol *Sym = Entry.getValue();
77 Entry.setValue(Sym);
99 // Ok, the entry doesn't already exist. Have the MCSymbol object itself refer
100 // to the copy of the string that is embedded in the UsedNames entry.
176 const MCSectionMachO *&Entry = Map[Name.str()];
177 if (Entry) return Entry;
180 return Entry = new (*this) MCSectionMachO(Segment, Section, TypeAndAttributes
[all...] |
| SubtargetFeature.cpp | 136 /// getLongestEntryLength - Return the length of the longest entry in the table.
285 // Find CPU entry if CPU name is specified.
352 // Find entry
353 const SubtargetInfoKV *Entry = Find(CPU, Table, TableSize);
355 if (Entry) {
356 return Entry->Value;
|
| /external/swiftshader/third_party/LLVM/lib/Target/X86/ |
| X86SelectionDAGInfo.cpp | 51 // Check to see if there is a specialized entry-point for memory zeroing.
59 TargetLowering::ArgListEntry Entry;
60 Entry.Node = Dst;
61 Entry.Ty = IntPtrTy;
62 Args.push_back(Entry);
63 Entry.Node = Size;
64 Args.push_back(Entry);
|
