Mercurial > jdk8-mips64-public > hotspot / file comparison
comparison: src/share/vm/opto/buildOopMap.cpp
src/share/vm/opto/buildOopMap.cpp
- changeset 9325
- 6ab57fe8b51f
- parent 6198
- 55fb97c4c58d
- child 9448
- 73d689add964
equal
deleted
inserted
replaced
| 9324:efdbe9b904ad | 9325:6ab57fe8b51f |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (c) 2002, 2013, Oracle and/or its affiliates. All rights reserved. | 2 * Copyright (c) 2002, 2018, 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. |
| 627 | 627 |
| 628 // If this block has a visited predecessor AND that predecessor has this | 628 // If this block has a visited predecessor AND that predecessor has this |
| 629 // last block as his only undone child, we can move the OopFlow from the | 629 // last block as his only undone child, we can move the OopFlow from the |
| 630 // pred to this block. Otherwise we have to grab a new OopFlow. | 630 // pred to this block. Otherwise we have to grab a new OopFlow. |
| 631 OopFlow *flow = NULL; // Flag for finding optimized flow | 631 OopFlow *flow = NULL; // Flag for finding optimized flow |
| 632 Block *pred = (Block*)0xdeadbeef; | 632 Block *pred = (Block*)((intptr_t)0xdeadbeef); |
| 633 // Scan this block's preds to find a done predecessor | 633 // Scan this block's preds to find a done predecessor |
| 634 for (uint j = 1; j < b->num_preds(); j++) { | 634 for (uint j = 1; j < b->num_preds(); j++) { |
| 635 Block* p = _cfg->get_block_for_node(b->pred(j)); | 635 Block* p = _cfg->get_block_for_node(b->pred(j)); |
| 636 OopFlow *p_flow = flows[p->_pre_order]; | 636 OopFlow *p_flow = flows[p->_pre_order]; |
| 637 if( p_flow ) { // Predecessor is done | 637 if( p_flow ) { // Predecessor is done |
