Searched refs:predecessors (Results 1 - 25 of 33) sorted by relevance

12

/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DRopMethod.java34 * {@code null-ok;} array of predecessors for each block, indexed by block
37 private IntList[] predecessors; field in class:RopMethod
40 * {@code null-ok;} the predecessors for the implicit "exit" block, that is
63 this.predecessors = null;
87 * Gets the predecessors associated with the given block. This throws
91 * @return {@code non-null;} the predecessors of that block
98 IntList result = predecessors[label];
108 * Gets the exit predecessors for this instance.
110 * @return {@code non-null;} the exit predecessors
135 * The predecessors hav
[all...]
/external/bison/src/
H A Dielr.h43 symbol_number lookahead, state ***predecessors,
H A DAnnotationList.h81 * - \c follow_kernel_items, \c always_follows, and \c predecessors were
111 state ***predecessors, bitset **item_lookahead_sets,
H A DAnnotationList.c196 state ***predecessors,
211 predecessors, item_lookahead_sets))
221 state ***predecessors,
231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor)
287 follow_kernel_items, always_follows, predecessors,
320 predecessors,
396 follow_kernel_items, always_follows, predecessors,
412 state ***predecessors, bitset **item_lookahead_sets,
496 always_follows, predecessors, item_lookahead_sets,
558 follow_kernel_items, always_follows, predecessors,
192 AnnotationList__compute_lhs_contributions(state *s, rule *the_rule, symbol_number conflicted_token, bitsetv follow_kernel_items, bitsetv always_follows, state ***predecessors, bitset **item_lookahead_sets, Sbitset *items, struct obstack *annotations_obstackp) argument
218 AnnotationList__computePredecessorAnnotations(AnnotationList *self, state *s, bitsetv follow_kernel_items, bitsetv always_follows, state ***predecessors, bitset **item_lookahead_sets, AnnotationList **annotation_lists, AnnotationIndex *annotation_counts, struct obstack *annotations_obstackp) argument
410 AnnotationList__compute_from_inadequacies( state *s, bitsetv follow_kernel_items, bitsetv always_follows, state ***predecessors, bitset **item_lookahead_sets, InadequacyList **inadequacy_lists, AnnotationList **annotation_lists, AnnotationIndex *annotation_counts, ContributionIndex *max_contributionsp, struct obstack *annotations_obstackp, InadequacyListNodeCount *inadequacy_list_node_count) argument
[all...]
H A Dielr.c379 symbol_number lookahead, state ***predecessors,
423 check all predecessors' goto follows for the LHS. */
428 for (predecessor = predecessors[s->number];
441 for (predecessor = predecessors[s->number];
455 predecessors, item_lookahead_sets);
469 * - \c follow_kernel_items, \c always_follows, and \c predecessors
484 bitsetv always_follows, state ***predecessors,
511 states[i], follow_kernel_items, always_follows, predecessors,
860 predecessors (at least one) other than *tp must be
865 predecessors
378 ielr_item_has_lookahead(state *s, symbol_number lhs, size_t item, symbol_number lookahead, state ***predecessors, bitset **item_lookahead_sets) argument
483 ielr_compute_annotation_lists(bitsetv follow_kernel_items, bitsetv always_follows, state ***predecessors, AnnotationIndex *max_annotationsp, InadequacyList ***inadequacy_listsp, AnnotationList ***annotation_listsp, struct obstack *annotations_obstackp) argument
1133 state ***predecessors; local
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen-deoptimizing-mark.cc64 const ZoneList<HBasicBlock*>* predecessors = block->predecessors(); local
65 int predecessors_length = predecessors->length();
68 if (!predecessors->at(j)->IsDeoptimizing()) {
H A Dhydrogen-environment-liveness.cc210 // store computed information for this block and add predecessors
216 for (int i = 0; i < block->predecessors()->length(); ++i) {
217 worklist.Add(block->predecessors()->at(i)->block_id());
H A Dhydrogen-range-analysis.cc65 if (block->predecessors()->length() == 1) {
66 HBasicBlock* pred = block->predecessors()->first();
H A Dhydrogen-escape-analysis.cc118 for (int i = 0; i < block->predecessors()->length(); i++) {
236 if (succ->predecessors()->length() == 1) {
H A Dhydrogen-representation-changes.cc39 next = use_value->block()->predecessors()->at(use_index)->end();
H A Dhydrogen-bch.cc218 HBasicBlock* pre_header = header->predecessors()->at(0);
H A Dhydrogen-gvn.cc544 HBasicBlock* pre_header = loop_header->predecessors()->at(0);
620 for (int i = 0; i < dominated->predecessors()->length(); ++i) {
621 HBasicBlock* block = dominated->predecessors()->at(i);
H A Dlithium-allocator.cc1053 HBasicBlock* cur_block = block->predecessors()->at(j);
1165 if (block->predecessors()->length() == 1) {
1254 if (block->predecessors()->length() != 1) return false;
1255 return block->predecessors()->first()->block_id() == block->block_id() - 1;
1269 for (int i = 0; i < block->predecessors()->length(); ++i) {
1270 HBasicBlock* cur = block->predecessors()->at(i);
1305 LGap* gap = GetLastGap(phi->block()->predecessors()->at(0));
H A Dhydrogen.cc293 if (predecessors()->length() == 1) {
301 for (int i = 1; i < predecessors()->length(); ++i) {
302 loop_information()->RegisterBackEdge(predecessors()->at(i));
396 // If more successors than predecessors have been seen in the loop up to
480 for (int i = 0; i < block->predecessors()->length(); ++i) {
481 AddBlock(block->predecessors()->at(i));
563 ASSERT(first->predecessors()->Contains(block));
565 ASSERT(second->predecessors()->Contains(block));
575 // Check that all join blocks have predecessors that end with an
577 if (block->predecessors()
[all...]
H A Dhydrogen-instructions.cc2045 if (block->predecessors()->length() != 1) return;
2046 HBasicBlock* predecessor = block->predecessors()->at(0);
2105 limit.variable->induction_exit_block_ = block->predecessors()->at(0);
3990 ASSERT(OperandCount() == block()->predecessors()->length());
3994 HBasicBlock* predecessor_block = block()->predecessors()->at(i);
H A Dhydrogen.h77 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; } function in class:v8::internal::HBasicBlock
160 // predecessors should contain the inlined exit sequence:
226 : predecessor_list_(block->predecessors()), current_(0) { }
/external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/
H A DAnalyzedInstruction.java53 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in class:AnalyzedInstruction
101 return predecessors.size();
105 return Collections.unmodifiableSortedSet(predecessors);
109 return predecessors.add(predecessor);
159 //if this instruction has no predecessors, it is either the fake "StartOfMethod" instruction or it is an
161 if (predecessors.size() == 0) {
165 if (predecessors.first().instructionIndex == -1) {
203 * Iterates over the predecessors of this instruction, and merges all the post-instruction register types for the
206 * @return The register type resulting from merging the post-instruction register types from all predecessors
210 for (AnalyzedInstruction predecessor: predecessors) {
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DSsaBasicBlock.java55 private BitSet predecessors; field in class:SsaBasicBlock
128 this.predecessors = new BitSet(parent.getBlocks().size());
158 result.predecessors = SsaMethod.bitSetFromLabelList(
341 * @return {@code non-null;} predecessors set, indexed by block index
344 return predecessors;
412 * All previous predecessors will be predecessors to the new block.
420 newPred.predecessors = predecessors;
427 predecessors
[all...]
/external/llvm/lib/CodeGen/
H A DShrinkWrapping.cpp236 /// predecessors.
242 SmallVector<MachineBasicBlock*, 4> predecessors; local
247 predecessors.push_back(PRED);
250 unsigned i = 0, e = predecessors.size();
253 MachineBasicBlock* PRED = predecessors[i];
257 PRED = predecessors[i];
295 // available at predecessors of MBB.
448 assert(HDR->pred_size() > 0 && "Loop header has no predecessors?");
592 // Propagate selected bits to successors, predecessors of MBB.
671 /// in MBB using AnticIn sets of MBB's predecessors, keepin
682 SmallVector<MachineBasicBlock*, 4> predecessors; local
[all...]
/external/v8/src/
H A Dlithium-allocator.cc1030 HBasicBlock* cur_block = block->predecessors()->at(j);
1137 if (block->predecessors()->length() == 1) {
1221 if (block->predecessors()->length() != 1) return false;
1222 return block->predecessors()->first()->block_id() == block->block_id() - 1;
1236 for (int i = 0; i < block->predecessors()->length(); ++i) {
1237 HBasicBlock* cur = block->predecessors()->at(i);
1272 LGap* gap = GetLastGap(phi->block()->predecessors()->at(0));
H A Dhydrogen.cc241 if (predecessors()->length() == 1) {
249 for (int i = 1; i < predecessors()->length(); ++i) {
250 loop_information()->RegisterBackEdge(predecessors()->at(i));
344 // If more successors than predecessors have been seen in the loop up to
428 for (int i = 0; i < block->predecessors()->length(); ++i) {
429 AddBlock(block->predecessors()->at(i));
508 ASSERT(first->predecessors()->Contains(block));
510 ASSERT(second->predecessors()->Contains(block));
520 // Check that all join blocks have predecessors that end with an
522 if (block->predecessors()
[all...]
H A Dhydrogen.h70 const ZoneList<HBasicBlock*>* predecessors() const { return &predecessors_; } function in class:v8::internal::HBasicBlock
142 // predecessors should contain the inlined exit sequence:
200 : predecessor_list_(block->predecessors()), current_(0) { }
/external/v8/src/arm/
H A Dlithium-arm.cc919 } else if (block->predecessors()->length() == 1) {
923 HBasicBlock* pred = block->predecessors()->at(0);
940 HBasicBlock* pred = block->predecessors()->at(0);
952 // Pick up the outgoing argument count of one of the predecessors.
/external/v8/src/mips/
H A Dlithium-mips.cc919 } else if (block->predecessors()->length() == 1) {
923 HBasicBlock* pred = block->predecessors()->at(0);
940 HBasicBlock* pred = block->predecessors()->at(0);
952 // Pick up the outgoing argument count of one of the predecessors.
/external/v8/src/x64/
H A Dlithium-x64.cc914 } else if (block->predecessors()->length() == 1) {
918 HBasicBlock* pred = block->predecessors()->at(0);
935 HBasicBlock* pred = block->predecessors()->at(0);
947 // Pick up the outgoing argument count of one of the predecessors.

Completed in 1410 milliseconds

12