Searched defs:pred (Results 26 - 32 of 32) sorted by relevance
12
/openjdk7/hotspot/src/share/vm/adlc/ |
H A D | dfa.cpp | 486 static bool valid_loc(char *pred, char *shared) { argument 488 if( shared == pred ) return true; 496 return dfa_shared_preds::valid_loc(pred, prev); 505 if( prev != pred && *(prev-1) == '|' ) return true; 507 if( prev != pred && *(prev-1) == '&' ) return true; 525 static const char* pred(int index) { check_index(index); return _pred[index]; } function in class:dfa_shared_preds 531 char* pred = mList->get_pred(); local 532 if( pred != NULL ) { 534 const char *shared_pred = dfa_shared_preds::pred(index); 547 char *pred local [all...] |
H A D | output_c.cpp | 638 fprintf(fp_cpp, "uint Pipeline::functional_unit_latency(uint start, const Pipeline *pred) const {\n"); 643 fprintf(fp_cpp, " tty->print(\"# functional_unit_latency: start == %%d, this->exclusively == 0x%%03x, pred->exclusively == 0x%%03x\\n\", start, resourcesUsedExclusively(), pred->resourcesUsedExclusively());\n"); 647 fprintf(fp_cpp, " uint mask = resourcesUsedExclusively() & pred->resourcesUsedExclusively();\n"); 656 fprintf(fp_cpp, " for (uint i = 0; i < pred->resourceUseCount(); i++) {\n"); 657 fprintf(fp_cpp, " const Pipeline_Use_Element *predUse = pred->resourceUseElement(i);\n"); 678 fprintf(fp_cpp, "uint Pipeline_Use::full_latency(uint delay, const Pipeline_Use &pred) const {\n"); 679 fprintf(fp_cpp, " for (uint i = 0; i < pred._count; i++) {\n"); 680 fprintf(fp_cpp, " const Pipeline_Use_Element *predUse = pred.element(i);\n"); 712 fprintf(fp_cpp, "void Pipeline_Use::add_usage(const Pipeline_Use &pred) {\ 4175 Predicate *pred = instr->build_predicate(); local [all...] |
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_IR.cpp | 634 BlockBegin* pred = cur->pred_at(j); local 636 if (!is_block_in_loop(loop_idx, pred) /*&& !pred->is_set(BlockBeginosr_entry_flag)*/) { 638 TRACE_LINEAR_SCAN(3, tty->print_cr(" pushing B%d", pred->block_id())); 639 _work_list.push(pred); 640 set_block_in_loop(loop_idx, pred); 987 BlockBegin* pred = cur->pred_at(j); local 988 tty->print("B%d ", pred->block_id()); 1044 BlockBegin* pred = cur->pred_at(j); local 1046 assert(pred [all...] |
H A D | c1_LinearScan.cpp | 1774 BlockBegin* pred = block->pred_at(0); local 1778 if (!block_completed.at(pred->linear_scan_number()) && !block_completed.at(sux->linear_scan_number())) { 1779 TRACE_LINEAR_SCAN(3, tty->print_cr("**** optimizing empty block B%d (pred: B%d, sux: B%d)", block->block_id(), pred->block_id(), sux->block_id())); 1782 // directly resolve between pred and sux (without looking at the empty block between) 1783 resolve_collect_mappings(pred, sux, move_resolver); 5904 BlockBegin* pred = block->pred_at(i); 5905 LIR_OpList* pred_instructions = pred->lir()->instructions_list(); 5907 if (pred->number_of_sux() != 1) { 5913 assert(pred [all...] |
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.hpp | 515 SuccIter(Block* pred) : _pred(pred), _index(-1), _succ(NULL) { next(); } argument 517 Block* pred() { return _pred; } // Return predecessor function in class:ciTypeFlow::SuccIter
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | loopnode.cpp | 1119 Node* pred = use_ctrl; local 1122 if ((pred->Opcode() == Op_IfTrue || pred->Opcode() == Op_IfFalse)) { 1124 const TypeInt* if_t = IfNode::filtered_int_type(&_igvn, val, pred); 1133 pred = idom(pred); 1134 if (pred == NULL || pred == C->top()) { 1138 if (dom_depth(pred) < val_dom_depth) {
|
H A D | superword.cpp | 725 Node* pred = preds.current(); local 726 if (in_bb(pred) && !visited_test(pred)) { 727 if (shallow == pred) { 730 if (shal_depth < depth(pred) && !independent_path(shallow, pred, dp+1)) { 1754 Node* pred = preds.current(); local 1755 if (in_bb(pred)) { 1756 d_in = MAX2(d_in, depth(pred)); 2457 Node* pred local [all...] |
Completed in 79 milliseconds
12