HomeSort by relevance Sort by last modified time
    Searched refs:successor (Results 1 - 15 of 15) sorted by null

  /external/e2fsprogs/intl/
finddomain.c 102 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
104 if (retval->successor[cnt]->decided == 0)
105 _nl_load_domain (retval->successor[cnt], domainbinding);
107 if (retval->successor[cnt]->data != NULL)
156 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
158 if (retval->successor[cnt]->decided == 0)
159 _nl_load_domain (retval->successor[cnt], domainbinding);
160 if (retval->successor[cnt]->data != NULL)
loadinfo.h 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
99 furthermore its ->successor[] field contains a list of other lookup
l10nflist.c 346 retval->successor[entries++]
353 retval->successor[entries++]
359 retval->successor[entries] = NULL;
dcigettext.c 627 for (cnt = 0; domain->successor[cnt] != NULL; ++cnt)
629 retval = _nl_find_msg (domain->successor[cnt], binding,
634 domain = domain->successor[cnt];
    [all...]
  /external/webkit/Tools/android/flex-2.5.4a/
sym.c 61 register struct hash_entry *successor; local
80 if ( (successor = table[hash_val]) != 0 )
82 new_entry->next = successor;
83 successor->prev = new_entry;
  /dalvik/dx/src/com/android/dx/command/dump/
DotDumper.java 148 int successor = successors.get(j); local
150 if (successor != bb.getPrimarySuccessor()) {
151 System.out.print(" n" + Hex.u2(successor) + " ");
  /external/llvm/lib/Analysis/
PathNumbering.cpp 97 // Returns an iterator over successor edges. Includes phony and
103 // Returns the end sentinel for the successor iterator.
108 // Returns the number of successor edges. Includes phony and
124 // Add an edge to the successor list.
129 // Remove an edge from the successor list.
290 // Iterate through each successor edge, adding phony edges
400 for(succ_iterator successor = succ_begin(currentBlock),
401 succEnd = succ_end(currentBlock); successor != succEnd;
402 oldSuccessor = *successor, ++successor ) {
    [all...]
  /external/chromium/net/tools/testserver/
chromiumsync.py 398 for item, successor in zip(siblings, siblings[1:]):
401 elif successor.id_string == entry.id_string:
403 entry.position_in_parent = successor.position_in_parent
406 # existing successor.
408 successor.position_in_parent) / 8
    [all...]
  /dalvik/dx/src/com/android/dx/ssa/
SsaRenamer.java 364 * phis in successor blocks.
625 * Updates the phi insns in successor blocks with operands based
657 SsaBasicBlock successor = ssaMeth.getBlocks().get(i); local
658 successor.forEachPhiInsn(visitor);
  /external/llvm/lib/Transforms/Utils/
InlineFunction.cpp 94 // Okay, if that failed, look for one in an obvious successor. If
124 BasicBlock *successor = branch->getSuccessor(0);
127 if (!visited.insert(successor)) return 0;
129 // If the successor isn't dominated by exnBlock:
130 if (!successor->getSinglePredecessor()) {
138 nonDominated = successor;
142 exnBlock = successor;
    [all...]
  /external/v8/src/
lithium-allocator.cc 564 // successor edges.
567 // Process all successor blocks.
568 HBasicBlock* successor = block->end()->FirstSuccessor(); local
569 while (successor != NULL) {
570 // Add values live on entry to the successor. Note the successor's
572 BitVector* live_in = live_in_sets_[successor->block_id()];
575 // All phi input operands corresponding to this successor edge are live
577 int index = successor->PredecessorIndexOf(block);
578 const ZoneList<HPhi*>* phis = successor->phis()
    [all...]
jsregexp.cc 3482 RegExpNode* successor = that->on_success(); local
3526 RegExpNode* successor = that->on_success(); local
4728 OutSet* successor = successors()->at(i); local
5069 GuardedAlternative successor = this->alternatives()->at(1); local
    [all...]
hydrogen.h 290 void CheckForBackEdge(HBasicBlock* block, HBasicBlock* successor);
738 // block and loop_entry is the successor block. loop_successor is the
742 // value is the new successor block which is the join of loop_successor
    [all...]
jsregexp.h     [all...]
  /external/chromium/chrome/browser/sync/syncable/
syncable.cc     [all...]

Completed in 1996 milliseconds