Searched refs:predecessors (Results 1 - 25 of 41) 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/compiler/
H A Dschedule.cc40 BasicBlock::Predecessors predecessors = block->predecessors(); local
42 for (BasicBlock::Predecessors::iterator j = predecessors.begin();
43 j != predecessors.end(); ++j) {
H A Dschedule.h104 Predecessors predecessors() { return static_cast<Predecessors>(inputs()); } function in class:v8::internal::compiler::FINAL
113 BasicBlock::Predecessors predecessors = this->predecessors(); local
114 for (BasicBlock::Predecessors::iterator i = predecessors.begin();
115 i != predecessors.end(); ++i) {
H A Djs-inlining.cc124 int predecessors = local
127 const Operator* op_phi = jsgraph->common()->Phi(kMachAnyTagged, predecessors);
128 const Operator* op_ephi = jsgraph->common()->EffectPhi(predecessors);
132 // Iterate over all control flow predecessors,
H A Dinstruction.cc436 << ")\n predecessors:";
438 BasicBlock::Predecessors predecessors = block->predecessors(); local
439 for (BasicBlock::Predecessors::iterator iter = predecessors.begin();
440 iter != predecessors.end(); ++iter) {
H A Dscheduler.cc330 current_rpo->predecessors().begin();
332 current_rpo->predecessors().end();
336 // For multiple predecessors, walk up the rpo ordering until a common
532 *hoist_block->predecessors().begin() == pre_header);
805 // Push the member onto the queue and process its predecessors.
812 // Propagate loop membership backwards. All predecessors of M up to the
H A Dregister-allocator.cc1268 BasicBlock::Predecessors predecessors = block->predecessors(); local
1269 for (BasicBlock::Predecessors::iterator i = predecessors.begin();
1270 i != predecessors.end(); ++i) {
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
H A DAnalyzedInstruction.java56 protected final TreeSet<AnalyzedInstruction> predecessors = new TreeSet<AnalyzedInstruction>(); field in class:AnalyzedInstruction
97 return predecessors.size();
101 return Collections.unmodifiableSortedSet(predecessors);
105 return predecessors.add(predecessor);
151 //if this instruction has no predecessors, it is either the fake "StartOfMethod" instruction or it is an
153 if (predecessors.size() == 0) {
157 if (predecessors.first().instructionIndex == -1) {
195 * Iterates over the predecessors of this instruction, and merges all the post-instruction register types for the
198 * @return The register type resulting from merging the post-instruction register types from all predecessors
202 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/chromium_org/v8/src/
H A Dhydrogen-environment-liveness.cc187 // store computed information for this block and add predecessors
193 for (int i = 0; i < block->predecessors()->length(); ++i) {
194 worklist.Add(block->predecessors()->at(i)->block_id());
H A Dhydrogen-flow-engine.h110 // Must have visited all predecessors before this block.
126 if (max == 1 && succ->predecessors()->length() == 1) {
198 DCHECK(block->predecessors()->length() == pred_counts_[block->block_id()]);
210 ZoneList<int> pred_counts_; // Finished predecessors (by block id).
H A Dhydrogen-range-analysis.cc42 if (block->predecessors()->length() == 1) {
43 HBasicBlock* pred = block->predecessors()->first();
H A Dhydrogen-escape-analysis.cc119 for (int i = 0; i < block->predecessors()->length(); i++) {
254 if (succ->predecessors()->length() == 1) {
H A Dhydrogen-representation-changes.cc16 next = use_value->block()->predecessors()->at(use_index)->end();
H A Dhydrogen-bch.cc196 HBasicBlock* pre_header = header->predecessors()->at(0);
H A Dhydrogen-gvn.cc585 HBasicBlock* pre_header = loop_header->predecessors()->at(0);
650 for (int i = 0; i < dominated->predecessors()->length(); ++i) {
651 HBasicBlock* block = dominated->predecessors()->at(i);
H A Dlithium-allocator.cc1034 HBasicBlock* cur_block = block->predecessors()->at(j);
1145 if (block->predecessors()->length() == 1) {
1234 if (block->predecessors()->length() != 1) return false;
1235 return block->predecessors()->first()->block_id() == block->block_id() - 1;
1249 for (int i = 0; i < block->predecessors()->length(); ++i) {
1250 HBasicBlock* cur = block->predecessors()->at(i);
1285 LGap* gap = GetLastGap(phi->block()->predecessors()->at(0));
H A Dhydrogen-check-elimination.cc218 if (succ->predecessors()->length() == 1) {
219 HControlInstruction* end = succ->predecessors()->at(0)->end();
H A Dhydrogen.cc315 if (predecessors()->length() == 1) {
323 for (int i = 1; i < predecessors()->length(); ++i) {
324 loop_information()->RegisterBackEdge(predecessors()->at(i));
333 DCHECK(succ_block->predecessors()->length() == 1);
427 // If more successors than predecessors have been seen in the loop up to
511 for (int i = 0; i < block->predecessors()->length(); ++i) {
512 AddBlock(block->predecessors()->at(i));
594 DCHECK(first->predecessors()->Contains(block));
596 DCHECK(second->predecessors()->Contains(block));
606 // Check that all join blocks have predecessors tha
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64A53Fix835769.cpp139 for (MachineBasicBlock *S : MBB->predecessors())
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h303 inline iterator_range<pred_iterator> predecessors() { function in class:llvm::MachineBasicBlock
306 inline iterator_range<const_pred_iterator> predecessors() const { function in class:llvm::MachineBasicBlock

Completed in 579 milliseconds

12