Mercurial > hg > truffle
comparison src/share/vm/opto/matcher.cpp @ 10405:f2110083203d
8005849: JEP 167: Event-Based JVM Tracing
Reviewed-by: acorn, coleenp, sla
Contributed-by: Karen Kinnear <karen.kinnear@oracle.com>, Bengt Rutisson <bengt.rutisson@oracle.com>, Calvin Cheung <calvin.cheung@oracle.com>, Erik Gahlin <erik.gahlin@oracle.com>, Erik Helin <erik.helin@oracle.com>, Jesper Wilhelmsson <jesper.wilhelmsson@oracle.com>, Keith McGuigan <keith.mcguigan@oracle.com>, Mattias Tobiasson <mattias.tobiasson@oracle.com>, Markus Gronlund <markus.gronlund@oracle.com>, Mikael Auno <mikael.auno@oracle.com>, Nils Eliasson <nils.eliasson@oracle.com>, Nils Loodin <nils.loodin@oracle.com>, Rickard Backman <rickard.backman@oracle.com>, Staffan Larsen <staffan.larsen@oracle.com>, Stefan Karlsson <stefan.karlsson@oracle.com>, Yekaterina Kantserova <yekaterina.kantserova@oracle.com>
author | sla |
---|---|
date | Mon, 10 Jun 2013 11:30:51 +0200 |
parents | 603ca7e51354 |
children | ac91879aa56f b5c8a61d7fa0 |
comparison
equal
deleted
inserted
replaced
10404:d0add7016434 | 10405:f2110083203d |
---|---|
1 /* | 1 /* |
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 1997, 2013, 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. |
315 // _shared[_idx] is cleared is guaranteed to not be shared, and thus | 315 // _shared[_idx] is cleared is guaranteed to not be shared, and thus |
316 // can be a valid interior of some tree. | 316 // can be a valid interior of some tree. |
317 find_shared( C->root() ); | 317 find_shared( C->root() ); |
318 find_shared( C->top() ); | 318 find_shared( C->top() ); |
319 | 319 |
320 C->print_method("Before Matching"); | 320 C->print_method(PHASE_BEFORE_MATCHING); |
321 | 321 |
322 // Create new ideal node ConP #NULL even if it does exist in old space | 322 // Create new ideal node ConP #NULL even if it does exist in old space |
323 // to avoid false sharing if the corresponding mach node is not used. | 323 // to avoid false sharing if the corresponding mach node is not used. |
324 // The corresponding mach node is only used in rare cases for derived | 324 // The corresponding mach node is only used in rare cases for derived |
325 // pointers. | 325 // pointers. |
1846 } | 1846 } |
1847 } | 1847 } |
1848 | 1848 |
1849 for( uint i=0; kid != NULL && i<2; kid = s->_kids[1], i++ ) { // binary tree | 1849 for( uint i=0; kid != NULL && i<2; kid = s->_kids[1], i++ ) { // binary tree |
1850 int newrule; | 1850 int newrule; |
1851 if( i == 0 ) | 1851 if( i == 0) |
1852 newrule = kid->_rule[_leftOp[rule]]; | 1852 newrule = kid->_rule[_leftOp[rule]]; |
1853 else | 1853 else |
1854 newrule = kid->_rule[_rightOp[rule]]; | 1854 newrule = kid->_rule[_rightOp[rule]]; |
1855 | 1855 |
1856 if( newrule < _LAST_MACH_OPER ) { // Operand or instruction? | 1856 if( newrule < _LAST_MACH_OPER ) { // Operand or instruction? |