equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2000, 2017, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2000, 2019, 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. |
2082 } |
2082 } |
2083 |
2083 |
2084 // Dump a register name into a buffer. Be intelligent if we get called |
2084 // Dump a register name into a buffer. Be intelligent if we get called |
2085 // before allocation is complete. |
2085 // before allocation is complete. |
2086 char *PhaseChaitin::dump_register( const Node *n, char *buf ) const { |
2086 char *PhaseChaitin::dump_register( const Node *n, char *buf ) const { |
2087 if( this == NULL ) { // Not got anything? |
2087 if( _node_regs ) { |
2088 sprintf(buf,"N%d",n->_idx); // Then use Node index |
|
2089 } else if( _node_regs ) { |
|
2090 // Post allocation, use direct mappings, no LRG info available |
2088 // Post allocation, use direct mappings, no LRG info available |
2091 print_reg( get_reg_first(n), this, buf ); |
2089 print_reg( get_reg_first(n), this, buf ); |
2092 } else { |
2090 } else { |
2093 uint lidx = _lrg_map.find_const(n); // Grab LRG number |
2091 uint lidx = _lrg_map.find_const(n); // Grab LRG number |
2094 if( !_ifg ) { |
2092 if( !_ifg ) { |