| /external/llvm/lib/Support/ |
| SmallPtrSet.cpp | 25 free(CurArray);
33 CurArray = (const void**)malloc(sizeof(void*) * CurArraySize);
34 assert(CurArray && "Failed to allocate memory?");
35 memset(CurArray, -1, CurArraySize*sizeof(void*));
66 for (const void **APtr = CurArray, **E = CurArray + NumNonEmpty; APtr != E;
92 const void *const *Array = CurArray;
118 const void **OldBuckets = CurArray;
123 CurArray = (const void**)malloc(sizeof(void*) * NewSize);
124 assert(CurArray && "Failed to allocate memory?")
[all...] |
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| SmallPtrSet.cpp | 26 free(CurArray);
34 CurArray = (const void**)malloc(sizeof(void*) * CurArraySize);
35 assert(CurArray && "Failed to allocate memory?");
36 memset(CurArray, -1, CurArraySize*sizeof(void*));
67 for (const void **APtr = CurArray, **E = CurArray + NumNonEmpty; APtr != E;
93 const void *const *Array = CurArray;
119 const void **OldBuckets = CurArray;
124 CurArray = (const void**)malloc(sizeof(void*) * NewSize);
125 assert(CurArray && "Failed to allocate memory?")
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| SmallPtrSet.cpp | 23 free(CurArray);
30 CurArray = (const void**)malloc(sizeof(void*) * (CurArraySize+1));
31 assert(CurArray && "Failed to allocate memory?");
32 memset(CurArray, -1, CurArraySize*sizeof(void*));
36 CurArray[CurArraySize] = 0;
107 const void *const *Array = CurArray;
136 const void **OldBuckets = CurArray;
140 CurArray = (const void**)malloc(sizeof(void*) * (NewSize+1));
141 assert(CurArray && "Failed to allocate memory?");
143 memset(CurArray, -1, NewSize*sizeof(void*))
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| SmallPtrSet.h | 52 /// CurArray - This is the current set of buckets. If equal to SmallArray,
54 const void **CurArray;
55 /// CurArraySize - The allocated size of CurArray, always a power of two.
56 /// Note that CurArray points to an array that has CurArraySize+1 elements in
67 SmallArray(SmallStorage), CurArray(SmallStorage), CurArraySize(SmallSize) {
72 CurArray[SmallSize] = 0;
88 memset(CurArray, -1, CurArraySize*sizeof(void*));
127 bool isSmall() const { return CurArray == SmallArray; }
276 return iterator(CurArray);
279 return iterator(CurArray+CurArraySize)
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 56 /// CurArray - This is the current set of buckets. If equal to SmallArray,
58 const void **CurArray;
59 /// CurArraySize - The allocated size of CurArray, always a power of two.
62 /// Number of elements in CurArray that contain a value or are a tombstone.
63 /// If small, all these elements are at the beginning of CurArray and the rest
66 /// Number of tombstones in CurArray.
75 : SmallArray(SmallStorage), CurArray(SmallStorage),
82 free(CurArray);
97 memset(CurArray, -1, CurArraySize * sizeof(void *));
113 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| SmallPtrSet.h | 62 /// CurArray - This is the current set of buckets. If equal to SmallArray,
64 const void **CurArray;
65 /// CurArraySize - The allocated size of CurArray, always a power of two.
68 /// Number of elements in CurArray that contain a value or are a tombstone.
69 /// If small, all these elements are at the beginning of CurArray and the rest
72 /// Number of tombstones in CurArray.
82 : SmallArray(SmallStorage), CurArray(SmallStorage),
90 free(CurArray);
108 memset(CurArray, -1, CurArraySize * sizeof(void *));
125 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 63 /// CurArray - This is the current set of buckets. If equal to SmallArray,
65 const void **CurArray;
66 /// CurArraySize - The allocated size of CurArray, always a power of two.
69 /// Number of elements in CurArray that contain a value or are a tombstone.
70 /// If small, all these elements are at the beginning of CurArray and the rest
73 /// Number of tombstones in CurArray.
83 : SmallArray(SmallStorage), CurArray(SmallStorage),
91 free(CurArray);
109 memset(CurArray, -1, CurArraySize * sizeof(void *));
126 return isSmall() ? CurArray + NumNonEmpty : CurArray + CurArraySize
[all...] |
