HomeSort by relevance Sort by last modified time
    Searched refs:preds (Results 1 - 25 of 27) sorted by null

1 2

  /external/llvm/test/CodeGen/CellSPU/useful-harnesses/
i32operations.c 32 struct pred_s preds[] = { variable in typeref:struct:pred_s
52 for (i = 0; i < sizeof(preds)/sizeof(preds[0]); ++i) {
53 printf("a %s a = %s\n", preds[i].name, boolstring((*preds[i].predfunc)(a, a)));
54 printf("a %s a = %s\n", preds[i].name, boolstring((*preds[i].predfunc)(a, a)));
55 printf("a %s b = %s\n", preds[i].name, boolstring((*preds[i].predfunc)(a, b)));
56 printf("a %s c = %s\n", preds[i].name, boolstring((*preds[i].predfunc)(a, c)))
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 74 IntList preds = ropMethod.labelToPredecessors(b.getLabel()); local
77 int szPreds = preds.size();
79 int iLabel = preds.get(i);
92 // ...and see if they can be combined with any other preds...
94 int jLabel = preds.get(j);
146 IntList preds = ropMethod.labelToPredecessors(bb.getLabel()); local
147 int szPreds = preds.size();
150 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j));
LivenessAnalyzer.java 221 BitSet preds = blockN.getPredecessors(); local
223 liveOutBlocks.or(preds);
SsaToRop.java 148 BitSet preds = (BitSet) b.getPredecessors().clone();
150 for (int i = preds.nextSetBit(0); i >= 0;
151 i = preds.nextSetBit(i + 1)) {
  /external/webp/src/enc/
tree.c 319 const uint8_t* preds = it.preds_; local
327 PutI16Mode(bw, preds[0]);
330 const uint8_t* top_pred = preds - preds_w;
333 int left = preds[-1];
336 left = PutI4Mode(bw, preds[x], probas);
338 top_pred = preds;
339 preds += preds_w;
iterator.c 278 uint8_t* preds = it->preds_; local
280 memset(preds, mode, 4);
281 preds += it->enc_->preds_w_;
288 uint8_t* preds = it->preds_; local
291 preds[x] = modes[x + y * 4];
293 preds += it->enc_->preds_w_;
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
RopMethod.java 184 IntList preds = predecessors[i]; local
185 if (preds != null) {
186 preds.sort();
187 preds.setImmutable();
  /dalvik/dx/src/com/android/dx/rop/code/
RopMethod.java 184 IntList preds = predecessors[i]; local
185 if (preds != null) {
186 preds.sort();
187 preds.setImmutable();
  /dalvik/dx/src/com/android/dx/command/dump/
SsaDumper.java 140 BitSet preds = block.getPredecessors(); local
142 for (int i = preds.nextSetBit(0); i >= 0;
143 i = preds.nextSetBit(i+1)) {
BlockDumper.java 311 IntList preds = rmeth.labelToPredecessors(label); local
312 int psz = preds.size();
315 sb.append(Hex.u2(preds.get(i)));
  /dalvik/dx/src/com/android/dx/ssa/
Dominators.java 195 BitSet preds = getPreds(w); local
196 for (int j = preds.nextSetBit(0);
198 j = preds.nextSetBit(j + 1)) {
SsaConverter.java 206 BitSet preds = (BitSet)block.getPredecessors().clone(); local
207 for (int j = preds.nextSetBit(0); j >= 0;
208 j = preds.nextSetBit(j + 1)) {
  /dalvik/vm/analysis/
VfyBasicBlock.cpp 127 PointerSet* preds = targetBlock->predecessors; local
128 bool added = dvmPointerSetAddEntry(preds, curBlock);
231 LOGI("Lots of preds at 0x%04x in %s.%s:%s", curIdx,
259 PointerSet* preds = block->predecessors; local
260 size_t numPreds = dvmPointerSetGetCount(preds);
264 "preds:");
271 (const VfyBasicBlock*) dvmPointerSetGetEntry(preds, predIdx);
277 "(no preds)");
Liveness.cpp 208 PointerSet* preds = workBlock->predecessors; local
209 size_t numPreds = dvmPointerSetGetCount(preds);
214 (VfyBasicBlock*) dvmPointerSetGetEntry(preds, predIdx);
  /external/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 179 SmallPtrSet<MachineBasicBlock*, 8> preds(BB->pred_begin(),
184 if (!preds.count(phi->getOperand(i).getMBB())) {
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
basic-block.h 142 dest->preds. */
230 VEC(edge,gc) *preds;
631 && EDGE_COUNT ((e)->dest->preds) >= 2)
635 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
651 return EDGE_COUNT (bb->preds) == 1;
    [all...]
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/
basic-block.h 142 dest->preds. */
230 VEC(edge,gc) *preds;
631 && EDGE_COUNT ((e)->dest->preds) >= 2)
635 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
651 return EDGE_COUNT (bb->preds) == 1;
    [all...]
  /prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/
basic-block.h 142 dest->preds. */
230 VEC(edge,gc) *preds;
631 && EDGE_COUNT ((e)->dest->preds) >= 2)
635 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
651 return EDGE_COUNT (bb->preds) == 1;
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentSkipListMap.java 1416 ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); local
1505 ArrayList<Index<K,V>> preds = new ArrayList<Index<K,V>>(); local
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
RopTranslator.java 345 IntList preds = method.labelToPredecessors(label); local
346 int psz = preds.size();
349 int predLabel = preds.get(i);
  /dalvik/dx/src/com/android/dx/dex/code/
RopTranslator.java 352 IntList preds = method.labelToPredecessors(label); local
353 int psz = preds.size();
356 int predLabel = preds.get(i);
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.h 634 PatternToMatch(Record *srcrecord, ListInit *preds,
638 : SrcRecord(srcrecord), Predicates(preds), SrcPattern(src), DstPattern(dst),
  /external/valgrind/main/helgrind/
hg_main.c 3653 WordSetID preds, succs; local
    [all...]
  /external/v8/benchmarks/
earley-boyer.js     [all...]
  /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/
v8-earley-boyer.js     [all...]

Completed in 748 milliseconds

1 2