Lines Matching refs:ROffs
2024 std::pair<FileID, unsigned> ROffs = getDecomposedLoc(RHS);
2029 if (LOffs.first.isInvalid() || ROffs.first.isInvalid())
2030 return LOffs.first.isInvalid() && !ROffs.first.isInvalid();
2032 std::pair<bool, bool> InSameTU = isInTheSameTranslationUnit(LOffs, ROffs);
2040 StringRef RB = getBufferOrFake(ROffs.first).getBufferIdentifier();
2049 return LOffs.first < ROffs.first;
2057 assert(LOffs.first == ROffs.first);
2066 return LOffs.second < ROffs.second;
2073 std::pair<FileID, unsigned> &ROffs) const {
2075 if (LOffs.first == ROffs.first)
2076 return std::make_pair(true, LOffs.second < ROffs.second);
2081 getInBeforeInTUCache(LOffs.first, ROffs.first);
2085 if (IsBeforeInTUCache.isCacheValid(LOffs.first, ROffs.first))
2087 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));
2090 IsBeforeInTUCache.setQueryFIDs(LOffs.first, ROffs.first,
2091 /*isLFIDBeforeRFID=*/LOffs.first.ID < ROffs.first.ID);
2102 // We catch the case where LOffs is in a file included by ROffs and
2104 } while (LOffs.first != ROffs.first && !MoveUpIncludeHierarchy(LOffs, *this));
2106 while((I = LChain.find(ROffs.first)) == LChain.end()) {
2107 if (MoveUpIncludeHierarchy(ROffs, *this))
2115 if (LOffs.first == ROffs.first) {
2116 IsBeforeInTUCache.setCommonLoc(LOffs.first, LOffs.second, ROffs.second);
2118 true, IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second));