| /frameworks/compile/slang/ |
| slang_rs_export_element.cpp | 39 ElementInfo *EI = new ElementInfo; \
40 EI->type = RSExportPrimitiveType::DataType ## _dt; \
41 EI->normalized = _norm; \
42 EI->vsize = _vsize; \
50 EI)); \
61 const ElementInfo *EI) {
70 slangAssert(EI != NULL && "Element info not found");
79 slangAssert(EI->vsize == 1 && "Element not a primitive class (please "
85 EI->normalized);
87 slangAssert(EI->type == EPT->getType() && "Element has unexpected type")
[all...] |
| slang_rs_export_element.h | 59 const ElementInfo *EI);
|
| slang_rs_context.cpp | 258 for (NeedExportTypeSet::const_iterator EI = mNeedExportTypes.begin(),
260 EI != EE;
261 EI++) {
262 if (!processExportType(EI->getKey())) {
|
| /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)
228 child_iterator EI = GTraits::child_begin(Node);
230 for (unsigned i = 0; EI != EE && i != 64; ++EI, ++i)
231 if (!DTraits.isNodeHidden(*EI))
232 writeEdge(Node, i, EI);
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineVectorOps.cpp | 108 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) {
109 // If vector val is constant with all elements the same, replace EI with
111 if (Constant *C = dyn_cast<Constant>(EI.getOperand(0)))
113 return ReplaceInstUsesWith(EI, C->getAggregateElement(0U));
117 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) {
119 unsigned VectorWidth = EI.getVectorOperandType()->getNumElements();
124 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType()));
129 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) {
133 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0)
[all...] |
| InstCombine.h | 203 Instruction *visitExtractElementInst(ExtractElementInst &EI);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.cpp | 82 EI = Entries.begin(), EE = Entries.end(); EI != EE; ++EI) {
85 std::stable_sort(EI->second.begin(), EI->second.end(), compareDIEs);
86 EI->second.erase(std::unique(EI->second.begin(), EI->second.end()),
87 EI->second.end());
89 HashData *Entry = new (Allocator) HashData(EI->getKey(), EI->second)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 56 SUnitIterator EI,
58 if (EI.isArtificialDep())
60 if (EI.isCtrlDep())
|
| Analysis.cpp | 44 EI = EB,
46 EI != EE; ++EI) {
47 if (Indices && *Indices == unsigned(EI - EB))
48 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex);
49 CurIndex = ComputeLinearIndex(*EI, 0, 0, CurIndex);
82 EI = EB,
84 EI != EE; ++EI)
85 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets
[all...] |
| SjLjEHPrepare.cpp | 253 Instruction *EI = ExtractValueInst::Create(AI, 0, "", AfterAllocaInsPt);
254 Instruction *NI = InsertValueInst::Create(AI, EI, 0);
255 NI->insertAfter(EI);
259 EI->setOperand(0, AI);
|
| RegAllocFast.cpp | 308 MachineBasicBlock::iterator EI = MI;
309 DL = (--EI)->getDebugLoc();
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 254 for (SmallVector<unsigned, 8>::iterator EI = BackEdges.begin(),
255 EE = BackEdges.end(); EI != EE; ++EI) {
256 setEdgeWeight(BB, *EI, backWeight);
265 for (SmallVector<unsigned, 8>::iterator EI = InEdges.begin(),
266 EE = InEdges.end(); EI != EE; ++EI) {
267 setEdgeWeight(BB, *EI, inWeight);
276 for (SmallVector<unsigned, 8>::iterator EI = ExitingEdges.begin(),
277 EE = ExitingEdges.end(); EI != EE; ++EI)
[all...] |
| ProfileInfo.cpp | 429 for (std::set<Edge>::iterator EI = Edges.begin(), EE = Edges.end();
430 EI != EE; ++EI) {
431 Edge newedge = getEdge(New, EI->second);
432 replaceEdge(*EI, newedge);
609 std::set<Edge>::iterator ei,ee; local
611 ei = outMissing.begin();
617 ei = inMissing.begin();
628 for ( ; ei != ee; ++ei ) {
[all...] |
| /external/clang/include/clang/Analysis/FlowSensitive/ |
| DataflowSolver.h | 242 typename EdgeDataMapTy::iterator EI =
245 if (EI != M.end()) {
249 V.copyValues(EI->second);
252 Merge(V, EI->second);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 90 static std::string getEdgeAttributes(const void *Node, EdgeIter EI,
92 SDValue Op = EI.getNode()->getOperand(EI.getOperand());
|
| /external/clang/lib/ARCMigrate/ |
| TransZeroOutPropsInDealloc.cpp | 117 I = IMD->propimpl_begin(), EI = IMD->propimpl_end(); I != EI; ++I) {
|
| /external/clang/lib/Sema/ |
| SemaStmt.cpp | [all...] |
| SemaType.cpp | [all...] |
| SemaCast.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerInvoke.cpp | 298 Instruction *EI = ExtractValueInst::Create(AI, 0, "",AfterAllocaInsertPt);
299 Instruction *NI = InsertValueInst::Create(AI, EI, 0);
300 NI->insertAfter(EI);
303 EI->setOperand(0, AI);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| CheckerManager.cpp | 539 EI = EvalCallCheckers.begin(), EE = EvalCallCheckers.end();
540 EI != EE; ++EI) {
543 Pred->getLocationContext(), EI->Checker);
549 evaluated = (*EI)(CE, C);
|
| ExprEngine.cpp | [all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| GVN.cpp | 115 Expression create_extractvalue_expression(ExtractValueInst* EI);
213 Expression ValueTable::create_extractvalue_expression(ExtractValueInst *EI) {
214 assert(EI != 0 && "Not an ExtractValueInst?");
216 e.type = EI->getType();
219 IntrinsicInst *I = dyn_cast<IntrinsicInst>(EI->getAggregateOperand());
220 if (I != 0 && EI->getNumIndices() == 1 && *EI->idx_begin() == 0 ) {
221 // EI might be an extract from one of our recognised intrinsics. If it
253 e.opcode = EI->getOpcode();
254 for (Instruction::op_iterator OI = EI->op_begin(), OE = EI->op_end()
[all...] |
| /external/llvm/lib/IR/ |
| Verifier.cpp | 270 void visitExtractElementInst(ExtractElementInst &EI);
271 void visitInsertElementInst(InsertElementInst &EI);
272 void visitShuffleVectorInst(ShuffleVectorInst &EI);
[all...] |
| /external/llvm/lib/Support/ |
| YAMLParser.cpp | 1033 EncodingInfo EI = getUnicodeEncoding(currentInput());
1037 T.Range = StringRef(Current, EI.second);
1039 Current += EI.second;
[all...] |
