HomeSort by relevance Sort by last modified time
    Searched full:retvals (Results 1 - 10 of 10) sorted by null

  /external/llvm/lib/Transforms/IPO/
IPConstantPropagation.cpp 169 SmallVector<Value *,4> RetVals;
173 RetVals.push_back(UndefValue::get(STy->getElementType(i)));
175 RetVals.push_back(UndefValue::get(F.getReturnType()));
180 for (unsigned i = 0, e = RetVals.size(); i != e; ++i) {
182 Value *RV = RetVals[i];
202 RetVals[i] = V;
212 RetVals[i] = 0;
214 if (++NumNonConstant == RetVals.size())
239 Value* New = RetVals[0];
264 Value *New = RetVals[index]
    [all...]
DeadArgumentElimination.cpp 467 typedef SmallVector<Liveness, 5> RetVals;
468 RetVals RetValLiveness(RetCount, MaybeLive);
491 // Keep track of the number of live retvals, so we can skip checks once all
    [all...]
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
LeftRecursiveRuleAnalyzer.java 26 public GrammarAST retvals; field in class:LeftRecursiveRuleAnalyzer
57 retvals = t;
198 ruleST.add("userRetvals", retvals);
218 ruleST.add("userRetvals", retvals);
247 ruleST.add("userRetvals", retvals);
321 if ( retvals==null ) return;
324 for (String name : getNamesFromArgAction(retvals.token)) {
  /packages/apps/Mms/src/com/android/mms/
SuggestionsProvider.java 153 int [] retvals = new int[vals.length]; local
154 for (int i = retvals.length-1; i >= 0; i--) {
155 retvals[i] = Integer.parseInt(vals[i]);
157 return retvals;
  /external/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp     [all...]
  /external/llvm/bindings/ocaml/llvm/
llvm_ocaml.c     [all...]
  /external/llvm/include/llvm/Support/
IRBuilder.h 427 /// with one Value from the retVals array each, that build a aggregate
433 ReturnInst *CreateAggregateRet(Value *const *retVals, unsigned N) {
436 V = CreateInsertValue(V, retVals[i], i, "mrv");
    [all...]
  /external/llvm/lib/VMCore/
Core.cpp     [all...]
  /external/llvm/include/llvm-c/
Core.h     [all...]
  /external/llvm/lib/Target/ARM/
ARMFastISel.cpp     [all...]

Completed in 405 milliseconds