Lines Matching refs:slice
51 _mem_slice_head(arena(), 8, 0, NULL), // memory slice heads
52 _mem_slice_tail(arena(), 8, 0, NULL), // memory slice tails
515 // For each memory slice, create the dependences
520 // Get slice in predecessor order (last is first)
523 // Make the slice dependent on the root
524 DepMem* slice = _dg.dep(n);
525 _dg.make_edge(_dg.root(), slice);
527 // Create a sink for the slice
535 // If no dependency yet, use slice
537 _dg.make_edge(slice, s1);
565 tty->print_cr("\nDependence graph for slice: %d", n->_idx);
588 // Return a memory slice (node list) in predecessor order starting at "start"
612 assert(out == prev || prev == NULL, "no branches off of store slice");
1183 uint pos; //lip (lower insert point) must be the last one in the memory slice
1632 assert(n_tail->is_Mem(), err_msg_res("unexpected node for memory slice: %s", n_tail->Name()));