Lines Matching defs:array

898   // to the call node, & reset all offsets to match call node array.
1142 Node* GraphKit::load_array_length(Node* array) {
1144 AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(array, &_gvn);
1147 Node *r_adr = basic_plus_adr(array, arrayOopDesc::length_offset_in_bytes());
1151 Node* ccast = alloc->make_ideal_length(_gvn.type(array)->is_oopptr(), &_gvn);
1561 // Could be an array or object we don't know at compile time (unsafe ref.)
1616 int index_max = max_jint - 1; // array size is max_jint, index is one less
2424 // types. An exception would be a secondary type like array-of-interface,
2432 // Now do a linear scan of the secondary super-klass array. Again, no real
2495 // A primitive array type has no subtypes.
2669 // array store bytecode. Stack must be as-if BEFORE doing the bytecode so the
2782 // This means that if I successfully store an Object into an array-of-String
2785 // a Baz into an array-of-Interface and then tell the optimizer it's an
2956 // If the given klass is a constant or known to be an array,
3157 // The 'length' parameter is (obviously) the length of the array.
3159 Node* GraphKit::new_array(Node* klass_node, // array klass (maybe variable)
3160 Node* length, // number of array elements
3169 // This is a reflective array creation site.
3193 // Increase the size limit if we have exact knowledge of array type.
3295 // and in the latter case the actual array type will be inexact also.
3297 // In any case, the value of klass_node provides the desired array type.
3489 // All card marks for a (non-array) instance are in one place:
3492 // (Else it's an array (or unknown), and we want more precise card marks.)
3691 // All card marks for a (non-array) instance are in one place:
3694 // (Else it's an array (or unknown), and we want more precise card marks.)