equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 1997, 2013, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
2620 assert(_cost[i] != max_juint, "cost must be a valid value"); |
2620 assert(_cost[i] != max_juint, "cost must be a valid value"); |
2621 assert(_rule[i] < _last_Mach_Node, "rule[i] must be valid rule"); |
2621 assert(_rule[i] < _last_Mach_Node, "rule[i] must be valid rule"); |
2622 tty->print_cr("%s %d %s", |
2622 tty->print_cr("%s %d %s", |
2623 ruleName[i], _cost[i], ruleName[_rule[i]] ); |
2623 ruleName[i], _cost[i], ruleName[_rule[i]] ); |
2624 } |
2624 } |
2625 tty->print_cr(""); |
2625 tty->cr(); |
2626 |
2626 |
2627 for( i=0; i<2; i++ ) |
2627 for( i=0; i<2; i++ ) |
2628 if( _kids[i] ) |
2628 if( _kids[i] ) |
2629 _kids[i]->dump(depth+1); |
2629 _kids[i]->dump(depth+1); |
2630 } |
2630 } |