/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/axes/ |
H A D | HasPositionalPredChecker.java | 94 * @param pred The predicate object. 97 public boolean visitPredicate(ExpressionOwner owner, Expression pred) argument 103 if((pred instanceof Variable) || 104 (pred instanceof XNumber) || 105 (pred instanceof Div) || 106 (pred instanceof Plus) || 107 (pred instanceof Minus) || 108 (pred instanceof Mod) || 109 (pred instanceof Quo) || 110 (pred instanceo [all...] |
/openjdk7/jaxp/src/com/sun/org/apache/xpath/internal/ |
H A D | XPathVisitor.java | 98 * @param pred The predicate object. 101 public boolean visitPredicate(ExpressionOwner owner, Expression pred) argument
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | survRateGroup.cpp | 176 double pred = 0.0; local 178 pred = _g1p->get_new_prediction(_surv_rate_pred[i]); 179 if (pred > 1.0) pred = 1.0; 180 accum += pred; 184 _last_pred = pred; 193 gclog_or_tty->print_cr(" age %4d surv rate %6.2lf %% pred %6.2lf %%",
|
H A D | g1CollectorPolicy.hpp | 459 double pred = get_new_prediction(seq); local 460 if (pred > 1.0) 461 pred = 1.0; 462 return pred;
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/ |
H A D | ServerCompilerScheduler.java | 340 List<Integer> pred; field in class:ServerCompilerScheduler.BlockIntermediate 393 bi.pred = new ArrayList<Integer>(); 418 succ.pred.add(index); 425 for (int predIndex : block.pred) {
|
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_ValueMap.cpp | 317 BlockBegin* pred = block->pred_at(j); local 319 ValueMap* pred_map = value_map_of(pred); 322 } else if (!_loop_blocks.contains(pred)) { 326 _loop_blocks.append(pred); 392 BlockBegin* pred = block->pred_at(j); local 393 ValueMap* pred_map = value_map_of(pred); 397 current_map()->kill_map(value_map_of(pred));
|
H A D | c1_Instruction.cpp | 657 void BlockBegin::remove_successor(BlockBegin* pred) { argument 659 while ((idx = _successors.index_of(pred)) >= 0) { 665 void BlockBegin::add_predecessor(BlockBegin* pred) { argument 666 _predecessors.append(pred); 670 void BlockBegin::remove_predecessor(BlockBegin* pred) { argument 672 while ((idx = _predecessors.index_of(pred)) >= 0) {
|
/openjdk7/hotspot/src/share/vm/compiler/ |
H A D | methodLiveness.hpp | 140 void add_normal_predecessor(BasicBlock *pred) { argument 141 _normal_predecessors->append_if_missing(pred); 145 void add_exception_predecessor(BasicBlock *pred) { argument 146 _exception_predecessors->append_if_missing(pred);
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | buildOopMap.cpp | 541 worklist->push(cfg->_bbs[b->pred(l)->_idx]); 629 // pred to this block. Otherwise we have to grab a new OopFlow. 631 Block *pred = (Block*)0xdeadbeef; local 635 Block *p = _cfg->_bbs[b->pred(j)->_idx]; 639 pred = p; // Record some predecessor 653 break; // Found an ideal pred, use him 670 flow->clone(flows[pred->_pre_order], max_reg); 676 assert( flow->_b == pred, "have some prior flow" );
|
H A D | coalesce.cpp | 203 tty->print("B%d ", _phc._cfg._bbs[b->pred(j)->_idx]->_pre_order); 423 Block *pred = _phc._cfg._bbs[b->pred(j)->_idx]; local 431 pred->add_inst(copy); 433 _phc.clone_projs( pred, pred->end_idx(), m, copy, _phc._maxlrg ); 438 insert_copy_with_overlap(pred,copy,phi_name,src_name); 442 _phc._cfg._bbs.map( copy->_idx, pred ); 569 while( _phc._cfg._bbs[bs->pred(j)->_idx] != b ) j++; 644 b = _phc._cfg._bbs[b->pred( [all...] |
H A D | loopPredicate.cpp | 102 void PhaseIdealLoop::register_control(Node* n, IdealLoopTree *loop, Node* pred) { argument 109 set_idom(n, pred, dom_depth(pred));
|
H A D | reg_split.cpp | 273 b = _cfg._bbs[b->pred(useidx)->_idx]; 474 Block *b, *pred; local 578 Block *pred1 = _cfg._bbs[b->pred(1)->_idx]; 588 n1 = b->pred(1); 590 pred = _cfg._bbs[n1->_idx]; 591 pidx = pred->_pre_order; 603 n2 = b->pred(inpidx); 605 pred = _cfg._bbs[n2->_idx]; 606 pidx = pred->_pre_order; 688 n1 = b->pred( 1295 Block *pred = _cfg._bbs[b->pred(i)->_idx]; local [all...] |
H A D | block.hpp | 122 Node *pred(uint i) const { return head()->in(i); } function in class:Block
|
H A D | parse.hpp | 195 void mark_merged_backedge(Block* pred) { argument 197 if (pred != NULL && is_SEL_backedge(pred)) { 222 bool is_SEL_backedge(Block* pred) const{ return is_SEL_head() && pred->rpo() >= rpo(); } 244 // Return the phi/region input index for the "current" pred, 245 // and bump the pred number. For historical reasons these index
|
H A D | superword.hpp | 81 DepEdge(DepMem* pred, DepMem* succ, DepEdge* next_in, DepEdge* next_out) : argument 82 _pred(pred), _succ(succ), _next_in(next_in), _next_out(next_out) {} 86 DepMem* pred() { return _pred; } function in class:DepEdge 142 DepEdge* make_edge(Node* pred, Node* succ) { return make_edge(dep(pred), dep(succ)); } argument 143 DepEdge* make_edge(DepMem* pred, Node* succ) { return make_edge(pred, dep(succ)); } argument 144 DepEdge* make_edge(Node* pred, DepMem* succ) { return make_edge(dep(pred), succ); } argument
|
H A D | gcm.cpp | 332 Block* pred = bbs[buse->pred(j)->_idx]; local 333 LCA = pred->dom_lca(LCA); 369 Block* mid_parent = bbs[ mid->pred(j)->_idx ]; 640 Block* pred_block = _bbs[store_block->pred(j)->_idx]; 1389 Block *pb = _bbs[root_blk->pred(i)->_idx]; 1398 Block *pb = _bbs[uct->pred(i)->_idx]; 1427 Block *pb = _bbs[root_blk->pred(i)->_idx]; 1436 Block *pb = _bbs[uct->pred(i)->_idx]; 1495 Node* tail_n = loop_head->pred(LoopNod 1556 Block* pred = node_to_blk[pred_n->_idx]; local [all...] |
H A D | loopopts.cpp | 1609 void PhaseIdealLoop::register_node(Node* n, IdealLoopTree *loop, Node* pred, int ddepth) { argument 1614 set_idom(n, pred, ddepth); 1616 set_ctrl(n, pred);
|
/openjdk7/jdk/src/share/native/sun/awt/image/jpeg/ |
H A D | jdcoefct.c | 483 int Al, pred; local 582 pred = (int) (((Q01<<7) + num) / (Q01<<8)); 583 if (Al > 0 && pred >= (1<<Al)) 584 pred = (1<<Al)-1; 586 pred = (int) (((Q01<<7) - num) / (Q01<<8)); 587 if (Al > 0 && pred >= (1<<Al)) 588 pred = (1<<Al)-1; 589 pred = -pred; 591 workspace[1] = (JCOEF) pred; [all...] |
/openjdk7/jdk/src/share/demo/applets/Fractal/ |
H A D | CLSFractal.java | 293 + "Sensitive\n L-System \n(pred, succ, lContext, rContext)." 310 { "pred", "String", 387 * (pred, succ, lContext, rContext) from the given java.applet.Applet's attributes. 403 String pred = app.getParameter("pred" + num); 405 if (pred == null || succ == null) { 408 rules.add(new CLSRule(pred, succ, 441 pos += rule.pred.length(); 463 * L-System (pred, succ, lContext, rContext). 471 String pred; field in class:CLSRule [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentLinkedDeque.java | 271 * - all live nodes are reachable from the last node via pred() 736 final Node<E> pred(Node<E> p) { method in class:ConcurrentLinkedDeque 944 for (Node<E> p = last(); p != null; p = pred(p)) { 978 for (Node<E> p = last(); p != null; p = pred(p)) { 1066 for (Node<E> p = last(); p != null; p = pred(p)) { 1387 Node<E> nextNode(Node<E> p) { return pred(p); }
|
H A D | LinkedTransferQueue.java | 640 Node pred = tryAppend(s, haveData); 641 if (pred == null) 644 return awaitMatch(s, pred, e, (how == TIMED), nanos); 689 * @param pred the predecessor of s, or s itself if it has no 697 private E awaitMatch(Node s, Node pred, E e, boolean timed, long nanos) { argument 712 unsplice(pred, s); 717 if ((spins = spinsFor(pred, s.isData)) > 0) 744 private static int spinsFor(Node pred, boolean haveData) { argument 745 if (MP && pred != null) { 746 if (pred 924 unsplice(Node pred, Node s) argument [all...] |
H A D | SynchronousQueue.java | 770 * Gets rid of cancelled node s with original predecessor pred. 772 void clean(QNode pred, QNode s) { argument 782 while (pred.next == s) { // Return early if already unlinked 801 if (sn == s || pred.casNext(s, sn)) 816 if (dp == pred) 818 } else if (casCleanMe(null, pred))
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/locks/ |
H A D | AbstractQueuedLongSynchronizer.java | 385 Node pred = tail; 386 if (pred != null) { 387 node.prev = pred; 388 if (compareAndSetTail(pred, node)) { 389 pred.next = node; 525 Node pred = node.prev; 526 while (pred.waitStatus > 0) 527 node.prev = pred = pred.prev; 532 Node predNext = pred 570 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
H A D | AbstractQueuedSynchronizer.java | 608 Node pred = tail; 609 if (pred != null) { 610 node.prev = pred; 611 if (compareAndSetTail(pred, node)) { 612 pred.next = node; 748 Node pred = node.prev; 749 while (pred.waitStatus > 0) 750 node.prev = pred = pred.prev; 755 Node predNext = pred 793 shouldParkAfterFailedAcquire(Node pred, Node node) argument [all...] |
/openjdk7/hotspot/src/share/vm/adlc/ |
H A D | archDesc.cpp | 274 Predicate *pred = op->_predicate; local 302 buildMatchList(op->_matrule, result, rootOp, pred, cost); 320 Predicate *pred = instr->build_predicate(); local 356 buildMatchList(instr->_matrule, result, mrule._machType, pred, cost); 489 const char *rootOp, Predicate *pred, 524 buildMList(mnode, rootOp, resultStr, pred, cost); 543 !_mlistab[index]->search(rootOp, resultStr, leftstr, rightstr, pred))) { 546 new MatchList(_mlistab[index], pred, cost, 554 const char *resultOp, Predicate *pred, 605 !_mlistab[index]->search(opcode, resultop, leftstr, rightstr, pred))) { 488 buildMatchList(MatchRule *mrule, const char *resultStr, const char *rootOp, Predicate *pred, const char *cost) argument 553 buildMList(MatchNode *node, const char *rootOp, const char *resultOp, Predicate *pred, const char *cost) argument [all...] |