1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 1.2 +++ b/src/share/vm/ci/ciConstantPoolCache.cpp Sat Dec 01 00:00:00 2007 +0000 1.3 @@ -0,0 +1,101 @@ 1.4 +/* 1.5 + * Copyright 1999 Sun Microsystems, Inc. All Rights Reserved. 1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 1.7 + * 1.8 + * This code is free software; you can redistribute it and/or modify it 1.9 + * under the terms of the GNU General Public License version 2 only, as 1.10 + * published by the Free Software Foundation. 1.11 + * 1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT 1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 1.15 + * version 2 for more details (a copy is included in the LICENSE file that 1.16 + * accompanied this code). 1.17 + * 1.18 + * You should have received a copy of the GNU General Public License version 1.19 + * 2 along with this work; if not, write to the Free Software Foundation, 1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 1.21 + * 1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or 1.24 + * have any questions. 1.25 + * 1.26 + */ 1.27 + 1.28 +#include "incls/_precompiled.incl" 1.29 +#include "incls/_ciConstantPoolCache.cpp.incl" 1.30 + 1.31 +// ciConstantPoolCache 1.32 +// 1.33 +// This class caches indexed constant pool lookups. 1.34 + 1.35 +// ------------------------------------------------------------------ 1.36 +// ciConstantPoolCache::ciConstantPoolCache 1.37 +ciConstantPoolCache::ciConstantPoolCache(Arena* arena, 1.38 + int expected_size) { 1.39 + _elements = 1.40 + new (arena) GrowableArray<void*>(arena, expected_size, 0, 0); 1.41 + _keys = new (arena) GrowableArray<intptr_t>(arena, expected_size, 0, 0); 1.42 +} 1.43 + 1.44 +// ------------------------------------------------------------------ 1.45 +// ciConstantPoolCache::get 1.46 +// 1.47 +// Get the entry at some index 1.48 +void* ciConstantPoolCache::get(int index) { 1.49 + ASSERT_IN_VM; 1.50 + int pos = find(index); 1.51 + if (pos >= _keys->length() || 1.52 + _keys->at(pos) != index) { 1.53 + // This element is not present in the cache. 1.54 + return NULL; 1.55 + } 1.56 + return _elements->at(pos); 1.57 +} 1.58 + 1.59 +// ------------------------------------------------------------------ 1.60 +// ciConstantPoolCache::find 1.61 +// 1.62 +// Use binary search to find the position of this index in the cache. 1.63 +// If there is no entry in the cache corresponding to this oop, return 1.64 +// the position at which the index would be inserted. 1.65 +int ciConstantPoolCache::find(int key) { 1.66 + int min = 0; 1.67 + int max = _keys->length()-1; 1.68 + 1.69 + while (max >= min) { 1.70 + int mid = (max + min) / 2; 1.71 + int value = _keys->at(mid); 1.72 + if (value < key) { 1.73 + min = mid + 1; 1.74 + } else if (value > key) { 1.75 + max = mid - 1; 1.76 + } else { 1.77 + return mid; 1.78 + } 1.79 + } 1.80 + return min; 1.81 +} 1.82 + 1.83 +// ------------------------------------------------------------------ 1.84 +// ciConstantPoolCache::insert 1.85 +// 1.86 +// Insert a ciObject into the table at some index. 1.87 +void ciConstantPoolCache::insert(int index, void* elem) { 1.88 + int i; 1.89 + int pos = find(index); 1.90 + for (i = _keys->length()-1; i >= pos; i--) { 1.91 + _keys->at_put_grow(i+1, _keys->at(i)); 1.92 + _elements->at_put_grow(i+1, _elements->at(i)); 1.93 + } 1.94 + _keys->at_put_grow(pos, index); 1.95 + _elements->at_put_grow(pos, elem); 1.96 +} 1.97 + 1.98 +// ------------------------------------------------------------------ 1.99 +// ciConstantPoolCache::print 1.100 +// 1.101 +// Print debugging information about the cache. 1.102 +void ciConstantPoolCache::print() { 1.103 + Unimplemented(); 1.104 +}