Searched refs:Refs (Results 1 - 7 of 7) sorted by relevance
| /freebsd-11.0-release/contrib/llvm/tools/clang/lib/ARCMigrate/ |
| H A D | 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; member in struct:__anon3608::AutoreleasePoolRewriter::PoolVarInfo
|
| H A D | TransProtectedScope.cpp | 27 SmallVectorImpl<DeclRefExpr *> &Refs; member in class:__anon3614::LocalRefsCollector
31 : Refs(refs) { }
36 Refs.push_back(E);
|
| H A D | Transforms.cpp | 221 ExprSet &Refs; member in class:__anon3621::ReferenceClear
223 ReferenceClear(ExprSet &refs) : Refs(refs) { }
224 bool VisitDeclRefExpr(DeclRefExpr *E) { Refs.erase(E); return true; }
229 ExprSet &Refs; member in class:__anon3621::ReferenceCollector
233 : Dcl(D), Refs(refs) { }
237 Refs.insert(E);
|
| /freebsd-11.0-release/contrib/llvm/lib/CodeGen/ |
| H A D | ExecutionDepsFix.cpp | 57 unsigned Refs; member in struct:__anon2455::DomainValue
104 DomainValue() : Refs(0) { clear(); }
182 if (DV) ++DV->Refs;
223 assert(dv->Refs == 0 && "Reference count wasn't cleared");
232 assert(DV->Refs && "Bad DomainValue");
233 if (--DV->Refs)
322 if (LiveRegs && dv->Refs > 1)
|
| /freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/ |
| H A D | HexagonRDFOpt.cpp | 134 NodeList Refs = IA.Addr->members(getDFG()); local
135 for (NodeAddr<RefNode*> RA : Refs)
140 for (NodeAddr<RefNode*> RA : Refs) {
|
| H A D | RDFGraph.cpp | 1050 NodeList Refs; local
1053 Refs.push_back(RA);
1056 return Refs;
1255 auto &Refs = RefM[BA.Id]; local
1263 Refs.insert(SRs.begin(), SRs.end());
1268 Refs.insert(RA.Addr->getRegRef());
1310 RegisterSet &Refs = RefM[BA.Id]; local
1314 Refs.insert(Rs.begin(), Rs.end());
1333 // First, remove all R in Refs in such that there exists T in Refs
1448 NodeList Refs = PA.Addr->members(*this); local
[all...] |
| /freebsd-11.0-release/contrib/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1239 SmallVector<IntervalMapImpl::NodeRef, 4> Refs, NextRefs;
1243 Refs.push_back(rootBranch().subtree(i));
1247 for (unsigned i = 0, e = Refs.size(); i != e; ++i) {
1248 for (unsigned j = 0, s = Refs[i].size(); j != s; ++j)
1249 NextRefs.push_back(Refs[i].subtree(j));
1250 (this->*f)(Refs[i], h);
1252 Refs.clear();
1253 Refs.swap(NextRefs);
1257 for (unsigned i = 0, e = Refs.size(); i != e; ++i)
1258 (this->*f)(Refs[
[all...] |
Completed in 96 milliseconds