Home
last modified time | relevance | path

Searched defs:CheckAvailable (Results 1 – 4 of 4) sorted by relevance

/aosp_15_r20/external/google-breakpad/src/common/
H A Dbyte_cursor.h239 bool CheckAvailable(size_t size) { in CheckAvailable() function
/aosp_15_r20/external/llvm/lib/Analysis/
H A DScalarEvolution.cpp4068 struct CheckAvailable { in IsAvailableOnEntry() struct
4069 bool TraversalDone = false; in IsAvailableOnEntry()
4070 bool Available = true; in IsAvailableOnEntry()
4072 const Loop *L = nullptr; // The loop BB is in (can be nullptr) in IsAvailableOnEntry()
4073 BasicBlock *BB = nullptr; in IsAvailableOnEntry()
4074 DominatorTree &DT; in IsAvailableOnEntry()
4076 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() argument
4079 bool setUnavailable() { in IsAvailableOnEntry()
4085 bool follow(const SCEV *S) { in IsAvailableOnEntry()
4127 bool isDone() { return TraversalDone; } in IsAvailableOnEntry()
/aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DScalarEvolution.cpp5177 struct CheckAvailable { in IsAvailableOnEntry() struct
5178 bool TraversalDone = false; in IsAvailableOnEntry()
5179 bool Available = true; in IsAvailableOnEntry()
5181 const Loop *L = nullptr; // The loop BB is in (can be nullptr) in IsAvailableOnEntry()
5182 BasicBlock *BB = nullptr; in IsAvailableOnEntry()
5183 DominatorTree &DT; in IsAvailableOnEntry()
5185 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() function
5188 bool setUnavailable() { in IsAvailableOnEntry()
5194 bool follow(const SCEV *S) { in IsAvailableOnEntry()
5238 bool isDone() { return TraversalDone; } in IsAvailableOnEntry()
/aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/
H A DScalarEvolution.cpp5910 struct CheckAvailable { in IsAvailableOnEntry() struct
5911 bool TraversalDone = false; in IsAvailableOnEntry()
5912 bool Available = true; in IsAvailableOnEntry()
5914 const Loop *L = nullptr; // The loop BB is in (can be nullptr) in IsAvailableOnEntry()
5915 BasicBlock *BB = nullptr; in IsAvailableOnEntry()
5916 DominatorTree &DT; in IsAvailableOnEntry()
5918 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() argument
5921 bool setUnavailable() { in IsAvailableOnEntry()
5927 bool follow(const SCEV *S) { in IsAvailableOnEntry()
5979 bool isDone() { return TraversalDone; } in IsAvailableOnEntry()