OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Refs
(Results
1 - 11
of
11
) sorted by null
/external/clang/lib/ARCMigrate/
TransProtectedScope.cpp
27
SmallVectorImpl<DeclRefExpr *> &
Refs
;
30
LocalRefsCollector(SmallVectorImpl<DeclRefExpr *> &
refs
)
31
:
Refs
(
refs
) { }
36
Refs
.push_back(E);
TransAutoreleasePool.cpp
94
clearRefsIn(info.Dcl, info.
Refs
);
99
clearRefsIn(*scope.Begin, info.
Refs
);
100
clearRefsIn(*scope.End, info.
Refs
);
101
clearRefsIn(scope.Releases.begin(), scope.Releases.end(), info.
Refs
);
106
if (info.
Refs
.empty())
176
collectRefs(VD, S, info.
Refs
);
421
ExprSet
Refs
;
Transforms.cpp
221
ExprSet &
Refs
;
223
ReferenceClear(ExprSet &
refs
) :
Refs
(
refs
) { }
224
bool VisitDeclRefExpr(DeclRefExpr *E) {
Refs
.erase(E); return true; }
229
ExprSet &
Refs
;
232
ReferenceCollector(ValueDecl *D, ExprSet &
refs
)
233
: Dcl(D),
Refs
(
refs
) { }
237
Refs
.insert(E)
[
all
...]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
ExecutionDepsFix.cpp
53
unsigned
Refs
;
98
Refs
= AvailableDomains = Dist = 0;
195
assert(LiveRegs[rx]->
Refs
&& "Bad refcount");
196
if (--LiveRegs[rx]->
Refs
== 0) Recycle(LiveRegs[rx]);
199
if (dv) ++dv->
Refs
;
209
if (LiveRegs[rx]->
Refs
== 1 && !LiveRegs[rx]->isCollapsed())
248
if (LiveRegs && dv->
Refs
> 1)
StackSlotColoring.cpp
52
STATISTIC(NumRegRepl, "Number of stack slot
refs
replaced with reg
refs
");
502
SmallVector<MachineOperand*, 4>
Refs
;
531
Refs
.push_back(&MO);
545
for (unsigned i = 0, e =
Refs
.size(); i != e; ++i)
546
Refs
[i]->setReg(NewReg);
552
Refs
.push_back(Uses[i]);
/external/llvm/lib/CodeGen/
ExecutionDepsFix.cpp
57
unsigned
Refs
;
104
DomainValue() :
Refs
(0) { clear(); }
187
if (DV) ++DV->
Refs
;
228
assert(dv->
Refs
== 0 && "Reference count wasn't cleared");
237
assert(DV->
Refs
&& "Bad DomainValue");
238
if (--DV->
Refs
)
327
if (LiveRegs && dv->
Refs
> 1)
MachinePipeliner.cpp
[
all
...]
/external/llvm/lib/Target/Hexagon/
HexagonRDFOpt.cpp
185
NodeList
Refs
= IA.Addr->members(getDFG());
186
for (NodeAddr<RefNode*> RA :
Refs
)
191
for (NodeAddr<RefNode*> RA :
Refs
) {
RDFGraph.cpp
970
// Link all the
refs
. This will recursively traverse the dominator tree.
1059
NodeList
Refs
;
1062
Refs
.push_back(RA);
1065
return
Refs
;
[
all
...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
wsdxmldom.h
32
DWORD
Refs
;
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
AliasSetTracker.h
123
/// both. The lattice goes from "NoModRef" to either
Refs
or Mods, then to
127
NoModRef = 0,
Refs
= 1, // Ref = bit 1
157
bool isRef() const { return AccessTy &
Refs
; }
Completed in 4450 milliseconds