equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2000, 2017, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2000, 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. |
681 if( needs_phi || has_phi ) { |
681 if( needs_phi || has_phi ) { |
682 // add new phinode if one not already found |
682 // add new phinode if one not already found |
683 if( needs_phi ) { |
683 if( needs_phi ) { |
684 // create a new phi node and insert it into the block |
684 // create a new phi node and insert it into the block |
685 // type is taken from left over pointer to a predecessor |
685 // type is taken from left over pointer to a predecessor |
686 assert(n3,"No non-NULL reaching DEF for a Phi"); |
686 guarantee(n3, "No non-NULL reaching DEF for a Phi"); |
687 phi = new PhiNode(b->head(), n3->bottom_type()); |
687 phi = new PhiNode(b->head(), n3->bottom_type()); |
688 // initialize the Reaches entry for this LRG |
688 // initialize the Reaches entry for this LRG |
689 Reachblock[slidx] = phi; |
689 Reachblock[slidx] = phi; |
690 |
690 |
691 // add node to block & node_to_block mapping |
691 // add node to block & node_to_block mapping |