Lines Matching defs:that
2 // Use of this source code is governed by a BSD-style license that can be
114 void CsaLoadElimination::HalfState::IntersectWith(HalfState const* that) {
115 IntersectWith(fresh_entries_, that->fresh_entries_);
116 IntersectWith(constant_entries_, that->constant_entries_);
117 IntersectWith(arbitrary_entries_, that->arbitrary_entries_);
118 IntersectWith(fresh_unknown_entries_, that->fresh_unknown_entries_);
119 IntersectWith(constant_unknown_entries_, that->constant_unknown_entries_);
120 IntersectWith(arbitrary_unknown_entries_, that->arbitrary_unknown_entries_);
236 // Kill all elements in {infos} that overlap with an element with {offset} and
249 // Now we have to remove all elements in earlier offsets that overlap with an
251 // The earliest offset that may overlap with {offset} is
257 // respective inner map, and reset all elements that are large enough to
351 // Make sure we don't reuse values that were recorded with a different
479 // Only signal that the {node} has Changed, if the information about {state}
546 // from a previous subsuming load or store. Since that value might be
560 // from a previous subsuming load or store. Since that value might be