| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/z8k/ |
| eidi.s | 3 ei all
5 ei both
7 ei vi
9 ei nvi
12 ei vi,nvi
13 ei nvi,vi
18 EI ALL
20 EI BOTH
22 EI VI
24 EI NV
[all...] |
| /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...] |
| slang_rs_export_element.h | 59 const ElementInfo *EI);
|
| /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...] |
| DwarfAccelTable.cpp | 74 for (StringMap<DataArray>::iterator EI = Entries.begin(), EE = Entries.end();
75 EI != EE; ++EI) {
78 std::stable_sort(EI->second.Values.begin(), EI->second.Values.end(), compareDIEs);
79 EI->second.Values.erase(
80 std::unique(EI->second.Values.begin(), EI->second.Values.end()),
81 EI->second.Values.end());
83 HashData *Entry = new (Allocator) HashData(EI->getKey(), EI->second)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombineVectorOps.cpp | 123 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
125 if (isa<UndefValue>(EI.getOperand(0)))
126 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
129 if (isa<ConstantAggregateZero>(EI.getOperand(0)))
130 return ReplaceInstUsesWith(EI, Constant::getNullValue(EI.getType()));
132 if (ConstantVector *C = dyn_cast<ConstantVector>(EI.getOperand(0))) {
133 // If vector val is constant with all elements the same, replace EI with
143 return ReplaceInstUsesWith(EI, op0)
[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/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-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-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-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-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-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-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-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...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineVectorOps.cpp | 68 Instruction *InstCombiner::scalarizePHI(ExtractElementInst &EI, PHINode *PN) {
71 // 1) The EI ExtractElement (we already know this)
77 if (EI.getIndexOperand() == EU->getIndexOperand())
101 PHINode::Create(EI.getType(), PN->getNumIncomingValues(), ""), *PN));
106 Value *Elt = EI.getIndexOperand();
143 return &EI;
146 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
148 EI.getVectorOperand(), EI.getIndexOperand(), DL, TLI, DT, AC))
149 return replaceInstUsesWith(EI, V)
[all...] |
| /external/llvm/lib/Support/ |
| Error.cpp | 61 handleAllErrors(std::move(E), [&](const ErrorInfoBase &EI) {
62 EI.log(OS);
86 handleAllErrors(std::move(Err), [&](const ErrorInfoBase &EI) {
87 EC = EI.convertToErrorCode();
|
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 56 SUnitIterator EI,
58 if (EI.isArtificialDep())
60 if (EI.isCtrlDep())
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 54 SUnitIterator EI,
56 if (EI.isArtificialDep())
58 if (EI.isCtrlDep())
|
| Analysis.cpp | 45 EI = EB,
47 EI != EE; ++EI) {
48 if (Indices && *Indices == unsigned(EI - EB))
49 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex);
50 CurIndex = ComputeLinearIndex(*EI, 0, 0, CurIndex);
83 EI = EB,
85 EI != EE; ++EI)
86 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets
[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/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/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/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...] |
