1564N/A * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. 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 0N/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. 1472N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 0N/A// ----------------------------------------------------------------------------------------- 0N/A// Implementation of VtableStub 0N/A // compute real VtableStub size (rounded to nearest word) 0N/A // malloc them in chunks to minimize header overhead 0N/A // Notify JVMTI about this stub. The event will be recorded by the enclosing 0N/A // JvmtiDynamicCodeEventCollector and posted when this thread has released 0N/A// ----------------------------------------------------------------------------------------- 0N/A// Implementation of VtableStubs 0N/A// For each hash value there's a linked list of vtable stubs (with that 0N/A// hash value). Each list is anchored in a little hash _table, indexed 0N/A// by that hash value. 0N/A for (
int i = 0; i < N; i++) {
0N/A // Assumption: receiver_location < 4 in most cases. 0N/A // enter s at the beginning of the corresponding list 0N/A // simple solution for now - we may want to use 0N/A // a faster way if this function is called often 0N/A // Note: No locking needed since any change to the data structure 0N/A // happens with an atomic store into it (we don't care about 0N/A // consistency with the _number_of_vtable_stubs counter). 0N/A for (
int i = 0; i < N; i++) {
0N/A//----------------------------------------------------------------------------------------------------- 1410N/A "index %d (vtable length %d)",