| /external/llvm/lib/CodeGen/ |
| MachineModuleInfo.cpp | 97 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
99 // If we already had an entry for this block, just return it.
100 if (!Entry.Symbols.empty()) {
101 assert(BB->getParent() == Entry.Fn && "Parent changed");
102 return Entry.Symbols;
105 // Otherwise, this is a new entry, create a new symbol for it and add an
106 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
109 Entry.Index = BBCallbacks.size() - 1;
110 Entry.Fn = BB->getParent();
111 Entry.Symbols.push_back(Context.createTempSymbol())
[all...] |
| ShrinkWrap.cpp | 38 // entry and exits blocks.
118 /// Frequency of the Entry block.
124 /// Entry block.
125 const MachineBasicBlock *Entry;
172 Entry = &MF.front();
181 bool ArePointsInteresting() const { return Save != Entry && Save && Restore; }
281 DEBUG(dbgs() << "Found a block that is not reachable from Entry\n");
315 // 2. all path to Restore needs to go through Save from Entry.
405 const MachineBasicBlock *Entry = &*MF.begin();
406 ReversePostOrderTraversal<const MachineBasicBlock *> RPOT(Entry);
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugLine.cpp | 318 // The directory index represents an entry in the include_directories
634 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
635 const char *FileName = Entry.Name;
643 uint64_t IncludeDirIndex = Entry.DirIdx;
645 // Be defensive about the contents of Entry.
|
| /external/llvm/lib/ExecutionEngine/ |
| GDBRegistrationListener.cpp | 68 RegisteredObjectInfo(std::size_t Size, jit_code_entry *Entry,
70 : Size(Size), Entry(Entry), Obj(std::move(Obj)) {}
73 : Size(Other.Size), Entry(Other.Entry), Obj(std::move(Other.Obj)) {}
77 Entry = Other.Entry;
83 jit_code_entry *Entry;
108 /// Creates an entry in the JIT registry for the buffer @p Object,
134 // Insert this entry at the head of the list
[all...] |
| /external/llvm/lib/MC/ |
| MCContext.cpp | 196 // embedded in the UsedNames entry.
283 MCSectionMachO *&Entry = MachOUniquingMap[Name];
284 if (Entry)
285 return Entry;
292 return Entry = new (MachOAllocator.Allocate()) MCSectionMachO(
357 auto &Entry = *IterBool.first;
359 return Entry.second;
361 StringRef CachedName = Entry.first.SectionName;
376 Entry.second = Result;
|
| /external/llvm/lib/Support/ |
| Timer.cpp | 338 const std::pair<TimeRecord, std::string> &Entry = TimersToPrint[e-i-1];
339 Entry.first.print(Total, OS);
340 OS << Entry.second << '\n';
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIWholeQuadMode.cpp | 43 /// the LiveMask (this is implemented for the entry block).
47 /// be done at the entry and exit points rather than potentially in each
373 // This is a non-entry block that is WQM throughout, so no need to do
481 MachineBasicBlock &Entry = MF.front();
482 MachineBasicBlock::iterator EntryMI = Entry.getFirstNonPHI();
486 BuildMI(Entry, EntryMI, DebugLoc(), TII->get(AMDGPU::COPY), LiveMaskReg)
492 BuildMI(Entry, EntryMI, DebugLoc(), TII->get(AMDGPU::S_WQM_B64),
|
| /external/llvm/lib/Target/Mips/ |
| MipsOptimizePICCall.cpp | 86 /// instruction and load the function address from object Entry.
87 unsigned getCount(ValueType Entry);
90 /// that loads from object Entry.
91 unsigned getReg(ValueType Entry);
94 void incCntAndSetReg(ValueType Entry, unsigned Reg);
215 ValueType Entry;
218 if (!isCallViaRegister(*I, Reg, Entry))
222 unsigned N = getCount(Entry);
229 getCallTargetRegOpnd(*I)->setReg(getReg(Entry));
237 if (Entry)
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 22 /// WebAssembly, provided that all loops are single-entry.
117 struct Entry {
125 explicit Entry(const MachineLoop *L)
163 SmallVector<Entry, 4> Loops;
170 Loops.push_back(Entry(L));
174 for (Entry &E : Loops)
249 // function entry block and includes the entire function as a "loop" that
277 "The function entry block shouldn't actually be a loop header");
|
| /external/llvm/tools/lli/ |
| lli.cpp | 144 EntryFunc("entry-function",
145 cl::desc("Specify the entry function (default = 'main') "
575 // Reset errno to zero on entry to main.
680 orc::TargetAddress Entry = EE->getFunctionAddress(EntryFn->getName().str());
683 << format("%llx", Entry) << "\n");
684 Result = ExitOnErr(R.callIntVoid(Entry));
|
| /external/llvm/unittests/CodeGen/ |
| DIEHashTest.cpp | 33 DwarfStringPoolEntry Entry = {nullptr, 1, 1};
35 DwarfStringPoolEntryRef(*Pool.insert(std::make_pair(S, Entry)).first));
|
| /external/llvm/unittests/ExecutionEngine/MCJIT/ |
| MCJITCAPITest.cpp | 174 LLVMBasicBlockRef entry = LLVMAppendBasicBlock(Function, "entry"); local
176 LLVMPositionBuilderAtEnd(builder, entry);
199 LLVMBasicBlockRef entry = LLVMAppendBasicBlock(Function, "entry"); local
201 LLVMPositionBuilderAtEnd(builder, entry);
229 LLVMBasicBlockRef Entry = LLVMAppendBasicBlock(Function, "entry");
231 LLVMPositionBuilderAtEnd(Builder, Entry);
248 LLVMBasicBlockRef Entry = LLVMAppendBasicBlock(Function2, "entry")
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenInstruction.cpp | 480 // The operand info should only have a single (register) entry. We
604 Record *&Entry = NameClass[Result->getArgName(i)];
605 if (Entry && Entry != ADI->getDef())
607 " is both " + Entry->getName() + " and " +
609 Entry = ADI->getDef();
616 // Tied registers don't have an entry in the result dag unless they're part
|
| DAGISelMatcherEmitter.cpp | 71 unsigned &Entry = NodePredicateMap[TP];
72 if (Entry == 0) {
76 // We've never seen a predicate with the same code: allocate an entry.
78 Entry = NodePredicates.size();
81 Entry = NodePredicateMap[SameCodePreds.front()];
82 assert(Entry != 0);
88 return Entry-1;
92 unsigned &Entry = PatternPredicateMap[PredName];
93 if (Entry == 0) {
95 Entry = PatternPredicates.size()
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/fragment/ |
| TrackFragmentRandomAccessBox.java | 61 private List<Entry> entries = Collections.emptyList();
94 entries = new ArrayList<Entry>();
97 Entry entry = new Entry(); local
99 entry.time = IsoTypeReader.readUInt64(content);
100 entry.moofOffset = IsoTypeReader.readUInt64(content);
102 entry.time = IsoTypeReader.readUInt32(content);
103 entry.moofOffset = IsoTypeReader.readUInt32(content);
105 entry.trafNumber = IsoTypeReaderVariable.read(content, lengthSizeOfTrafNum)
[all...] |
| TrackRunBox.java | 51 private List<Entry> entries = new ArrayList<Entry>();
54 public List<Entry> getEntries() {
58 public static class Entry {
64 public Entry() {
67 public Entry(long sampleDuration, long sampleSize, SampleFlags sampleFlags, int sampleCompositionTimeOffset) {
108 return "Entry{" +
199 for (Entry entry : entries) {
201 IsoTypeWriter.writeUInt32(byteBuffer, entry.sampleDuration)
230 Entry entry = new Entry(); local
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/ |
| RateShareEntry.java | 52 private List<Entry> entries = new LinkedList<Entry>();
66 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(byteBuffer)), byteBuffer.getShort()));
81 for (Entry entry : entries) {
82 buf.putInt(entry.getAvailableBitrate());
83 buf.putShort(entry.getTargetRateShare());
93 public static class Entry {
94 public Entry(int availableBitrate, short targetRateShare) {
135 Entry entry = (Entry) o local
[all...] |
| SampleToGroupBox.java | 31 * sample group. The table is compactly coded with each entry giving the index of the first sample of a run of
49 List<Entry> entries = new LinkedList<Entry>();
69 for (Entry entry : entries) {
70 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSampleCount());
71 IsoTypeWriter.writeUInt32(byteBuffer, entry.getGroupDescriptionIndex());
85 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(content)), l2i(IsoTypeReader.readUInt32(content))));
89 public static class Entry {
93 public Entry(long sampleCount, int groupDescriptionIndex)
131 Entry entry = (Entry) o; local
[all...] |
| /external/skia/src/codec/ |
| SkIcoCodec.cpp | 53 // directory entry.
54 struct Entry {
58 SkAutoFree dirEntryBuffer(sk_malloc_canfail(sizeof(Entry) * numImages));
65 auto* directoryEntries = reinterpret_cast<Entry*>(dirEntryBuffer.get());
76 // The directory entry contains information such as width, height,
103 bool operator() (Entry a, Entry b) const {
|
| /external/skia/src/core/ |
| SkDescriptor.h | 20 return sizeof(SkDescriptor) + entryCount * sizeof(Entry);
43 Entry* entry = (Entry*)((char*)this + fLength); local
44 entry->fTag = tag;
45 entry->fLen = SkToU32(length);
47 memcpy(entry + 1, data, length);
51 fLength = SkToU32(fLength + sizeof(Entry) + length);
52 return (entry + 1); // return its data
66 const Entry* entry = (const Entry*)(this + 1) local
[all...] |
| /external/skia/src/gpu/ |
| GrColorSpaceXform.cpp | 43 struct Entry {
44 // The default Entry is "valid". Any 64-bit key that is the same 32-bit value repeated
48 Entry() : fKey(0), fXform(nullptr), fLastUse(0) {}
55 Entry fEntries[kEntryCount];
|
| /external/skqp/src/codec/ |
| SkIcoCodec.cpp | 53 // directory entry.
54 struct Entry {
58 SkAutoFree dirEntryBuffer(sk_malloc_canfail(sizeof(Entry) * numImages));
65 auto* directoryEntries = reinterpret_cast<Entry*>(dirEntryBuffer.get());
76 // The directory entry contains information such as width, height,
103 bool operator() (Entry a, Entry b) const {
|
| /external/skqp/src/core/ |
| SkDescriptor.h | 20 return sizeof(SkDescriptor) + entryCount * sizeof(Entry);
43 Entry* entry = (Entry*)((char*)this + fLength); local
44 entry->fTag = tag;
45 entry->fLen = SkToU32(length);
47 memcpy(entry + 1, data, length);
51 fLength = SkToU32(fLength + sizeof(Entry) + length);
52 return (entry + 1); // return its data
66 const Entry* entry = (const Entry*)(this + 1) local
[all...] |
| /external/skqp/src/gpu/ |
| GrColorSpaceXform.cpp | 43 struct Entry {
44 // The default Entry is "valid". Any 64-bit key that is the same 32-bit value repeated
48 Entry() : fKey(0), fXform(nullptr), fLastUse(0) {}
55 Entry fEntries[kEntryCount];
|
| /external/spirv-llvm/lib/SPIRV/ |
| OCLUtil.cpp | 165 SPIRVEntry *Entry = nullptr;
167 Entry = SPIRVEntry::create(OC);
169 Entry = static_cast<SPIRVEntry*>(
171 return std::unique_ptr<SPIRVEntry>(Entry);
|
