OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Users
(Results
1 - 5
of
5
) sorted by null
/external/llvm/lib/CodeGen/
SjLjEHPrepare.cpp
320
// Avoid iterator invalidation by copying
users
to a temporary vector.
321
SmallVector<Instruction*, 16>
Users
;
326
Users
.push_back(User);
332
while (!
Users
.empty()) {
333
Instruction *U =
Users
.back();
334
Users
.pop_back();
/external/llvm/lib/Transforms/Utils/
LowerInvoke.cpp
340
// Avoid iterator invalidation by copying
users
to a temporary vector.
341
SmallVector<Instruction*,16>
Users
;
346
Users
.push_back(User);
357
while (!
Users
.empty()) {
358
Instruction *U =
Users
.back();
359
Users
.pop_back();
/external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp
614
// Otherwise, we can replace *all*
users
with the new PHI we form.
[
all
...]
/external/llvm/lib/Transforms/Vectorize/
BBVectorize.cpp
216
bool trackUsesOfI(DenseSet<Value *> &
Users
,
490
//
users
of the pair are also paired. This defines a (directed) forest
712
// Figure out whether or not J uses I and update the
users
and write-set
713
// structures associated with I. Specifically,
Users
represents the set of
716
// and J uses I, then
Users
is updated to contain J and WriteSet is updated
727
bool BBVectorize::trackUsesOfI(DenseSet<Value *> &
Users
,
735
if (
Users
.count(J))
742
if (I == V ||
Users
.count(V)) {
764
Users
.insert(J);
787
DenseSet<Value *>
Users
;
[
all
...]
/external/llvm/lib/Transforms/Scalar/
ObjCARC.cpp
300
// only question is whether or not they may be
users
.
448
/// argument verbatim, so if it's such a call and the return value has
users
,
458
"Can't delete non-forwarding instruction with
users
!");
[
all
...]
Completed in 83 milliseconds