Lines Matching defs:p_vector
50 void cl_ptr_vector_construct(IN cl_ptr_vector_t * const p_vector)
52 CL_ASSERT(p_vector);
54 memset(p_vector, 0, sizeof(cl_ptr_vector_t));
56 p_vector->state = CL_UNINITIALIZED;
59 cl_status_t cl_ptr_vector_init(IN cl_ptr_vector_t * const p_vector,
65 CL_ASSERT(p_vector);
67 cl_ptr_vector_construct(p_vector);
69 p_vector->grow_size = grow_size;
75 p_vector->state = CL_INITIALIZED;
79 status = cl_ptr_vector_set_size(p_vector, min_size);
81 cl_ptr_vector_destroy(p_vector);
87 void cl_ptr_vector_destroy(IN cl_ptr_vector_t * const p_vector)
89 CL_ASSERT(p_vector);
90 CL_ASSERT(cl_is_state_valid(p_vector->state));
93 if (p_vector->state == CL_INITIALIZED) {
95 if (p_vector->p_ptr_array) {
96 free((void *)p_vector->p_ptr_array);
97 p_vector->p_ptr_array = NULL;
101 p_vector->state = CL_UNINITIALIZED;
104 cl_status_t cl_ptr_vector_at(IN const cl_ptr_vector_t * const p_vector,
107 CL_ASSERT(p_vector);
108 CL_ASSERT(p_vector->state == CL_INITIALIZED);
111 if (index >= p_vector->size)
114 *p_element = cl_ptr_vector_get(p_vector, index);
118 cl_status_t cl_ptr_vector_set(IN cl_ptr_vector_t * const p_vector,
124 CL_ASSERT(p_vector);
125 CL_ASSERT(p_vector->state == CL_INITIALIZED);
128 if (index >= p_vector->size) {
130 status = cl_ptr_vector_set_size(p_vector, index + 1);
133 if ((status != CL_SUCCESS) && (p_vector->size < index))
138 p_vector->p_ptr_array[index] = element;
143 void *cl_ptr_vector_remove(IN cl_ptr_vector_t * const p_vector,
149 CL_ASSERT(p_vector);
150 CL_ASSERT(p_vector->state == CL_INITIALIZED);
151 CL_ASSERT(p_vector->size > index);
154 element = p_vector->p_ptr_array[index];
156 if (index < --p_vector->size) {
157 for (src = index; src < p_vector->size; src++)
158 p_vector->p_ptr_array[src] =
159 p_vector->p_ptr_array[src + 1];
162 p_vector->p_ptr_array[p_vector->size] = NULL;
167 cl_status_t cl_ptr_vector_set_capacity(IN cl_ptr_vector_t * const p_vector,
172 CL_ASSERT(p_vector);
173 CL_ASSERT(p_vector->state == CL_INITIALIZED);
176 if (new_capacity <= p_vector->capacity) {
188 if (p_vector->p_ptr_array) {
190 memcpy(p_new_ptr_array, p_vector->p_ptr_array,
191 p_vector->capacity * sizeof(void *));
194 free((void *)p_vector->p_ptr_array);
198 p_vector->p_ptr_array = p_new_ptr_array;
201 p_vector->capacity = new_capacity;
206 cl_status_t cl_ptr_vector_set_size(IN cl_ptr_vector_t * const p_vector,
212 CL_ASSERT(p_vector);
213 CL_ASSERT(p_vector->state == CL_INITIALIZED);
216 if (size == p_vector->size)
220 if (size >= p_vector->capacity) {
221 if (!p_vector->grow_size)
226 if (size % p_vector->grow_size) {
228 new_capacity += p_vector->grow_size -
229 (size % p_vector->grow_size);
232 status = cl_ptr_vector_set_capacity(p_vector, new_capacity);
237 p_vector->size = size;
241 cl_status_t cl_ptr_vector_set_min_size(IN cl_ptr_vector_t * const p_vector,
244 CL_ASSERT(p_vector);
245 CL_ASSERT(p_vector->state == CL_INITIALIZED);
247 if (min_size > p_vector->size) {
249 return (cl_ptr_vector_set_size(p_vector, min_size));
256 void cl_ptr_vector_apply_func(IN const cl_ptr_vector_t * const p_vector,
262 CL_ASSERT(p_vector);
263 CL_ASSERT(p_vector->state == CL_INITIALIZED);
266 for (i = 0; i < p_vector->size; i++)
267 pfn_callback(i, (void *)p_vector->p_ptr_array[i],
271 size_t cl_ptr_vector_find_from_start(IN const cl_ptr_vector_t * const p_vector,
277 CL_ASSERT(p_vector);
278 CL_ASSERT(p_vector->state == CL_INITIALIZED);
281 for (i = 0; i < p_vector->size; i++) {
283 if (pfn_callback(i, (void *)p_vector->p_ptr_array[i],
291 size_t cl_ptr_vector_find_from_end(IN const cl_ptr_vector_t * const p_vector,
297 CL_ASSERT(p_vector);
298 CL_ASSERT(p_vector->state == CL_INITIALIZED);
301 i = p_vector->size;
306 if (pfn_callback(i, (void *)p_vector->p_ptr_array[i],
312 return (p_vector->size);