2362N/A * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved. 0N/A * Copyright 2008, 2009 Red Hat, Inc. 0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 0N/A * This code is free software; you can redistribute it and/or modify it 2362N/A * under the terms of the GNU General Public License version 2 only, as 0N/A * published by the Free Software Foundation. 0N/A * This code is distributed in the hope that it will be useful, but WITHOUT 0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 0N/A * version 2 for more details (a copy is included in the LICENSE file that 0N/A * accompanied this code). 0N/A * You should have received a copy of the GNU General Public License version 0N/A * 2 along with this work; if not, write to the Free Software Foundation, 0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 0N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 0N/A // Create the function 0N/A // Get our arguments 0N/A // Create the list of blocks 0N/A // Work around a bug in pre_order_at() that does not return 0N/A // the correct pre-ordering. If pre_order_at() were correct 0N/A // this line could simply be: 0N/A // _blocks[i] = new SharkTopLevelBlock(this, b); 0N/A // Walk the tree from the start block to determine which 0N/A // blocks are entered and which blocks require phis 0N/A // Initialize all entered blocks 0N/A // Create and push our stack frame 0N/A // Create the entry state 0N/A // Free the OSR buffer 0N/A // Lock if necessary 0N/A // Transition into the method proper