Lines Matching refs:Uses
87 /// with no registered uses (in Uses) will never be marked alive and will
102 /// arguments it uses. This allows the MaybeLive values to be marked live
105 /// - Uses[ret F] = ret G
107 /// - Uses[arg F] = ret G
110 /// - Uses[ret F] = arg F
112 /// - Uses[arg F] = arg G
115 UseMap Uses;
137 // DAH uses this to specify a different ID.
317 // Loop over the argument list, transferring uses of the old arguments over to
427 // that U is really a use of an insertvalue instruction that uses the
437 // depends on all uses of that aggregate, but if it is used as a return
442 // we don't change RetValNum, but do survey all our uses.
483 /// SurveyUses - This looks at all the uses of the given value
484 /// Returns the Liveness deduced from the uses of this value.
486 /// Adds all uses that cause the result to be MaybeLive to MaybeLiveRetUses. If
490 // Assume it's dead (which will only hold if there are no uses at all..).
503 // checking out whether or not it uses any of its incoming arguments or whether
504 // any callers use the return value. This fills in the LiveValues set and Uses
517 // These vectors map each return value to the uses that make it MaybeLive, so
518 // we can add those to the Uses map if the return value really turns out to be
541 // Loop all uses of the function.
565 // Check all uses of the return value.
570 // This use uses a part of our return value, survey the uses of
607 // See what the effect of this use is (recording any uses that cause
618 /// MaybeLive, it also takes all uses in MaybeLiveUses and records them in Uses,
627 // Note any uses of this value, so this return value can be
628 // marked live whenever one of the uses becomes live.
631 Uses.insert(std::make_pair(*UI, RA));
640 /// values (according to Uses) live as well.
654 /// mark any values that are used by this value (according to Uses) live as
668 /// to any other values it uses (according to Uses).
673 UseMap::iterator Begin = Uses.lower_bound(RA);
674 UseMap::iterator E = Uses.end();
679 // Erase RA from the Uses map (from the lower bound to wherever we ended up
681 Uses.erase(Begin, I);
912 // Our return value has uses, but they will get removed later on.
928 // uses of this struct, we will just rebuild it using
947 // Now, replace all uses of the old call instruction with the return
964 // Loop over the argument list, transferring uses of the old arguments over to
976 // If this argument is dead, replace any uses of it with null constants
