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

1 2 3

  /art/compiler/sea_ir/ir/
regions_test.cc 42 std::vector<sea_ir::Region*>* preds = then_region->GetPredecessors(); local
43 EXPECT_EQ(1U, preds->size());
44 EXPECT_EQ(root, preds->at(0));
51 preds = then_region->GetPredecessors();
52 EXPECT_EQ(1U, preds->size());
53 EXPECT_EQ(root, preds->at(0));
54 preds = else_region->GetPredecessors();
55 EXPECT_EQ(1U, preds->size());
56 EXPECT_EQ(root, preds->at(0));
sea.cc 93 std::vector<Region*>* preds = (*crt_it)->GetPredecessors(); local
94 DCHECK(NULL != preds);
96 for (std::vector<Region*>::iterator pred_it = preds->begin();
97 pred_it != preds->end(); ++pred_it) {
106 for (std::vector<Region*>::const_iterator pred_it = preds->begin();
107 pred_it != preds->end(); ++pred_it) {
438 std::vector<Region*>* preds = (*region_it)->GetPredecessors(); local
439 if (preds->size() > 1) {
440 for (std::vector<Region*>::iterator pred_it = preds->begin();
441 pred_it != preds->end(); pred_it++)
    [all...]
  /external/chromium_org/third_party/libwebp/utils/
filters.c 50 const uint8_t* preds = (inverse ? out : in); local
59 PredictLine(in, preds - stride, out, 1, inverse);
61 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
62 preds += stride;
85 const uint8_t* preds = (inverse ? out : in); local
91 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
97 PredictLine(in, preds, out, width, inverse);
98 preds += stride;
122 const uint8_t* preds = (inverse ? out : in); local
128 PredictLine(in + 1, preds, out + 1, width - 1, inverse)
    [all...]
  /external/webp/src/utils/
filters.c 50 const uint8_t* preds = (inverse ? out : in); local
59 PredictLine(in, preds - stride, out, 1, inverse);
61 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
62 preds += stride;
85 const uint8_t* preds = (inverse ? out : in); local
91 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
97 PredictLine(in, preds, out, width, inverse);
98 preds += stride;
122 const uint8_t* preds = (inverse ? out : in); local
128 PredictLine(in + 1, preds, out + 1, width - 1, inverse)
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/back/
IdenticalBlockCombiner.java 69 IntList preds = ropMethod.labelToPredecessors(b.getLabel()); local
72 int szPreds = preds.size();
74 int iLabel = preds.get(i);
87 // ...and see if they can be combined with any other preds...
89 int jLabel = preds.get(j);
141 IntList preds = ropMethod.labelToPredecessors(bb.getLabel()); local
142 int szPreds = preds.size();
145 BasicBlock predBlock = newBlocks.labelToBlock(preds.get(j));
LivenessAnalyzer.java 220 BitSet preds = blockN.getPredecessors(); local
222 liveOutBlocks.or(preds);
  /external/chromium_org/third_party/libwebp/enc/
tree.c 324 const uint8_t* preds = it.preds_; local
332 PutI16Mode(bw, preds[0]);
335 const uint8_t* top_pred = preds - preds_w;
338 int left = preds[-1];
341 left = PutI4Mode(bw, preds[x], probas);
343 top_pred = preds;
344 preds += preds_w;
iterator.c 293 uint8_t* preds = it->preds_; local
296 memset(preds, mode, 4);
297 preds += it->enc_->preds_w_;
303 uint8_t* preds = it->preds_; local
306 memcpy(preds, modes, 4 * sizeof(*modes));
307 preds += it->enc_->preds_w_;
  /external/dexmaker/src/dx/java/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);
  /external/webp/src/enc/
tree.c 324 const uint8_t* preds = it.preds_; local
332 PutI16Mode(bw, preds[0]);
335 const uint8_t* top_pred = preds - preds_w;
338 int left = preds[-1];
341 left = PutI4Mode(bw, preds[x], probas);
343 top_pred = preds;
344 preds += preds_w;
iterator.c 293 uint8_t* preds = it->preds_; local
296 memset(preds, mode, 4);
297 preds += it->enc_->preds_w_;
303 uint8_t* preds = it->preds_; local
306 memcpy(preds, modes, 4 * sizeof(*modes));
307 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 183 IntList preds = predecessors[i]; local
184 if (preds != null) {
185 preds.sort();
186 preds.setImmutable();
  /external/dexmaker/src/dx/java/com/android/dx/rop/code/
RopMethod.java 184 IntList preds = predecessors[i]; local
185 if (preds != null) {
186 preds.sort();
187 preds.setImmutable();
  /art/compiler/sea_ir/types/
type_inference_visitor_test.cc 111 std::vector<InstructionNode*> preds; local
119 preds.push_back(short_inst);
120 preds.push_back(int_inst);
126 TestInstructionNode* inst_to_test = new TestInstructionNode(preds);
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
ACyclicDFACodeGenerator.java 133 SemanticContext preds = local
135 if ( preds!=null ) {
136 //System.out.println("preds="+target.getGatedPredicatesInNFAConfigurations());
137 ST predST = preds.genExpr(parentGenerator,
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
FASerializer.java 168 SemanticContext preds = local
170 if ( preds!=null ) {
172 preds.genExpr(grammar.generator,
  /dalvik/dx/src/com/android/dx/command/dump/
SsaDumper.java 132 BitSet preds = block.getPredecessors(); local
134 for (int i = preds.nextSetBit(0); i >= 0;
135 i = preds.nextSetBit(i+1)) {
  /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 205 BitSet preds = (BitSet)block.getPredecessors().clone(); local
206 for (int j = preds.nextSetBit(0); j >= 0;
207 j = preds.nextSetBit(j + 1)) {
  /external/dexmaker/src/dx/java/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 ALOGI("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)");
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
basic-block.h 55 dest->preds. */
132 VEC(edge,gc) *preds;
531 && EDGE_COUNT ((e)->dest->preds) >= 2)
535 #define EDGE_PRED(bb,i) VEC_index (edge, (bb)->preds, (i))
551 return EDGE_COUNT (bb->preds) == 1;
891 FOR_EACH_EDGE (e, ei, bb->preds)
906 FOR_EACH_EDGE (e, ei, bb->preds)

Completed in 436 milliseconds

1 2 3