lib/Analysis/ThreadSafety.cpp

88   void push_back_nodup(const CapabilityExpr &CapE) {
91       return CapE.equals(CapE2);
94       push_back(CapE);
217   bool removeLock(FactManager& FM, const CapabilityExpr &CapE) {
223       if (FM[FactIDs[i]].matches(CapE)) {
229     if (FM[FactIDs[n-1]].matches(CapE)) {
236   iterator findLockIter(FactManager &FM, const CapabilityExpr &CapE) {
238       return FM[ID].matches(CapE);
242   const FactEntry *findLock(FactManager &FM, const CapabilityExpr &CapE) const {
244       return FM[ID].matches(CapE);
250                                 const CapabilityExpr &CapE) const {
252       return FM[ID].matchesUniv(CapE);
258                                     const CapabilityExpr &CapE) const {
260       return FM[ID].partiallyMatches(CapE);
1028   bool inCurrentScope(const CapabilityExpr &CapE);
1032   void removeLock(FactSet &FSet, const CapabilityExpr &CapE,
1267 bool ThreadSafetyAnalyzer::inCurrentScope(const CapabilityExpr &CapE) {
1268   const threadSafety::til::SExpr *SExp = CapE.sexpr();