Lines Matching refs:arr

66         const auto& arr = implicit_layers_;
67 if (arr.result != VK_SUCCESS)
68 return arr.result;
71 if (!arr.count)
74 names_ = AllocateNameArray(arr.count + count);
79 for (uint32_t i = 0; i < arr.count; i++)
82 name_count_ = arr.count;
126 auto& arr = implicit_layers_;
127 std::sort(arr.elements, arr.elements + arr.count,
186 auto& arr = implicit_layers_;
187 auto& layer = arr.elements[arr.count++];
192 ALOGV("Added implicit layer %s", GetImplicitLayerName(arr.count - 1));
200 auto& arr = implicit_layers_;
201 size_t offset = arr.pool_size;
202 char* dst = arr.name_pool + offset;
207 arr.pool_size += len + 1;
216 auto& arr = implicit_layers_;
219 while (arr.count + layer_count > arr.max_count) {
221 (arr.max_count) ? (arr.max_count << 1) : initial_max_count;
224 if (new_max_count > arr.max_count) {
226 allocator_.pUserData, arr.elements,
232 arr.result = VK_ERROR_OUT_OF_HOST_MEMORY;
233 arr.count = 0;
237 arr.elements = reinterpret_cast<ImplicitLayer*>(new_mem);
238 arr.max_count = new_max_count;
242 while (arr.pool_size + name_size > arr.max_pool_size) {
243 size_t new_max_pool_size = (arr.max_pool_size)
244 ? (arr.max_pool_size << 1)
248 if (new_max_pool_size > arr.max_pool_size) {
250 allocator_.pUserData, arr.name_pool, new_max_pool_size,
255 arr.result = VK_ERROR_OUT_OF_HOST_MEMORY;
256 arr.pool_size = 0;
260 arr.name_pool = reinterpret_cast<char*>(new_mem);
261 arr.max_pool_size = new_max_pool_size;
268 const auto& arr = implicit_layers_;
270 // this may return nullptr when arr.result is not VK_SUCCESS
271 return implicit_layers_.name_pool + arr.elements[index].name_offset;
275 const auto& arr = implicit_layers_;
277 for (uint32_t i = 0; i < arr.count; i++) {