Lines Matching defs:least
195 assert(deepb != NULL, "must be at least one input to n");
289 // Find least common ancestor in dominator tree
666 "Expect at least one phi input will not be from original memory state");
1015 Block* least = LCA;
1016 double least_freq = least->_freq;
1050 // the earliest legal location. Capture the least execution frequency.
1057 return least;
1082 least = LCA; // Found cheaper block
1094 least->_pre_order, start_latency, least_freq);
1109 return least;
1115 // dominator tree of all USES of a value. Pick the block with the least
1225 // Now find the block with the least execution frequency.
1293 // dominator tree of all USES of a value. Pick the block with the least