hotspot/src/share/vm/opto/library_call.cpp
author jrose
Tue, 21 Jul 2009 16:56:06 -0700
changeset 3273 6acf7084b1d3
parent 3268 f034e0c86895
child 3596 baa6856ba14e
permissions -rw-r--r--
6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics Summary: remove useless lazy evaluation of intrinsics; add LAST_COMPILER_INLINE to help categorize them Reviewed-by: kvn
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
2255
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
     2
 * Copyright 1999-2009 Sun Microsystems, Inc.  All Rights Reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
#include "incls/_library_call.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
class LibraryIntrinsic : public InlineCallGenerator {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
  // Extend the set of intrinsics known to the runtime:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
 private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
  bool             _is_virtual;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
  vmIntrinsics::ID _intrinsic_id;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
  LibraryIntrinsic(ciMethod* m, bool is_virtual, vmIntrinsics::ID id)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
    : InlineCallGenerator(m),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
      _is_virtual(is_virtual),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
      _intrinsic_id(id)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
  virtual bool is_intrinsic() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
  virtual bool is_virtual()   const { return _is_virtual; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  virtual JVMState* generate(JVMState* jvms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
  vmIntrinsics::ID intrinsic_id() const { return _intrinsic_id; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
// Local helper class for LibraryIntrinsic:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
class LibraryCallKit : public GraphKit {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
 private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
  LibraryIntrinsic* _intrinsic;   // the library intrinsic being called
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
  LibraryCallKit(JVMState* caller, LibraryIntrinsic* intrinsic)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
    : GraphKit(caller),
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
      _intrinsic(intrinsic)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
  ciMethod*         caller()    const    { return jvms()->method(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
  int               bci()       const    { return jvms()->bci(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
  LibraryIntrinsic* intrinsic() const    { return _intrinsic; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
  vmIntrinsics::ID  intrinsic_id() const { return _intrinsic->intrinsic_id(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  ciMethod*         callee()    const    { return _intrinsic->method(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
  ciSignature*      signature() const    { return callee()->signature(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
  int               arg_size()  const    { return callee()->arg_size(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
  bool try_to_inline();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
  // Helper functions to inline natives
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
  void push_result(RegionNode* region, PhiNode* value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  Node* generate_guard(Node* test, RegionNode* region, float true_prob);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
  Node* generate_slow_guard(Node* test, RegionNode* region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
  Node* generate_fair_guard(Node* test, RegionNode* region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  Node* generate_negative_guard(Node* index, RegionNode* region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
                                // resulting CastII of index:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
                                Node* *pos_index = NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  Node* generate_nonpositive_guard(Node* index, bool never_negative,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
                                   // resulting CastII of index:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
                                   Node* *pos_index = NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
  Node* generate_limit_guard(Node* offset, Node* subseq_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
                             Node* array_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
                             RegionNode* region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  Node* generate_current_thread(Node* &tls_output);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
  address basictype2arraycopy(BasicType t, Node *src_offset, Node *dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
                              bool disjoint_bases, const char* &name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  Node* load_mirror_from_klass(Node* klass);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
                                      int nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
                                      RegionNode* region, int null_path,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
                                      int offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
  Node* load_klass_from_mirror(Node* mirror, bool never_see_null, int nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
                               RegionNode* region, int null_path) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
    int offset = java_lang_Class::klass_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
    return load_klass_from_mirror_common(mirror, never_see_null, nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
                                         region, null_path,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
                                         offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
  Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
                                     int nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
                                     RegionNode* region, int null_path) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
    int offset = java_lang_Class::array_klass_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
    return load_klass_from_mirror_common(mirror, never_see_null, nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
                                         region, null_path,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
                                         offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
  Node* generate_access_flags_guard(Node* kls,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
                                    int modifier_mask, int modifier_bits,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
                                    RegionNode* region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
  Node* generate_interface_guard(Node* kls, RegionNode* region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
  Node* generate_array_guard(Node* kls, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
    return generate_array_guard_common(kls, region, false, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  Node* generate_non_array_guard(Node* kls, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
    return generate_array_guard_common(kls, region, false, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
  Node* generate_objArray_guard(Node* kls, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
    return generate_array_guard_common(kls, region, true, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  Node* generate_non_objArray_guard(Node* kls, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
    return generate_array_guard_common(kls, region, true, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  Node* generate_array_guard_common(Node* kls, RegionNode* region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
                                    bool obj_array, bool not_array);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  CallJavaNode* generate_method_call(vmIntrinsics::ID method_id,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
                                     bool is_virtual = false, bool is_static = false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
  CallJavaNode* generate_method_call_static(vmIntrinsics::ID method_id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
    return generate_method_call(method_id, false, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  CallJavaNode* generate_method_call_virtual(vmIntrinsics::ID method_id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
    return generate_method_call(method_id, true, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  bool inline_string_compareTo();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
  bool inline_string_indexOf();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
  Node* string_indexOf(Node* string_object, ciTypeArray* target_array, jint offset, jint cache_i, jint md2_i);
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   139
  bool inline_string_equals();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
  Node* pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
  bool runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
  bool inline_math_native(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
  bool inline_trig(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  bool inline_trans(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
  bool inline_abs(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
  bool inline_sqrt(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
  bool inline_pow(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
  bool inline_exp(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
  bool inline_min_max(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
  Node* generate_min_max(vmIntrinsics::ID id, Node* x, Node* y);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  // This returns Type::AnyPtr, RawPtr, or OopPtr.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
  int classify_unsafe_addr(Node* &base, Node* &offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
  Node* make_unsafe_address(Node* base, Node* offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  bool inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
  bool inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
  bool inline_unsafe_allocate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
  bool inline_unsafe_copyMemory();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
  bool inline_native_currentThread();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
  bool inline_native_time_funcs(bool isNano);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
  bool inline_native_isInterrupted();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
  bool inline_native_Class_query(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
  bool inline_native_subtype_check();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  bool inline_native_newArray();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  bool inline_native_getLength();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
  bool inline_array_copyOf(bool is_copyOfRange);
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   167
  bool inline_array_equals();
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
   168
  void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
  bool inline_native_clone(bool is_virtual);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
  bool inline_native_Reflection_getCallerClass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
  bool inline_native_AtomicLong_get();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
  bool inline_native_AtomicLong_attemptUpdate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
  bool is_method_invoke_or_aux_frame(JVMState* jvms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
  // Helper function for inlining native object hash method
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
  bool inline_native_hashcode(bool is_virtual, bool is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
  bool inline_native_getClass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
  // Helper functions for inlining arraycopy
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
  bool inline_arraycopy();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
  void generate_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
                          BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
                          Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
                          Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
                          Node* copy_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
                          bool disjoint_bases = false,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
                          bool length_never_negative = false,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
                          RegionNode* slow_region = NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
  AllocateArrayNode* tightly_coupled_allocation(Node* ptr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
                                                RegionNode* slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
  void generate_clear_array(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
                            Node* dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
                            BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
                            Node* slice_off,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
                            Node* slice_len,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
                            Node* slice_end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
  bool generate_block_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
                                BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
                                AllocateNode* alloc,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
                                Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
                                Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
                                Node* dest_size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
  void generate_slow_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
                               Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
                               Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
   205
                               Node* copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  Node* generate_checkcast_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
                                     Node* dest_elem_klass,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
                                     Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
                                     Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
   210
                                     Node* copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  Node* generate_generic_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
                                   Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
                                   Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
   214
                                   Node* copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
  void generate_unchecked_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
                                    BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
                                    bool disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
                                    Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
                                    Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
                                    Node* copy_length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
  bool inline_unsafe_CAS(BasicType type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  bool inline_unsafe_ordered_store(BasicType type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
  bool inline_fp_conversions(vmIntrinsics::ID id);
2862
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   224
  bool inline_numberOfLeadingZeros(vmIntrinsics::ID id);
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   225
  bool inline_numberOfTrailingZeros(vmIntrinsics::ID id);
2255
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   226
  bool inline_bitCount(vmIntrinsics::ID id);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  bool inline_reverseBytes(vmIntrinsics::ID id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
//---------------------------make_vm_intrinsic----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
  vmIntrinsics::ID id = m->intrinsic_id();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
  assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
  if (DisableIntrinsic[0] != '\0'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
      && strstr(DisableIntrinsic, vmIntrinsics::name_at(id)) != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
    // disabled by a user request on the command line:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
    // example: -XX:DisableIntrinsic=_hashCode,_getClass
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
  if (!m->is_loaded()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
    // do not attempt to inline unloaded methods
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
  // Only a few intrinsics implement a virtual dispatch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
  // They are expensive calls which are also frequently overridden.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
  if (is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
    switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
    case vmIntrinsics::_hashCode:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
    case vmIntrinsics::_clone:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
      // OK, Object.hashCode and Object.clone intrinsics come in both flavors
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
  // -XX:-InlineNatives disables nearly all intrinsics:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
  if (!InlineNatives) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
    switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
    case vmIntrinsics::_indexOf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
    case vmIntrinsics::_compareTo:
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   266
    case vmIntrinsics::_equals:
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   267
    case vmIntrinsics::_equalsC:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
      break;  // InlineNatives does not control String.compareTo
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  case vmIntrinsics::_compareTo:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
    if (!SpecialStringCompareTo)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
  case vmIntrinsics::_indexOf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
    if (!SpecialStringIndexOf)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
    break;
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   281
  case vmIntrinsics::_equals:
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   282
    if (!SpecialStringEquals)  return NULL;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   283
    break;
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   284
  case vmIntrinsics::_equalsC:
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   285
    if (!SpecialArraysEquals)  return NULL;
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   286
    break;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  case vmIntrinsics::_arraycopy:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
    if (!InlineArrayCopy)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  case vmIntrinsics::_copyMemory:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
    if (StubRoutines::unsafe_arraycopy() == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
    if (!InlineArrayCopy)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
  case vmIntrinsics::_hashCode:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
    if (!InlineObjectHash)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
  case vmIntrinsics::_clone:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  case vmIntrinsics::_copyOf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  case vmIntrinsics::_copyOfRange:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
    if (!InlineObjectCopy)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
    // These also use the arraycopy intrinsic mechanism:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
    if (!InlineArrayCopy)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
  case vmIntrinsics::_checkIndex:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
    // We do not intrinsify this.  The optimizer does fine with it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  case vmIntrinsics::_get_AtomicLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
  case vmIntrinsics::_attemptUpdate:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
    if (!InlineAtomicLong)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  case vmIntrinsics::_getCallerClass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
    if (!UseNewReflection)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
    if (!InlineReflectionGetCallerClass)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
    if (!JDK_Version::is_gte_jdk14x_version())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
2255
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   319
  case vmIntrinsics::_bitCount_i:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   320
  case vmIntrinsics::_bitCount_l:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   321
    if (!UsePopCountInstruction)  return NULL;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   322
    break;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   323
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
 default:
3273
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   325
    assert(id <= vmIntrinsics::LAST_COMPILER_INLINE, "caller responsibility");
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   326
    assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  // -XX:-InlineClassNatives disables natives from the Class class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
  // The flag applies to all reflective calls, notably Array.newArray
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  // (visible to Java programmers as Array.newInstance).
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
  if (m->holder()->name() == ciSymbol::java_lang_Class() ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
      m->holder()->name() == ciSymbol::java_lang_reflect_Array()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
    if (!InlineClassNatives)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
  // -XX:-InlineThreadNatives disables natives from the Thread class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
  if (m->holder()->name() == ciSymbol::java_lang_Thread()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
    if (!InlineThreadNatives)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  // -XX:-InlineMathNatives disables natives from the Math,Float and Double classes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
  if (m->holder()->name() == ciSymbol::java_lang_Math() ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
      m->holder()->name() == ciSymbol::java_lang_Float() ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
      m->holder()->name() == ciSymbol::java_lang_Double()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
    if (!InlineMathNatives)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  // -XX:-InlineUnsafeOps disables natives from the Unsafe class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
  if (m->holder()->name() == ciSymbol::sun_misc_Unsafe()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
    if (!InlineUnsafeOps)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
  return new LibraryIntrinsic(m, is_virtual, (vmIntrinsics::ID) id);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
//----------------------register_library_intrinsics-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
// Initialize this file's data structures, for each Compile instance.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
void Compile::register_library_intrinsics() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  // Nothing to do here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
JVMState* LibraryIntrinsic::generate(JVMState* jvms) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
  LibraryCallKit kit(jvms, this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
  Compile* C = kit.C;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  int nodes = C->unique();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   369
  if ((PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    char buf[1000];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    tty->print_cr("Intrinsic %s", str);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   374
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
  if (kit.try_to_inline()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    if (PrintIntrinsics || PrintInlining NOT_PRODUCT( || PrintOptoInlining) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
      tty->print("Inlining intrinsic %s%s at bci:%d in",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
                 vmIntrinsics::name_at(intrinsic_id()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
                 (is_virtual() ? " (virtual)" : ""), kit.bci());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   380
      kit.caller()->print_short_name(tty);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
      tty->print_cr(" (%d bytes)", kit.caller()->code_size());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
    C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
    if (C->log()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
      C->log()->elem("intrinsic id='%s'%s nodes='%d'",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
                     vmIntrinsics::name_at(intrinsic_id()),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   387
                     (is_virtual() ? " virtual='1'" : ""),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
                     C->unique() - nodes);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
    return kit.transfer_exceptions_into_jvms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
  if (PrintIntrinsics) {
3273
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   394
    tty->print("Did not inline intrinsic %s%s at bci:%d in",
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   395
               vmIntrinsics::name_at(intrinsic_id()),
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   396
               (is_virtual() ? " (virtual)" : ""), kit.bci());
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   397
    kit.caller()->print_short_name(tty);
6acf7084b1d3 6862576: vmIntrinsics needs cleanup in order to support JSR 292 intrinsics
jrose
parents: 3268
diff changeset
   398
    tty->print_cr(" (%d bytes)", kit.caller()->code_size());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
  C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
bool LibraryCallKit::try_to_inline() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
  // Handle symbolic names for otherwise undistinguished boolean switches:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
  const bool is_store       = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
  const bool is_native_ptr  = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
  const bool is_static      = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
  switch (intrinsic_id()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
  case vmIntrinsics::_hashCode:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
    return inline_native_hashcode(intrinsic()->is_virtual(), !is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
  case vmIntrinsics::_identityHashCode:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
    return inline_native_hashcode(/*!virtual*/ false, is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
  case vmIntrinsics::_getClass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
    return inline_native_getClass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
  case vmIntrinsics::_dsin:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  case vmIntrinsics::_dcos:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   420
  case vmIntrinsics::_dtan:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
  case vmIntrinsics::_dabs:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
  case vmIntrinsics::_datan2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
  case vmIntrinsics::_dsqrt:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
  case vmIntrinsics::_dexp:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
  case vmIntrinsics::_dlog:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
  case vmIntrinsics::_dlog10:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
  case vmIntrinsics::_dpow:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
    return inline_math_native(intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
  case vmIntrinsics::_min:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
  case vmIntrinsics::_max:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
    return inline_min_max(intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
  case vmIntrinsics::_arraycopy:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
    return inline_arraycopy();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  case vmIntrinsics::_compareTo:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
    return inline_string_compareTo();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  case vmIntrinsics::_indexOf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
    return inline_string_indexOf();
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   441
  case vmIntrinsics::_equals:
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   442
    return inline_string_equals();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
  case vmIntrinsics::_getObject:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
    return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
  case vmIntrinsics::_getBoolean:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
    return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
  case vmIntrinsics::_getByte:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
    return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
  case vmIntrinsics::_getShort:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
    return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
  case vmIntrinsics::_getChar:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
    return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  case vmIntrinsics::_getInt:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
    return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  case vmIntrinsics::_getLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
    return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
  case vmIntrinsics::_getFloat:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
    return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
  case vmIntrinsics::_getDouble:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
    return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
  case vmIntrinsics::_putObject:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
    return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
  case vmIntrinsics::_putBoolean:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
    return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  case vmIntrinsics::_putByte:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
    return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  case vmIntrinsics::_putShort:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
    return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
  case vmIntrinsics::_putChar:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
    return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
  case vmIntrinsics::_putInt:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
    return inline_unsafe_access(!is_native_ptr, is_store, T_INT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
  case vmIntrinsics::_putLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
    return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
  case vmIntrinsics::_putFloat:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
    return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
  case vmIntrinsics::_putDouble:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
    return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
  case vmIntrinsics::_getByte_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
    return inline_unsafe_access(is_native_ptr, !is_store, T_BYTE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
  case vmIntrinsics::_getShort_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
    return inline_unsafe_access(is_native_ptr, !is_store, T_SHORT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  case vmIntrinsics::_getChar_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
    return inline_unsafe_access(is_native_ptr, !is_store, T_CHAR, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
  case vmIntrinsics::_getInt_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
    return inline_unsafe_access(is_native_ptr, !is_store, T_INT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
  case vmIntrinsics::_getLong_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
    return inline_unsafe_access(is_native_ptr, !is_store, T_LONG, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
  case vmIntrinsics::_getFloat_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
    return inline_unsafe_access(is_native_ptr, !is_store, T_FLOAT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
  case vmIntrinsics::_getDouble_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
    return inline_unsafe_access(is_native_ptr, !is_store, T_DOUBLE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
  case vmIntrinsics::_getAddress_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
    return inline_unsafe_access(is_native_ptr, !is_store, T_ADDRESS, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  case vmIntrinsics::_putByte_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
    return inline_unsafe_access(is_native_ptr, is_store, T_BYTE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
  case vmIntrinsics::_putShort_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
    return inline_unsafe_access(is_native_ptr, is_store, T_SHORT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
  case vmIntrinsics::_putChar_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
    return inline_unsafe_access(is_native_ptr, is_store, T_CHAR, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
  case vmIntrinsics::_putInt_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
    return inline_unsafe_access(is_native_ptr, is_store, T_INT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
  case vmIntrinsics::_putLong_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
    return inline_unsafe_access(is_native_ptr, is_store, T_LONG, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
  case vmIntrinsics::_putFloat_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
    return inline_unsafe_access(is_native_ptr, is_store, T_FLOAT, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
  case vmIntrinsics::_putDouble_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
    return inline_unsafe_access(is_native_ptr, is_store, T_DOUBLE, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
  case vmIntrinsics::_putAddress_raw:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
    return inline_unsafe_access(is_native_ptr, is_store, T_ADDRESS, false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  case vmIntrinsics::_getObjectVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
    return inline_unsafe_access(!is_native_ptr, !is_store, T_OBJECT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  case vmIntrinsics::_getBooleanVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
    return inline_unsafe_access(!is_native_ptr, !is_store, T_BOOLEAN, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  case vmIntrinsics::_getByteVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
    return inline_unsafe_access(!is_native_ptr, !is_store, T_BYTE, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
  case vmIntrinsics::_getShortVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
    return inline_unsafe_access(!is_native_ptr, !is_store, T_SHORT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
  case vmIntrinsics::_getCharVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
    return inline_unsafe_access(!is_native_ptr, !is_store, T_CHAR, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
  case vmIntrinsics::_getIntVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
    return inline_unsafe_access(!is_native_ptr, !is_store, T_INT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
  case vmIntrinsics::_getLongVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
    return inline_unsafe_access(!is_native_ptr, !is_store, T_LONG, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  case vmIntrinsics::_getFloatVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
    return inline_unsafe_access(!is_native_ptr, !is_store, T_FLOAT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  case vmIntrinsics::_getDoubleVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
    return inline_unsafe_access(!is_native_ptr, !is_store, T_DOUBLE, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   534
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  case vmIntrinsics::_putObjectVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
    return inline_unsafe_access(!is_native_ptr, is_store, T_OBJECT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  case vmIntrinsics::_putBooleanVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
    return inline_unsafe_access(!is_native_ptr, is_store, T_BOOLEAN, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
  case vmIntrinsics::_putByteVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
    return inline_unsafe_access(!is_native_ptr, is_store, T_BYTE, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
  case vmIntrinsics::_putShortVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
    return inline_unsafe_access(!is_native_ptr, is_store, T_SHORT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  case vmIntrinsics::_putCharVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
    return inline_unsafe_access(!is_native_ptr, is_store, T_CHAR, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
  case vmIntrinsics::_putIntVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
    return inline_unsafe_access(!is_native_ptr, is_store, T_INT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  case vmIntrinsics::_putLongVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
    return inline_unsafe_access(!is_native_ptr, is_store, T_LONG, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  case vmIntrinsics::_putFloatVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
    return inline_unsafe_access(!is_native_ptr, is_store, T_FLOAT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
  case vmIntrinsics::_putDoubleVolatile:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
    return inline_unsafe_access(!is_native_ptr, is_store, T_DOUBLE, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
  case vmIntrinsics::_prefetchRead:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
    return inline_unsafe_prefetch(!is_native_ptr, !is_store, !is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
  case vmIntrinsics::_prefetchWrite:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
    return inline_unsafe_prefetch(!is_native_ptr, is_store, !is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
  case vmIntrinsics::_prefetchReadStatic:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
    return inline_unsafe_prefetch(!is_native_ptr, !is_store, is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
  case vmIntrinsics::_prefetchWriteStatic:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
    return inline_unsafe_prefetch(!is_native_ptr, is_store, is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
  case vmIntrinsics::_compareAndSwapObject:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
    return inline_unsafe_CAS(T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
  case vmIntrinsics::_compareAndSwapInt:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
    return inline_unsafe_CAS(T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
  case vmIntrinsics::_compareAndSwapLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
    return inline_unsafe_CAS(T_LONG);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  case vmIntrinsics::_putOrderedObject:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
    return inline_unsafe_ordered_store(T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
  case vmIntrinsics::_putOrderedInt:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
    return inline_unsafe_ordered_store(T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
  case vmIntrinsics::_putOrderedLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
    return inline_unsafe_ordered_store(T_LONG);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  case vmIntrinsics::_currentThread:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
    return inline_native_currentThread();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
  case vmIntrinsics::_isInterrupted:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
    return inline_native_isInterrupted();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
  case vmIntrinsics::_currentTimeMillis:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
    return inline_native_time_funcs(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
  case vmIntrinsics::_nanoTime:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
    return inline_native_time_funcs(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
  case vmIntrinsics::_allocateInstance:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
    return inline_unsafe_allocate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
  case vmIntrinsics::_copyMemory:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
    return inline_unsafe_copyMemory();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
  case vmIntrinsics::_newArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
    return inline_native_newArray();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
  case vmIntrinsics::_getLength:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
    return inline_native_getLength();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
  case vmIntrinsics::_copyOf:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
    return inline_array_copyOf(false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
  case vmIntrinsics::_copyOfRange:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
    return inline_array_copyOf(true);
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   598
  case vmIntrinsics::_equalsC:
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   599
    return inline_array_equals();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
  case vmIntrinsics::_clone:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
    return inline_native_clone(intrinsic()->is_virtual());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
  case vmIntrinsics::_isAssignableFrom:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
    return inline_native_subtype_check();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
  case vmIntrinsics::_isInstance:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
  case vmIntrinsics::_getModifiers:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
  case vmIntrinsics::_isInterface:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
  case vmIntrinsics::_isArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
  case vmIntrinsics::_isPrimitive:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
  case vmIntrinsics::_getSuperclass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  case vmIntrinsics::_getComponentType:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
  case vmIntrinsics::_getClassAccessFlags:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
    return inline_native_Class_query(intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
  case vmIntrinsics::_floatToRawIntBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
  case vmIntrinsics::_floatToIntBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
  case vmIntrinsics::_intBitsToFloat:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  case vmIntrinsics::_doubleToRawLongBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
  case vmIntrinsics::_doubleToLongBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
  case vmIntrinsics::_longBitsToDouble:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
    return inline_fp_conversions(intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
2862
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   624
  case vmIntrinsics::_numberOfLeadingZeros_i:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   625
  case vmIntrinsics::_numberOfLeadingZeros_l:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   626
    return inline_numberOfLeadingZeros(intrinsic_id());
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   627
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   628
  case vmIntrinsics::_numberOfTrailingZeros_i:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   629
  case vmIntrinsics::_numberOfTrailingZeros_l:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   630
    return inline_numberOfTrailingZeros(intrinsic_id());
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
   631
2255
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   632
  case vmIntrinsics::_bitCount_i:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   633
  case vmIntrinsics::_bitCount_l:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   634
    return inline_bitCount(intrinsic_id());
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
   635
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   636
  case vmIntrinsics::_reverseBytes_i:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   637
  case vmIntrinsics::_reverseBytes_l:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   638
    return inline_reverseBytes((vmIntrinsics::ID) intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   639
489c9b5090e2 Initial load
duke
parents:
diff changeset
   640
  case vmIntrinsics::_get_AtomicLong:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   641
    return inline_native_AtomicLong_get();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   642
  case vmIntrinsics::_attemptUpdate:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   643
    return inline_native_AtomicLong_attemptUpdate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   644
489c9b5090e2 Initial load
duke
parents:
diff changeset
   645
  case vmIntrinsics::_getCallerClass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   646
    return inline_native_Reflection_getCallerClass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   647
489c9b5090e2 Initial load
duke
parents:
diff changeset
   648
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   649
    // If you get here, it may be that someone has added a new intrinsic
489c9b5090e2 Initial load
duke
parents:
diff changeset
   650
    // to the list in vmSymbols.hpp without implementing it here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   651
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   652
    if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   653
      tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   654
                    vmIntrinsics::name_at(intrinsic_id()), intrinsic_id());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   655
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   656
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   657
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   658
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   659
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   660
489c9b5090e2 Initial load
duke
parents:
diff changeset
   661
//------------------------------push_result------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   662
// Helper function for finishing intrinsics.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   663
void LibraryCallKit::push_result(RegionNode* region, PhiNode* value) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   664
  record_for_igvn(region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   665
  set_control(_gvn.transform(region));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   666
  BasicType value_type = value->type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   667
  push_node(value_type, _gvn.transform(value));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   668
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   669
489c9b5090e2 Initial load
duke
parents:
diff changeset
   670
//------------------------------generate_guard---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   671
// Helper function for generating guarded fast-slow graph structures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   672
// The given 'test', if true, guards a slow path.  If the test fails
489c9b5090e2 Initial load
duke
parents:
diff changeset
   673
// then a fast path can be taken.  (We generally hope it fails.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   674
// In all cases, GraphKit::control() is updated to the fast path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   675
// The returned value represents the control for the slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   676
// The return value is never 'top'; it is either a valid control
489c9b5090e2 Initial load
duke
parents:
diff changeset
   677
// or NULL if it is obvious that the slow path can never be taken.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   678
// Also, if region and the slow control are not NULL, the slow edge
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
// is appended to the region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
    // Already short circuited.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
  // Build an if node and its projections.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
  // If test is true we take the slow path, which we assume is uncommon.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  if (_gvn.type(test) == TypeInt::ZERO) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
    // The slow branch is never taken.  No need to build this guard.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
  IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
  Node* if_slow = _gvn.transform( new (C, 1) IfTrueNode(iff) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
  if (if_slow == top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
    // The slow branch is never taken.  No need to build this guard.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
  if (region != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
    region->add_req(if_slow);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  Node* if_fast = _gvn.transform( new (C, 1) IfFalseNode(iff) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
  set_control(if_fast);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
  return if_slow;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
  return generate_guard(test, region, PROB_UNLIKELY_MAG(3));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
  return generate_guard(test, region, PROB_FAIR);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
                                                     Node* *pos_index) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
  if (stopped())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
    return NULL;                // already stopped
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
  if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
    return NULL;                // index is already adequately typed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
  Node* cmp_lt = _gvn.transform( new (C, 3) CmpINode(index, intcon(0)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
  Node* bol_lt = _gvn.transform( new (C, 2) BoolNode(cmp_lt, BoolTest::lt) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
  Node* is_neg = generate_guard(bol_lt, region, PROB_MIN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
  if (is_neg != NULL && pos_index != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
    // Emulate effect of Parse::adjust_map_after_if.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
    Node* ccast = new (C, 2) CastIINode(index, TypeInt::POS);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
    ccast->set_req(0, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
    (*pos_index) = _gvn.transform(ccast);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
  return is_neg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
inline Node* LibraryCallKit::generate_nonpositive_guard(Node* index, bool never_negative,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
                                                        Node* *pos_index) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
  if (stopped())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
    return NULL;                // already stopped
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
  if (_gvn.type(index)->higher_equal(TypeInt::POS1)) // [1,maxint]
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
    return NULL;                // index is already adequately typed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
  Node* cmp_le = _gvn.transform( new (C, 3) CmpINode(index, intcon(0)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
  BoolTest::mask le_or_eq = (never_negative ? BoolTest::eq : BoolTest::le);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
  Node* bol_le = _gvn.transform( new (C, 2) BoolNode(cmp_le, le_or_eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
  Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
  if (is_notp != NULL && pos_index != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
    // Emulate effect of Parse::adjust_map_after_if.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
    Node* ccast = new (C, 2) CastIINode(index, TypeInt::POS1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
    ccast->set_req(0, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
    (*pos_index) = _gvn.transform(ccast);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
  return is_notp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
// Make sure that 'position' is a valid limit index, in [0..length].
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
// There are two equivalent plans for checking this:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
//   A. (offset + copyLength)  unsigned<=  arrayLength
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
//   B. offset  <=  (arrayLength - copyLength)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
// We require that all of the values above, except for the sum and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
// difference, are already known to be non-negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
// Plan A is robust in the face of overflow, if offset and copyLength
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
// are both hugely positive.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
// Plan B is less direct and intuitive, but it does not overflow at
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
// all, since the difference of two non-negatives is always
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
// representable.  Whenever Java methods must perform the equivalent
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
// check they generally use Plan B instead of Plan A.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
// For the moment we use Plan A.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
inline Node* LibraryCallKit::generate_limit_guard(Node* offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
                                                  Node* subseq_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
                                                  Node* array_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
                                                  RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
  if (stopped())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
    return NULL;                // already stopped
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
  bool zero_offset = _gvn.type(offset) == TypeInt::ZERO;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
  if (zero_offset && _gvn.eqv_uncast(subseq_length, array_length))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
    return NULL;                // common case of whole-array copy
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
  Node* last = subseq_length;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
  if (!zero_offset)             // last += offset
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
    last = _gvn.transform( new (C, 3) AddINode(last, offset));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
  Node* cmp_lt = _gvn.transform( new (C, 3) CmpUNode(array_length, last) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
  Node* bol_lt = _gvn.transform( new (C, 2) BoolNode(cmp_lt, BoolTest::lt) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
  Node* is_over = generate_guard(bol_lt, region, PROB_MIN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
  return is_over;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
//--------------------------generate_current_thread--------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
Node* LibraryCallKit::generate_current_thread(Node* &tls_output) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
  ciKlass*    thread_klass = env()->Thread_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
  const Type* thread_type  = TypeOopPtr::make_from_klass(thread_klass)->cast_to_ptr_type(TypePtr::NotNull);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
  Node* thread = _gvn.transform(new (C, 1) ThreadLocalNode());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
  Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset()));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
  Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
  tls_output = thread;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
  return threadObj;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
//------------------------------inline_string_compareTo------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
bool LibraryCallKit::inline_string_compareTo() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   802
  if (!Matcher::has_match_rule(Op_StrComp)) return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   803
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
  const int value_offset = java_lang_String::value_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
  const int count_offset = java_lang_String::count_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
  const int offset_offset = java_lang_String::offset_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
  _sp += 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
  Node *argument = pop();  // pop non-receiver first:  it was pushed second
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
  Node *receiver = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
  // Null check on self without removing any arguments.  The argument
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
  // null check technically happens in the wrong place, which can lead to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
  // invalid stack traces when string compare is inlined into a method
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
  // which handles NullPointerExceptions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
  _sp += 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
  receiver = do_null_check(receiver, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
  argument = do_null_check(argument, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
  _sp -= 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
  ciInstanceKlass* klass = env()->String_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
  const TypeInstPtr* string_type =
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
    TypeInstPtr::make(TypePtr::BotPTR, klass, false, NULL, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
  Node* compare =
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
    _gvn.transform(new (C, 7) StrCompNode(
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
                        control(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
                        memory(TypeAryPtr::CHARS),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   832
                        memory(string_type->add_offset(value_offset)),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
                        memory(string_type->add_offset(count_offset)),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
                        memory(string_type->add_offset(offset_offset)),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
                        receiver,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
                        argument));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
  push(compare);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   841
//------------------------------inline_string_equals------------------------
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   842
bool LibraryCallKit::inline_string_equals() {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   843
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   844
  if (!Matcher::has_match_rule(Op_StrEquals)) return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   845
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   846
  const int value_offset = java_lang_String::value_offset_in_bytes();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   847
  const int count_offset = java_lang_String::count_offset_in_bytes();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   848
  const int offset_offset = java_lang_String::offset_offset_in_bytes();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   849
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   850
  _sp += 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   851
  Node* argument = pop();  // pop non-receiver first:  it was pushed second
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   852
  Node* receiver = pop();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   853
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   854
  // Null check on self without removing any arguments.  The argument
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   855
  // null check technically happens in the wrong place, which can lead to
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   856
  // invalid stack traces when string compare is inlined into a method
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   857
  // which handles NullPointerExceptions.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   858
  _sp += 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   859
  receiver = do_null_check(receiver, T_OBJECT);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   860
  //should not do null check for argument for String.equals(), because spec
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   861
  //allows to specify NULL as argument.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   862
  _sp -= 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   863
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   864
  if (stopped()) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   865
    return true;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   866
  }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   867
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   868
  // get String klass for instanceOf
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   869
  ciInstanceKlass* klass = env()->String_klass();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   870
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   871
  // two paths (plus control) merge
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   872
  RegionNode* region = new (C, 3) RegionNode(3);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   873
  Node* phi = new (C, 3) PhiNode(region, TypeInt::BOOL);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   874
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   875
  Node* inst = gen_instanceof(argument, makecon(TypeKlassPtr::make(klass)));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   876
  Node* cmp  = _gvn.transform(new (C, 3) CmpINode(inst, intcon(1)));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   877
  Node* bol  = _gvn.transform(new (C, 2) BoolNode(cmp, BoolTest::eq));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   878
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   879
  IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   880
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   881
  Node* if_true  = _gvn.transform(new (C, 1) IfTrueNode(iff));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   882
  set_control(if_true);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   883
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   884
  const TypeInstPtr* string_type =
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   885
    TypeInstPtr::make(TypePtr::BotPTR, klass, false, NULL, 0);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   886
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   887
  // instanceOf == true
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   888
  Node* equals =
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   889
    _gvn.transform(new (C, 7) StrEqualsNode(
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   890
                        control(),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   891
                        memory(TypeAryPtr::CHARS),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   892
                        memory(string_type->add_offset(value_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   893
                        memory(string_type->add_offset(count_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   894
                        memory(string_type->add_offset(offset_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   895
                        receiver,
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   896
                        argument));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   897
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   898
  phi->init_req(1, _gvn.transform(equals));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   899
  region->init_req(1, if_true);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   900
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   901
  //instanceOf == false, fallthrough
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   902
  Node* if_false = _gvn.transform(new (C, 1) IfFalseNode(iff));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   903
  set_control(if_false);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   904
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   905
  phi->init_req(2, _gvn.transform(intcon(0)));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   906
  region->init_req(2, if_false);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   907
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   908
  // post merge
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   909
  set_control(_gvn.transform(region));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   910
  record_for_igvn(region);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   911
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   912
  push(_gvn.transform(phi));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   913
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   914
  return true;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   915
}
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
   916
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   917
//------------------------------inline_array_equals----------------------------
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   918
bool LibraryCallKit::inline_array_equals() {
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   919
600
f7b4f99c0199 6709972: runThese failed with assert(false,"bad AD file")
rasbold
parents: 595
diff changeset
   920
  if (!Matcher::has_match_rule(Op_AryEq)) return false;
f7b4f99c0199 6709972: runThese failed with assert(false,"bad AD file")
rasbold
parents: 595
diff changeset
   921
595
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   922
  _sp += 2;
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   923
  Node *argument2 = pop();
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   924
  Node *argument1 = pop();
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   925
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   926
  Node* equals =
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   927
    _gvn.transform(new (C, 3) AryEqNode(control(),
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   928
                                        argument1,
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   929
                                        argument2)
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   930
                   );
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   931
  push(equals);
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   932
  return true;
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   933
}
a2be4c89de81 6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents: 590
diff changeset
   934
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
// Java version of String.indexOf(constant string)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
// class StringDecl {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
//   StringDecl(char[] ca) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
//     offset = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
//     count = ca.length;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
//     value = ca;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
//   }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
//   int offset;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
//   int count;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
//   char[] value;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
// }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
// static int string_indexOf_J(StringDecl string_object, char[] target_object,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
//                             int targetOffset, int cache_i, int md2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   949
//   int cache = cache_i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   950
//   int sourceOffset = string_object.offset;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   951
//   int sourceCount = string_object.count;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   952
//   int targetCount = target_object.length;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   953
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   954
//   int targetCountLess1 = targetCount - 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   955
//   int sourceEnd = sourceOffset + sourceCount - targetCountLess1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   956
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   957
//   char[] source = string_object.value;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   958
//   char[] target = target_object;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   959
//   int lastChar = target[targetCountLess1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   960
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
   961
//  outer_loop:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   962
//   for (int i = sourceOffset; i < sourceEnd; ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   963
//     int src = source[i + targetCountLess1];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   964
//     if (src == lastChar) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   965
//       // With random strings and a 4-character alphabet,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   966
//       // reverse matching at this point sets up 0.8% fewer
489c9b5090e2 Initial load
duke
parents:
diff changeset
   967
//       // frames, but (paradoxically) makes 0.3% more probes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   968
//       // Since those probes are nearer the lastChar probe,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   969
//       // there is may be a net D$ win with reverse matching.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   970
//       // But, reversing loop inhibits unroll of inner loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   971
//       // for unknown reason.  So, does running outer loop from
489c9b5090e2 Initial load
duke
parents:
diff changeset
   972
//       // (sourceOffset - targetCountLess1) to (sourceOffset + sourceCount)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   973
//       for (int j = 0; j < targetCountLess1; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   974
//         if (target[targetOffset + j] != source[i+j]) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   975
//           if ((cache & (1 << source[i+j])) == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   976
//             if (md2 < j+1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   977
//               i += j+1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   978
//               continue outer_loop;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   979
//             }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   980
//           }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   981
//           i += md2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   982
//           continue outer_loop;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   983
//         }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   984
//       }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   985
//       return i - sourceOffset;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   986
//     }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   987
//     if ((cache & (1 << src)) == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   988
//       i += targetCountLess1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   989
//     } // using "i += targetCount;" and an "else i++;" causes a jump to jump.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   990
//     i++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   991
//   }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   992
//   return -1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   993
// }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   994
489c9b5090e2 Initial load
duke
parents:
diff changeset
   995
//------------------------------string_indexOf------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   996
Node* LibraryCallKit::string_indexOf(Node* string_object, ciTypeArray* target_array, jint targetOffset_i,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   997
                                     jint cache_i, jint md2_i) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   998
489c9b5090e2 Initial load
duke
parents:
diff changeset
   999
  Node* no_ctrl  = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1000
  float likely   = PROB_LIKELY(0.9);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1001
  float unlikely = PROB_UNLIKELY(0.9);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1002
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1003
  const int value_offset  = java_lang_String::value_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1004
  const int count_offset  = java_lang_String::count_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1005
  const int offset_offset = java_lang_String::offset_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
  ciInstanceKlass* klass = env()->String_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
  const TypeInstPtr* string_type = TypeInstPtr::make(TypePtr::BotPTR, klass, false, NULL, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
  const TypeAryPtr*  source_type = TypeAryPtr::make(TypePtr::NotNull, TypeAry::make(TypeInt::CHAR,TypeInt::POS), ciTypeArrayKlass::make(T_CHAR), true, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
  Node* sourceOffseta = basic_plus_adr(string_object, string_object, offset_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
  Node* sourceOffset  = make_load(no_ctrl, sourceOffseta, TypeInt::INT, T_INT, string_type->add_offset(offset_offset));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
  Node* sourceCounta  = basic_plus_adr(string_object, string_object, count_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  Node* sourceCount   = make_load(no_ctrl, sourceCounta, TypeInt::INT, T_INT, string_type->add_offset(count_offset));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  Node* sourcea       = basic_plus_adr(string_object, string_object, value_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1016
  Node* source        = make_load(no_ctrl, sourcea, source_type, T_OBJECT, string_type->add_offset(value_offset));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  1018
  Node* target = _gvn.transform( makecon(TypeOopPtr::make_from_constant(target_array)) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
  jint target_length = target_array->length();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
  const TypeAry* target_array_type = TypeAry::make(TypeInt::CHAR, TypeInt::make(0, target_length, Type::WidenMin));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
  const TypeAryPtr* target_type = TypeAryPtr::make(TypePtr::BotPTR, target_array_type, target_array->klass(), true, Type::OffsetBot);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  1023
  IdealKit kit(gvn(), control(), merged_memory(), false, true);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
#define __ kit.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  Node* zero             = __ ConI(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  Node* one              = __ ConI(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  Node* cache            = __ ConI(cache_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
  Node* md2              = __ ConI(md2_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
  Node* lastChar         = __ ConI(target_array->char_at(target_length - 1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
  Node* targetCount      = __ ConI(target_length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
  Node* targetCountLess1 = __ ConI(target_length - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
  Node* targetOffset     = __ ConI(targetOffset_i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
  Node* sourceEnd        = __ SubI(__ AddI(sourceOffset, sourceCount), targetCountLess1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  1035
  IdealVariable rtn(kit), i(kit), j(kit); __ declarations_done();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
  Node* outer_loop = __ make_label(2 /* goto */);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
  Node* return_    = __ make_label(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
  __ set(rtn,__ ConI(-1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
  __ loop(i, sourceOffset, BoolTest::lt, sourceEnd); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
       Node* i2  = __ AddI(__ value(i), targetCountLess1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
       // pin to prohibit loading of "next iteration" value which may SEGV (rare)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
       Node* src = load_array_element(__ ctrl(), source, i2, TypeAryPtr::CHARS);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
       __ if_then(src, BoolTest::eq, lastChar, unlikely); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
         __ loop(j, zero, BoolTest::lt, targetCountLess1); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
              Node* tpj = __ AddI(targetOffset, __ value(j));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
              Node* targ = load_array_element(no_ctrl, target, tpj, target_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
              Node* ipj  = __ AddI(__ value(i), __ value(j));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
              Node* src2 = load_array_element(no_ctrl, source, ipj, TypeAryPtr::CHARS);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
              __ if_then(targ, BoolTest::ne, src2); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
                __ if_then(__ AndI(cache, __ LShiftI(one, src2)), BoolTest::eq, zero); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
                  __ if_then(md2, BoolTest::lt, __ AddI(__ value(j), one)); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
                    __ increment(i, __ AddI(__ value(j), one));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
                    __ goto_(outer_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
                  } __ end_if(); __ dead(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
                }__ end_if(); __ dead(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
                __ increment(i, md2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
                __ goto_(outer_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
              }__ end_if();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
              __ increment(j, one);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
         }__ end_loop(); __ dead(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
         __ set(rtn, __ SubI(__ value(i), sourceOffset)); __ dead(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
         __ goto_(return_);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
       }__ end_if();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
       __ if_then(__ AndI(cache, __ LShiftI(one, src)), BoolTest::eq, zero, likely); {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
         __ increment(i, targetCountLess1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
       }__ end_if();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
       __ increment(i, one);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
       __ bind(outer_loop);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
  }__ end_loop(); __ dead(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
  __ bind(return_);
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  1072
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  1073
  // Final sync IdealKit and GraphKit.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  1074
  sync_kit(kit);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
  Node* result = __ value(rtn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
#undef __
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
  C->set_has_loops(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
  return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
//------------------------------inline_string_indexOf------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
bool LibraryCallKit::inline_string_indexOf() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
  const int value_offset  = java_lang_String::value_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
  const int count_offset  = java_lang_String::count_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
  const int offset_offset = java_lang_String::offset_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
  _sp += 2;
2348
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1089
  Node *argument = pop();  // pop non-receiver first:  it was pushed second
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1090
  Node *receiver = pop();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1091
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1092
  Node* result;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1093
  if (Matcher::has_match_rule(Op_StrIndexOf) &&
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1094
      UseSSE42Intrinsics) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1095
    // Generate SSE4.2 version of indexOf
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1096
    // We currently only have match rules that use SSE4.2
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1097
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1098
    // Null check on self without removing any arguments.  The argument
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1099
    // null check technically happens in the wrong place, which can lead to
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1100
    // invalid stack traces when string compare is inlined into a method
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1101
    // which handles NullPointerExceptions.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1102
    _sp += 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1103
    receiver = do_null_check(receiver, T_OBJECT);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1104
    argument = do_null_check(argument, T_OBJECT);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1105
    _sp -= 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1106
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1107
    if (stopped()) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1108
      return true;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1109
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1110
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1111
    ciInstanceKlass* klass = env()->String_klass();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1112
    const TypeInstPtr* string_type =
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1113
      TypeInstPtr::make(TypePtr::BotPTR, klass, false, NULL, 0);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1114
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1115
    result =
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1116
      _gvn.transform(new (C, 7)
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1117
                     StrIndexOfNode(control(),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1118
                                    memory(TypeAryPtr::CHARS),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1119
                                    memory(string_type->add_offset(value_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1120
                                    memory(string_type->add_offset(count_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1121
                                    memory(string_type->add_offset(offset_offset)),
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1122
                                    receiver,
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1123
                                    argument));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1124
  } else { //Use LibraryCallKit::string_indexOf
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1125
    // don't intrinsify is argument isn't a constant string.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1126
    if (!argument->is_Con()) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1127
     return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1128
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1129
    const TypeOopPtr* str_type = _gvn.type(argument)->isa_oopptr();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1130
    if (str_type == NULL) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1131
      return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1132
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1133
    ciInstanceKlass* klass = env()->String_klass();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1134
    ciObject* str_const = str_type->const_oop();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1135
    if (str_const == NULL || str_const->klass() != klass) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1136
      return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1137
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1138
    ciInstance* str = str_const->as_instance();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1139
    assert(str != NULL, "must be instance");
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1140
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1141
    ciObject* v = str->field_value_by_offset(value_offset).as_object();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1142
    int       o = str->field_value_by_offset(offset_offset).as_int();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1143
    int       c = str->field_value_by_offset(count_offset).as_int();
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1144
    ciTypeArray* pat = v->as_type_array(); // pattern (argument) character array
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1145
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1146
    // constant strings have no offset and count == length which
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1147
    // simplifies the resulting code somewhat so lets optimize for that.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1148
    if (o != 0 || c != pat->length()) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1149
     return false;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1150
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1151
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1152
    // Null check on self without removing any arguments.  The argument
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1153
    // null check technically happens in the wrong place, which can lead to
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1154
    // invalid stack traces when string compare is inlined into a method
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1155
    // which handles NullPointerExceptions.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1156
    _sp += 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1157
    receiver = do_null_check(receiver, T_OBJECT);
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1158
    // No null check on the argument is needed since it's a constant String oop.
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1159
    _sp -= 2;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1160
    if (stopped()) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1161
     return true;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1162
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1163
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1164
    // The null string as a pattern always returns 0 (match at beginning of string)
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1165
    if (c == 0) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1166
      push(intcon(0));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1167
      return true;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1168
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1169
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1170
    // Generate default indexOf
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1171
    jchar lastChar = pat->char_at(o + (c - 1));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1172
    int cache = 0;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1173
    int i;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1174
    for (i = 0; i < c - 1; i++) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1175
      assert(i < pat->length(), "out of range");
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1176
      cache |= (1 << (pat->char_at(o + i) & (sizeof(cache) * BitsPerByte - 1)));
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1177
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1178
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1179
    int md2 = c;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1180
    for (i = 0; i < c - 1; i++) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1181
      assert(i < pat->length(), "out of range");
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1182
      if (pat->char_at(o + i) == lastChar) {
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1183
        md2 = (c - 1) - i;
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1184
      }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1185
    }
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1186
4e71ed4c2709 6761600: Use sse 4.2 in intrinsics
cfang
parents: 2255
diff changeset
  1187
    result = string_indexOf(receiver, pat, o, cache, md2);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
  push(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
//--------------------------pop_math_arg--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
// Pop a double argument to a math function from the stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
// rounding it if necessary.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
Node * LibraryCallKit::pop_math_arg() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
  Node *arg = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
  if( Matcher::strict_fp_requires_explicit_rounding && UseSSE<=1 )
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
    arg = _gvn.transform( new (C, 2) RoundDoubleNode(0, arg) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
  return arg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
//------------------------------inline_trig----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
// Inline sin/cos/tan instructions, if possible.  If rounding is required, do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
// argument reduction which will turn into a fast/slow diamond.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
bool LibraryCallKit::inline_trig(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
  _sp += arg_size();            // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
  Node* arg = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
  Node* trig = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
  case vmIntrinsics::_dsin:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
    trig = _gvn.transform((Node*)new (C, 2) SinDNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
  case vmIntrinsics::_dcos:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
    trig = _gvn.transform((Node*)new (C, 2) CosDNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
  case vmIntrinsics::_dtan:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
    trig = _gvn.transform((Node*)new (C, 2) TanDNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
    assert(false, "bad intrinsic was passed in");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
  // Rounding required?  Check for argument reduction!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
  if( Matcher::strict_fp_requires_explicit_rounding ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
    static const double     pi_4 =  0.7853981633974483;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
    static const double neg_pi_4 = -0.7853981633974483;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
    // pi/2 in 80-bit extended precision
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
    // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00};
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
    // -pi/2 in 80-bit extended precision
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
    // static const unsigned char neg_pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0xbf,0x00,0x00,0x00,0x00,0x00,0x00};
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
    // Cutoff value for using this argument reduction technique
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
    //static const double    pi_2_minus_epsilon =  1.564660403643354;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
    //static const double neg_pi_2_plus_epsilon = -1.564660403643354;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
    // Pseudocode for sin:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
    // if (x <= Math.PI / 4.0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
    //   if (x >= -Math.PI / 4.0) return  fsin(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
    //   if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
    // } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
    //   if (x <=  Math.PI / 2.0) return  fcos(x - Math.PI / 2.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
    // }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
    // return StrictMath.sin(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
    // Pseudocode for cos:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
    // if (x <= Math.PI / 4.0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
    //   if (x >= -Math.PI / 4.0) return  fcos(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
    //   if (x >= -Math.PI / 2.0) return  fsin(x + Math.PI / 2.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
    // } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
    //   if (x <=  Math.PI / 2.0) return -fsin(x - Math.PI / 2.0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
    // }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
    // return StrictMath.cos(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
    // Actually, sticking in an 80-bit Intel value into C2 will be tough; it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
    // requires a special machine instruction to load it.  Instead we'll try
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
    // the 'easy' case.  If we really need the extra range +/- PI/2 we'll
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
    // probably do the math inside the SIN encoding.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
    // Make the merge point
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
    RegionNode *r = new (C, 3) RegionNode(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
    Node *phi = new (C, 3) PhiNode(r,Type::DOUBLE);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1267
    // Flatten arg so we need only 1 test
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
    Node *abs = _gvn.transform(new (C, 2) AbsDNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
    // Node for PI/4 constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
    Node *pi4 = makecon(TypeD::make(pi_4));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
    // Check PI/4 : abs(arg)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
    Node *cmp = _gvn.transform(new (C, 3) CmpDNode(pi4,abs));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
    // Check: If PI/4 < abs(arg) then go slow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
    Node *bol = _gvn.transform( new (C, 2) BoolNode( cmp, BoolTest::lt ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
    // Branch either way
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
    IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
    set_control(opt_iff(r,iff));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
    // Set fast path result
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
    phi->init_req(2,trig);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
    // Slow path - non-blocking leaf call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
    Node* call = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1284
    switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
    case vmIntrinsics::_dsin:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
      call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
                               CAST_FROM_FN_PTR(address, SharedRuntime::dsin),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
                               "Sin", NULL, arg, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
    case vmIntrinsics::_dcos:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
      call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
                               CAST_FROM_FN_PTR(address, SharedRuntime::dcos),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
                               "Cos", NULL, arg, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
    case vmIntrinsics::_dtan:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
      call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
                               CAST_FROM_FN_PTR(address, SharedRuntime::dtan),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
                               "Tan", NULL, arg, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
    assert(control()->in(0) == call, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
    Node* slow_result = _gvn.transform(new (C, 1) ProjNode(call,TypeFunc::Parms));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
    r->init_req(1,control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
    phi->init_req(1,slow_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
    // Post-merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1307
    set_control(_gvn.transform(r));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
    record_for_igvn(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
    trig = _gvn.transform(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
    C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
  // Push result back on JVM stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
  push_pair(trig);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1318
//------------------------------inline_sqrt-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1319
// Inline square root instruction, if possible.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1320
bool LibraryCallKit::inline_sqrt(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
  assert(id == vmIntrinsics::_dsqrt, "Not square root");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
  push_pair(_gvn.transform(new (C, 2) SqrtDNode(0, pop_math_arg())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1326
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
//------------------------------inline_abs-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1328
// Inline absolute value instruction, if possible.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1329
bool LibraryCallKit::inline_abs(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1330
  assert(id == vmIntrinsics::_dabs, "Not absolute value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
  push_pair(_gvn.transform(new (C, 2) AbsDNode(pop_math_arg())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1336
//------------------------------inline_exp-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1337
// Inline exp instructions, if possible.  The Intel hardware only misses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
// really odd corner cases (+/- Infinity).  Just uncommon-trap them.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
bool LibraryCallKit::inline_exp(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
  assert(id == vmIntrinsics::_dexp, "Not exp");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
  // If this inlining ever returned NaN in the past, we do not intrinsify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
  // every again.  NaN results requires StrictMath.exp handling.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1344
  if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1345
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1346
  // Do not intrinsify on older platforms which lack cmove.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1347
  if (ConditionalMoveLimit == 0)  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1348
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1349
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1350
  Node *x = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1351
  Node *result = _gvn.transform(new (C, 2) ExpDNode(0,x));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1352
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1353
  //-------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1354
  //result=(result.isNaN())? StrictMath::exp():result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1355
  // Check: If isNaN() by checking result!=result? then go to Strict Math
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1356
  Node* cmpisnan = _gvn.transform(new (C, 3) CmpDNode(result,result));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1357
  // Build the boolean node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1358
  Node* bolisnum = _gvn.transform( new (C, 2) BoolNode(cmpisnan, BoolTest::eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1359
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1360
  { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1361
    // End the current control-flow path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1362
    push_pair(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1363
    // Math.exp intrinsic returned a NaN, which requires StrictMath.exp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1364
    // to handle.  Recompile without intrinsifying Math.exp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1365
    uncommon_trap(Deoptimization::Reason_intrinsic,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1366
                  Deoptimization::Action_make_not_entrant);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1367
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1368
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1370
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1371
  push_pair(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1372
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1373
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1374
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1375
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1376
//------------------------------inline_pow-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1377
// Inline power instructions, if possible.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1378
bool LibraryCallKit::inline_pow(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1379
  assert(id == vmIntrinsics::_dpow, "Not pow");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1380
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
  // If this inlining ever returned NaN in the past, we do not intrinsify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1382
  // every again.  NaN results requires StrictMath.pow handling.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1383
  if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1384
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1385
  // Do not intrinsify on older platforms which lack cmove.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1386
  if (ConditionalMoveLimit == 0)  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1387
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1388
  // Pseudocode for pow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1389
  // if (x <= 0.0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1390
  //   if ((double)((int)y)==y) { // if y is int
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1391
  //     result = ((1&(int)y)==0)?-DPow(abs(x), y):DPow(abs(x), y)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1392
  //   } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1393
  //     result = NaN;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1394
  //   }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
  // } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1396
  //   result = DPow(x,y);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1397
  // }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1398
  // if (result != result)?  {
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  1399
  //   uncommon_trap();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1400
  // }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
  // return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
  Node* y = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
  Node* x = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
  Node *fast_result = _gvn.transform( new (C, 3) PowDNode(0, x, y) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
  // Short form: if not top-level (i.e., Math.pow but inlining Math.pow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
  // inside of something) then skip the fancy tests and just check for
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
  // NaN result.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
  Node *result = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
  if( jvms()->depth() >= 1 ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
    result = fast_result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
    // Set the merge point for If node with condition of (x <= 0.0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
    // There are four possible paths to region node and phi node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1419
    RegionNode *r = new (C, 4) RegionNode(4);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1420
    Node *phi = new (C, 4) PhiNode(r, Type::DOUBLE);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1421
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1422
    // Build the first if node: if (x <= 0.0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1423
    // Node for 0 constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
    Node *zeronode = makecon(TypeD::ZERO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
    // Check x:0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
    Node *cmp = _gvn.transform(new (C, 3) CmpDNode(x, zeronode));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
    // Check: If (x<=0) then go complex path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
    Node *bol1 = _gvn.transform( new (C, 2) BoolNode( cmp, BoolTest::le ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
    // Branch either way
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1430
    IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1431
    Node *opt_test = _gvn.transform(if1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
    //assert( opt_test->is_If(), "Expect an IfNode");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1433
    IfNode *opt_if1 = (IfNode*)opt_test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
    // Fast path taken; set region slot 3
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
    Node *fast_taken = _gvn.transform( new (C, 1) IfFalseNode(opt_if1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
    r->init_req(3,fast_taken); // Capture fast-control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1437
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
    // Fast path not-taken, i.e. slow path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
    Node *complex_path = _gvn.transform( new (C, 1) IfTrueNode(opt_if1) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
    // Set fast path result
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
    Node *fast_result = _gvn.transform( new (C, 3) PowDNode(0, y, x) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
    phi->init_req(3, fast_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1445
    // Complex path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1446
    // Build the second if node (if y is int)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
    // Node for (int)y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1448
    Node *inty = _gvn.transform( new (C, 2) ConvD2INode(y));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
    // Node for (double)((int) y)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
    Node *doubleinty= _gvn.transform( new (C, 2) ConvI2DNode(inty));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1451
    // Check (double)((int) y) : y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1452
    Node *cmpinty= _gvn.transform(new (C, 3) CmpDNode(doubleinty, y));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1453
    // Check if (y isn't int) then go to slow path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1454
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1455
    Node *bol2 = _gvn.transform( new (C, 2) BoolNode( cmpinty, BoolTest::ne ) );
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  1456
    // Branch either way
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
    IfNode *if2 = create_and_xform_if(complex_path,bol2, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
    Node *slow_path = opt_iff(r,if2); // Set region path 2
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
    // Calculate DPow(abs(x), y)*(1 & (int)y)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1461
    // Node for constant 1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1462
    Node *conone = intcon(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1463
    // 1& (int)y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1464
    Node *signnode= _gvn.transform( new (C, 3) AndINode(conone, inty) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1465
    // zero node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1466
    Node *conzero = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1467
    // Check (1&(int)y)==0?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1468
    Node *cmpeq1 = _gvn.transform(new (C, 3) CmpINode(signnode, conzero));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1469
    // Check if (1&(int)y)!=0?, if so the result is negative
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1470
    Node *bol3 = _gvn.transform( new (C, 2) BoolNode( cmpeq1, BoolTest::ne ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1471
    // abs(x)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1472
    Node *absx=_gvn.transform( new (C, 2) AbsDNode(x));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1473
    // abs(x)^y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1474
    Node *absxpowy = _gvn.transform( new (C, 3) PowDNode(0, y, absx) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1475
    // -abs(x)^y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1476
    Node *negabsxpowy = _gvn.transform(new (C, 2) NegDNode (absxpowy));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1477
    // (1&(int)y)==1?-DPow(abs(x), y):DPow(abs(x), y)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1478
    Node *signresult = _gvn.transform( CMoveNode::make(C, NULL, bol3, absxpowy, negabsxpowy, Type::DOUBLE));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1479
    // Set complex path fast result
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1480
    phi->init_req(2, signresult);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1481
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1482
    static const jlong nan_bits = CONST64(0x7ff8000000000000);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1483
    Node *slow_result = makecon(TypeD::make(*(double*)&nan_bits)); // return NaN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1484
    r->init_req(1,slow_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1485
    phi->init_req(1,slow_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1486
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1487
    // Post merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1488
    set_control(_gvn.transform(r));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1489
    record_for_igvn(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1490
    result=_gvn.transform(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1491
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1492
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1493
  //-------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1494
  //result=(result.isNaN())? uncommon_trap():result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1495
  // Check: If isNaN() by checking result!=result? then go to Strict Math
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1496
  Node* cmpisnan = _gvn.transform(new (C, 3) CmpDNode(result,result));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1497
  // Build the boolean node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1498
  Node* bolisnum = _gvn.transform( new (C, 2) BoolNode(cmpisnan, BoolTest::eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1499
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1500
  { BuildCutout unless(this, bolisnum, PROB_STATIC_FREQUENT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1501
    // End the current control-flow path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1502
    push_pair(x);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1503
    push_pair(y);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1504
    // Math.pow intrinsic returned a NaN, which requires StrictMath.pow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1505
    // to handle.  Recompile without intrinsifying Math.pow.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1506
    uncommon_trap(Deoptimization::Reason_intrinsic,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1507
                  Deoptimization::Action_make_not_entrant);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1508
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1509
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1510
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1511
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1512
  push_pair(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1513
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1514
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1515
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1516
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1517
//------------------------------inline_trans-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1518
// Inline transcendental instructions, if possible.  The Intel hardware gets
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1519
// these right, no funny corner cases missed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1520
bool LibraryCallKit::inline_trans(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1521
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1522
  Node* arg = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1523
  Node* trans = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1524
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1525
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1526
  case vmIntrinsics::_dlog:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1527
    trans = _gvn.transform((Node*)new (C, 2) LogDNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1528
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1529
  case vmIntrinsics::_dlog10:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1530
    trans = _gvn.transform((Node*)new (C, 2) Log10DNode(arg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1531
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1532
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1533
    assert(false, "bad intrinsic was passed in");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1534
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1535
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1536
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1537
  // Push result back on JVM stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1538
  push_pair(trans);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1539
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1540
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1541
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1542
//------------------------------runtime_math-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1543
bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1544
  Node* a = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1545
  Node* b = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1546
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1547
  assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1548
         "must be (DD)D or (D)D type");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1549
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1550
  // Inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1551
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1552
  if (call_type == OptoRuntime::Math_DD_D_Type()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1553
    b = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1554
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1555
  a = pop_math_arg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1556
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1557
  const TypePtr* no_memory_effects = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1558
  Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1559
                                 no_memory_effects,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1560
                                 a, top(), b, b ? top() : NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1561
  Node* value = _gvn.transform(new (C, 1) ProjNode(trig, TypeFunc::Parms+0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1562
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1563
  Node* value_top = _gvn.transform(new (C, 1) ProjNode(trig, TypeFunc::Parms+1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1564
  assert(value_top == top(), "second value must be top");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1565
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1566
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1567
  push_pair(value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1568
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1569
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1570
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1571
//------------------------------inline_math_native-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1572
bool LibraryCallKit::inline_math_native(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1573
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1574
    // These intrinsics are not properly supported on all hardware
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1575
  case vmIntrinsics::_dcos: return Matcher::has_match_rule(Op_CosD) ? inline_trig(id) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1576
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dcos), "COS");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1577
  case vmIntrinsics::_dsin: return Matcher::has_match_rule(Op_SinD) ? inline_trig(id) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1578
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dsin), "SIN");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1579
  case vmIntrinsics::_dtan: return Matcher::has_match_rule(Op_TanD) ? inline_trig(id) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1580
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dtan), "TAN");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1581
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1582
  case vmIntrinsics::_dlog:   return Matcher::has_match_rule(Op_LogD) ? inline_trans(id) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1583
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dlog), "LOG");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1584
  case vmIntrinsics::_dlog10: return Matcher::has_match_rule(Op_Log10D) ? inline_trans(id) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1585
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dlog10), "LOG10");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1586
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1587
    // These intrinsics are supported on all hardware
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1588
  case vmIntrinsics::_dsqrt: return Matcher::has_match_rule(Op_SqrtD) ? inline_sqrt(id) : false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1589
  case vmIntrinsics::_dabs:  return Matcher::has_match_rule(Op_AbsD)  ? inline_abs(id)  : false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1590
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1591
    // These intrinsics don't work on X86.  The ad implementation doesn't
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1592
    // handle NaN's properly.  Instead of returning infinity, the ad
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1593
    // implementation returns a NaN on overflow. See bug: 6304089
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1594
    // Once the ad implementations are fixed, change the code below
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1595
    // to match the intrinsics above
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1596
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1597
  case vmIntrinsics::_dexp:  return
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1598
    runtime_math(OptoRuntime::Math_D_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dexp), "EXP");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1599
  case vmIntrinsics::_dpow:  return
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1600
    runtime_math(OptoRuntime::Math_DD_D_Type(), CAST_FROM_FN_PTR(address, SharedRuntime::dpow), "POW");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1601
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1602
   // These intrinsics are not yet correctly implemented
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1603
  case vmIntrinsics::_datan2:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1604
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1605
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1606
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1607
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1608
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1609
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1610
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1611
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1612
static bool is_simple_name(Node* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1613
  return (n->req() == 1         // constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1614
          || (n->is_Type() && n->as_Type()->type()->singleton())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1615
          || n->is_Proj()       // parameter or return value
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1616
          || n->is_Phi()        // local of some sort
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1617
          );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1618
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1619
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1620
//----------------------------inline_min_max-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1621
bool LibraryCallKit::inline_min_max(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1622
  push(generate_min_max(id, argument(0), argument(1)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1623
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1624
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1625
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1626
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1627
Node*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1628
LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1629
  // These are the candidate return value:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1630
  Node* xvalue = x0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1631
  Node* yvalue = y0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1632
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1633
  if (xvalue == yvalue) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1634
    return xvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1635
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1636
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1637
  bool want_max = (id == vmIntrinsics::_max);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1638
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1639
  const TypeInt* txvalue = _gvn.type(xvalue)->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1640
  const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1641
  if (txvalue == NULL || tyvalue == NULL)  return top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1642
  // This is not really necessary, but it is consistent with a
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1643
  // hypothetical MaxINode::Value method:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1644
  int widen = MAX2(txvalue->_widen, tyvalue->_widen);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1645
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1646
  // %%% This folding logic should (ideally) be in a different place.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1647
  // Some should be inside IfNode, and there to be a more reliable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1648
  // transformation of ?: style patterns into cmoves.  We also want
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1649
  // more powerful optimizations around cmove and min/max.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1650
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1651
  // Try to find a dominating comparison of these guys.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1652
  // It can simplify the index computation for Arrays.copyOf
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1653
  // and similar uses of System.arraycopy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1654
  // First, compute the normalized version of CmpI(x, y).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1655
  int   cmp_op = Op_CmpI;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1656
  Node* xkey = xvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1657
  Node* ykey = yvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1658
  Node* ideal_cmpxy = _gvn.transform( new(C, 3) CmpINode(xkey, ykey) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1659
  if (ideal_cmpxy->is_Cmp()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1660
    // E.g., if we have CmpI(length - offset, count),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1661
    // it might idealize to CmpI(length, count + offset)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1662
    cmp_op = ideal_cmpxy->Opcode();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1663
    xkey = ideal_cmpxy->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1664
    ykey = ideal_cmpxy->in(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1665
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1666
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1667
  // Start by locating any relevant comparisons.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1668
  Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1669
  Node* cmpxy = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1670
  Node* cmpyx = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1671
  for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1672
    Node* cmp = start_from->fast_out(k);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1673
    if (cmp->outcnt() > 0 &&            // must have prior uses
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1674
        cmp->in(0) == NULL &&           // must be context-independent
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1675
        cmp->Opcode() == cmp_op) {      // right kind of compare
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1676
      if (cmp->in(1) == xkey && cmp->in(2) == ykey)  cmpxy = cmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1677
      if (cmp->in(1) == ykey && cmp->in(2) == xkey)  cmpyx = cmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1678
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1679
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1680
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1681
  const int NCMPS = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1682
  Node* cmps[NCMPS] = { cmpxy, cmpyx };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1683
  int cmpn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1684
  for (cmpn = 0; cmpn < NCMPS; cmpn++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1685
    if (cmps[cmpn] != NULL)  break;     // find a result
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1686
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1687
  if (cmpn < NCMPS) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1688
    // Look for a dominating test that tells us the min and max.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1689
    int depth = 0;                // Limit search depth for speed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1690
    Node* dom = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1691
    for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1692
      if (++depth >= 100)  break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1693
      Node* ifproj = dom;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1694
      if (!ifproj->is_Proj())  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1695
      Node* iff = ifproj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1696
      if (!iff->is_If())  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1697
      Node* bol = iff->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1698
      if (!bol->is_Bool())  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1699
      Node* cmp = bol->in(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1700
      if (cmp == NULL)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1701
      for (cmpn = 0; cmpn < NCMPS; cmpn++)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1702
        if (cmps[cmpn] == cmp)  break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1703
      if (cmpn == NCMPS)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1704
      BoolTest::mask btest = bol->as_Bool()->_test._test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1705
      if (ifproj->is_IfFalse())  btest = BoolTest(btest).negate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1706
      if (cmp->in(1) == ykey)    btest = BoolTest(btest).commute();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1707
      // At this point, we know that 'x btest y' is true.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1708
      switch (btest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1709
      case BoolTest::eq:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1710
        // They are proven equal, so we can collapse the min/max.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1711
        // Either value is the answer.  Choose the simpler.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1712
        if (is_simple_name(yvalue) && !is_simple_name(xvalue))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1713
          return yvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1714
        return xvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1715
      case BoolTest::lt:          // x < y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1716
      case BoolTest::le:          // x <= y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1717
        return (want_max ? yvalue : xvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1718
      case BoolTest::gt:          // x > y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1719
      case BoolTest::ge:          // x >= y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1720
        return (want_max ? xvalue : yvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1721
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1722
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1723
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1724
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1725
  // We failed to find a dominating test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1726
  // Let's pick a test that might GVN with prior tests.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1727
  Node*          best_bol   = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1728
  BoolTest::mask best_btest = BoolTest::illegal;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1729
  for (cmpn = 0; cmpn < NCMPS; cmpn++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1730
    Node* cmp = cmps[cmpn];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1731
    if (cmp == NULL)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1732
    for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1733
      Node* bol = cmp->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1734
      if (!bol->is_Bool())  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1735
      BoolTest::mask btest = bol->as_Bool()->_test._test;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1736
      if (btest == BoolTest::eq || btest == BoolTest::ne)  continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1737
      if (cmp->in(1) == ykey)   btest = BoolTest(btest).commute();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1738
      if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1739
        best_bol   = bol->as_Bool();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1740
        best_btest = btest;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1741
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1742
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1743
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1744
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1745
  Node* answer_if_true  = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1746
  Node* answer_if_false = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1747
  switch (best_btest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1748
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1749
    if (cmpxy == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1750
      cmpxy = ideal_cmpxy;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1751
    best_bol = _gvn.transform( new(C, 2) BoolNode(cmpxy, BoolTest::lt) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1752
    // and fall through:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1753
  case BoolTest::lt:          // x < y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1754
  case BoolTest::le:          // x <= y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1755
    answer_if_true  = (want_max ? yvalue : xvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1756
    answer_if_false = (want_max ? xvalue : yvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1757
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1758
  case BoolTest::gt:          // x > y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1759
  case BoolTest::ge:          // x >= y
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1760
    answer_if_true  = (want_max ? xvalue : yvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1761
    answer_if_false = (want_max ? yvalue : xvalue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1762
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1763
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1764
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1765
  jint hi, lo;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1766
  if (want_max) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1767
    // We can sharpen the minimum.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1768
    hi = MAX2(txvalue->_hi, tyvalue->_hi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1769
    lo = MAX2(txvalue->_lo, tyvalue->_lo);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1770
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1771
    // We can sharpen the maximum.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1772
    hi = MIN2(txvalue->_hi, tyvalue->_hi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1773
    lo = MIN2(txvalue->_lo, tyvalue->_lo);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1774
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1775
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1776
  // Use a flow-free graph structure, to avoid creating excess control edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1777
  // which could hinder other optimizations.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1778
  // Since Math.min/max is often used with arraycopy, we want
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1779
  // tightly_coupled_allocation to be able to see beyond min/max expressions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1780
  Node* cmov = CMoveNode::make(C, NULL, best_bol,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1781
                               answer_if_false, answer_if_true,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1782
                               TypeInt::make(lo, hi, widen));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1783
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1784
  return _gvn.transform(cmov);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1785
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1786
  /*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1787
  // This is not as desirable as it may seem, since Min and Max
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1788
  // nodes do not have a full set of optimizations.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1789
  // And they would interfere, anyway, with 'if' optimizations
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1790
  // and with CMoveI canonical forms.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1791
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1792
  case vmIntrinsics::_min:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1793
    result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1794
  case vmIntrinsics::_max:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1795
    result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1796
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1797
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1798
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1799
  */
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1800
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1801
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1802
inline int
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1803
LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1804
  const TypePtr* base_type = TypePtr::NULL_PTR;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1805
  if (base != NULL)  base_type = _gvn.type(base)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1806
  if (base_type == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1807
    // Unknown type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1808
    return Type::AnyPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1809
  } else if (base_type == TypePtr::NULL_PTR) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1810
    // Since this is a NULL+long form, we have to switch to a rawptr.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1811
    base   = _gvn.transform( new (C, 2) CastX2PNode(offset) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1812
    offset = MakeConX(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1813
    return Type::RawPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1814
  } else if (base_type->base() == Type::RawPtr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1815
    return Type::RawPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1816
  } else if (base_type->isa_oopptr()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1817
    // Base is never null => always a heap address.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1818
    if (base_type->ptr() == TypePtr::NotNull) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1819
      return Type::OopPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1820
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1821
    // Offset is small => always a heap address.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1822
    const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1823
    if (offset_type != NULL &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1824
        base_type->offset() == 0 &&     // (should always be?)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1825
        offset_type->_lo >= 0 &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1826
        !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1827
      return Type::OopPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1828
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1829
    // Otherwise, it might either be oop+off or NULL+addr.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1830
    return Type::AnyPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1831
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1832
    // No information:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1833
    return Type::AnyPtr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1834
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1835
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1836
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1837
inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1838
  int kind = classify_unsafe_addr(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1839
  if (kind == Type::RawPtr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1840
    return basic_plus_adr(top(), base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1841
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1842
    return basic_plus_adr(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1843
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1844
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1845
2862
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1846
//-------------------inline_numberOfLeadingZeros_int/long-----------------------
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1847
// inline int Integer.numberOfLeadingZeros(int)
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1848
// inline int Long.numberOfLeadingZeros(long)
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1849
bool LibraryCallKit::inline_numberOfLeadingZeros(vmIntrinsics::ID id) {
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1850
  assert(id == vmIntrinsics::_numberOfLeadingZeros_i || id == vmIntrinsics::_numberOfLeadingZeros_l, "not numberOfLeadingZeros");
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1851
  if (id == vmIntrinsics::_numberOfLeadingZeros_i && !Matcher::match_rule_supported(Op_CountLeadingZerosI)) return false;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1852
  if (id == vmIntrinsics::_numberOfLeadingZeros_l && !Matcher::match_rule_supported(Op_CountLeadingZerosL)) return false;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1853
  _sp += arg_size();  // restore stack pointer
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1854
  switch (id) {
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1855
  case vmIntrinsics::_numberOfLeadingZeros_i:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1856
    push(_gvn.transform(new (C, 2) CountLeadingZerosINode(pop())));
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1857
    break;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1858
  case vmIntrinsics::_numberOfLeadingZeros_l:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1859
    push(_gvn.transform(new (C, 2) CountLeadingZerosLNode(pop_pair())));
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1860
    break;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1861
  default:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1862
    ShouldNotReachHere();
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1863
  }
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1864
  return true;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1865
}
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1866
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1867
//-------------------inline_numberOfTrailingZeros_int/long----------------------
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1868
// inline int Integer.numberOfTrailingZeros(int)
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1869
// inline int Long.numberOfTrailingZeros(long)
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1870
bool LibraryCallKit::inline_numberOfTrailingZeros(vmIntrinsics::ID id) {
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1871
  assert(id == vmIntrinsics::_numberOfTrailingZeros_i || id == vmIntrinsics::_numberOfTrailingZeros_l, "not numberOfTrailingZeros");
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1872
  if (id == vmIntrinsics::_numberOfTrailingZeros_i && !Matcher::match_rule_supported(Op_CountTrailingZerosI)) return false;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1873
  if (id == vmIntrinsics::_numberOfTrailingZeros_l && !Matcher::match_rule_supported(Op_CountTrailingZerosL)) return false;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1874
  _sp += arg_size();  // restore stack pointer
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1875
  switch (id) {
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1876
  case vmIntrinsics::_numberOfTrailingZeros_i:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1877
    push(_gvn.transform(new (C, 2) CountTrailingZerosINode(pop())));
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1878
    break;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1879
  case vmIntrinsics::_numberOfTrailingZeros_l:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1880
    push(_gvn.transform(new (C, 2) CountTrailingZerosLNode(pop_pair())));
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1881
    break;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1882
  default:
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1883
    ShouldNotReachHere();
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1884
  }
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1885
  return true;
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1886
}
fad636edf18f 6823354: Add intrinsics for {Integer,Long}.{numberOfLeadingZeros,numberOfTrailingZeros}()
twisti
parents: 2574
diff changeset
  1887
2255
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1888
//----------------------------inline_bitCount_int/long-----------------------
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1889
// inline int Integer.bitCount(int)
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1890
// inline int Long.bitCount(long)
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1891
bool LibraryCallKit::inline_bitCount(vmIntrinsics::ID id) {
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1892
  assert(id == vmIntrinsics::_bitCount_i || id == vmIntrinsics::_bitCount_l, "not bitCount");
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1893
  if (id == vmIntrinsics::_bitCount_i && !Matcher::has_match_rule(Op_PopCountI)) return false;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1894
  if (id == vmIntrinsics::_bitCount_l && !Matcher::has_match_rule(Op_PopCountL)) return false;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1895
  _sp += arg_size();  // restore stack pointer
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1896
  switch (id) {
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1897
  case vmIntrinsics::_bitCount_i:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1898
    push(_gvn.transform(new (C, 2) PopCountINode(pop())));
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1899
    break;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1900
  case vmIntrinsics::_bitCount_l:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1901
    push(_gvn.transform(new (C, 2) PopCountLNode(pop_pair())));
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1902
    break;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1903
  default:
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1904
    ShouldNotReachHere();
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1905
  }
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1906
  return true;
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1907
}
54abdf3e1055 6378821: bitCount() should use POPC on SPARC processors and AMD+10h
twisti
parents: 2131
diff changeset
  1908
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1909
//----------------------------inline_reverseBytes_int/long-------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  1910
// inline Integer.reverseBytes(int)
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  1911
// inline Long.reverseBytes(long)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1912
bool LibraryCallKit::inline_reverseBytes(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1913
  assert(id == vmIntrinsics::_reverseBytes_i || id == vmIntrinsics::_reverseBytes_l, "not reverse Bytes");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1914
  if (id == vmIntrinsics::_reverseBytes_i && !Matcher::has_match_rule(Op_ReverseBytesI)) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1915
  if (id == vmIntrinsics::_reverseBytes_l && !Matcher::has_match_rule(Op_ReverseBytesL)) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1916
  _sp += arg_size();        // restore stack pointer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1917
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1918
  case vmIntrinsics::_reverseBytes_i:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1919
    push(_gvn.transform(new (C, 2) ReverseBytesINode(0, pop())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1920
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1921
  case vmIntrinsics::_reverseBytes_l:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1922
    push_pair(_gvn.transform(new (C, 2) ReverseBytesLNode(0, pop_pair())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1923
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1924
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1925
    ;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1926
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1927
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1928
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1929
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1930
//----------------------------inline_unsafe_access----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1931
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1932
const static BasicType T_ADDRESS_HOLDER = T_LONG;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1933
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1934
// Interpret Unsafe.fieldOffset cookies correctly:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1935
extern jlong Unsafe_field_offset_to_byte_offset(jlong field_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1936
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1937
bool LibraryCallKit::inline_unsafe_access(bool is_native_ptr, bool is_store, BasicType type, bool is_volatile) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1938
  if (callee()->is_static())  return false;  // caller must have the capability!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1939
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1940
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1941
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1942
    ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1943
    // Check the signatures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1944
    ciSignature* sig = signature();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1945
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1946
    if (!is_store) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1947
      // Object getObject(Object base, int/long offset), etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1948
      BasicType rtype = sig->return_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1949
      if (rtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::getAddress_name())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1950
          rtype = T_ADDRESS;  // it is really a C void*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1951
      assert(rtype == type, "getter must return the expected value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1952
      if (!is_native_ptr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1953
        assert(sig->count() == 2, "oop getter has 2 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1954
        assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1955
        assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1956
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1957
        assert(sig->count() == 1, "native getter has 1 argument");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1958
        assert(sig->type_at(0)->basic_type() == T_LONG, "getter base is long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1959
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1960
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1961
      // void putObject(Object base, int/long offset, Object x), etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1962
      assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1963
      if (!is_native_ptr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1964
        assert(sig->count() == 3, "oop putter has 3 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1965
        assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1966
        assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1967
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1968
        assert(sig->count() == 2, "native putter has 2 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1969
        assert(sig->type_at(0)->basic_type() == T_LONG, "putter base is long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1970
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1971
      BasicType vtype = sig->type_at(sig->count()-1)->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1972
      if (vtype == T_ADDRESS_HOLDER && callee()->name() == ciSymbol::putAddress_name())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1973
        vtype = T_ADDRESS;  // it is really a C void*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1974
      assert(vtype == type, "putter must accept the expected value");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1975
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1976
#endif // ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1977
 }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1978
#endif //PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1979
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1980
  C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1981
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1982
  int type_words = type2size[ (type == T_ADDRESS) ? T_LONG : type ];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1983
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1984
  // Argument words:  "this" plus (oop/offset) or (lo/hi) args plus maybe 1 or 2 value words
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1985
  int nargs = 1 + (is_native_ptr ? 2 : 3) + (is_store ? type_words : 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1986
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1987
  debug_only(int saved_sp = _sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1988
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1989
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1990
  Node* val;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1991
  debug_only(val = (Node*)(uintptr_t)-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1992
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1993
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1994
  if (is_store) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1995
    // Get the value being stored.  (Pop it first; it was pushed last.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1996
    switch (type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1997
    case T_DOUBLE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1998
    case T_LONG:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1999
    case T_ADDRESS:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2000
      val = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2001
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2002
    default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2003
      val = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2004
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2005
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2006
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2007
  // Build address expression.  See the code in inline_unsafe_prefetch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2008
  Node *adr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2009
  Node *heap_base_oop = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2010
  if (!is_native_ptr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2011
    // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2012
    Node* offset = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2013
    // The base is either a Java object or a value produced by Unsafe.staticFieldBase
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2014
    Node* base   = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2015
    // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2016
    // to be plain byte offsets, which are also the same as those accepted
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2017
    // by oopDesc::field_base.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2018
    assert(Unsafe_field_offset_to_byte_offset(11) == 11,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2019
           "fieldOffset must be byte-scaled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2020
    // 32-bit machines ignore the high half!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2021
    offset = ConvL2X(offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2022
    adr = make_unsafe_address(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2023
    heap_base_oop = base;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2024
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2025
    Node* ptr = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2026
    // Adjust Java long to machine word:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2027
    ptr = ConvL2X(ptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2028
    adr = make_unsafe_address(NULL, ptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2029
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2030
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2031
  // Pop receiver last:  it was pushed first.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2032
  Node *receiver = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2033
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2034
  assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2035
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2036
  const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2037
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2038
  // First guess at the value type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2039
  const Type *value_type = Type::get_const_basic_type(type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2040
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2041
  // Try to categorize the address.  If it comes up as TypeJavaPtr::BOTTOM,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2042
  // there was not enough information to nail it down.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2043
  Compile::AliasType* alias_type = C->alias_type(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2044
  assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2045
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2046
  // We will need memory barriers unless we can determine a unique
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2047
  // alias category for this reference.  (Note:  If for some reason
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2048
  // the barriers get omitted and the unsafe reference begins to "pollute"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2049
  // the alias analysis of the rest of the graph, either Compile::can_alias
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2050
  // or Compile::must_alias will throw a diagnostic assert.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2051
  bool need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2052
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2053
  if (!is_store && type == T_OBJECT) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2054
    // Attempt to infer a sharper value type from the offset and base type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2055
    ciKlass* sharpened_klass = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2056
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2057
    // See if it is an instance field, with an object type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2058
    if (alias_type->field() != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2059
      assert(!is_native_ptr, "native pointer op cannot use a java address");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2060
      if (alias_type->field()->type()->is_klass()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2061
        sharpened_klass = alias_type->field()->type()->as_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2062
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2063
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2064
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2065
    // See if it is a narrow oop array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2066
    if (adr_type->isa_aryptr()) {
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2067
      if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes(type)) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2068
        const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2069
        if (elem_type != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2070
          sharpened_klass = elem_type->klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2071
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2072
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2073
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2074
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2075
    if (sharpened_klass != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2076
      const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2077
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2078
      // Sharpen the value type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2079
      value_type = tjp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2080
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2081
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2082
      if (PrintIntrinsics || PrintInlining || PrintOptoInlining) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2083
        tty->print("  from base type:  ");   adr_type->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2084
        tty->print("  sharpened value: "); value_type->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2085
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2086
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2087
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2088
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2089
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2090
  // Null check on self without removing any arguments.  The argument
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2091
  // null check technically happens in the wrong place, which can lead to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2092
  // invalid stack traces when the primitive is inlined into a method
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2093
  // which handles NullPointerExceptions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2094
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2095
  do_null_check(receiver, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2096
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2097
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2098
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2099
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2100
  // Heap pointers get a null-check from the interpreter,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2101
  // as a courtesy.  However, this is not guaranteed by Unsafe,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2102
  // and it is not possible to fully distinguish unintended nulls
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2103
  // from intended ones in this API.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2104
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2105
  if (is_volatile) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2106
    // We need to emit leading and trailing CPU membars (see below) in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2107
    // addition to memory membars when is_volatile. This is a little
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2108
    // too strong, but avoids the need to insert per-alias-type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2109
    // volatile membars (for stores; compare Parse::do_put_xxx), which
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  2110
    // we cannot do effectively here because we probably only have a
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2111
    // rough approximation of type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2112
    need_mem_bar = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2113
    // For Stores, place a memory ordering barrier now.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2114
    if (is_store)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2115
      insert_mem_bar(Op_MemBarRelease);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2116
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2117
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2118
  // Memory barrier to prevent normal and 'unsafe' accesses from
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2119
  // bypassing each other.  Happens after null checks, so the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2120
  // exception paths do not take memory state from the memory barrier,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2121
  // so there's no problems making a strong assert about mixing users
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2122
  // of safe & unsafe memory.  Otherwise fails in a CTW of rt.jar
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2123
  // around 5701, class sun/reflect/UnsafeBooleanFieldAccessorImpl.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2124
  if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2125
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2126
  if (!is_store) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2127
    Node* p = make_load(control(), adr, value_type, type, adr_type, is_volatile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2128
    // load value and push onto stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2129
    switch (type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2130
    case T_BOOLEAN:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2131
    case T_CHAR:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2132
    case T_BYTE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2133
    case T_SHORT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2134
    case T_INT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2135
    case T_FLOAT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2136
    case T_OBJECT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2137
      push( p );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2138
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2139
    case T_ADDRESS:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2140
      // Cast to an int type.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2141
      p = _gvn.transform( new (C, 2) CastP2XNode(NULL,p) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2142
      p = ConvX2L(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2143
      push_pair(p);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2144
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2145
    case T_DOUBLE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2146
    case T_LONG:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2147
      push_pair( p );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2148
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2149
    default: ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2150
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2151
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2152
    // place effect of store into memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2153
    switch (type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2154
    case T_DOUBLE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2155
      val = dstore_rounding(val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2156
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2157
    case T_ADDRESS:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2158
      // Repackage the long as a pointer.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2159
      val = ConvL2X(val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2160
      val = _gvn.transform( new (C, 2) CastX2PNode(val) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2161
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2162
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2163
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2164
    if (type != T_OBJECT ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2165
      (void) store_to_memory(control(), adr, val, type, adr_type, is_volatile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2166
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2167
      // Possibly an oop being stored to Java heap or native memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2168
      if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2169
        // oop to Java heap.
3178
596a9ab2a92d 6818666: G1: Type lost in g1 pre-barrier
never
parents: 2874
diff changeset
  2170
        (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2171
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2172
        // We can't tell at compile time if we are storing in the Java heap or outside
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2173
        // of it. So we need to emit code to conditionally do the proper type of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2174
        // store.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2175
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2176
        IdealKit ideal(gvn(), control(),  merged_memory());
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2177
#define __ ideal.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2178
        // QQQ who knows what probability is here??
3268
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2179
        __ if_then(heap_base_oop, BoolTest::ne, null(), PROB_UNLIKELY(0.999)); {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2180
          // Sync IdealKit and graphKit.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2181
          set_all_memory( __ merged_memory());
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2182
          set_control(__ ctrl());
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2183
          Node* st = store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2184
          // Update IdealKit memory.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2185
          __ set_all_memory(merged_memory());
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2186
          __ set_ctrl(control());
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2187
        } __ else_(); {
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2188
          __ store(__ ctrl(), adr, val, type, alias_type->index(), is_volatile);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2189
        } __ end_if();
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2190
        // Final sync IdealKit and GraphKit.
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2191
        sync_kit(ideal);
f034e0c86895 6851742: (EA) allocation elimination doesn't work with UseG1GC
kvn
parents: 3189
diff changeset
  2192
#undef __
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2193
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2194
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2195
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2196
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2197
  if (is_volatile) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2198
    if (!is_store)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2199
      insert_mem_bar(Op_MemBarAcquire);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2200
    else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2201
      insert_mem_bar(Op_MemBarVolatile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2202
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2203
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2204
  if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2205
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2206
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2207
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2208
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2209
//----------------------------inline_unsafe_prefetch----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2210
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2211
bool LibraryCallKit::inline_unsafe_prefetch(bool is_native_ptr, bool is_store, bool is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2212
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2213
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2214
    ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2215
    // Check the signatures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2216
    ciSignature* sig = signature();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2217
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2218
    // Object getObject(Object base, int/long offset), etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2219
    BasicType rtype = sig->return_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2220
    if (!is_native_ptr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2221
      assert(sig->count() == 2, "oop prefetch has 2 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2222
      assert(sig->type_at(0)->basic_type() == T_OBJECT, "prefetch base is object");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2223
      assert(sig->type_at(1)->basic_type() == T_LONG, "prefetcha offset is correct");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2224
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2225
      assert(sig->count() == 1, "native prefetch has 1 argument");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2226
      assert(sig->type_at(0)->basic_type() == T_LONG, "prefetch base is long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2227
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2228
#endif // ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2229
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2230
#endif // !PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2231
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2232
  C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2233
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2234
  // Argument words:  "this" if not static, plus (oop/offset) or (lo/hi) args
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2235
  int nargs = (is_static ? 0 : 1) + (is_native_ptr ? 2 : 3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2236
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2237
  debug_only(int saved_sp = _sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2238
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2239
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2240
  // Build address expression.  See the code in inline_unsafe_access.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2241
  Node *adr;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2242
  if (!is_native_ptr) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2243
    // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2244
    Node* offset = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2245
    // The base is either a Java object or a value produced by Unsafe.staticFieldBase
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2246
    Node* base   = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2247
    // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2248
    // to be plain byte offsets, which are also the same as those accepted
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2249
    // by oopDesc::field_base.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2250
    assert(Unsafe_field_offset_to_byte_offset(11) == 11,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2251
           "fieldOffset must be byte-scaled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2252
    // 32-bit machines ignore the high half!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2253
    offset = ConvL2X(offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2254
    adr = make_unsafe_address(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2255
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2256
    Node* ptr = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2257
    // Adjust Java long to machine word:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2258
    ptr = ConvL2X(ptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2259
    adr = make_unsafe_address(NULL, ptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2260
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2261
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2262
  if (is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2263
    assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2264
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2265
    // Pop receiver last:  it was pushed first.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2266
    Node *receiver = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2267
    assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2268
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2269
    // Null check on self without removing any arguments.  The argument
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2270
    // null check technically happens in the wrong place, which can lead to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2271
    // invalid stack traces when the primitive is inlined into a method
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2272
    // which handles NullPointerExceptions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2273
    _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2274
    do_null_check(receiver, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2275
    _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2276
    if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2277
      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2278
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2279
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2280
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2281
  // Generate the read or write prefetch
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2282
  Node *prefetch;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2283
  if (is_store) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2284
    prefetch = new (C, 3) PrefetchWriteNode(i_o(), adr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2285
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2286
    prefetch = new (C, 3) PrefetchReadNode(i_o(), adr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2287
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2288
  prefetch->init_req(0, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2289
  set_i_o(_gvn.transform(prefetch));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2290
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2291
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2292
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2293
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2294
//----------------------------inline_unsafe_CAS----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2295
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2296
bool LibraryCallKit::inline_unsafe_CAS(BasicType type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2297
  // This basic scheme here is the same as inline_unsafe_access, but
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2298
  // differs in enough details that combining them would make the code
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2299
  // overly confusing.  (This is a true fact! I originally combined
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2300
  // them, but even I was confused by it!) As much code/comments as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2301
  // possible are retained from inline_unsafe_access though to make
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  2302
  // the correspondences clearer. - dl
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2303
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2304
  if (callee()->is_static())  return false;  // caller must have the capability!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2305
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2306
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2307
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2308
    ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2309
    // Check the signatures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2310
    ciSignature* sig = signature();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2311
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2312
    BasicType rtype = sig->return_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2313
    assert(rtype == T_BOOLEAN, "CAS must return boolean");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2314
    assert(sig->count() == 4, "CAS has 4 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2315
    assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2316
    assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2317
#endif // ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2318
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2319
#endif //PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2320
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2321
  // number of stack slots per value argument (1 or 2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2322
  int type_words = type2size[type];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2323
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2324
  // Cannot inline wide CAS on machines that don't support it natively
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
  2325
  if (type2aelembytes(type) > BytesPerInt && !VM_Version::supports_cx8())
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2326
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2327
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2328
  C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2329
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2330
  // Argument words:  "this" plus oop plus offset plus oldvalue plus newvalue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2331
  int nargs = 1 + 1 + 2  + type_words + type_words;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2332
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2333
  // pop arguments: newval, oldval, offset, base, and receiver
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2334
  debug_only(int saved_sp = _sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2335
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2336
  Node* newval   = (type_words == 1) ? pop() : pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2337
  Node* oldval   = (type_words == 1) ? pop() : pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2338
  Node *offset   = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2339
  Node *base     = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2340
  Node *receiver = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2341
  assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2342
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2343
  //  Null check receiver.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2344
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2345
  do_null_check(receiver, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2346
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2347
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2348
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2349
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2350
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2351
  // Build field offset expression.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2352
  // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2353
  // to be plain byte offsets, which are also the same as those accepted
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2354
  // by oopDesc::field_base.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2355
  assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2356
  // 32-bit machines ignore the high half of long offsets
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2357
  offset = ConvL2X(offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2358
  Node* adr = make_unsafe_address(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2359
  const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2360
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2361
  // (Unlike inline_unsafe_access, there seems no point in trying
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2362
  // to refine types. Just use the coarse types here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2363
  const Type *value_type = Type::get_const_basic_type(type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2364
  Compile::AliasType* alias_type = C->alias_type(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2365
  assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2366
  int alias_idx = C->get_alias_index(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2367
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2368
  // Memory-model-wise, a CAS acts like a little synchronized block,
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  2369
  // so needs barriers on each side.  These don't translate into
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2370
  // actual barriers on most machines, but we still need rest of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2371
  // compiler to respect ordering.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2372
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2373
  insert_mem_bar(Op_MemBarRelease);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2374
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2375
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2376
  // 4984716: MemBars must be inserted before this
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2377
  //          memory node in order to avoid a false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2378
  //          dependency which will confuse the scheduler.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2379
  Node *mem = memory(alias_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2380
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2381
  // For now, we handle only those cases that actually exist: ints,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2382
  // longs, and Object. Adding others should be straightforward.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2383
  Node* cas;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2384
  switch(type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2385
  case T_INT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2386
    cas = _gvn.transform(new (C, 5) CompareAndSwapINode(control(), mem, adr, newval, oldval));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2387
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2388
  case T_LONG:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2389
    cas = _gvn.transform(new (C, 5) CompareAndSwapLNode(control(), mem, adr, newval, oldval));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2390
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2391
  case T_OBJECT:
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2392
     // reference stores need a store barrier.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2393
    // (They don't if CAS fails, but it isn't worth checking.)
3180
c589129153a4 6856025: assert(_base >= OopPtr && _base <= KlassPtr,"Not a Java pointer")
never
parents: 3178
diff changeset
  2394
    pre_barrier(control(), base, adr, alias_idx, newval, value_type->make_oopptr(), T_OBJECT);
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2395
#ifdef _LP64
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 360
diff changeset
  2396
    if (adr->bottom_type()->is_ptr_to_narrowoop()) {
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2397
      Node *newval_enc = _gvn.transform(new (C, 2) EncodePNode(newval, newval->bottom_type()->make_narrowoop()));
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2398
      Node *oldval_enc = _gvn.transform(new (C, 2) EncodePNode(oldval, oldval->bottom_type()->make_narrowoop()));
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2399
      cas = _gvn.transform(new (C, 5) CompareAndSwapNNode(control(), mem, adr,
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2400
                                                          newval_enc, oldval_enc));
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2401
    } else
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  2402
#endif
767
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2403
    {
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2404
      cas = _gvn.transform(new (C, 5) CompareAndSwapPNode(control(), mem, adr, newval, oldval));
64fb1fd7186d 6710487: More than half of JDI Regression tests hang with COOPs in -Xcomp mode
kvn
parents: 600
diff changeset
  2405
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2406
    post_barrier(control(), cas, base, adr, alias_idx, newval, T_OBJECT, true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2407
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2408
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2409
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2410
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2411
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2412
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2413
  // SCMemProjNodes represent the memory state of CAS. Their main
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2414
  // role is to prevent CAS nodes from being optimized away when their
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2415
  // results aren't used.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2416
  Node* proj = _gvn.transform( new (C, 1) SCMemProjNode(cas));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2417
  set_memory(proj, alias_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2418
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2419
  // Add the trailing membar surrounding the access
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2420
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2421
  insert_mem_bar(Op_MemBarAcquire);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2422
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2423
  push(cas);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2424
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2425
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2426
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2427
bool LibraryCallKit::inline_unsafe_ordered_store(BasicType type) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2428
  // This is another variant of inline_unsafe_access, differing in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2429
  // that it always issues store-store ("release") barrier and ensures
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2430
  // store-atomicity (which only matters for "long").
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2431
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2432
  if (callee()->is_static())  return false;  // caller must have the capability!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2433
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2434
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2435
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2436
    ResourceMark rm;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2437
    // Check the signatures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2438
    ciSignature* sig = signature();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2439
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2440
    BasicType rtype = sig->return_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2441
    assert(rtype == T_VOID, "must return void");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2442
    assert(sig->count() == 3, "has 3 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2443
    assert(sig->type_at(0)->basic_type() == T_OBJECT, "base is object");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2444
    assert(sig->type_at(1)->basic_type() == T_LONG, "offset is long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2445
#endif // ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2446
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2447
#endif //PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2448
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2449
  // number of stack slots per value argument (1 or 2)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2450
  int type_words = type2size[type];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2451
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2452
  C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2453
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2454
  // Argument words:  "this" plus oop plus offset plus value;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2455
  int nargs = 1 + 1 + 2 + type_words;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2456
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2457
  // pop arguments: val, offset, base, and receiver
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2458
  debug_only(int saved_sp = _sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2459
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2460
  Node* val      = (type_words == 1) ? pop() : pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2461
  Node *offset   = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2462
  Node *base     = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2463
  Node *receiver = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2464
  assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2465
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2466
  //  Null check receiver.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2467
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2468
  do_null_check(receiver, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2469
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2470
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2471
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2472
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2473
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2474
  // Build field offset expression.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2475
  assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2476
  // 32-bit machines ignore the high half of long offsets
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2477
  offset = ConvL2X(offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2478
  Node* adr = make_unsafe_address(base, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2479
  const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2480
  const Type *value_type = Type::get_const_basic_type(type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2481
  Compile::AliasType* alias_type = C->alias_type(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2482
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2483
  insert_mem_bar(Op_MemBarRelease);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2484
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2485
  // Ensure that the store is atomic for longs:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2486
  bool require_atomic_access = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2487
  Node* store;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2488
  if (type == T_OBJECT) // reference stores need a store barrier.
3178
596a9ab2a92d 6818666: G1: Type lost in g1 pre-barrier
never
parents: 2874
diff changeset
  2489
    store = store_oop_to_unknown(control(), base, adr, adr_type, val, type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2490
  else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2491
    store = store_to_memory(control(), adr, val, type, adr_type, require_atomic_access);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2492
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2493
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2494
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2495
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2496
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2497
bool LibraryCallKit::inline_unsafe_allocate() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2498
  if (callee()->is_static())  return false;  // caller must have the capability!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2499
  int nargs = 1 + 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2500
  assert(signature()->size() == nargs-1, "alloc has 1 argument");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2501
  null_check_receiver(callee());  // check then ignore argument(0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2502
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2503
  Node* cls = do_null_check(argument(1), T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2504
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2505
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2506
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2507
  Node* kls = load_klass_from_mirror(cls, false, nargs, NULL, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2508
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2509
  kls = do_null_check(kls, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2510
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2511
  if (stopped())  return true;  // argument was like int.class
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2512
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2513
  // Note:  The argument might still be an illegal value like
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2514
  // Serializable.class or Object[].class.   The runtime will handle it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2515
  // But we must make an explicit check for initialization.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2516
  Node* insp = basic_plus_adr(kls, instanceKlass::init_state_offset_in_bytes() + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2517
  Node* inst = make_load(NULL, insp, TypeInt::INT, T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2518
  Node* bits = intcon(instanceKlass::fully_initialized);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2519
  Node* test = _gvn.transform( new (C, 3) SubINode(inst, bits) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2520
  // The 'test' is non-zero if we need to take a slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2521
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2522
  Node* obj = new_instance(kls, test);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2523
  push(obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2524
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2525
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2526
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2527
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2528
//------------------------inline_native_time_funcs--------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2529
// inline code for System.currentTimeMillis() and System.nanoTime()
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2530
// these have the same type and signature
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2531
bool LibraryCallKit::inline_native_time_funcs(bool isNano) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2532
  address funcAddr = isNano ? CAST_FROM_FN_PTR(address, os::javaTimeNanos) :
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2533
                              CAST_FROM_FN_PTR(address, os::javaTimeMillis);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2534
  const char * funcName = isNano ? "nanoTime" : "currentTimeMillis";
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2535
  const TypeFunc *tf = OptoRuntime::current_time_millis_Type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2536
  const TypePtr* no_memory_effects = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2537
  Node* time = make_runtime_call(RC_LEAF, tf, funcAddr, funcName, no_memory_effects);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2538
  Node* value = _gvn.transform(new (C, 1) ProjNode(time, TypeFunc::Parms+0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2539
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2540
  Node* value_top = _gvn.transform(new (C, 1) ProjNode(time, TypeFunc::Parms + 1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2541
  assert(value_top == top(), "second value must be top");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2542
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2543
  push_pair(value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2544
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2545
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2546
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2547
//------------------------inline_native_currentThread------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2548
bool LibraryCallKit::inline_native_currentThread() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2549
  Node* junk = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2550
  push(generate_current_thread(junk));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2551
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2552
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2553
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2554
//------------------------inline_native_isInterrupted------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2555
bool LibraryCallKit::inline_native_isInterrupted() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2556
  const int nargs = 1+1;  // receiver + boolean
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2557
  assert(nargs == arg_size(), "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2558
  // Add a fast path to t.isInterrupted(clear_int):
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2559
  //   (t == Thread.current() && (!TLS._osthread._interrupted || !clear_int))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2560
  //   ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2561
  // So, in the common case that the interrupt bit is false,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2562
  // we avoid making a call into the VM.  Even if the interrupt bit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2563
  // is true, if the clear_int argument is false, we avoid the VM call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2564
  // However, if the receiver is not currentThread, we must call the VM,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2565
  // because there must be some locking done around the operation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2566
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2567
  // We only go to the fast case code if we pass two guards.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2568
  // Paths which do not pass are accumulated in the slow_region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2569
  RegionNode* slow_region = new (C, 1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2570
  record_for_igvn(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2571
  RegionNode* result_rgn = new (C, 4) RegionNode(1+3); // fast1, fast2, slow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2572
  PhiNode*    result_val = new (C, 4) PhiNode(result_rgn, TypeInt::BOOL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2573
  enum { no_int_result_path   = 1,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2574
         no_clear_result_path = 2,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2575
         slow_result_path     = 3
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2576
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2577
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2578
  // (a) Receiving thread must be the current thread.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2579
  Node* rec_thr = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2580
  Node* tls_ptr = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2581
  Node* cur_thr = generate_current_thread(tls_ptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2582
  Node* cmp_thr = _gvn.transform( new (C, 3) CmpPNode(cur_thr, rec_thr) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2583
  Node* bol_thr = _gvn.transform( new (C, 2) BoolNode(cmp_thr, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2584
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2585
  bool known_current_thread = (_gvn.type(bol_thr) == TypeInt::ZERO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2586
  if (!known_current_thread)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2587
    generate_slow_guard(bol_thr, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2588
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2589
  // (b) Interrupt bit on TLS must be false.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2590
  Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset()));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2591
  Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2592
  p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::interrupted_offset()));
2874
cb263b90c794 6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents: 2862
diff changeset
  2593
  // Set the control input on the field _interrupted read to prevent it floating up.
cb263b90c794 6772683: Thread.isInterrupted() fails to return true on multiprocessor PC
kvn
parents: 2862
diff changeset
  2594
  Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2595
  Node* cmp_bit = _gvn.transform( new (C, 3) CmpINode(int_bit, intcon(0)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2596
  Node* bol_bit = _gvn.transform( new (C, 2) BoolNode(cmp_bit, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2597
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2598
  IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2599
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2600
  // First fast path:  if (!TLS._interrupted) return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2601
  Node* false_bit = _gvn.transform( new (C, 1) IfFalseNode(iff_bit) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2602
  result_rgn->init_req(no_int_result_path, false_bit);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2603
  result_val->init_req(no_int_result_path, intcon(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2604
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2605
  // drop through to next case
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2606
  set_control( _gvn.transform(new (C, 1) IfTrueNode(iff_bit)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2607
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2608
  // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2609
  Node* clr_arg = argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2610
  Node* cmp_arg = _gvn.transform( new (C, 3) CmpINode(clr_arg, intcon(0)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2611
  Node* bol_arg = _gvn.transform( new (C, 2) BoolNode(cmp_arg, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2612
  IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2613
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2614
  // Second fast path:  ... else if (!clear_int) return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2615
  Node* false_arg = _gvn.transform( new (C, 1) IfFalseNode(iff_arg) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2616
  result_rgn->init_req(no_clear_result_path, false_arg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2617
  result_val->init_req(no_clear_result_path, intcon(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2618
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2619
  // drop through to next case
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2620
  set_control( _gvn.transform(new (C, 1) IfTrueNode(iff_arg)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2621
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2622
  // (d) Otherwise, go to the slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2623
  slow_region->add_req(control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2624
  set_control( _gvn.transform(slow_region) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2625
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2626
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2627
    // There is no slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2628
    result_rgn->init_req(slow_result_path, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2629
    result_val->init_req(slow_result_path, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2630
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2631
    // non-virtual because it is a private non-static
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2632
    CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2633
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2634
    Node* slow_val = set_results_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2635
    // this->control() comes from set_results_for_java_call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2636
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2637
    // If we know that the result of the slow call will be true, tell the optimizer!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2638
    if (known_current_thread)  slow_val = intcon(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2639
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2640
    Node* fast_io  = slow_call->in(TypeFunc::I_O);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2641
    Node* fast_mem = slow_call->in(TypeFunc::Memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2642
    // These two phis are pre-filled with copies of of the fast IO and Memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2643
    Node* io_phi   = PhiNode::make(result_rgn, fast_io,  Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2644
    Node* mem_phi  = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2645
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2646
    result_rgn->init_req(slow_result_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2647
    io_phi    ->init_req(slow_result_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2648
    mem_phi   ->init_req(slow_result_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2649
    result_val->init_req(slow_result_path, slow_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2650
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2651
    set_all_memory( _gvn.transform(mem_phi) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2652
    set_i_o(        _gvn.transform(io_phi) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2653
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2654
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2655
  push_result(result_rgn, result_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2656
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2657
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2658
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2659
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2660
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2661
//---------------------------load_mirror_from_klass----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2662
// Given a klass oop, load its java mirror (a java.lang.Class oop).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2663
Node* LibraryCallKit::load_mirror_from_klass(Node* klass) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2664
  Node* p = basic_plus_adr(klass, Klass::java_mirror_offset_in_bytes() + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2665
  return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2666
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2667
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2668
//-----------------------load_klass_from_mirror_common-------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2669
// Given a java mirror (a java.lang.Class oop), load its corresponding klass oop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2670
// Test the klass oop for null (signifying a primitive Class like Integer.TYPE),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2671
// and branch to the given path on the region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2672
// If never_see_null, take an uncommon trap on null, so we can optimistically
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2673
// compile for the non-null case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2674
// If the region is NULL, force never_see_null = true.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2675
Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2676
                                                    bool never_see_null,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2677
                                                    int nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2678
                                                    RegionNode* region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2679
                                                    int null_path,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2680
                                                    int offset) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2681
  if (region == NULL)  never_see_null = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2682
  Node* p = basic_plus_adr(mirror, offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2683
  const TypeKlassPtr*  kls_type = TypeKlassPtr::OBJECT_OR_NULL;
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  2684
  Node* kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2685
  _sp += nargs; // any deopt will start just before call to enclosing method
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2686
  Node* null_ctl = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2687
  kls = null_check_oop(kls, &null_ctl, never_see_null);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2688
  if (region != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2689
    // Set region->in(null_path) if the mirror is a primitive (e.g, int.class).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2690
    region->init_req(null_path, null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2691
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2692
    assert(null_ctl == top(), "no loose ends");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2693
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2694
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2695
  return kls;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2696
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2697
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2698
//--------------------(inline_native_Class_query helpers)---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2699
// Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE, JVM_ACC_HAS_FINALIZER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2700
// Fall through if (mods & mask) == bits, take the guard otherwise.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2701
Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2702
  // Branch around if the given klass has the given modifier bit set.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2703
  // Like generate_guard, adds a new path onto the region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2704
  Node* modp = basic_plus_adr(kls, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2705
  Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2706
  Node* mask = intcon(modifier_mask);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2707
  Node* bits = intcon(modifier_bits);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2708
  Node* mbit = _gvn.transform( new (C, 3) AndINode(mods, mask) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2709
  Node* cmp  = _gvn.transform( new (C, 3) CmpINode(mbit, bits) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2710
  Node* bol  = _gvn.transform( new (C, 2) BoolNode(cmp, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2711
  return generate_fair_guard(bol, region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2712
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2713
Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2714
  return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2715
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2716
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2717
//-------------------------inline_native_Class_query-------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2718
bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2719
  int nargs = 1+0;  // just the Class mirror, in most cases
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2720
  const Type* return_type = TypeInt::BOOL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2721
  Node* prim_return_value = top();  // what happens if it's a primitive class?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2722
  bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2723
  bool expect_prim = false;     // most of these guys expect to work on refs
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2724
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2725
  enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2726
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2727
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2728
  case vmIntrinsics::_isInstance:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2729
    nargs = 1+1;  // the Class mirror, plus the object getting queried about
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2730
    // nothing is an instance of a primitive type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2731
    prim_return_value = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2732
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2733
  case vmIntrinsics::_getModifiers:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2734
    prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2735
    assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2736
    return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2737
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2738
  case vmIntrinsics::_isInterface:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2739
    prim_return_value = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2740
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2741
  case vmIntrinsics::_isArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2742
    prim_return_value = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2743
    expect_prim = true;  // cf. ObjectStreamClass.getClassSignature
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2744
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2745
  case vmIntrinsics::_isPrimitive:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2746
    prim_return_value = intcon(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2747
    expect_prim = true;  // obviously
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2748
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2749
  case vmIntrinsics::_getSuperclass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2750
    prim_return_value = null();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2751
    return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2752
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2753
  case vmIntrinsics::_getComponentType:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2754
    prim_return_value = null();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2755
    return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2756
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2757
  case vmIntrinsics::_getClassAccessFlags:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2758
    prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2759
    return_type = TypeInt::INT;  // not bool!  6297094
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2760
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2761
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2762
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2763
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2764
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2765
  Node* mirror =                      argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2766
  Node* obj    = (nargs <= 1)? top(): argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2767
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2768
  const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2769
  if (mirror_con == NULL)  return false;  // cannot happen?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2770
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2771
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2772
  if (PrintIntrinsics || PrintInlining || PrintOptoInlining) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2773
    ciType* k = mirror_con->java_mirror_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2774
    if (k) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2775
      tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id()));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2776
      k->print_name();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2777
      tty->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2778
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2779
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2780
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2781
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2782
  // Null-check the mirror, and the mirror's klass ptr (in case it is a primitive).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2783
  RegionNode* region = new (C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2784
  record_for_igvn(region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2785
  PhiNode* phi = new (C, PATH_LIMIT) PhiNode(region, return_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2786
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2787
  // The mirror will never be null of Reflection.getClassAccessFlags, however
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2788
  // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2789
  // if it is. See bug 4774291.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2790
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2791
  // For Reflection.getClassAccessFlags(), the null check occurs in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2792
  // the wrong place; see inline_unsafe_access(), above, for a similar
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2793
  // situation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2794
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2795
  mirror = do_null_check(mirror, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2796
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2797
  // If mirror or obj is dead, only null-path is taken.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2798
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2799
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2800
  if (expect_prim)  never_see_null = false;  // expect nulls (meaning prims)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2801
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2802
  // Now load the mirror's klass metaobject, and null-check it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2803
  // Side-effects region with the control path if the klass is null.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2804
  Node* kls = load_klass_from_mirror(mirror, never_see_null, nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2805
                                     region, _prim_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2806
  // If kls is null, we have a primitive mirror.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2807
  phi->init_req(_prim_path, prim_return_value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2808
  if (stopped()) { push_result(region, phi); return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2809
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2810
  Node* p;  // handy temp
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2811
  Node* null_ctl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2812
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2813
  // Now that we have the non-null klass, we can perform the real query.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2814
  // For constant classes, the query will constant-fold in LoadNode::Value.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2815
  Node* query_value = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2816
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2817
  case vmIntrinsics::_isInstance:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2818
    // nothing is an instance of a primitive type
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2819
    query_value = gen_instanceof(obj, kls);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2820
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2821
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2822
  case vmIntrinsics::_getModifiers:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2823
    p = basic_plus_adr(kls, Klass::modifier_flags_offset_in_bytes() + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2824
    query_value = make_load(NULL, p, TypeInt::INT, T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2825
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2826
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2827
  case vmIntrinsics::_isInterface:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2828
    // (To verify this code sequence, check the asserts in JVM_IsInterface.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2829
    if (generate_interface_guard(kls, region) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2830
      // A guard was added.  If the guard is taken, it was an interface.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2831
      phi->add_req(intcon(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2832
    // If we fall through, it's a plain class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2833
    query_value = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2834
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2835
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2836
  case vmIntrinsics::_isArray:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2837
    // (To verify this code sequence, check the asserts in JVM_IsArrayClass.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2838
    if (generate_array_guard(kls, region) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2839
      // A guard was added.  If the guard is taken, it was an array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2840
      phi->add_req(intcon(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2841
    // If we fall through, it's a plain class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2842
    query_value = intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2843
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2844
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2845
  case vmIntrinsics::_isPrimitive:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2846
    query_value = intcon(0); // "normal" path produces false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2847
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2848
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2849
  case vmIntrinsics::_getSuperclass:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2850
    // The rules here are somewhat unfortunate, but we can still do better
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2851
    // with random logic than with a JNI call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2852
    // Interfaces store null or Object as _super, but must report null.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2853
    // Arrays store an intermediate super as _super, but must report Object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2854
    // Other types can report the actual _super.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2855
    // (To verify this code sequence, check the asserts in JVM_IsInterface.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2856
    if (generate_interface_guard(kls, region) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2857
      // A guard was added.  If the guard is taken, it was an interface.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2858
      phi->add_req(null());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2859
    if (generate_array_guard(kls, region) != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2860
      // A guard was added.  If the guard is taken, it was an array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2861
      phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2862
    // If we fall through, it's a plain class.  Get its _super.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2863
    p = basic_plus_adr(kls, Klass::super_offset_in_bytes() + sizeof(oopDesc));
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  2864
    kls = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL) );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2865
    null_ctl = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2866
    kls = null_check_oop(kls, &null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2867
    if (null_ctl != top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2868
      // If the guard is taken, Object.superClass is null (both klass and mirror).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2869
      region->add_req(null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2870
      phi   ->add_req(null());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2871
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2872
    if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2873
      query_value = load_mirror_from_klass(kls);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2874
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2875
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2876
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2877
  case vmIntrinsics::_getComponentType:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2878
    if (generate_array_guard(kls, region) != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2879
      // Be sure to pin the oop load to the guard edge just created:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2880
      Node* is_array_ctrl = region->in(region->req()-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2881
      Node* cma = basic_plus_adr(kls, in_bytes(arrayKlass::component_mirror_offset()) + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2882
      Node* cmo = make_load(is_array_ctrl, cma, TypeInstPtr::MIRROR, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2883
      phi->add_req(cmo);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2884
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2885
    query_value = null();  // non-array case is null
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2886
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2887
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2888
  case vmIntrinsics::_getClassAccessFlags:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2889
    p = basic_plus_adr(kls, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2890
    query_value = make_load(NULL, p, TypeInt::INT, T_INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2891
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2892
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2893
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2894
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2895
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2896
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2897
  // Fall-through is the normal case of a query to a real class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2898
  phi->init_req(1, query_value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2899
  region->init_req(1, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2900
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2901
  push_result(region, phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2902
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2903
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2904
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2905
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2906
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2907
//--------------------------inline_native_subtype_check------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2908
// This intrinsic takes the JNI calls out of the heart of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2909
// UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2910
bool LibraryCallKit::inline_native_subtype_check() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2911
  int nargs = 1+1;  // the Class mirror, plus the other class getting examined
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2912
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2913
  // Pull both arguments off the stack.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2914
  Node* args[2];                // two java.lang.Class mirrors: superc, subc
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2915
  args[0] = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2916
  args[1] = argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2917
  Node* klasses[2];             // corresponding Klasses: superk, subk
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2918
  klasses[0] = klasses[1] = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2919
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2920
  enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2921
    // A full decision tree on {superc is prim, subc is prim}:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2922
    _prim_0_path = 1,           // {P,N} => false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2923
                                // {P,P} & superc!=subc => false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2924
    _prim_same_path,            // {P,P} & superc==subc => true
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2925
    _prim_1_path,               // {N,P} => false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2926
    _ref_subtype_path,          // {N,N} & subtype check wins => true
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2927
    _both_ref_path,             // {N,N} & subtype check loses => false
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2928
    PATH_LIMIT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2929
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2930
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2931
  RegionNode* region = new (C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2932
  Node*       phi    = new (C, PATH_LIMIT) PhiNode(region, TypeInt::BOOL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2933
  record_for_igvn(region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2934
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2935
  const TypePtr* adr_type = TypeRawPtr::BOTTOM;   // memory type of loads
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2936
  const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2937
  int class_klass_offset = java_lang_Class::klass_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2938
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2939
  // First null-check both mirrors and load each mirror's klass metaobject.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2940
  int which_arg;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2941
  for (which_arg = 0; which_arg <= 1; which_arg++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2942
    Node* arg = args[which_arg];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2943
    _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2944
    arg = do_null_check(arg, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2945
    _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2946
    if (stopped())  break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2947
    args[which_arg] = _gvn.transform(arg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2948
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2949
    Node* p = basic_plus_adr(arg, class_klass_offset);
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  2950
    Node* kls = LoadKlassNode::make(_gvn, immutable_memory(), p, adr_type, kls_type);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2951
    klasses[which_arg] = _gvn.transform(kls);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2952
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2953
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2954
  // Having loaded both klasses, test each for null.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2955
  bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2956
  for (which_arg = 0; which_arg <= 1; which_arg++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2957
    Node* kls = klasses[which_arg];
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2958
    Node* null_ctl = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2959
    _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2960
    kls = null_check_oop(kls, &null_ctl, never_see_null);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2961
    _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2962
    int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2963
    region->init_req(prim_path, null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2964
    if (stopped())  break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2965
    klasses[which_arg] = kls;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2966
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2967
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2968
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2969
    // now we have two reference types, in klasses[0..1]
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2970
    Node* subk   = klasses[1];  // the argument to isAssignableFrom
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2971
    Node* superk = klasses[0];  // the receiver
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2972
    region->set_req(_both_ref_path, gen_subtype_check(subk, superk));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2973
    // now we have a successful reference subtype check
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2974
    region->set_req(_ref_subtype_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2975
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2976
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2977
  // If both operands are primitive (both klasses null), then
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2978
  // we must return true when they are identical primitives.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2979
  // It is convenient to test this after the first null klass check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2980
  set_control(region->in(_prim_0_path)); // go back to first null check
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2981
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2982
    // Since superc is primitive, make a guard for the superc==subc case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2983
    Node* cmp_eq = _gvn.transform( new (C, 3) CmpPNode(args[0], args[1]) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2984
    Node* bol_eq = _gvn.transform( new (C, 2) BoolNode(cmp_eq, BoolTest::eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2985
    generate_guard(bol_eq, region, PROB_FAIR);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2986
    if (region->req() == PATH_LIMIT+1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2987
      // A guard was added.  If the added guard is taken, superc==subc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2988
      region->swap_edges(PATH_LIMIT, _prim_same_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2989
      region->del_req(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2990
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2991
    region->set_req(_prim_0_path, control()); // Not equal after all.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2992
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2993
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2994
  // these are the only paths that produce 'true':
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2995
  phi->set_req(_prim_same_path,   intcon(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2996
  phi->set_req(_ref_subtype_path, intcon(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2997
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2998
  // pull together the cases:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  2999
  assert(region->req() == PATH_LIMIT, "sane region");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3000
  for (uint i = 1; i < region->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3001
    Node* ctl = region->in(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3002
    if (ctl == NULL || ctl == top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3003
      region->set_req(i, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3004
      phi   ->set_req(i, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3005
    } else if (phi->in(i) == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3006
      phi->set_req(i, intcon(0)); // all other paths produce 'false'
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3007
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3008
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3009
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3010
  set_control(_gvn.transform(region));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3011
  push(_gvn.transform(phi));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3012
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3013
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3014
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3015
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3016
//---------------------generate_array_guard_common------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3017
Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3018
                                                  bool obj_array, bool not_array) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3019
  // If obj_array/non_array==false/false:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3020
  // Branch around if the given klass is in fact an array (either obj or prim).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3021
  // If obj_array/non_array==false/true:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3022
  // Branch around if the given klass is not an array klass of any kind.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3023
  // If obj_array/non_array==true/true:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3024
  // Branch around if the kls is not an oop array (kls is int[], String, etc.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3025
  // If obj_array/non_array==true/false:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3026
  // Branch around if the kls is an oop array (Object[] or subtype)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3027
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3028
  // Like generate_guard, adds a new path onto the region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3029
  jint  layout_con = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3030
  Node* layout_val = get_layout_helper(kls, layout_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3031
  if (layout_val == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3032
    bool query = (obj_array
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3033
                  ? Klass::layout_helper_is_objArray(layout_con)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3034
                  : Klass::layout_helper_is_javaArray(layout_con));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3035
    if (query == not_array) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3036
      return NULL;                       // never a branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3037
    } else {                             // always a branch
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3038
      Node* always_branch = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3039
      if (region != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3040
        region->add_req(always_branch);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3041
      set_control(top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3042
      return always_branch;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3043
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3044
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3045
  // Now test the correct condition.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3046
  jint  nval = (obj_array
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3047
                ? ((jint)Klass::_lh_array_tag_type_value
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3048
                   <<    Klass::_lh_array_tag_shift)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3049
                : Klass::_lh_neutral_value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3050
  Node* cmp = _gvn.transform( new(C, 3) CmpINode(layout_val, intcon(nval)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3051
  BoolTest::mask btest = BoolTest::lt;  // correct for testing is_[obj]array
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3052
  // invert the test if we are looking for a non-array
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3053
  if (not_array)  btest = BoolTest(btest).negate();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3054
  Node* bol = _gvn.transform( new(C, 2) BoolNode(cmp, btest) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3055
  return generate_fair_guard(bol, region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3056
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3057
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3058
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3059
//-----------------------inline_native_newArray--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3060
bool LibraryCallKit::inline_native_newArray() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3061
  int nargs = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3062
  Node* mirror    = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3063
  Node* count_val = argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3064
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3065
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3066
  mirror = do_null_check(mirror, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3067
  _sp -= nargs;
589
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 360
diff changeset
  3068
  // If mirror or obj is dead, only null-path is taken.
a44a1e70a3e4 6695810: null oop passed to encode_heap_oop_not_null
kvn
parents: 360
diff changeset
  3069
  if (stopped())  return true;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3070
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3071
  enum { _normal_path = 1, _slow_path = 2, PATH_LIMIT };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3072
  RegionNode* result_reg = new(C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3073
  PhiNode*    result_val = new(C, PATH_LIMIT) PhiNode(result_reg,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3074
                                                      TypeInstPtr::NOTNULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3075
  PhiNode*    result_io  = new(C, PATH_LIMIT) PhiNode(result_reg, Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3076
  PhiNode*    result_mem = new(C, PATH_LIMIT) PhiNode(result_reg, Type::MEMORY,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3077
                                                      TypePtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3078
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3079
  bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3080
  Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3081
                                                  nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3082
                                                  result_reg, _slow_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3083
  Node* normal_ctl   = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3084
  Node* no_array_ctl = result_reg->in(_slow_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3085
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3086
  // Generate code for the slow case.  We make a call to newArray().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3087
  set_control(no_array_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3088
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3089
    // Either the input type is void.class, or else the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3090
    // array klass has not yet been cached.  Either the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3091
    // ensuing call will throw an exception, or else it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3092
    // will cache the array klass for next time.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3093
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3094
    CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3095
    Node* slow_result = set_results_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3096
    // this->control() comes from set_results_for_java_call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3097
    result_reg->set_req(_slow_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3098
    result_val->set_req(_slow_path, slow_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3099
    result_io ->set_req(_slow_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3100
    result_mem->set_req(_slow_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3101
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3102
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3103
  set_control(normal_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3104
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3105
    // Normal case:  The array type has been cached in the java.lang.Class.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3106
    // The following call works fine even if the array type is polymorphic.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3107
    // It could be a dynamic mix of int[], boolean[], Object[], etc.
2574
1d5f85c2d755 6589834: deoptimization problem with -XX:+DeoptimizeALot
cfang
parents: 2348
diff changeset
  3108
    Node* obj = new_array(klass_node, count_val, nargs);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3109
    result_reg->init_req(_normal_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3110
    result_val->init_req(_normal_path, obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3111
    result_io ->init_req(_normal_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3112
    result_mem->init_req(_normal_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3113
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3114
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3115
  // Return the combined state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3116
  set_i_o(        _gvn.transform(result_io)  );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3117
  set_all_memory( _gvn.transform(result_mem) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3118
  push_result(result_reg, result_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3119
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3120
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3121
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3122
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3123
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3124
//----------------------inline_native_getLength--------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3125
bool LibraryCallKit::inline_native_getLength() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3126
  if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3127
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3128
  int nargs = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3129
  Node* array = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3130
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3131
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3132
  array = do_null_check(array, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3133
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3134
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3135
  // If array is dead, only null-path is taken.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3136
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3137
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3138
  // Deoptimize if it is a non-array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3139
  Node* non_array = generate_non_array_guard(load_object_klass(array), NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3140
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3141
  if (non_array != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3142
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3143
    set_control(non_array);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3144
    _sp += nargs;  // push the arguments back on the stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3145
    uncommon_trap(Deoptimization::Reason_intrinsic,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3146
                  Deoptimization::Action_maybe_recompile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3147
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3148
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3149
  // If control is dead, only non-array-path is taken.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3150
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3151
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3152
  // The works fine even if the array type is polymorphic.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3153
  // It could be a dynamic mix of int[], boolean[], Object[], etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3154
  push( load_array_length(array) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3155
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3156
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3157
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3158
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3159
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3160
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3161
//------------------------inline_array_copyOf----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3162
bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3163
  if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3164
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3165
  // Restore the stack and pop off the arguments.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3166
  int nargs = 3 + (is_copyOfRange? 1: 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3167
  Node* original          = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3168
  Node* start             = is_copyOfRange? argument(1): intcon(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3169
  Node* end               = is_copyOfRange? argument(2): argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3170
  Node* array_type_mirror = is_copyOfRange? argument(3): argument(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3171
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3172
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3173
  array_type_mirror = do_null_check(array_type_mirror, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3174
  original          = do_null_check(original, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3175
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3176
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3177
  // Check if a null path was taken unconditionally.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3178
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3179
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3180
  Node* orig_length = load_array_length(original);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3181
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3182
  Node* klass_node = load_klass_from_mirror(array_type_mirror, false, nargs,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3183
                                            NULL, 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3184
  _sp += nargs;  // set original stack for use by uncommon_trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3185
  klass_node = do_null_check(klass_node, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3186
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3187
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3188
  RegionNode* bailout = new (C, 1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3189
  record_for_igvn(bailout);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3190
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3191
  // Despite the generic type of Arrays.copyOf, the mirror might be int, int[], etc.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3192
  // Bail out if that is so.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3193
  Node* not_objArray = generate_non_objArray_guard(klass_node, bailout);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3194
  if (not_objArray != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3195
    // Improve the klass node's type from the new optimistic assumption:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3196
    ciKlass* ak = ciArrayKlass::make(env()->Object_klass());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3197
    const Type* akls = TypeKlassPtr::make(TypePtr::NotNull, ak, 0/*offset*/);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3198
    Node* cast = new (C, 2) CastPPNode(klass_node, akls);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3199
    cast->init_req(0, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3200
    klass_node = _gvn.transform(cast);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3201
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3202
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3203
  // Bail out if either start or end is negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3204
  generate_negative_guard(start, bailout, &start);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3205
  generate_negative_guard(end,   bailout, &end);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3206
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3207
  Node* length = end;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3208
  if (_gvn.type(start) != TypeInt::ZERO) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3209
    length = _gvn.transform( new (C, 3) SubINode(end, start) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3210
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3211
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3212
  // Bail out if length is negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3213
  // ...Not needed, since the new_array will throw the right exception.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3214
  //generate_negative_guard(length, bailout, &length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3215
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3216
  if (bailout->req() > 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3217
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3218
    set_control( _gvn.transform(bailout) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3219
    _sp += nargs;  // push the arguments back on the stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3220
    uncommon_trap(Deoptimization::Reason_intrinsic,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3221
                  Deoptimization::Action_maybe_recompile);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3222
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3223
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3224
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3225
    // How many elements will we copy from the original?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3226
    // The answer is MinI(orig_length - start, length).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3227
    Node* orig_tail = _gvn.transform( new(C, 3) SubINode(orig_length, start) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3228
    Node* moved = generate_min_max(vmIntrinsics::_min, orig_tail, length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3229
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3230
    const bool raw_mem_only = true;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3231
    Node* newcopy = new_array(klass_node, length, nargs, raw_mem_only);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3232
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3233
    // Generate a direct call to the right arraycopy function(s).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3234
    // We know the copy is disjoint but we might not know if the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3235
    // oop stores need checking.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3236
    // Extreme case:  Arrays.copyOf((Integer[])x, 10, String[].class).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3237
    // This will fail a store-check if x contains any non-nulls.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3238
    bool disjoint_bases = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3239
    bool length_never_negative = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3240
    generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3241
                       original, start, newcopy, intcon(0), moved,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3242
                       disjoint_bases, length_never_negative);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3243
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3244
    push(newcopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3245
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3246
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3247
  C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3248
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3249
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3250
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3251
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3252
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3253
//----------------------generate_virtual_guard---------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3254
// Helper for hashCode and clone.  Peeks inside the vtable to avoid a call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3255
Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3256
                                             RegionNode* slow_region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3257
  ciMethod* method = callee();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3258
  int vtable_index = method->vtable_index();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3259
  // Get the methodOop out of the appropriate vtable entry.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3260
  int entry_offset  = (instanceKlass::vtable_start_offset() +
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3261
                     vtable_index*vtableEntry::size()) * wordSize +
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3262
                     vtableEntry::method_offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3263
  Node* entry_addr  = basic_plus_adr(obj_klass, entry_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3264
  Node* target_call = make_load(NULL, entry_addr, TypeInstPtr::NOTNULL, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3265
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3266
  // Compare the target method with the expected method (e.g., Object.hashCode).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3267
  const TypeInstPtr* native_call_addr = TypeInstPtr::make(method);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3268
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3269
  Node* native_call = makecon(native_call_addr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3270
  Node* chk_native  = _gvn.transform( new(C, 3) CmpPNode(target_call, native_call) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3271
  Node* test_native = _gvn.transform( new(C, 2) BoolNode(chk_native, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3272
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3273
  return generate_slow_guard(test_native, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3274
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3275
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3276
//-----------------------generate_method_call----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3277
// Use generate_method_call to make a slow-call to the real
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3278
// method if the fast path fails.  An alternative would be to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3279
// use a stub like OptoRuntime::slow_arraycopy_Java.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3280
// This only works for expanding the current library call,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3281
// not another intrinsic.  (E.g., don't use this for making an
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3282
// arraycopy call inside of the copyOf intrinsic.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3283
CallJavaNode*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3284
LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3285
  // When compiling the intrinsic method itself, do not use this technique.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3286
  guarantee(callee() != C->method(), "cannot make slow-call to self");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3287
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3288
  ciMethod* method = callee();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3289
  // ensure the JVMS we have will be correct for this call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3290
  guarantee(method_id == method->intrinsic_id(), "must match");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3291
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3292
  const TypeFunc* tf = TypeFunc::make(method);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3293
  int tfdc = tf->domain()->cnt();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3294
  CallJavaNode* slow_call;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3295
  if (is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3296
    assert(!is_virtual, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3297
    slow_call = new(C, tfdc) CallStaticJavaNode(tf,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3298
                                SharedRuntime::get_resolve_static_call_stub(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3299
                                method, bci());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3300
  } else if (is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3301
    null_check_receiver(method);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3302
    int vtable_index = methodOopDesc::invalid_vtable_index;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3303
    if (UseInlineCaches) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3304
      // Suppress the vtable call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3305
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3306
      // hashCode and clone are not a miranda methods,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3307
      // so the vtable index is fixed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3308
      // No need to use the linkResolver to get it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3309
       vtable_index = method->vtable_index();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3310
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3311
    slow_call = new(C, tfdc) CallDynamicJavaNode(tf,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3312
                                SharedRuntime::get_resolve_virtual_call_stub(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3313
                                method, vtable_index, bci());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3314
  } else {  // neither virtual nor static:  opt_virtual
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3315
    null_check_receiver(method);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3316
    slow_call = new(C, tfdc) CallStaticJavaNode(tf,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3317
                                SharedRuntime::get_resolve_opt_virtual_call_stub(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3318
                                method, bci());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3319
    slow_call->set_optimized_virtual(true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3320
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3321
  set_arguments_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3322
  set_edges_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3323
  return slow_call;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3324
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3325
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3326
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3327
//------------------------------inline_native_hashcode--------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3328
// Build special case code for calls to hashCode on an object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3329
bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3330
  assert(is_static == callee()->is_static(), "correct intrinsic selection");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3331
  assert(!(is_virtual && is_static), "either virtual, special, or static");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3332
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3333
  enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3334
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3335
  RegionNode* result_reg = new(C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3336
  PhiNode*    result_val = new(C, PATH_LIMIT) PhiNode(result_reg,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3337
                                                      TypeInt::INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3338
  PhiNode*    result_io  = new(C, PATH_LIMIT) PhiNode(result_reg, Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3339
  PhiNode*    result_mem = new(C, PATH_LIMIT) PhiNode(result_reg, Type::MEMORY,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3340
                                                      TypePtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3341
  Node* obj = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3342
  if (!is_static) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3343
    // Check for hashing null object
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3344
    obj = null_check_receiver(callee());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3345
    if (stopped())  return true;        // unconditionally null
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3346
    result_reg->init_req(_null_path, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3347
    result_val->init_req(_null_path, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3348
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3349
    // Do a null check, and return zero if null.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3350
    // System.identityHashCode(null) == 0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3351
    obj = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3352
    Node* null_ctl = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3353
    obj = null_check_oop(obj, &null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3354
    result_reg->init_req(_null_path, null_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3355
    result_val->init_req(_null_path, _gvn.intcon(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3356
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3357
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3358
  // Unconditionally null?  Then return right away.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3359
  if (stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3360
    set_control( result_reg->in(_null_path) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3361
    if (!stopped())
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3362
      push(      result_val ->in(_null_path) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3363
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3364
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3365
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3366
  // After null check, get the object's klass.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3367
  Node* obj_klass = load_object_klass(obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3368
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3369
  // This call may be virtual (invokevirtual) or bound (invokespecial).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3370
  // For each case we generate slightly different code.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3371
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3372
  // We only go to the fast case code if we pass a number of guards.  The
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3373
  // paths which do not pass are accumulated in the slow_region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3374
  RegionNode* slow_region = new (C, 1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3375
  record_for_igvn(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3376
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3377
  // If this is a virtual call, we generate a funny guard.  We pull out
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3378
  // the vtable entry corresponding to hashCode() from the target object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3379
  // If the target method which we are calling happens to be the native
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3380
  // Object hashCode() method, we pass the guard.  We do not need this
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3381
  // guard for non-virtual calls -- the caller is known to be the native
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3382
  // Object hashCode().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3383
  if (is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3384
    generate_virtual_guard(obj_klass, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3385
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3386
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3387
  // Get the header out of the object, use LoadMarkNode when available
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3388
  Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3389
  Node* header = make_load(NULL, header_addr, TypeRawPtr::BOTTOM, T_ADDRESS);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3390
  header = _gvn.transform( new (C, 2) CastP2XNode(NULL, header) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3391
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3392
  // Test the header to see if it is unlocked.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3393
  Node *lock_mask      = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3394
  Node *lmasked_header = _gvn.transform( new (C, 3) AndXNode(header, lock_mask) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3395
  Node *unlocked_val   = _gvn.MakeConX(markOopDesc::unlocked_value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3396
  Node *chk_unlocked   = _gvn.transform( new (C, 3) CmpXNode( lmasked_header, unlocked_val));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3397
  Node *test_unlocked  = _gvn.transform( new (C, 2) BoolNode( chk_unlocked, BoolTest::ne) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3398
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3399
  generate_slow_guard(test_unlocked, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3400
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3401
  // Get the hash value and check to see that it has been properly assigned.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3402
  // We depend on hash_mask being at most 32 bits and avoid the use of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3403
  // hash_mask_in_place because it could be larger than 32 bits in a 64-bit
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3404
  // vm: see markOop.hpp.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3405
  Node *hash_mask      = _gvn.intcon(markOopDesc::hash_mask);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3406
  Node *hash_shift     = _gvn.intcon(markOopDesc::hash_shift);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3407
  Node *hshifted_header= _gvn.transform( new (C, 3) URShiftXNode(header, hash_shift) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3408
  // This hack lets the hash bits live anywhere in the mark object now, as long
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  3409
  // as the shift drops the relevant bits into the low 32 bits.  Note that
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3410
  // Java spec says that HashCode is an int so there's no point in capturing
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3411
  // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3412
  hshifted_header      = ConvX2I(hshifted_header);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3413
  Node *hash_val       = _gvn.transform( new (C, 3) AndINode(hshifted_header, hash_mask) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3414
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3415
  Node *no_hash_val    = _gvn.intcon(markOopDesc::no_hash);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3416
  Node *chk_assigned   = _gvn.transform( new (C, 3) CmpINode( hash_val, no_hash_val));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3417
  Node *test_assigned  = _gvn.transform( new (C, 2) BoolNode( chk_assigned, BoolTest::eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3418
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3419
  generate_slow_guard(test_assigned, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3420
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3421
  Node* init_mem = reset_memory();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3422
  // fill in the rest of the null path:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3423
  result_io ->init_req(_null_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3424
  result_mem->init_req(_null_path, init_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3425
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3426
  result_val->init_req(_fast_path, hash_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3427
  result_reg->init_req(_fast_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3428
  result_io ->init_req(_fast_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3429
  result_mem->init_req(_fast_path, init_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3430
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3431
  // Generate code for the slow case.  We make a call to hashCode().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3432
  set_control(_gvn.transform(slow_region));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3433
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3434
    // No need for PreserveJVMState, because we're using up the present state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3435
    set_all_memory(init_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3436
    vmIntrinsics::ID hashCode_id = vmIntrinsics::_hashCode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3437
    if (is_static)   hashCode_id = vmIntrinsics::_identityHashCode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3438
    CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3439
    Node* slow_result = set_results_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3440
    // this->control() comes from set_results_for_java_call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3441
    result_reg->init_req(_slow_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3442
    result_val->init_req(_slow_path, slow_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3443
    result_io  ->set_req(_slow_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3444
    result_mem ->set_req(_slow_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3445
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3446
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3447
  // Return the combined state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3448
  set_i_o(        _gvn.transform(result_io)  );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3449
  set_all_memory( _gvn.transform(result_mem) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3450
  push_result(result_reg, result_val);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3451
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3452
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3453
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3454
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3455
//---------------------------inline_native_getClass----------------------------
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  3456
// Build special case code for calls to getClass on an object.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3457
bool LibraryCallKit::inline_native_getClass() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3458
  Node* obj = null_check_receiver(callee());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3459
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3460
  push( load_mirror_from_klass(load_object_klass(obj)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3461
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3462
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3463
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3464
//-----------------inline_native_Reflection_getCallerClass---------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3465
// In the presence of deep enough inlining, getCallerClass() becomes a no-op.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3466
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3467
// NOTE that this code must perform the same logic as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3468
// vframeStream::security_get_caller_frame in that it must skip
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3469
// Method.invoke() and auxiliary frames.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3470
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3471
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3472
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3473
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3474
bool LibraryCallKit::inline_native_Reflection_getCallerClass() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3475
  ciMethod*       method = callee();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3476
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3477
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3478
  if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3479
    tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3480
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3481
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3482
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3483
  debug_only(int saved_sp = _sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3484
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3485
  // Argument words:  (int depth)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3486
  int nargs = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3487
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3488
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3489
  Node* caller_depth_node = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3490
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3491
  assert(saved_sp == _sp, "must have correct argument count");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3492
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3493
  // The depth value must be a constant in order for the runtime call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3494
  // to be eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3495
  const TypeInt* caller_depth_type = _gvn.type(caller_depth_node)->isa_int();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3496
  if (caller_depth_type == NULL || !caller_depth_type->is_con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3497
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3498
    if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3499
      tty->print_cr("  Bailing out because caller depth was not a constant");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3500
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3501
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3502
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3503
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3504
  // Note that the JVM state at this point does not include the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3505
  // getCallerClass() frame which we are trying to inline. The
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3506
  // semantics of getCallerClass(), however, are that the "first"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3507
  // frame is the getCallerClass() frame, so we subtract one from the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3508
  // requested depth before continuing. We don't inline requests of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3509
  // getCallerClass(0).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3510
  int caller_depth = caller_depth_type->get_con() - 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3511
  if (caller_depth < 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3512
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3513
    if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3514
      tty->print_cr("  Bailing out because caller depth was %d", caller_depth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3515
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3516
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3517
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3518
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3519
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3520
  if (!jvms()->has_method()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3521
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3522
    if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3523
      tty->print_cr("  Bailing out because intrinsic was inlined at top level");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3524
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3525
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3526
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3527
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3528
  int _depth = jvms()->depth();  // cache call chain depth
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3529
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3530
  // Walk back up the JVM state to find the caller at the required
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3531
  // depth. NOTE that this code must perform the same logic as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3532
  // vframeStream::security_get_caller_frame in that it must skip
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3533
  // Method.invoke() and auxiliary frames. Note also that depth is
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3534
  // 1-based (1 is the bottom of the inlining).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3535
  int inlining_depth = _depth;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3536
  JVMState* caller_jvms = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3537
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3538
  if (inlining_depth > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3539
    caller_jvms = jvms();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3540
    assert(caller_jvms = jvms()->of_depth(inlining_depth), "inlining_depth == our depth");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3541
    do {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3542
      // The following if-tests should be performed in this order
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3543
      if (is_method_invoke_or_aux_frame(caller_jvms)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3544
        // Skip a Method.invoke() or auxiliary frame
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3545
      } else if (caller_depth > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3546
        // Skip real frame
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3547
        --caller_depth;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3548
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3549
        // We're done: reached desired caller after skipping.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3550
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3551
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3552
      caller_jvms = caller_jvms->caller();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3553
      --inlining_depth;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3554
    } while (inlining_depth > 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3555
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3556
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3557
  if (inlining_depth == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3558
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3559
    if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3560
      tty->print_cr("  Bailing out because caller depth (%d) exceeded inlining depth (%d)", caller_depth_type->get_con(), _depth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3561
      tty->print_cr("  JVM state at this point:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3562
      for (int i = _depth; i >= 1; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3563
        tty->print_cr("   %d) %s", i, jvms()->of_depth(i)->method()->name()->as_utf8());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3564
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3565
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3566
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3567
    return false; // Reached end of inlining
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3568
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3569
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3570
  // Acquire method holder as java.lang.Class
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3571
  ciInstanceKlass* caller_klass  = caller_jvms->method()->holder();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3572
  ciInstance*      caller_mirror = caller_klass->java_mirror();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3573
  // Push this as a constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3574
  push(makecon(TypeInstPtr::make(caller_mirror)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3575
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3576
  if ((PrintIntrinsics || PrintInlining || PrintOptoInlining) && Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3577
    tty->print_cr("  Succeeded: caller = %s.%s, caller depth = %d, depth = %d", caller_klass->name()->as_utf8(), caller_jvms->method()->name()->as_utf8(), caller_depth_type->get_con(), _depth);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3578
    tty->print_cr("  JVM state at this point:");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3579
    for (int i = _depth; i >= 1; i--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3580
      tty->print_cr("   %d) %s", i, jvms()->of_depth(i)->method()->name()->as_utf8());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3581
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3582
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3583
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3584
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3585
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3586
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3587
// Helper routine for above
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3588
bool LibraryCallKit::is_method_invoke_or_aux_frame(JVMState* jvms) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3589
  // Is this the Method.invoke method itself?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3590
  if (jvms->method()->intrinsic_id() == vmIntrinsics::_invoke)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3591
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3592
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3593
  // Is this a helper, defined somewhere underneath MethodAccessorImpl.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3594
  ciKlass* k = jvms->method()->holder();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3595
  if (k->is_instance_klass()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3596
    ciInstanceKlass* ik = k->as_instance_klass();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3597
    for (; ik != NULL; ik = ik->super()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3598
      if (ik->name() == ciSymbol::sun_reflect_MethodAccessorImpl() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3599
          ik == env()->find_system_klass(ik->name())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3600
        return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3601
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3602
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3603
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3604
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3605
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3606
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3607
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3608
static int value_field_offset = -1;  // offset of the "value" field of AtomicLongCSImpl.  This is needed by
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3609
                                     // inline_native_AtomicLong_attemptUpdate() but it has no way of
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3610
                                     // computing it since there is no lookup field by name function in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3611
                                     // CI interface.  This is computed and set by inline_native_AtomicLong_get().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3612
                                     // Using a static variable here is safe even if we have multiple compilation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3613
                                     // threads because the offset is constant.  At worst the same offset will be
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3614
                                     // computed and  stored multiple
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3615
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3616
bool LibraryCallKit::inline_native_AtomicLong_get() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3617
  // Restore the stack and pop off the argument
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3618
  _sp+=1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3619
  Node *obj = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3620
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3621
  // get the offset of the "value" field. Since the CI interfaces
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3622
  // does not provide a way to look up a field by name, we scan the bytecodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3623
  // to get the field index.  We expect the first 2 instructions of the method
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3624
  // to be:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3625
  //    0 aload_0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3626
  //    1 getfield "value"
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3627
  ciMethod* method = callee();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3628
  if (value_field_offset == -1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3629
  {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3630
    ciField* value_field;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3631
    ciBytecodeStream iter(method);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3632
    Bytecodes::Code bc = iter.next();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3633
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3634
    if ((bc != Bytecodes::_aload_0) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3635
              ((bc != Bytecodes::_aload) || (iter.get_index() != 0)))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3636
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3637
    bc = iter.next();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3638
    if (bc != Bytecodes::_getfield)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3639
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3640
    bool ignore;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3641
    value_field = iter.get_field(ignore);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3642
    value_field_offset = value_field->offset_in_bytes();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3643
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3644
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3645
  // Null check without removing any arguments.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3646
  _sp++;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3647
  obj = do_null_check(obj, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3648
  _sp--;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3649
  // Check for locking null object
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3650
  if (stopped()) return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3651
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3652
  Node *adr = basic_plus_adr(obj, obj, value_field_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3653
  const TypePtr *adr_type = _gvn.type(adr)->is_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3654
  int alias_idx = C->get_alias_index(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3655
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3656
  Node *result = _gvn.transform(new (C, 3) LoadLLockedNode(control(), memory(alias_idx), adr));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3657
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3658
  push_pair(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3659
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3660
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3661
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3662
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3663
bool LibraryCallKit::inline_native_AtomicLong_attemptUpdate() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3664
  // Restore the stack and pop off the arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3665
  _sp+=5;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3666
  Node *newVal = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3667
  Node *oldVal = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3668
  Node *obj = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3669
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3670
  // we need the offset of the "value" field which was computed when
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3671
  // inlining the get() method.  Give up if we don't have it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3672
  if (value_field_offset == -1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3673
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3674
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3675
  // Null check without removing any arguments.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3676
  _sp+=5;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3677
  obj = do_null_check(obj, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3678
  _sp-=5;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3679
  // Check for locking null object
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3680
  if (stopped()) return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3681
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3682
  Node *adr = basic_plus_adr(obj, obj, value_field_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3683
  const TypePtr *adr_type = _gvn.type(adr)->is_ptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3684
  int alias_idx = C->get_alias_index(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3685
1500
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3686
  Node *cas = _gvn.transform(new (C, 5) StoreLConditionalNode(control(), memory(alias_idx), adr, newVal, oldVal));
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3687
  Node *store_proj = _gvn.transform( new (C, 1) SCMemProjNode(cas));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3688
  set_memory(store_proj, alias_idx);
1500
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3689
  Node *bol = _gvn.transform( new (C, 2) BoolNode( cas, BoolTest::eq ) );
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3690
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3691
  Node *result;
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3692
  // CMove node is not used to be able fold a possible check code
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3693
  // after attemptUpdate() call. This code could be transformed
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3694
  // into CMove node by loop optimizations.
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3695
  {
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3696
    RegionNode *r = new (C, 3) RegionNode(3);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3697
    result = new (C, 3) PhiNode(r, TypeInt::BOOL);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3698
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3699
    Node *iff = create_and_xform_if(control(), bol, PROB_FAIR, COUNT_UNKNOWN);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3700
    Node *iftrue = opt_iff(r, iff);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3701
    r->init_req(1, iftrue);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3702
    result->init_req(1, intcon(1));
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3703
    result->init_req(2, intcon(0));
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3704
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3705
    set_control(_gvn.transform(r));
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3706
    record_for_igvn(r);
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3707
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3708
    C->set_has_split_ifs(true); // Has chance for split-if optimization
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3709
  }
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3710
bea9a90f3e8f 6462850: generate biased locking code in C2 ideal graph
kvn
parents: 781
diff changeset
  3711
  push(_gvn.transform(result));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3712
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3713
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3714
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3715
bool LibraryCallKit::inline_fp_conversions(vmIntrinsics::ID id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3716
  // restore the arguments
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3717
  _sp += arg_size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3718
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3719
  switch (id) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3720
  case vmIntrinsics::_floatToRawIntBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3721
    push(_gvn.transform( new (C, 2) MoveF2INode(pop())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3722
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3723
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3724
  case vmIntrinsics::_intBitsToFloat:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3725
    push(_gvn.transform( new (C, 2) MoveI2FNode(pop())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3726
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3727
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3728
  case vmIntrinsics::_doubleToRawLongBits:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3729
    push_pair(_gvn.transform( new (C, 2) MoveD2LNode(pop_pair())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3730
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3731
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3732
  case vmIntrinsics::_longBitsToDouble:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3733
    push_pair(_gvn.transform( new (C, 2) MoveL2DNode(pop_pair())));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3734
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3735
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3736
  case vmIntrinsics::_doubleToLongBits: {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3737
    Node* value = pop_pair();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3738
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3739
    // two paths (plus control) merge in a wood
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3740
    RegionNode *r = new (C, 3) RegionNode(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3741
    Node *phi = new (C, 3) PhiNode(r, TypeLong::LONG);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3742
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3743
    Node *cmpisnan = _gvn.transform( new (C, 3) CmpDNode(value, value));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3744
    // Build the boolean node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3745
    Node *bolisnan = _gvn.transform( new (C, 2) BoolNode( cmpisnan, BoolTest::ne ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3746
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3747
    // Branch either way.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3748
    // NaN case is less traveled, which makes all the difference.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3749
    IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3750
    Node *opt_isnan = _gvn.transform(ifisnan);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3751
    assert( opt_isnan->is_If(), "Expect an IfNode");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3752
    IfNode *opt_ifisnan = (IfNode*)opt_isnan;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3753
    Node *iftrue = _gvn.transform( new (C, 1) IfTrueNode(opt_ifisnan) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3754
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3755
    set_control(iftrue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3756
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3757
    static const jlong nan_bits = CONST64(0x7ff8000000000000);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3758
    Node *slow_result = longcon(nan_bits); // return NaN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3759
    phi->init_req(1, _gvn.transform( slow_result ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3760
    r->init_req(1, iftrue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3761
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3762
    // Else fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3763
    Node *iffalse = _gvn.transform( new (C, 1) IfFalseNode(opt_ifisnan) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3764
    set_control(iffalse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3765
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3766
    phi->init_req(2, _gvn.transform( new (C, 2) MoveD2LNode(value)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3767
    r->init_req(2, iffalse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3768
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3769
    // Post merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3770
    set_control(_gvn.transform(r));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3771
    record_for_igvn(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3772
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3773
    Node* result = _gvn.transform(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3774
    assert(result->bottom_type()->isa_long(), "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3775
    push_pair(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3776
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3777
    C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3778
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3779
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3780
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3781
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3782
  case vmIntrinsics::_floatToIntBits: {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3783
    Node* value = pop();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3784
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3785
    // two paths (plus control) merge in a wood
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3786
    RegionNode *r = new (C, 3) RegionNode(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3787
    Node *phi = new (C, 3) PhiNode(r, TypeInt::INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3788
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3789
    Node *cmpisnan = _gvn.transform( new (C, 3) CmpFNode(value, value));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3790
    // Build the boolean node
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3791
    Node *bolisnan = _gvn.transform( new (C, 2) BoolNode( cmpisnan, BoolTest::ne ) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3792
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3793
    // Branch either way.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3794
    // NaN case is less traveled, which makes all the difference.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3795
    IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3796
    Node *opt_isnan = _gvn.transform(ifisnan);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3797
    assert( opt_isnan->is_If(), "Expect an IfNode");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3798
    IfNode *opt_ifisnan = (IfNode*)opt_isnan;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3799
    Node *iftrue = _gvn.transform( new (C, 1) IfTrueNode(opt_ifisnan) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3800
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3801
    set_control(iftrue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3802
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3803
    static const jint nan_bits = 0x7fc00000;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3804
    Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3805
    phi->init_req(1, _gvn.transform( slow_result ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3806
    r->init_req(1, iftrue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3807
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3808
    // Else fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3809
    Node *iffalse = _gvn.transform( new (C, 1) IfFalseNode(opt_ifisnan) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3810
    set_control(iffalse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3811
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3812
    phi->init_req(2, _gvn.transform( new (C, 2) MoveF2INode(value)));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3813
    r->init_req(2, iffalse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3814
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3815
    // Post merge
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3816
    set_control(_gvn.transform(r));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3817
    record_for_igvn(r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3818
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3819
    Node* result = _gvn.transform(phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3820
    assert(result->bottom_type()->isa_int(), "must be");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3821
    push(result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3822
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3823
    C->set_has_split_ifs(true); // Has chance for split-if optimization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3824
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3825
    break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3826
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3827
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3828
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3829
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3830
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3831
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3832
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3833
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3834
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3835
#ifdef _LP64
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3836
#define XTOP ,top() /*additional argument*/
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3837
#else  //_LP64
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3838
#define XTOP        /*no additional argument*/
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3839
#endif //_LP64
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3840
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3841
//----------------------inline_unsafe_copyMemory-------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3842
bool LibraryCallKit::inline_unsafe_copyMemory() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3843
  if (callee()->is_static())  return false;  // caller must have the capability!
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3844
  int nargs = 1 + 5 + 3;  // 5 args:  (src: ptr,off, dst: ptr,off, size)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3845
  assert(signature()->size() == nargs-1, "copy has 5 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3846
  null_check_receiver(callee());  // check then ignore argument(0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3847
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3848
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3849
  C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3850
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3851
  Node* src_ptr = argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3852
  Node* src_off = ConvL2X(argument(2));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3853
  assert(argument(3)->is_top(), "2nd half of long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3854
  Node* dst_ptr = argument(4);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3855
  Node* dst_off = ConvL2X(argument(5));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3856
  assert(argument(6)->is_top(), "2nd half of long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3857
  Node* size    = ConvL2X(argument(7));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3858
  assert(argument(8)->is_top(), "2nd half of long");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3859
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3860
  assert(Unsafe_field_offset_to_byte_offset(11) == 11,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3861
         "fieldOffset must be byte-scaled");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3862
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3863
  Node* src = make_unsafe_address(src_ptr, src_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3864
  Node* dst = make_unsafe_address(dst_ptr, dst_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3865
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3866
  // Conservatively insert a memory barrier on all memory slices.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3867
  // Do not let writes of the copy source or destination float below the copy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3868
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3869
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3870
  // Call it.  Note that the length argument is not scaled.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3871
  make_runtime_call(RC_LEAF|RC_NO_FP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3872
                    OptoRuntime::fast_arraycopy_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3873
                    StubRoutines::unsafe_arraycopy(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3874
                    "unsafe_arraycopy",
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3875
                    TypeRawPtr::BOTTOM,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3876
                    src, dst, size XTOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3877
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3878
  // Do not let reads of the copy destination float above the copy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3879
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3880
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3881
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3882
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3883
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3884
//------------------------clone_coping-----------------------------------
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3885
// Helper function for inline_native_clone.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3886
void LibraryCallKit::copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3887
  assert(obj_size != NULL, "");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3888
  Node* raw_obj = alloc_obj->in(1);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3889
  assert(alloc_obj->is_CheckCastPP() && raw_obj->is_Proj() && raw_obj->in(0)->is_Allocate(), "");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3890
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3891
  if (ReduceBulkZeroing) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3892
    // We will be completely responsible for initializing this object -
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3893
    // mark Initialize node as complete.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3894
    AllocateNode* alloc = AllocateNode::Ideal_allocation(alloc_obj, &_gvn);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3895
    // The object was just allocated - there should be no any stores!
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3896
    guarantee(alloc != NULL && alloc->maybe_set_complete(&_gvn), "");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3897
  }
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3898
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3899
  // Cast to Object for arraycopy.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3900
  // We can't use the original CheckCastPP since it should be moved
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3901
  // after the arraycopy to prevent stores flowing above it.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3902
  Node* new_obj = new(C, 2) CheckCastPPNode(alloc_obj->in(0), raw_obj,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3903
                                            TypeInstPtr::NOTNULL);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3904
  new_obj = _gvn.transform(new_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3905
  // Substitute in the locally valid dest_oop.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3906
  replace_in_map(alloc_obj, new_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3907
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3908
  // Copy the fastest available way.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3909
  // TODO: generate fields copies for small objects instead.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3910
  Node* src  = obj;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3911
  Node* dest = new_obj;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3912
  Node* size = _gvn.transform(obj_size);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3913
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3914
  // Exclude the header but include array length to copy by 8 bytes words.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3915
  // Can't use base_offset_in_bytes(bt) since basic type is unknown.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3916
  int base_off = is_array ? arrayOopDesc::length_offset_in_bytes() :
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3917
                            instanceOopDesc::base_offset_in_bytes();
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3918
  // base_off:
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3919
  // 8  - 32-bit VM
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3920
  // 12 - 64-bit VM, compressed oops
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3921
  // 16 - 64-bit VM, normal oops
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3922
  if (base_off % BytesPerLong != 0) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3923
    assert(UseCompressedOops, "");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3924
    if (is_array) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3925
      // Exclude length to copy by 8 bytes words.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3926
      base_off += sizeof(int);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3927
    } else {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3928
      // Include klass to copy by 8 bytes words.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3929
      base_off = instanceOopDesc::klass_offset_in_bytes();
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3930
    }
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3931
    assert(base_off % BytesPerLong == 0, "expect 8 bytes alignment");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3932
  }
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3933
  src  = basic_plus_adr(src,  base_off);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3934
  dest = basic_plus_adr(dest, base_off);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3935
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3936
  // Compute the length also, if needed:
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3937
  Node* countx = size;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3938
  countx = _gvn.transform( new (C, 3) SubXNode(countx, MakeConX(base_off)) );
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3939
  countx = _gvn.transform( new (C, 3) URShiftXNode(countx, intcon(LogBytesPerLong) ));
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3940
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3941
  const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3942
  bool disjoint_bases = true;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3943
  generate_unchecked_arraycopy(raw_adr_type, T_LONG, disjoint_bases,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3944
                               src, NULL, dest, NULL, countx);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3945
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3946
  // If necessary, emit some card marks afterwards.  (Non-arrays only.)
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3947
  if (card_mark) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3948
    assert(!is_array, "");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3949
    // Put in store barrier for any and all oops we are sticking
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3950
    // into this object.  (We could avoid this if we could prove
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3951
    // that the object type contains no oop fields at all.)
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3952
    Node* no_particular_value = NULL;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3953
    Node* no_particular_field = NULL;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3954
    int raw_adr_idx = Compile::AliasIdxRaw;
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3955
    post_barrier(control(),
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3956
                 memory(raw_adr_type),
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3957
                 new_obj,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3958
                 no_particular_field,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3959
                 raw_adr_idx,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3960
                 no_particular_value,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3961
                 T_OBJECT,
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3962
                 false);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3963
  }
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3964
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3965
  // Move the original CheckCastPP after arraycopy.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3966
  _gvn.hash_delete(alloc_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3967
  alloc_obj->set_req(0, control());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3968
  // Replace raw memory edge with new CheckCastPP to have a live oop
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3969
  // at safepoints instead of raw value.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3970
  assert(new_obj->is_CheckCastPP() && new_obj->in(1) == alloc_obj->in(1), "sanity");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3971
  alloc_obj->set_req(1, new_obj);    // cast to the original type
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3972
  _gvn.hash_find_insert(alloc_obj);  // put back into GVN table
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3973
  // Restore in the locally valid dest_oop.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3974
  replace_in_map(new_obj, alloc_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  3975
}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3976
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3977
//------------------------inline_native_clone----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3978
// Here are the simple edge cases:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3979
//  null receiver => normal trap
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3980
//  virtual and clone was overridden => slow path to out-of-line clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3981
//  not cloneable or finalizer => slow path to out-of-line Object.clone
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3982
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3983
// The general case has two steps, allocation and copying.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3984
// Allocation has two cases, and uses GraphKit::new_instance or new_array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3985
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3986
// Copying also has two cases, oop arrays and everything else.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3987
// Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3988
// Everything else uses the tight inline loop supplied by CopyArrayNode.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3989
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3990
// These steps fold up nicely if and when the cloned object's klass
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3991
// can be sharply typed as an object array, a type array, or an instance.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3992
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3993
bool LibraryCallKit::inline_native_clone(bool is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3994
  int nargs = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3995
  Node* obj = null_check_receiver(callee());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3996
  if (stopped())  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3997
  Node* obj_klass = load_object_klass(obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3998
  const TypeKlassPtr* tklass = _gvn.type(obj_klass)->isa_klassptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  3999
  const TypeOopPtr*   toop   = ((tklass != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4000
                                ? tklass->as_instance_type()
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4001
                                : TypeInstPtr::NOTNULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4002
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4003
  // Conservatively insert a memory barrier on all memory slices.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4004
  // Do not let writes into the original float below the clone.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4005
  insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4006
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4007
  // paths into result_reg:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4008
  enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4009
    _slow_path = 1,     // out-of-line call to clone method (virtual or not)
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4010
    _objArray_path,     // plain array allocation, plus arrayof_oop_arraycopy
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4011
    _array_path,        // plain array allocation, plus arrayof_long_arraycopy
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4012
    _instance_path,     // plain instance allocation, plus arrayof_long_arraycopy
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4013
    PATH_LIMIT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4014
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4015
  RegionNode* result_reg = new(C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4016
  PhiNode*    result_val = new(C, PATH_LIMIT) PhiNode(result_reg,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4017
                                                      TypeInstPtr::NOTNULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4018
  PhiNode*    result_i_o = new(C, PATH_LIMIT) PhiNode(result_reg, Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4019
  PhiNode*    result_mem = new(C, PATH_LIMIT) PhiNode(result_reg, Type::MEMORY,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4020
                                                      TypePtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4021
  record_for_igvn(result_reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4022
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4023
  const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4024
  int raw_adr_idx = Compile::AliasIdxRaw;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4025
  const bool raw_mem_only = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4026
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4027
  Node* array_ctl = generate_array_guard(obj_klass, (RegionNode*)NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4028
  if (array_ctl != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4029
    // It's an array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4030
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4031
    set_control(array_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4032
    Node* obj_length = load_array_length(obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4033
    Node* obj_size = NULL;
2574
1d5f85c2d755 6589834: deoptimization problem with -XX:+DeoptimizeALot
cfang
parents: 2348
diff changeset
  4034
    Node* alloc_obj = new_array(obj_klass, obj_length, nargs,
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4035
                                raw_mem_only, &obj_size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4036
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4037
    if (!use_ReduceInitialCardMarks()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4038
      // If it is an oop array, it requires very special treatment,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4039
      // because card marking is required on each card of the array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4040
      Node* is_obja = generate_objArray_guard(obj_klass, (RegionNode*)NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4041
      if (is_obja != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4042
        PreserveJVMState pjvms2(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4043
        set_control(is_obja);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4044
        // Generate a direct call to the right arraycopy function(s).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4045
        bool disjoint_bases = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4046
        bool length_never_negative = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4047
        generate_arraycopy(TypeAryPtr::OOPS, T_OBJECT,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4048
                           obj, intcon(0), alloc_obj, intcon(0),
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4049
                           obj_length,
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4050
                           disjoint_bases, length_never_negative);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4051
        result_reg->init_req(_objArray_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4052
        result_val->init_req(_objArray_path, alloc_obj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4053
        result_i_o ->set_req(_objArray_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4054
        result_mem ->set_req(_objArray_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4055
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4056
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4057
    // We can dispense with card marks if we know the allocation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4058
    // comes out of eden (TLAB)...  In fact, ReduceInitialCardMarks
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4059
    // causes the non-eden paths to simulate a fresh allocation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4060
    // insofar that no further card marks are required to initialize
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4061
    // the object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4062
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4063
    // Otherwise, there are no card marks to worry about.
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4064
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4065
    if (!stopped()) {
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4066
      copy_to_clone(obj, alloc_obj, obj_size, true, false);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4067
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4068
      // Present the results of the copy.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4069
      result_reg->init_req(_array_path, control());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4070
      result_val->init_req(_array_path, alloc_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4071
      result_i_o ->set_req(_array_path, i_o());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4072
      result_mem ->set_req(_array_path, reset_memory());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4073
    }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4074
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4075
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4076
  // We only go to the instance fast case code if we pass a number of guards.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4077
  // The paths which do not pass are accumulated in the slow_region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4078
  RegionNode* slow_region = new (C, 1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4079
  record_for_igvn(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4080
  if (!stopped()) {
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4081
    // It's an instance (we did array above).  Make the slow-path tests.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4082
    // If this is a virtual call, we generate a funny guard.  We grab
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4083
    // the vtable entry corresponding to clone() from the target object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4084
    // If the target method which we are calling happens to be the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4085
    // Object clone() method, we pass the guard.  We do not need this
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4086
    // guard for non-virtual calls; the caller is known to be the native
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4087
    // Object clone().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4088
    if (is_virtual) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4089
      generate_virtual_guard(obj_klass, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4090
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4091
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4092
    // The object must be cloneable and must not have a finalizer.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4093
    // Both of these conditions may be checked in a single test.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4094
    // We could optimize the cloneable test further, but we don't care.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4095
    generate_access_flags_guard(obj_klass,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4096
                                // Test both conditions:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4097
                                JVM_ACC_IS_CLONEABLE | JVM_ACC_HAS_FINALIZER,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4098
                                // Must be cloneable but not finalizer:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4099
                                JVM_ACC_IS_CLONEABLE,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4100
                                slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4101
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4102
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4103
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4104
    // It's an instance, and it passed the slow-path tests.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4105
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4106
    Node* obj_size = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4107
    Node* alloc_obj = new_instance(obj_klass, NULL, raw_mem_only, &obj_size);
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4108
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4109
    copy_to_clone(obj, alloc_obj, obj_size, false, !use_ReduceInitialCardMarks());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4110
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4111
    // Present the results of the slow call.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4112
    result_reg->init_req(_instance_path, control());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4113
    result_val->init_req(_instance_path, alloc_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4114
    result_i_o ->set_req(_instance_path, i_o());
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4115
    result_mem ->set_req(_instance_path, reset_memory());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4116
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4117
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4118
  // Generate code for the slow case.  We make a call to clone().
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4119
  set_control(_gvn.transform(slow_region));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4120
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4121
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4122
    CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_clone, is_virtual);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4123
    Node* slow_result = set_results_for_java_call(slow_call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4124
    // this->control() comes from set_results_for_java_call
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4125
    result_reg->init_req(_slow_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4126
    result_val->init_req(_slow_path, slow_result);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4127
    result_i_o ->set_req(_slow_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4128
    result_mem ->set_req(_slow_path, reset_memory());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4129
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4130
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4131
  // Return the combined state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4132
  set_control(    _gvn.transform(result_reg) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4133
  set_i_o(        _gvn.transform(result_i_o) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4134
  set_all_memory( _gvn.transform(result_mem) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4135
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4136
  push(_gvn.transform(result_val));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4137
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4138
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4139
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4140
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4141
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4142
// constants for computing the copy function
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4143
enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4144
  COPYFUNC_UNALIGNED = 0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4145
  COPYFUNC_ALIGNED = 1,                 // src, dest aligned to HeapWordSize
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4146
  COPYFUNC_CONJOINT = 0,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4147
  COPYFUNC_DISJOINT = 2                 // src != dest, or transfer can descend
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4148
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4149
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4150
// Note:  The condition "disjoint" applies also for overlapping copies
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4151
// where an descending copy is permitted (i.e., dest_offset <= src_offset).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4152
static address
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4153
select_arraycopy_function(BasicType t, bool aligned, bool disjoint, const char* &name) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4154
  int selector =
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4155
    (aligned  ? COPYFUNC_ALIGNED  : COPYFUNC_UNALIGNED) +
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4156
    (disjoint ? COPYFUNC_DISJOINT : COPYFUNC_CONJOINT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4157
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4158
#define RETURN_STUB(xxx_arraycopy) { \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4159
  name = #xxx_arraycopy; \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4160
  return StubRoutines::xxx_arraycopy(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4161
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4162
  switch (t) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4163
  case T_BYTE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4164
  case T_BOOLEAN:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4165
    switch (selector) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4166
    case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4167
    case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4168
    case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jbyte_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4169
    case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jbyte_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4170
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4171
  case T_CHAR:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4172
  case T_SHORT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4173
    switch (selector) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4174
    case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4175
    case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4176
    case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jshort_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4177
    case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jshort_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4178
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4179
  case T_INT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4180
  case T_FLOAT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4181
    switch (selector) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4182
    case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4183
    case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4184
    case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jint_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4185
    case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jint_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4186
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4187
  case T_DOUBLE:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4188
  case T_LONG:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4189
    switch (selector) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4190
    case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4191
    case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4192
    case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(jlong_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4193
    case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_jlong_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4194
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4195
  case T_ARRAY:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4196
  case T_OBJECT:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4197
    switch (selector) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4198
    case COPYFUNC_CONJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(oop_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4199
    case COPYFUNC_CONJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_oop_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4200
    case COPYFUNC_DISJOINT | COPYFUNC_UNALIGNED:  RETURN_STUB(oop_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4201
    case COPYFUNC_DISJOINT | COPYFUNC_ALIGNED:    RETURN_STUB(arrayof_oop_disjoint_arraycopy);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4202
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4203
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4204
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4205
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4206
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4207
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4208
#undef RETURN_STUB
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4209
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4210
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4211
//------------------------------basictype2arraycopy----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4212
address LibraryCallKit::basictype2arraycopy(BasicType t,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4213
                                            Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4214
                                            Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4215
                                            bool disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4216
                                            const char* &name) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4217
  const TypeInt* src_offset_inttype  = gvn().find_int_type(src_offset);;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4218
  const TypeInt* dest_offset_inttype = gvn().find_int_type(dest_offset);;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4219
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4220
  bool aligned = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4221
  bool disjoint = disjoint_bases;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4222
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4223
  // if the offsets are the same, we can treat the memory regions as
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4224
  // disjoint, because either the memory regions are in different arrays,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4225
  // or they are identical (which we can treat as disjoint.)  We can also
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4226
  // treat a copy with a destination index  less that the source index
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4227
  // as disjoint since a low->high copy will work correctly in this case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4228
  if (src_offset_inttype != NULL && src_offset_inttype->is_con() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4229
      dest_offset_inttype != NULL && dest_offset_inttype->is_con()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4230
    // both indices are constants
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4231
    int s_offs = src_offset_inttype->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4232
    int d_offs = dest_offset_inttype->get_con();
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
  4233
    int element_size = type2aelembytes(t);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4234
    aligned = ((arrayOopDesc::base_offset_in_bytes(t) + s_offs * element_size) % HeapWordSize == 0) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4235
              ((arrayOopDesc::base_offset_in_bytes(t) + d_offs * element_size) % HeapWordSize == 0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4236
    if (s_offs >= d_offs)  disjoint = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4237
  } else if (src_offset == dest_offset && src_offset != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4238
    // This can occur if the offsets are identical non-constants.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4239
    disjoint = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4240
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4241
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4242
  return select_arraycopy_function(t, aligned, disjoint, name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4243
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4244
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4245
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4246
//------------------------------inline_arraycopy-----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4247
bool LibraryCallKit::inline_arraycopy() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4248
  // Restore the stack and pop off the arguments.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4249
  int nargs = 5;  // 2 oops, 3 ints, no size_t or long
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4250
  assert(callee()->signature()->size() == nargs, "copy has 5 arguments");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4251
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4252
  Node *src         = argument(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4253
  Node *src_offset  = argument(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4254
  Node *dest        = argument(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4255
  Node *dest_offset = argument(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4256
  Node *length      = argument(4);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4257
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4258
  // Compile time checks.  If any of these checks cannot be verified at compile time,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4259
  // we do not make a fast path for this call.  Instead, we let the call remain as it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4260
  // is.  The checks we choose to mandate at compile time are:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4261
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4262
  // (1) src and dest are arrays.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4263
  const Type* src_type = src->Value(&_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4264
  const Type* dest_type = dest->Value(&_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4265
  const TypeAryPtr* top_src = src_type->isa_aryptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4266
  const TypeAryPtr* top_dest = dest_type->isa_aryptr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4267
  if (top_src  == NULL || top_src->klass()  == NULL ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4268
      top_dest == NULL || top_dest->klass() == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4269
    // Conservatively insert a memory barrier on all memory slices.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4270
    // Do not let writes into the source float below the arraycopy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4271
    insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4272
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4273
    // Call StubRoutines::generic_arraycopy stub.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4274
    generate_arraycopy(TypeRawPtr::BOTTOM, T_CONFLICT,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4275
                       src, src_offset, dest, dest_offset, length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4276
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4277
    // Do not let reads from the destination float above the arraycopy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4278
    // Since we cannot type the arrays, we don't know which slices
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4279
    // might be affected.  We could restrict this barrier only to those
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4280
    // memory slices which pertain to array elements--but don't bother.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4281
    if (!InsertMemBarAfterArraycopy)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4282
      // (If InsertMemBarAfterArraycopy, there is already one in place.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4283
      insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4284
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4285
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4286
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4287
  // (2) src and dest arrays must have elements of the same BasicType
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4288
  // Figure out the size and type of the elements we will be copying.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4289
  BasicType src_elem  =  top_src->klass()->as_array_klass()->element_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4290
  BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4291
  if (src_elem  == T_ARRAY)  src_elem  = T_OBJECT;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4292
  if (dest_elem == T_ARRAY)  dest_elem = T_OBJECT;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4293
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4294
  if (src_elem != dest_elem || dest_elem == T_VOID) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4295
    // The component types are not the same or are not recognized.  Punt.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4296
    // (But, avoid the native method wrapper to JVM_ArrayCopy.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4297
    generate_slow_arraycopy(TypePtr::BOTTOM,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4298
                            src, src_offset, dest, dest_offset, length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4299
    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4300
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4301
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4302
  //---------------------------------------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4303
  // We will make a fast path for this call to arraycopy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4304
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4305
  // We have the following tests left to perform:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4306
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4307
  // (3) src and dest must not be null.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4308
  // (4) src_offset must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4309
  // (5) dest_offset must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4310
  // (6) length must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4311
  // (7) src_offset + length must not exceed length of src.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4312
  // (8) dest_offset + length must not exceed length of dest.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4313
  // (9) each element of an oop array must be assignable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4314
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4315
  RegionNode* slow_region = new (C, 1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4316
  record_for_igvn(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4317
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4318
  // (3) operands must not be null
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4319
  // We currently perform our null checks with the do_null_check routine.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4320
  // This means that the null exceptions will be reported in the caller
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4321
  // rather than (correctly) reported inside of the native arraycopy call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4322
  // This should be corrected, given time.  We do our null check with the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4323
  // stack pointer restored.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4324
  _sp += nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4325
  src  = do_null_check(src,  T_ARRAY);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4326
  dest = do_null_check(dest, T_ARRAY);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4327
  _sp -= nargs;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4328
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4329
  // (4) src_offset must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4330
  generate_negative_guard(src_offset, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4331
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4332
  // (5) dest_offset must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4333
  generate_negative_guard(dest_offset, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4334
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4335
  // (6) length must not be negative (moved to generate_arraycopy()).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4336
  // generate_negative_guard(length, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4337
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4338
  // (7) src_offset + length must not exceed length of src.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4339
  generate_limit_guard(src_offset, length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4340
                       load_array_length(src),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4341
                       slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4342
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4343
  // (8) dest_offset + length must not exceed length of dest.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4344
  generate_limit_guard(dest_offset, length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4345
                       load_array_length(dest),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4346
                       slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4347
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4348
  // (9) each element of an oop array must be assignable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4349
  // The generate_arraycopy subroutine checks this.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4350
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4351
  // This is where the memory effects are placed:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4352
  const TypePtr* adr_type = TypeAryPtr::get_array_body_type(dest_elem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4353
  generate_arraycopy(adr_type, dest_elem,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4354
                     src, src_offset, dest, dest_offset, length,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4355
                     false, false, slow_region);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4356
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4357
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4358
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4359
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4360
//-----------------------------generate_arraycopy----------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4361
// Generate an optimized call to arraycopy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4362
// Caller must guard against non-arrays.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4363
// Caller must determine a common array basic-type for both arrays.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4364
// Caller must validate offsets against array bounds.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4365
// The slow_region has already collected guard failure paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4366
// (such as out of bounds length or non-conformable array types).
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4367
// The generated code has this shape, in general:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4368
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4369
//     if (length == 0)  return   // via zero_path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4370
//     slowval = -1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4371
//     if (types unknown) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4372
//       slowval = call generic copy loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4373
//       if (slowval == 0)  return  // via checked_path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4374
//     } else if (indexes in bounds) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4375
//       if ((is object array) && !(array type check)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4376
//         slowval = call checked copy loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4377
//         if (slowval == 0)  return  // via checked_path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4378
//       } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4379
//         call bulk copy loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4380
//         return  // via fast_path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4381
//       }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4382
//     }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4383
//     // adjust params for remaining work:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4384
//     if (slowval != -1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4385
//       n = -1^slowval; src_offset += n; dest_offset += n; length -= n
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4386
//     }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4387
//   slow_region:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4388
//     call slow arraycopy(src, src_offset, dest, dest_offset, length)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4389
//     return  // via slow_call_path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4390
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4391
// This routine is used from several intrinsics:  System.arraycopy,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4392
// Object.clone (the array subcase), and Arrays.copyOf[Range].
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4393
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4394
void
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4395
LibraryCallKit::generate_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4396
                                   BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4397
                                   Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4398
                                   Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4399
                                   Node* copy_length,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4400
                                   bool disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4401
                                   bool length_never_negative,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4402
                                   RegionNode* slow_region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4403
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4404
  if (slow_region == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4405
    slow_region = new(C,1) RegionNode(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4406
    record_for_igvn(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4407
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4408
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4409
  Node* original_dest      = dest;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4410
  AllocateArrayNode* alloc = NULL;  // used for zeroing, if needed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4411
  bool  must_clear_dest    = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4412
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4413
  // See if this is the initialization of a newly-allocated array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4414
  // If so, we will take responsibility here for initializing it to zero.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4415
  // (Note:  Because tightly_coupled_allocation performs checks on the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4416
  // out-edges of the dest, we need to avoid making derived pointers
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4417
  // from it until we have checked its uses.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4418
  if (ReduceBulkZeroing
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4419
      && !ZeroTLAB              // pointless if already zeroed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4420
      && basic_elem_type != T_CONFLICT // avoid corner case
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4421
      && !_gvn.eqv_uncast(src, dest)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4422
      && ((alloc = tightly_coupled_allocation(dest, slow_region))
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4423
          != NULL)
207
694076d0755f 6667581: Don't generate initialization (by 0) code for arrays with size 0
kvn
parents: 202
diff changeset
  4424
      && _gvn.find_int_con(alloc->in(AllocateNode::ALength), 1) > 0
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4425
      && alloc->maybe_set_complete(&_gvn)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4426
    // "You break it, you buy it."
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4427
    InitializeNode* init = alloc->initialization();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4428
    assert(init->is_complete(), "we just did this");
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4429
    assert(dest->is_CheckCastPP(), "sanity");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4430
    assert(dest->in(0)->in(0) == init, "dest pinned");
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4431
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4432
    // Cast to Object for arraycopy.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4433
    // We can't use the original CheckCastPP since it should be moved
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4434
    // after the arraycopy to prevent stores flowing above it.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4435
    Node* new_obj = new(C, 2) CheckCastPPNode(dest->in(0), dest->in(1),
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4436
                                              TypeInstPtr::NOTNULL);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4437
    dest = _gvn.transform(new_obj);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4438
    // Substitute in the locally valid dest_oop.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4439
    replace_in_map(original_dest, dest);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4440
    adr_type = TypeRawPtr::BOTTOM;  // all initializations are into raw memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4441
    // From this point on, every exit path is responsible for
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4442
    // initializing any non-copied parts of the object to zero.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4443
    must_clear_dest = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4444
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4445
    // No zeroing elimination here.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4446
    alloc             = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4447
    //original_dest   = dest;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4448
    //must_clear_dest = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4449
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4450
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4451
  // Results are placed here:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4452
  enum { fast_path        = 1,  // normal void-returning assembly stub
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4453
         checked_path     = 2,  // special assembly stub with cleanup
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4454
         slow_call_path   = 3,  // something went wrong; call the VM
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4455
         zero_path        = 4,  // bypass when length of copy is zero
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4456
         bcopy_path       = 5,  // copy primitive array by 64-bit blocks
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4457
         PATH_LIMIT       = 6
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4458
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4459
  RegionNode* result_region = new(C, PATH_LIMIT) RegionNode(PATH_LIMIT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4460
  PhiNode*    result_i_o    = new(C, PATH_LIMIT) PhiNode(result_region, Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4461
  PhiNode*    result_memory = new(C, PATH_LIMIT) PhiNode(result_region, Type::MEMORY, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4462
  record_for_igvn(result_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4463
  _gvn.set_type_bottom(result_i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4464
  _gvn.set_type_bottom(result_memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4465
  assert(adr_type != TypePtr::BOTTOM, "must be RawMem or a T[] slice");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4466
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4467
  // The slow_control path:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4468
  Node* slow_control;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4469
  Node* slow_i_o = i_o();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4470
  Node* slow_mem = memory(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4471
  debug_only(slow_control = (Node*) badAddress);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4472
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4473
  // Checked control path:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4474
  Node* checked_control = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4475
  Node* checked_mem     = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4476
  Node* checked_i_o     = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4477
  Node* checked_value   = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4478
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4479
  if (basic_elem_type == T_CONFLICT) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4480
    assert(!must_clear_dest, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4481
    Node* cv = generate_generic_arraycopy(adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4482
                                          src, src_offset, dest, dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4483
                                          copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4484
    if (cv == NULL)  cv = intcon(-1);  // failure (no stub available)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4485
    checked_control = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4486
    checked_i_o     = i_o();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4487
    checked_mem     = memory(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4488
    checked_value   = cv;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4489
    set_control(top());         // no fast path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4490
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4491
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4492
  Node* not_pos = generate_nonpositive_guard(copy_length, length_never_negative);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4493
  if (not_pos != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4494
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4495
    set_control(not_pos);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4496
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4497
    // (6) length must not be negative.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4498
    if (!length_never_negative) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4499
      generate_negative_guard(copy_length, slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4500
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4501
3189
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4502
    // copy_length is 0.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4503
    if (!stopped() && must_clear_dest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4504
      Node* dest_length = alloc->in(AllocateNode::ALength);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4505
      if (_gvn.eqv_uncast(copy_length, dest_length)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4506
          || _gvn.find_int_con(dest_length, 1) <= 0) {
3189
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4507
        // There is no zeroing to do. No need for a secondary raw memory barrier.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4508
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4509
        // Clear the whole thing since there are no source elements to copy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4510
        generate_clear_array(adr_type, dest, basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4511
                             intcon(0), NULL,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4512
                             alloc->in(AllocateNode::AllocSize));
3189
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4513
        // Use a secondary InitializeNode as raw memory barrier.
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4514
        // Currently it is needed only on this path since other
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4515
        // paths have stub or runtime calls as raw memory barriers.
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4516
        InitializeNode* init = insert_mem_bar_volatile(Op_Initialize,
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4517
                                                       Compile::AliasIdxRaw,
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4518
                                                       top())->as_Initialize();
e9171813dda3 6857661: 64-bit server VM: assert(is_Initialize(),"invalid node class")
kvn
parents: 3186
diff changeset
  4519
        init->set_complete(&_gvn);  // (there is no corresponding AllocateNode)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4520
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4521
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4522
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4523
    // Present the results of the fast call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4524
    result_region->init_req(zero_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4525
    result_i_o   ->init_req(zero_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4526
    result_memory->init_req(zero_path, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4527
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4528
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4529
  if (!stopped() && must_clear_dest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4530
    // We have to initialize the *uncopied* part of the array to zero.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4531
    // The copy destination is the slice dest[off..off+len].  The other slices
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4532
    // are dest_head = dest[0..off] and dest_tail = dest[off+len..dest.length].
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4533
    Node* dest_size   = alloc->in(AllocateNode::AllocSize);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4534
    Node* dest_length = alloc->in(AllocateNode::ALength);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4535
    Node* dest_tail   = _gvn.transform( new(C,3) AddINode(dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4536
                                                          copy_length) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4537
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4538
    // If there is a head section that needs zeroing, do it now.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4539
    if (find_int_con(dest_offset, -1) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4540
      generate_clear_array(adr_type, dest, basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4541
                           intcon(0), dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4542
                           NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4543
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4544
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4545
    // Next, perform a dynamic check on the tail length.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4546
    // It is often zero, and we can win big if we prove this.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4547
    // There are two wins:  Avoid generating the ClearArray
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4548
    // with its attendant messy index arithmetic, and upgrade
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4549
    // the copy to a more hardware-friendly word size of 64 bits.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4550
    Node* tail_ctl = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4551
    if (!stopped() && !_gvn.eqv_uncast(dest_tail, dest_length)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4552
      Node* cmp_lt   = _gvn.transform( new(C,3) CmpINode(dest_tail, dest_length) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4553
      Node* bol_lt   = _gvn.transform( new(C,2) BoolNode(cmp_lt, BoolTest::lt) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4554
      tail_ctl = generate_slow_guard(bol_lt, NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4555
      assert(tail_ctl != NULL || !stopped(), "must be an outcome");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4556
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4557
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4558
    // At this point, let's assume there is no tail.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4559
    if (!stopped() && alloc != NULL && basic_elem_type != T_OBJECT) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4560
      // There is no tail.  Try an upgrade to a 64-bit copy.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4561
      bool didit = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4562
      { PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4563
        didit = generate_block_arraycopy(adr_type, basic_elem_type, alloc,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4564
                                         src, src_offset, dest, dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4565
                                         dest_size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4566
        if (didit) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4567
          // Present the results of the block-copying fast call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4568
          result_region->init_req(bcopy_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4569
          result_i_o   ->init_req(bcopy_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4570
          result_memory->init_req(bcopy_path, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4571
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4572
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4573
      if (didit)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4574
        set_control(top());     // no regular fast path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4575
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4576
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4577
    // Clear the tail, if any.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4578
    if (tail_ctl != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4579
      Node* notail_ctl = stopped() ? NULL : control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4580
      set_control(tail_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4581
      if (notail_ctl == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4582
        generate_clear_array(adr_type, dest, basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4583
                             dest_tail, NULL,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4584
                             dest_size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4585
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4586
        // Make a local merge.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4587
        Node* done_ctl = new(C,3) RegionNode(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4588
        Node* done_mem = new(C,3) PhiNode(done_ctl, Type::MEMORY, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4589
        done_ctl->init_req(1, notail_ctl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4590
        done_mem->init_req(1, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4591
        generate_clear_array(adr_type, dest, basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4592
                             dest_tail, NULL,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4593
                             dest_size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4594
        done_ctl->init_req(2, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4595
        done_mem->init_req(2, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4596
        set_control( _gvn.transform(done_ctl) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4597
        set_memory(  _gvn.transform(done_mem), adr_type );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4598
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4599
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4600
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4601
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4602
  BasicType copy_type = basic_elem_type;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4603
  assert(basic_elem_type != T_ARRAY, "caller must fix this");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4604
  if (!stopped() && copy_type == T_OBJECT) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4605
    // If src and dest have compatible element types, we can copy bits.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4606
    // Types S[] and D[] are compatible if D is a supertype of S.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4607
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4608
    // If they are not, we will use checked_oop_disjoint_arraycopy,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4609
    // which performs a fast optimistic per-oop check, and backs off
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4610
    // further to JVM_ArrayCopy on the first per-oop check that fails.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4611
    // (Actually, we don't move raw bits only; the GC requires card marks.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4612
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4613
    // Get the klassOop for both src and dest
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4614
    Node* src_klass  = load_object_klass(src);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4615
    Node* dest_klass = load_object_klass(dest);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4616
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4617
    // Generate the subtype check.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4618
    // This might fold up statically, or then again it might not.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4619
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4620
    // Non-static example:  Copying List<String>.elements to a new String[].
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4621
    // The backing store for a List<String> is always an Object[],
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4622
    // but its elements are always type String, if the generic types
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4623
    // are correct at the source level.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4624
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4625
    // Test S[] against D[], not S against D, because (probably)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4626
    // the secondary supertype cache is less busy for S[] than S.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4627
    // This usually only matters when D is an interface.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4628
    Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4629
    // Plug failing path into checked_oop_disjoint_arraycopy
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4630
    if (not_subtype_ctrl != top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4631
      PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4632
      set_control(not_subtype_ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4633
      // (At this point we can assume disjoint_bases, since types differ.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4634
      int ek_offset = objArrayKlass::element_klass_offset_in_bytes() + sizeof(oopDesc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4635
      Node* p1 = basic_plus_adr(dest_klass, ek_offset);
590
2954744d7bba 6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents: 589
diff changeset
  4636
      Node* n1 = LoadKlassNode::make(_gvn, immutable_memory(), p1, TypeRawPtr::BOTTOM);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4637
      Node* dest_elem_klass = _gvn.transform(n1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4638
      Node* cv = generate_checkcast_arraycopy(adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4639
                                              dest_elem_klass,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4640
                                              src, src_offset, dest, dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4641
                                              copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4642
      if (cv == NULL)  cv = intcon(-1);  // failure (no stub available)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4643
      checked_control = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4644
      checked_i_o     = i_o();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4645
      checked_mem     = memory(adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4646
      checked_value   = cv;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4647
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4648
    // At this point we know we do not need type checks on oop stores.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4649
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4650
    // Let's see if we need card marks:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4651
    if (alloc != NULL && use_ReduceInitialCardMarks()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4652
      // If we do not need card marks, copy using the jint or jlong stub.
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4653
      copy_type = LP64_ONLY(UseCompressedOops ? T_INT : T_LONG) NOT_LP64(T_INT);
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
  4654
      assert(type2aelembytes(basic_elem_type) == type2aelembytes(copy_type),
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4655
             "sizes agree");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4656
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4657
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4658
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4659
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4660
    // Generate the fast path, if possible.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4661
    PreserveJVMState pjvms(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4662
    generate_unchecked_arraycopy(adr_type, copy_type, disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4663
                                 src, src_offset, dest, dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4664
                                 ConvI2X(copy_length));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4665
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4666
    // Present the results of the fast call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4667
    result_region->init_req(fast_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4668
    result_i_o   ->init_req(fast_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4669
    result_memory->init_req(fast_path, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4670
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4671
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4672
  // Here are all the slow paths up to this point, in one bundle:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4673
  slow_control = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4674
  if (slow_region != NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4675
    slow_control = _gvn.transform(slow_region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4676
  debug_only(slow_region = (RegionNode*)badAddress);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4677
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4678
  set_control(checked_control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4679
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4680
    // Clean up after the checked call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4681
    // The returned value is either 0 or -1^K,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4682
    // where K = number of partially transferred array elements.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4683
    Node* cmp = _gvn.transform( new(C, 3) CmpINode(checked_value, intcon(0)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4684
    Node* bol = _gvn.transform( new(C, 2) BoolNode(cmp, BoolTest::eq) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4685
    IfNode* iff = create_and_map_if(control(), bol, PROB_MAX, COUNT_UNKNOWN);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4686
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4687
    // If it is 0, we are done, so transfer to the end.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4688
    Node* checks_done = _gvn.transform( new(C, 1) IfTrueNode(iff) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4689
    result_region->init_req(checked_path, checks_done);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4690
    result_i_o   ->init_req(checked_path, checked_i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4691
    result_memory->init_req(checked_path, checked_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4692
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4693
    // If it is not zero, merge into the slow call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4694
    set_control( _gvn.transform( new(C, 1) IfFalseNode(iff) ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4695
    RegionNode* slow_reg2 = new(C, 3) RegionNode(3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4696
    PhiNode*    slow_i_o2 = new(C, 3) PhiNode(slow_reg2, Type::ABIO);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4697
    PhiNode*    slow_mem2 = new(C, 3) PhiNode(slow_reg2, Type::MEMORY, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4698
    record_for_igvn(slow_reg2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4699
    slow_reg2  ->init_req(1, slow_control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4700
    slow_i_o2  ->init_req(1, slow_i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4701
    slow_mem2  ->init_req(1, slow_mem);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4702
    slow_reg2  ->init_req(2, control());
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4703
    slow_i_o2  ->init_req(2, checked_i_o);
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4704
    slow_mem2  ->init_req(2, checked_mem);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4705
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4706
    slow_control = _gvn.transform(slow_reg2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4707
    slow_i_o     = _gvn.transform(slow_i_o2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4708
    slow_mem     = _gvn.transform(slow_mem2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4709
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4710
    if (alloc != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4711
      // We'll restart from the very beginning, after zeroing the whole thing.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4712
      // This can cause double writes, but that's OK since dest is brand new.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4713
      // So we ignore the low 31 bits of the value returned from the stub.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4714
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4715
      // We must continue the copy exactly where it failed, or else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4716
      // another thread might see the wrong number of writes to dest.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4717
      Node* checked_offset = _gvn.transform( new(C, 3) XorINode(checked_value, intcon(-1)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4718
      Node* slow_offset    = new(C, 3) PhiNode(slow_reg2, TypeInt::INT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4719
      slow_offset->init_req(1, intcon(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4720
      slow_offset->init_req(2, checked_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4721
      slow_offset  = _gvn.transform(slow_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4722
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4723
      // Adjust the arguments by the conditionally incoming offset.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4724
      Node* src_off_plus  = _gvn.transform( new(C, 3) AddINode(src_offset,  slow_offset) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4725
      Node* dest_off_plus = _gvn.transform( new(C, 3) AddINode(dest_offset, slow_offset) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4726
      Node* length_minus  = _gvn.transform( new(C, 3) SubINode(copy_length, slow_offset) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4727
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4728
      // Tweak the node variables to adjust the code produced below:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4729
      src_offset  = src_off_plus;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4730
      dest_offset = dest_off_plus;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4731
      copy_length = length_minus;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4732
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4733
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4734
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4735
  set_control(slow_control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4736
  if (!stopped()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4737
    // Generate the slow path, if needed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4738
    PreserveJVMState pjvms(this);   // replace_in_map may trash the map
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4739
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4740
    set_memory(slow_mem, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4741
    set_i_o(slow_i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4742
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4743
    if (must_clear_dest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4744
      generate_clear_array(adr_type, dest, basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4745
                           intcon(0), NULL,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4746
                           alloc->in(AllocateNode::AllocSize));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4747
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4748
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4749
    generate_slow_arraycopy(adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4750
                            src, src_offset, dest, dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4751
                            copy_length);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4752
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4753
    result_region->init_req(slow_call_path, control());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4754
    result_i_o   ->init_req(slow_call_path, i_o());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4755
    result_memory->init_req(slow_call_path, memory(adr_type));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4756
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4757
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4758
  // Remove unused edges.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4759
  for (uint i = 1; i < result_region->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4760
    if (result_region->in(i) == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4761
      result_region->init_req(i, top());
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4762
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4763
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4764
  // Finished; return the combined state.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4765
  set_control( _gvn.transform(result_region) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4766
  set_i_o(     _gvn.transform(result_i_o)    );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4767
  set_memory(  _gvn.transform(result_memory), adr_type );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4768
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4769
  if (dest != original_dest) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4770
    // Pin the "finished" array node after the arraycopy/zeroing operations.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4771
    _gvn.hash_delete(original_dest);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4772
    original_dest->set_req(0, control());
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4773
    // Replace raw memory edge with new CheckCastPP to have a live oop
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4774
    // at safepoints instead of raw value.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4775
    assert(dest->is_CheckCastPP() && dest->in(1) == original_dest->in(1), "sanity");
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4776
    original_dest->set_req(1, dest);       // cast to the original type
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4777
    _gvn.hash_find_insert(original_dest);  // put back into GVN table
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4778
    // Restore in the locally valid dest_oop.
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  4779
    replace_in_map(dest, original_dest);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4780
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4781
  // The memory edges above are precise in order to model effects around
2131
98f9cef66a34 6810672: Comment typos
twisti
parents: 1500
diff changeset
  4782
  // array copies accurately to allow value numbering of field loads around
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4783
  // arraycopy.  Such field loads, both before and after, are common in Java
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4784
  // collections and similar classes involving header/array data structures.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4785
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4786
  // But with low number of register or when some registers are used or killed
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4787
  // by arraycopy calls it causes registers spilling on stack. See 6544710.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4788
  // The next memory barrier is added to avoid it. If the arraycopy can be
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4789
  // optimized away (which it can, sometimes) then we can manually remove
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4790
  // the membar also.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4791
  if (InsertMemBarAfterArraycopy)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4792
    insert_mem_bar(Op_MemBarCPUOrder);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4793
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4794
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4795
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4796
// Helper function which determines if an arraycopy immediately follows
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4797
// an allocation, with no intervening tests or other escapes for the object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4798
AllocateArrayNode*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4799
LibraryCallKit::tightly_coupled_allocation(Node* ptr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4800
                                           RegionNode* slow_region) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4801
  if (stopped())             return NULL;  // no fast path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4802
  if (C->AliasLevel() == 0)  return NULL;  // no MergeMems around
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4803
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4804
  AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4805
  if (alloc == NULL)  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4806
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4807
  Node* rawmem = memory(Compile::AliasIdxRaw);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4808
  // Is the allocation's memory state untouched?
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4809
  if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4810
    // Bail out if there have been raw-memory effects since the allocation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4811
    // (Example:  There might have been a call or safepoint.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4812
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4813
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4814
  rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4815
  if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4816
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4817
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4818
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4819
  // There must be no unexpected observers of this allocation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4820
  for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4821
    Node* obs = ptr->fast_out(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4822
    if (obs != this->map()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4823
      return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4824
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4825
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4826
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4827
  // This arraycopy must unconditionally follow the allocation of the ptr.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4828
  Node* alloc_ctl = ptr->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4829
  assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4830
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4831
  Node* ctl = control();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4832
  while (ctl != alloc_ctl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4833
    // There may be guards which feed into the slow_region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4834
    // Any other control flow means that we might not get a chance
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4835
    // to finish initializing the allocated object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4836
    if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4837
      IfNode* iff = ctl->in(0)->as_If();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4838
      Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4839
      assert(not_ctl != NULL && not_ctl != ctl, "found alternate");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4840
      if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4841
        ctl = iff->in(0);       // This test feeds the known slow_region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4842
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4843
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4844
      // One more try:  Various low-level checks bottom out in
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4845
      // uncommon traps.  If the debug-info of the trap omits
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4846
      // any reference to the allocation, as we've already
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4847
      // observed, then there can be no objection to the trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4848
      bool found_trap = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4849
      for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4850
        Node* obs = not_ctl->fast_out(j);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4851
        if (obs->in(0) == not_ctl && obs->is_Call() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4852
            (obs->as_Call()->entry_point() ==
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4853
             SharedRuntime::uncommon_trap_blob()->instructions_begin())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4854
          found_trap = true; break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4855
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4856
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4857
      if (found_trap) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4858
        ctl = iff->in(0);       // This test feeds a harmless uncommon trap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4859
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4860
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4861
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4862
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4863
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4864
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4865
  // If we get this far, we have an allocation which immediately
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4866
  // precedes the arraycopy, and we can take over zeroing the new object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4867
  // The arraycopy will finish the initialization, and provide
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4868
  // a new control state to which we will anchor the destination pointer.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4869
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4870
  return alloc;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4871
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4872
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4873
// Helper for initialization of arrays, creating a ClearArray.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4874
// It writes zero bits in [start..end), within the body of an array object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4875
// The memory effects are all chained onto the 'adr_type' alias category.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4876
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4877
// Since the object is otherwise uninitialized, we are free
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4878
// to put a little "slop" around the edges of the cleared area,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4879
// as long as it does not go back into the array's header,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4880
// or beyond the array end within the heap.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4881
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4882
// The lower edge can be rounded down to the nearest jint and the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4883
// upper edge can be rounded up to the nearest MinObjAlignmentInBytes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4884
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4885
// Arguments:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4886
//   adr_type           memory slice where writes are generated
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4887
//   dest               oop of the destination array
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4888
//   basic_elem_type    element type of the destination
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4889
//   slice_idx          array index of first element to store
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4890
//   slice_len          number of elements to store (or NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4891
//   dest_size          total size in bytes of the array object
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4892
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4893
// Exactly one of slice_len or dest_size must be non-NULL.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4894
// If dest_size is non-NULL, zeroing extends to the end of the object.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4895
// If slice_len is non-NULL, the slice_idx value must be a constant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4896
void
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4897
LibraryCallKit::generate_clear_array(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4898
                                     Node* dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4899
                                     BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4900
                                     Node* slice_idx,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4901
                                     Node* slice_len,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4902
                                     Node* dest_size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4903
  // one or the other but not both of slice_len and dest_size:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4904
  assert((slice_len != NULL? 1: 0) + (dest_size != NULL? 1: 0) == 1, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4905
  if (slice_len == NULL)  slice_len = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4906
  if (dest_size == NULL)  dest_size = top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4907
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4908
  // operate on this memory slice:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4909
  Node* mem = memory(adr_type); // memory slice to operate on
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4910
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4911
  // scaling and rounding of indexes:
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
  4912
  int scale = exact_log2(type2aelembytes(basic_elem_type));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4913
  int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4914
  int clear_low = (-1 << scale) & (BytesPerInt  - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4915
  int bump_bit  = (-1 << scale) & BytesPerInt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4916
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4917
  // determine constant starts and ends
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4918
  const intptr_t BIG_NEG = -128;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4919
  assert(BIG_NEG + 2*abase < 0, "neg enough");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4920
  intptr_t slice_idx_con = (intptr_t) find_int_con(slice_idx, BIG_NEG);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4921
  intptr_t slice_len_con = (intptr_t) find_int_con(slice_len, BIG_NEG);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4922
  if (slice_len_con == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4923
    return;                     // nothing to do here
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4924
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4925
  intptr_t start_con = (abase + (slice_idx_con << scale)) & ~clear_low;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4926
  intptr_t end_con   = find_intptr_t_con(dest_size, -1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4927
  if (slice_idx_con >= 0 && slice_len_con >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4928
    assert(end_con < 0, "not two cons");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4929
    end_con = round_to(abase + ((slice_idx_con + slice_len_con) << scale),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4930
                       BytesPerLong);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4931
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4932
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4933
  if (start_con >= 0 && end_con >= 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4934
    // Constant start and end.  Simple.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4935
    mem = ClearArrayNode::clear_memory(control(), mem, dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4936
                                       start_con, end_con, &_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4937
  } else if (start_con >= 0 && dest_size != top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4938
    // Constant start, pre-rounded end after the tail of the array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4939
    Node* end = dest_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4940
    mem = ClearArrayNode::clear_memory(control(), mem, dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4941
                                       start_con, end, &_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4942
  } else if (start_con >= 0 && slice_len != top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4943
    // Constant start, non-constant end.  End needs rounding up.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4944
    // End offset = round_up(abase + ((slice_idx_con + slice_len) << scale), 8)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4945
    intptr_t end_base  = abase + (slice_idx_con << scale);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4946
    int      end_round = (-1 << scale) & (BytesPerLong  - 1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4947
    Node*    end       = ConvI2X(slice_len);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4948
    if (scale != 0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4949
      end = _gvn.transform( new(C,3) LShiftXNode(end, intcon(scale) ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4950
    end_base += end_round;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4951
    end = _gvn.transform( new(C,3) AddXNode(end, MakeConX(end_base)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4952
    end = _gvn.transform( new(C,3) AndXNode(end, MakeConX(~end_round)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4953
    mem = ClearArrayNode::clear_memory(control(), mem, dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4954
                                       start_con, end, &_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4955
  } else if (start_con < 0 && dest_size != top()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4956
    // Non-constant start, pre-rounded end after the tail of the array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4957
    // This is almost certainly a "round-to-end" operation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4958
    Node* start = slice_idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4959
    start = ConvI2X(start);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4960
    if (scale != 0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4961
      start = _gvn.transform( new(C,3) LShiftXNode( start, intcon(scale) ));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4962
    start = _gvn.transform( new(C,3) AddXNode(start, MakeConX(abase)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4963
    if ((bump_bit | clear_low) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4964
      int to_clear = (bump_bit | clear_low);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4965
      // Align up mod 8, then store a jint zero unconditionally
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4966
      // just before the mod-8 boundary.
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4967
      if (((abase + bump_bit) & ~to_clear) - bump_bit
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4968
          < arrayOopDesc::length_offset_in_bytes() + BytesPerInt) {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4969
        bump_bit = 0;
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4970
        assert((abase & to_clear) == 0, "array base must be long-aligned");
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4971
      } else {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4972
        // Bump 'start' up to (or past) the next jint boundary:
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4973
        start = _gvn.transform( new(C,3) AddXNode(start, MakeConX(bump_bit)) );
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4974
        assert((abase & clear_low) == 0, "array base must be int-aligned");
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4975
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4976
      // Round bumped 'start' down to jlong boundary in body of array.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4977
      start = _gvn.transform( new(C,3) AndXNode(start, MakeConX(~to_clear)) );
360
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4978
      if (bump_bit != 0) {
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4979
        // Store a zero to the immediately preceding jint:
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4980
        Node* x1 = _gvn.transform( new(C,3) AddXNode(start, MakeConX(-bump_bit)) );
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4981
        Node* p1 = basic_plus_adr(dest, x1);
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4982
        mem = StoreNode::make(_gvn, control(), mem, p1, adr_type, intcon(0), T_INT);
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4983
        mem = _gvn.transform(mem);
21d113ecbf6a 6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents: 207
diff changeset
  4984
      }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4985
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4986
    Node* end = dest_size; // pre-rounded
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4987
    mem = ClearArrayNode::clear_memory(control(), mem, dest,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4988
                                       start, end, &_gvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4989
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4990
    // Non-constant start, unrounded non-constant end.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4991
    // (Nobody zeroes a random midsection of an array using this routine.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4992
    ShouldNotReachHere();       // fix caller
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4993
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4994
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4995
  // Done.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4996
  set_memory(mem, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4997
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4998
489c9b5090e2 Initial load
duke
parents:
diff changeset
  4999
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5000
bool
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5001
LibraryCallKit::generate_block_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5002
                                         BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5003
                                         AllocateNode* alloc,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5004
                                         Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5005
                                         Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5006
                                         Node* dest_size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5007
  // See if there is an advantage from block transfer.
202
dc13bf0e5d5d 6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents: 1
diff changeset
  5008
  int scale = exact_log2(type2aelembytes(basic_elem_type));
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5009
  if (scale >= LogBytesPerLong)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5010
    return false;               // it is already a block transfer
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5011
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5012
  // Look at the alignment of the starting offsets.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5013
  int abase = arrayOopDesc::base_offset_in_bytes(basic_elem_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5014
  const intptr_t BIG_NEG = -128;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5015
  assert(BIG_NEG + 2*abase < 0, "neg enough");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5016
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5017
  intptr_t src_off  = abase + ((intptr_t) find_int_con(src_offset, -1)  << scale);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5018
  intptr_t dest_off = abase + ((intptr_t) find_int_con(dest_offset, -1) << scale);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5019
  if (src_off < 0 || dest_off < 0)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5020
    // At present, we can only understand constants.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5021
    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5022
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5023
  if (((src_off | dest_off) & (BytesPerLong-1)) != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5024
    // Non-aligned; too bad.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5025
    // One more chance:  Pick off an initial 32-bit word.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5026
    // This is a common case, since abase can be odd mod 8.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5027
    if (((src_off | dest_off) & (BytesPerLong-1)) == BytesPerInt &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5028
        ((src_off ^ dest_off) & (BytesPerLong-1)) == 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5029
      Node* sptr = basic_plus_adr(src,  src_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5030
      Node* dptr = basic_plus_adr(dest, dest_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5031
      Node* sval = make_load(control(), sptr, TypeInt::INT, T_INT, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5032
      store_to_memory(control(), dptr, sval, T_INT, adr_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5033
      src_off += BytesPerInt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5034
      dest_off += BytesPerInt;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5035
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5036
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5037
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5038
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5039
  assert(src_off % BytesPerLong == 0, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5040
  assert(dest_off % BytesPerLong == 0, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5041
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5042
  // Do this copy by giant steps.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5043
  Node* sptr  = basic_plus_adr(src,  src_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5044
  Node* dptr  = basic_plus_adr(dest, dest_off);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5045
  Node* countx = dest_size;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5046
  countx = _gvn.transform( new (C, 3) SubXNode(countx, MakeConX(dest_off)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5047
  countx = _gvn.transform( new (C, 3) URShiftXNode(countx, intcon(LogBytesPerLong)) );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5048
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5049
  bool disjoint_bases = true;   // since alloc != NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5050
  generate_unchecked_arraycopy(adr_type, T_LONG, disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5051
                               sptr, NULL, dptr, NULL, countx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5052
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5053
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5054
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5055
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5056
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5057
// Helper function; generates code for the slow case.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5058
// We make a call to a runtime method which emulates the native method,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5059
// but without the native wrapper overhead.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5060
void
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5061
LibraryCallKit::generate_slow_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5062
                                        Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5063
                                        Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  5064
                                        Node* copy_length) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5065
  Node* call = make_runtime_call(RC_NO_LEAF | RC_UNCOMMON,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5066
                                 OptoRuntime::slow_arraycopy_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5067
                                 OptoRuntime::slow_arraycopy_Java(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5068
                                 "slow_arraycopy", adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5069
                                 src, src_offset, dest, dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5070
                                 copy_length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5071
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5072
  // Handle exceptions thrown by this fellow:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5073
  make_slow_call_ex(call, env()->Throwable_klass(), false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5074
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5075
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5076
// Helper function; generates code for cases requiring runtime checks.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5077
Node*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5078
LibraryCallKit::generate_checkcast_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5079
                                             Node* dest_elem_klass,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5080
                                             Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5081
                                             Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  5082
                                             Node* copy_length) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5083
  if (stopped())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5084
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5085
  address copyfunc_addr = StubRoutines::checkcast_arraycopy();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5086
  if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5087
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5088
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5089
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5090
  // Pick out the parameters required to perform a store-check
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5091
  // for the target array.  This is an optimistic check.  It will
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5092
  // look in each non-null element's class, at the desired klass's
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5093
  // super_check_offset, for the desired klass.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5094
  int sco_offset = Klass::super_check_offset_offset_in_bytes() + sizeof(oopDesc);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5095
  Node* p3 = basic_plus_adr(dest_elem_klass, sco_offset);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5096
  Node* n3 = new(C, 3) LoadINode(NULL, immutable_memory(), p3, TypeRawPtr::BOTTOM);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5097
  Node* check_offset = _gvn.transform(n3);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5098
  Node* check_value  = dest_elem_klass;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5099
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5100
  Node* src_start  = array_element_address(src,  src_offset,  T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5101
  Node* dest_start = array_element_address(dest, dest_offset, T_OBJECT);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5102
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5103
  // (We know the arrays are never conjoint, because their types differ.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5104
  Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5105
                                 OptoRuntime::checkcast_arraycopy_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5106
                                 copyfunc_addr, "checkcast_arraycopy", adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5107
                                 // five arguments, of which two are
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5108
                                 // intptr_t (jlong in LP64)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5109
                                 src_start, dest_start,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5110
                                 copy_length XTOP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5111
                                 check_offset XTOP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5112
                                 check_value);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5113
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5114
  return _gvn.transform(new (C, 1) ProjNode(call, TypeFunc::Parms));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5115
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5116
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5117
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5118
// Helper function; generates code for cases requiring runtime checks.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5119
Node*
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5120
LibraryCallKit::generate_generic_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5121
                                           Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5122
                                           Node* dest, Node* dest_offset,
3186
11ba3d09bd0e 6840775: Multiple JVM crashes seen with 1.6.0_10 through 1.6.0_14
kvn
parents: 3180
diff changeset
  5123
                                           Node* copy_length) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5124
  if (stopped())  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5125
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5126
  address copyfunc_addr = StubRoutines::generic_arraycopy();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5127
  if (copyfunc_addr == NULL) { // Stub was not generated, go slow path.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5128
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5129
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5130
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5131
  Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5132
                    OptoRuntime::generic_arraycopy_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5133
                    copyfunc_addr, "generic_arraycopy", adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5134
                    src, src_offset, dest, dest_offset, copy_length);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5135
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5136
  return _gvn.transform(new (C, 1) ProjNode(call, TypeFunc::Parms));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5137
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5138
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5139
// Helper function; generates the fast out-of-line call to an arraycopy stub.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5140
void
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5141
LibraryCallKit::generate_unchecked_arraycopy(const TypePtr* adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5142
                                             BasicType basic_elem_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5143
                                             bool disjoint_bases,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5144
                                             Node* src,  Node* src_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5145
                                             Node* dest, Node* dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5146
                                             Node* copy_length) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5147
  if (stopped())  return;               // nothing to do
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5148
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5149
  Node* src_start  = src;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5150
  Node* dest_start = dest;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5151
  if (src_offset != NULL || dest_offset != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5152
    assert(src_offset != NULL && dest_offset != NULL, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5153
    src_start  = array_element_address(src,  src_offset,  basic_elem_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5154
    dest_start = array_element_address(dest, dest_offset, basic_elem_type);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5155
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5156
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5157
  // Figure out which arraycopy runtime method to call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5158
  const char* copyfunc_name = "arraycopy";
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5159
  address     copyfunc_addr =
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5160
      basictype2arraycopy(basic_elem_type, src_offset, dest_offset,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5161
                          disjoint_bases, copyfunc_name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5162
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5163
  // Call it.  Note that the count_ix value is not scaled to a byte-size.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5164
  make_runtime_call(RC_LEAF|RC_NO_FP,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5165
                    OptoRuntime::fast_arraycopy_Type(),
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5166
                    copyfunc_addr, copyfunc_name, adr_type,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5167
                    src_start, dest_start, copy_length XTOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  5168
}