< prev index next >

src/hotspot/share/oops/objArrayKlass.hpp

Print this page

*** 1,7 **** /* ! * Copyright (c) 1997, 2017, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 67,77 **** static ByteSize element_klass_offset() { return in_ByteSize(offset_of(ObjArrayKlass, _element_klass)); } // Dispatched operation bool can_be_primary_super_slow() const; GrowableArray<Klass*>* compute_secondary_supers(int num_extra_slots, ! Array<Klass*>* transitive_interfaces); bool compute_is_subtype_of(Klass* k); DEBUG_ONLY(bool is_objArray_klass_slow() const { return true; }) int oop_size(oop obj) const; // Allocation --- 67,77 ---- static ByteSize element_klass_offset() { return in_ByteSize(offset_of(ObjArrayKlass, _element_klass)); } // Dispatched operation bool can_be_primary_super_slow() const; GrowableArray<Klass*>* compute_secondary_supers(int num_extra_slots, ! Array<InstanceKlass*>* transitive_interfaces); bool compute_is_subtype_of(Klass* k); DEBUG_ONLY(bool is_objArray_klass_slow() const { return true; }) int oop_size(oop obj) const; // Allocation
< prev index next >