208   FactID addLock(FactManager &FM, std::unique_ptr<FactEntry> Entry) {  in addLock()  argument
209     FactID F = FM.newFact(std::move(Entry));  in addLock()
214   bool removeLock(FactManager& FM, const CapabilityExpr &CapE) {  in removeLock()  argument
220       if (FM[FactIDs[i]].matches(CapE)) {  in removeLock()
226     if (FM[FactIDs[n-1]].matches(CapE)) {  in removeLock()
233   std::optional<FactID> replaceLock(FactManager &FM, iterator It,  in replaceLock()  argument
237     FactID F = FM.newFact(std::move(Entry));  in replaceLock()
242   std::optional<FactID> replaceLock(FactManager &FM, const CapabilityExpr &CapE,  in replaceLock()  argument
244     return replaceLock(FM, findLockIter(FM, CapE), std::move(Entry));  in replaceLock()
247   iterator findLockIter(FactManager &FM, const CapabilityExpr &CapE) {  in findLockIter()  argument
249                          [&](FactID ID) { return FM[ID].matches(CapE); });  in findLockIter()
252   const FactEntry *findLock(FactManager &FM, const CapabilityExpr &CapE) const {  in findLock()  argument
254         llvm::find_if(*this, [&](FactID ID) { return FM[ID].matches(CapE); });  in findLock()
255     return I != end() ? &FM[*I] : nullptr;  in findLock()
258   const FactEntry *findLockUniv(FactManager &FM,  in findLockUniv()  argument
261         *this, [&](FactID ID) -> bool { return FM[ID].matchesUniv(CapE); });  in findLockUniv()
262     return I != end() ? &FM[*I] : nullptr;  in findLockUniv()
265   const FactEntry *findPartialMatch(FactManager &FM,  in findPartialMatch()  argument
268       return FM[ID].partiallyMatches(CapE);  in findPartialMatch()
270     return I != end() ? &FM[*I] : nullptr;  in findPartialMatch()
273   bool containsMutexDecl(FactManager &FM, const ValueDecl* Vd) const {  in containsMutexDecl()  argument
275         *this, [&](FactID ID) -> bool { return FM[ID].valueDecl() == Vd; });  in containsMutexDecl()