1 /*
   2  * Copyright (c) 1999, 2010, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   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
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "ci/ciConstantPoolCache.hpp"
  27 #include "ci/ciUtilities.hpp"
  28 #include "memory/allocation.hpp"
  29 #include "memory/allocation.inline.hpp"
  30 
  31 // ciConstantPoolCache
  32 //
  33 // This class caches indexed constant pool lookups.
  34 
  35 // ------------------------------------------------------------------
  36 // ciConstantPoolCache::ciConstantPoolCache
  37 ciConstantPoolCache::ciConstantPoolCache(Arena* arena,
  38                                  int expected_size) {
  39   _elements =
  40     new (arena) GrowableArray<void*>(arena, expected_size, 0, 0);
  41   _keys = new (arena) GrowableArray<int>(arena, expected_size, 0, 0);
  42 }
  43 
  44 int ciConstantPoolCache::key_compare(const int& key, const int& elt) {
  45   if (key < elt)      return -1;
  46   else if (key > elt) return 1;
  47   else                  return 0;
  48 }
  49 
  50 // ------------------------------------------------------------------
  51 // ciConstantPoolCache::get
  52 //
  53 // Get the entry at some index
  54 void* ciConstantPoolCache::get(int index) {
  55   ASSERT_IN_VM;
  56   bool found = false;
  57   int pos = _keys->find_sorted<int, ciConstantPoolCache::key_compare>(index, found);
  58   if (!found) {
  59     // This element is not present in the cache.
  60     return NULL;
  61   }
  62   return _elements->at(pos);
  63 }
  64 
  65 // ------------------------------------------------------------------
  66 // ciConstantPoolCache::insert
  67 //
  68 // Insert a ciObject into the table at some index.
  69 void ciConstantPoolCache::insert(int index, void* elem) {
  70   bool found = false;
  71   int pos = _keys->find_sorted<int, ciConstantPoolCache::key_compare>(index, found);
  72   assert(!found, "duplicate");
  73   _keys->insert_before(pos, index);
  74   _elements->insert_before(pos, elem);
  75 }
  76 
  77 // ------------------------------------------------------------------
  78 // ciConstantPoolCache::print
  79 //
  80 // Print debugging information about the cache.
  81 void ciConstantPoolCache::print() {
  82   Unimplemented();
  83 }