opensm/complib/cl_vector.c

184 void cl_vector_construct(IN cl_vector_t * const p_vector)
186 	CL_ASSERT(p_vector);
188 	memset(p_vector, 0, sizeof(cl_vector_t));
190 	p_vector->state = CL_UNINITIALIZED;
194 cl_vector_init(IN cl_vector_t * const p_vector,
204 	CL_ASSERT(p_vector);
207 	cl_vector_construct(p_vector);
209 	p_vector->grow_size = grow_size;
210 	p_vector->element_size = element_size;
211 	p_vector->pfn_init = pfn_init;
212 	p_vector->pfn_dtor = pfn_dtor;
213 	p_vector->context = context;
221 		p_vector->pfn_copy = cl_vector_copy8;
225 		p_vector->pfn_copy = cl_vector_copy16;
229 		p_vector->pfn_copy = cl_vector_copy32;
233 		p_vector->pfn_copy = cl_vector_copy64;
237 		p_vector->pfn_copy = cl_vector_copy_general;
245 	p_vector->state = CL_INITIALIZED;
248 	cl_qlist_init(&p_vector->alloc_list);
252 		status = cl_vector_set_size(p_vector, min_size);
254 			cl_vector_destroy(p_vector);
260 void cl_vector_destroy(IN cl_vector_t * const p_vector)
265 	CL_ASSERT(p_vector);
266 	CL_ASSERT(cl_is_state_valid(p_vector->state));
269 	if (p_vector->state == CL_INITIALIZED) {
270 		if (p_vector->pfn_dtor) {
271 			for (i = 0; i < p_vector->size; i++) {
272 				p_element = p_vector->p_ptr_array[i];
275 				p_vector->pfn_dtor(p_element,
276 						   (void *)p_vector->context);
281 		while (!cl_is_qlist_empty(&p_vector->alloc_list))
282 			free(cl_qlist_remove_head(&p_vector->alloc_list));
285 		if (p_vector->p_ptr_array) {
286 			free(p_vector->p_ptr_array);
287 			p_vector->p_ptr_array = NULL;
291 	p_vector->state = CL_UNINITIALIZED;
295 cl_vector_at(IN const cl_vector_t * const p_vector,
298 	CL_ASSERT(p_vector);
299 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
302 	if (index >= p_vector->size)
305 	cl_vector_get(p_vector, index, p_element);
310 cl_vector_set(IN cl_vector_t * const p_vector,
316 	CL_ASSERT(p_vector);
317 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
321 	if (index >= p_vector->size) {
323 		status = cl_vector_set_size(p_vector, index + 1);
326 		if ((status != CL_SUCCESS) && (p_vector->size < index))
331 	p_dest = cl_vector_get_ptr(p_vector, index);
336 	p_vector->pfn_copy(p_dest, p_element, p_vector->element_size);
342 cl_vector_set_capacity(IN cl_vector_t * const p_vector,
351 	CL_ASSERT(p_vector);
352 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
355 	if (new_capacity <= p_vector->capacity) {
367 	if (p_vector->p_ptr_array) {
369 		memcpy(p_new_ptr_array, p_vector->p_ptr_array,
370 		       p_vector->capacity * sizeof(void *));
373 		free(p_vector->p_ptr_array);
377 	p_vector->p_ptr_array = p_new_ptr_array;
383 	new_elements = new_capacity - p_vector->capacity;
385 	alloc_size = new_elements * p_vector->element_size;
393 	cl_qlist_insert_tail(&p_vector->alloc_list, p_buf);
397 	for (i = p_vector->capacity; i < new_capacity; i++) {
398 		p_vector->p_ptr_array[i] = p_buf;
400 		p_buf = (void *)(((uint8_t *) p_buf) + p_vector->element_size);
404 	p_vector->capacity = new_capacity;
410 cl_vector_set_size(IN cl_vector_t * const p_vector, IN const size_t size)
417 	CL_ASSERT(p_vector);
418 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
421 	if (size == p_vector->size)
425 	if (size >= p_vector->capacity) {
426 		if (!p_vector->grow_size)
431 		if (size % p_vector->grow_size) {
433 			new_capacity += p_vector->grow_size -
434 			    (size % p_vector->grow_size);
437 		status = cl_vector_set_capacity(p_vector, new_capacity);
443 	if (size > p_vector->size && p_vector->pfn_init) {
444 		for (index = p_vector->size; index < size; index++) {
446 			p_element = cl_vector_get_ptr(p_vector, index);
450 			    p_vector->pfn_init(p_element,
451 					       (void *)p_vector->context);
454 				if (p_vector->pfn_dtor)
455 					p_vector->pfn_dtor(p_element,
456 							   (void *)p_vector->
464 			p_vector->size++;
466 	} else if (p_vector->pfn_dtor) {
468 		for (index = size; index < p_vector->size; index++) {
470 			p_element = cl_vector_get_ptr(p_vector, index);
472 			p_vector->pfn_dtor(p_element,
473 					   (void *)p_vector->context);
477 	p_vector->size = size;
482 cl_vector_set_min_size(IN cl_vector_t * const p_vector,
485 	CL_ASSERT(p_vector);
486 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
488 	if (min_size > p_vector->size) {
490 		return (cl_vector_set_size(p_vector, min_size));
498 cl_vector_apply_func(IN const cl_vector_t * const p_vector,
505 	CL_ASSERT(p_vector);
506 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
509 	for (i = 0; i < p_vector->size; i++) {
510 		p_element = cl_vector_get_ptr(p_vector, i);
516 cl_vector_find_from_start(IN const cl_vector_t * const p_vector,
523 	CL_ASSERT(p_vector);
524 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
527 	for (i = 0; i < p_vector->size; i++) {
528 		p_element = cl_vector_get_ptr(p_vector, i);
537 cl_vector_find_from_end(IN const cl_vector_t * const p_vector,
544 	CL_ASSERT(p_vector);
545 	CL_ASSERT(p_vector->state == CL_INITIALIZED);
548 	i = p_vector->size;
552 		p_element = cl_vector_get_ptr(p_vector, --i);
560 	return (p_vector->size);