| /frameworks/compile/slang/ |
| slang_rs_export_element.cpp | 59 ElementInfo *EI = new ElementInfo;
60 EI->type = DataElementInfoTable[i].dataType;
61 EI->normalized = DataElementInfoTable[i].normalized;
62 EI->vsize = DataElementInfoTable[i].vsize;
65 Name, ElementInfoMap.getAllocator(), EI));
73 const ElementInfo *EI) {
82 slangAssert(EI != nullptr && "Element info not found");
91 slangAssert(EI->vsize == 1 && "Element not a primitive class (please "
97 EI->normalized);
99 slangAssert(EI->type == EPT->getType() && "Element has unexpected type")
[all...] |
| /external/llvm/include/llvm/Support/ |
| GraphWriter.h | 70 child_iterator EI = GTraits::child_begin(Node);
74 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
75 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
88 if (EI != EE && hasEdgeSourceLabels)
230 child_iterator EI = GTraits::child_begin(Node);
232 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
233 if (!DTraits.isNodeHidden(*EI))
234 writeEdge(Node, i, EI);
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DebugLocStream.h | 115 size_t EI = getIndex(E);
117 .slice(Entries[EI].ByteOffset, getNumBytes(EI));
120 size_t EI = getIndex(E);
122 .slice(Entries[EI].CommentOffset, getNumComments(EI));
141 size_t getNumBytes(size_t EI) const {
142 if (EI + 1 == Entries.size())
143 return DWARFBytes.size() - Entries[EI].ByteOffset;
144 return Entries[EI + 1].ByteOffset - Entries[EI].ByteOffset
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| GraphWriter.h | 66 child_iterator EI = GTraits::child_begin(Node);
70 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
71 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
84 if (EI != EE && hasEdgeSourceLabels)
216 child_iterator EI = GTraits::child_begin(Node);
218 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
219 if (!DTraits.isNodeHidden(*EI))
220 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GraphWriter.h | 75 child_iterator EI = GTraits::child_begin(Node);
79 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i) {
80 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
93 if (EI != EE && hasEdgeSourceLabels)
219 child_iterator EI = GTraits::child_begin(Node);
221 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
222 if (!DTraits.isNodeHidden(*EI))
223 writeEdge(Node, i, EI);
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/ |
| Graph.h | 465 const auto &EI = Val.first;
466 Vertices.FindAndConstruct(EI.first);
467 Vertices.FindAndConstruct(EI.second);
468 InNeighbors[EI.second].insert(EI.first);
469 OutNeighbors[EI.first].insert(EI.second);
480 auto EI = Val.first;
483 Vertices.FindAndConstruct(EI.first);
484 Vertices.FindAndConstruct(EI.second)
[all...] |
| /external/llvm/lib/CodeGen/ |
| Analysis.cpp | 48 EI = EB,
50 EI != EE; ++EI) {
51 if (Indices && *Indices == unsigned(EI - EB))
52 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex);
53 CurIndex = ComputeLinearIndex(*EI, nullptr, nullptr, CurIndex);
93 EI = EB,
95 EI != EE; ++EI)
96 ComputeValueVTs(TLI, DL, *EI, ValueVTs, Offsets
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| LowerInvoke.cpp | 313 Instruction *EI = ExtractValueInst::Create(AI, 0, "",AfterAllocaInsertPt);
314 Instruction *NI = InsertValueInst::Create(AI, EI, 0);
315 NI->insertAfter(EI);
318 EI->setOperand(0, AI);
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 536 BasicBlock::iterator EI;
540 EI = SecondBBI;
545 EI = B->end();
547 for (; BI != EI; ++BI) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RegAllocFast.cpp | 286 MachineBasicBlock::iterator EI = MI;
287 DL = (--EI)->getDebugLoc();
[all...] |
| SjLjEHPrepare.cpp | 276 Instruction *EI = ExtractValueInst::Create(AI, 0, "",AfterAllocaInsertPt);
277 Instruction *NI = InsertValueInst::Create(AI, EI, 0);
278 NI->insertAfter(EI);
281 EI->setOperand(0, AI);
[all...] |
