Searched refs:CheckAvailable (Results 1 – 4 of 4) sorted by relevance
/external/google-breakpad/src/common/ |
D | byte_cursor.h | 120 if (CheckAvailable(size)) { in Read() 158 if (CheckAvailable(size)) { in Read() 197 if (CheckAvailable(limit)) { in CString() 217 if (CheckAvailable(size)) { 230 if (CheckAvailable(size)) in Skip() 239 bool CheckAvailable(size_t size) { in CheckAvailable() function
|
/external/llvm/lib/Analysis/ |
D | ScalarEvolution.cpp | 4068 struct CheckAvailable { in IsAvailableOnEntry() struct 4076 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() function 4130 CheckAvailable CA(L, BB, DT); in IsAvailableOnEntry() 4131 SCEVTraversal<CheckAvailable> ST(CA); in IsAvailableOnEntry()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | ScalarEvolution.cpp | 5177 struct CheckAvailable { in IsAvailableOnEntry() struct 5185 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() function 5241 CheckAvailable CA(L, BB, DT); in IsAvailableOnEntry() 5242 SCEVTraversal<CheckAvailable> ST(CA); in IsAvailableOnEntry()
|
/external/llvm-project/llvm/lib/Analysis/ |
D | ScalarEvolution.cpp | 5242 struct CheckAvailable { in IsAvailableOnEntry() struct 5250 CheckAvailable(const Loop *L, BasicBlock *BB, DominatorTree &DT) in IsAvailableOnEntry() argument 5313 CheckAvailable CA(L, BB, DT); in IsAvailableOnEntry() 5314 SCEVTraversal<CheckAvailable> ST(CA); in IsAvailableOnEntry()
|