1 /*
   2  * Copyright (c) 1997, 2015, 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  *

 200   void  remove_first();                          // remove the first stub in the queue
 201   void  remove_first(int n);                     // remove the first n stubs in the queue
 202   void  remove_all();                            // remove all stubs in the queue
 203 
 204   // Iteration
 205   static void queues_do(void f(StubQueue* s));   // call f with each StubQueue
 206   void  stubs_do(void f(Stub* s));               // call f with all stubs
 207   Stub* first() const                            { return number_of_stubs() > 0 ? stub_at(_queue_begin) : NULL; }
 208   Stub* next(Stub* s) const                      { int i = index_of(s) + stub_size(s);
 209                                                    if (i == _buffer_limit) i = 0;
 210                                                    return (i == _queue_end) ? NULL : stub_at(i);
 211                                                  }
 212 
 213   address stub_code_begin(Stub* s) const         { return _stub_interface->code_begin(s); }
 214   address stub_code_end(Stub* s) const           { return _stub_interface->code_end(s);   }
 215 
 216   // Debugging/printing
 217   void  verify();                                // verifies the stub queue
 218   void  print();                                 // prints information about the stub queue
 219 
 220   // Fixup for pregenerated code
 221   void fix_buffer(address buffer, address queue_end, address buffer_end, int number_of_stubs);
 222 };
 223 
 224 #endif // SHARE_VM_CODE_STUBS_HPP

   1 /*
   2  * Copyright (c) 1997, 2016, 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  *

 200   void  remove_first();                          // remove the first stub in the queue
 201   void  remove_first(int n);                     // remove the first n stubs in the queue
 202   void  remove_all();                            // remove all stubs in the queue
 203 
 204   // Iteration
 205   static void queues_do(void f(StubQueue* s));   // call f with each StubQueue
 206   void  stubs_do(void f(Stub* s));               // call f with all stubs
 207   Stub* first() const                            { return number_of_stubs() > 0 ? stub_at(_queue_begin) : NULL; }
 208   Stub* next(Stub* s) const                      { int i = index_of(s) + stub_size(s);
 209                                                    if (i == _buffer_limit) i = 0;
 210                                                    return (i == _queue_end) ? NULL : stub_at(i);
 211                                                  }
 212 
 213   address stub_code_begin(Stub* s) const         { return _stub_interface->code_begin(s); }
 214   address stub_code_end(Stub* s) const           { return _stub_interface->code_end(s);   }
 215 
 216   // Debugging/printing
 217   void  verify();                                // verifies the stub queue
 218   void  print();                                 // prints information about the stub queue
 219 


 220 };
 221 
 222 #endif // SHARE_VM_CODE_STUBS_HPP