2025   std::pair<FileID, unsigned> LOffs = getDecomposedLoc(LHS);  in isBeforeInTranslationUnit()  local
2031   if (LOffs.first.isInvalid() || ROffs.first.isInvalid())  in isBeforeInTranslationUnit()
2032     return LOffs.first.isInvalid() && !ROffs.first.isInvalid();  in isBeforeInTranslationUnit()
2035   if (LOffs.first == ROffs.first)  in isBeforeInTranslationUnit()
2036     return LOffs.second < ROffs.second;  in isBeforeInTranslationUnit()
2041     getInBeforeInTUCache(LOffs.first, ROffs.first);  in isBeforeInTranslationUnit()
2045   if (IsBeforeInTUCache.isCacheValid(LOffs.first, ROffs.first))  in isBeforeInTranslationUnit()
2046     return IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second);  in isBeforeInTranslationUnit()
2049   IsBeforeInTUCache.setQueryFIDs(LOffs.first, ROffs.first,  in isBeforeInTranslationUnit()
2050                           /*isLFIDBeforeRFID=*/LOffs.first.ID < ROffs.first.ID);  in isBeforeInTranslationUnit()
2060     LChain.insert(LOffs);  in isBeforeInTranslationUnit()
2063   } while (LOffs.first != ROffs.first && !MoveUpIncludeHierarchy(LOffs, *this));  in isBeforeInTranslationUnit()
2070     LOffs = *I;  in isBeforeInTranslationUnit()
2074   if (LOffs.first == ROffs.first) {  in isBeforeInTranslationUnit()
2075     IsBeforeInTUCache.setCommonLoc(LOffs.first, LOffs.second, ROffs.second);  in isBeforeInTranslationUnit()
2076     return IsBeforeInTUCache.getCachedResult(LOffs.second, ROffs.second);  in isBeforeInTranslationUnit()
2084   llvm::MemoryBuffer *LBuf = getBuffer(LOffs.first);  in isBeforeInTranslationUnit()
2094     return LOffs.first < ROffs.first;  in isBeforeInTranslationUnit()
2102     assert(LOffs.first == ROffs.first);  in isBeforeInTranslationUnit()