/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 | 255 for (NeedExportTypeSet::const_iterator EI = mNeedExportTypes.begin(), 257 EI != EE; 258 EI++) { 259 if (!processExportType(EI->getKey())) {
|
/external/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...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineVectorOps.cpp | 99 Instruction *InstCombiner::visitExtractElementInst(ExtractElementInst &EI) { 100 // If vector val is constant with all elements the same, replace EI with 102 if (Constant *C = dyn_cast<Constant>(EI.getOperand(0))) 104 return ReplaceInstUsesWith(EI, C->getAggregateElement(0U)); 108 if (ConstantInt *IdxC = dyn_cast<ConstantInt>(EI.getOperand(1))) { 110 unsigned VectorWidth = EI.getVectorOperandType()->getNumElements(); 115 return ReplaceInstUsesWith(EI, UndefValue::get(EI.getType())); 120 if (EI.getOperand(0)->hasOneUse() && VectorWidth != 1) { 124 if (Value *V = SimplifyDemandedVectorElts(EI.getOperand(0) [all...] |
/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 | 53 SUnitIterator EI, 55 if (EI.isArtificialDep()) 57 if (EI.isCtrlDep())
|
Analysis.cpp | 46 EI = EB, 48 EI != EE; ++EI) { 49 if (Indices && *Indices == unsigned(EI - EB)) 50 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex); 51 CurIndex = ComputeLinearIndex(*EI, 0, 0, CurIndex); 84 EI = EB, 86 EI != EE; ++EI) 87 ComputeValueVTs(TLI, *EI, ValueVTs, Offsets [all...] |
LiveIntervalAnalysis.cpp | [all...] |
SjLjEHPrepare.cpp | 268 Instruction *EI = ExtractValueInst::Create(AI, 0, "", AfterAllocaInsPt); 269 Instruction *NI = InsertValueInst::Create(AI, EI, 0); 270 NI->insertAfter(EI); 274 EI->setOperand(0, AI);
|
/external/llvm/lib/Analysis/ |
BranchProbabilityInfo.cpp | 242 for (SmallPtrSet<BasicBlock *, 8>::iterator EI = BackEdges.begin(), 243 EE = BackEdges.end(); EI != EE; ++EI) { 244 BasicBlock *Back = *EI; 254 for (SmallPtrSet<BasicBlock *, 8>::iterator EI = InEdges.begin(), 255 EE = InEdges.end(); EI != EE; ++EI) { 256 BasicBlock *Back = *EI; 266 for (SmallPtrSet<BasicBlock *, 8>::iterator EI = ExitingEdges.begin(), 267 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 | 91 static std::string getEdgeAttributes(const void *Node, EdgeIter EI, 93 SDValue Op = EI.getNode()->getOperand(EI.getOperand());
|
/external/clang/lib/Sema/ |
SemaStmt.cpp | [all...] |
SemaType.cpp | [all...] |
SemaCast.cpp | [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
CheckerManager.cpp | 482 EI = InlineCallCheckers.begin(), EE = InlineCallCheckers.end(); 483 EI != EE; ++EI) { 485 bool evaluated = (*EI)(CE, Eng, Pred, checkDst); 507 EI = EvalCallCheckers.begin(), EE = EvalCallCheckers.end(); 508 EI != EE; ++EI) { 511 Pred->getLocationContext(), EI->Checker); 517 evaluated = (*EI)(CE, C);
|
BasicConstraintManager.cpp | 352 for (ConstNotEqTy::iterator I = CNE.begin(), EI = CNE.end(); I!=EI; ++I) {
|
ExprEngine.cpp | [all...] |
/external/clang/lib/ARCMigrate/ |
TransZeroOutPropsInDealloc.cpp | 116 I = IMD->propimpl_begin(), EI = IMD->propimpl_end(); I != EI; ++I) {
|
/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/llvm/lib/Transforms/Scalar/ |
GVN.cpp | 109 Expression create_extractvalue_expression(ExtractValueInst* EI); 207 Expression ValueTable::create_extractvalue_expression(ExtractValueInst *EI) { 208 assert(EI != 0 && "Not an ExtractValueInst?"); 210 e.type = EI->getType(); 213 IntrinsicInst *I = dyn_cast<IntrinsicInst>(EI->getAggregateOperand()); 214 if (I != 0 && EI->getNumIndices() == 1 && *EI->idx_begin() == 0 ) { 215 // EI might be an extract from one of our recognised intrinsics. If it 247 e.opcode = EI->getOpcode(); 248 for (Instruction::op_iterator OI = EI->op_begin(), OE = EI->op_end() [all...] |
/external/llvm/lib/VMCore/ |
Verifier.cpp | 265 void visitExtractElementInst(ExtractElementInst &EI); 266 void visitInsertElementInst(InsertElementInst &EI); 267 void visitShuffleVectorInst(ShuffleVectorInst &EI); [all...] |
/external/llvm/lib/Support/ |
YAMLParser.cpp | 1017 EncodingInfo EI = getUnicodeEncoding(currentInput()); 1021 T.Range = StringRef(Current, EI.second); 1023 Current += EI.second; [all...] |