Lines Matching +full:sub +full:- +full:components

3  * Copyright (c) 2002-2005 Mellanox Technologies LTD. All rights reserved.
4  * Copyright (c) 1996-2003 Intel Corporation. All rights reserved.
16  *      - Redistributions of source code must retain the above
20  *      - Redistributions in binary form must reproduce the above
40  *	that is made of multiple sub objects.
63 *	The Composite Pool provides a self-contained and self-sustaining pool of
67 *	sub-objects, each of which needs to be treated separately for
135 *	to chain components to form a composite object and perform any necessary
138 *	causes the initiating function to fail.  Any non-CL_SUCCESS status will
141 *	All memory for the requested number of components is pre-allocated.
269 	/* CL_ASSERT that a non-null pointer is provided. */  in cl_is_cpool_inited()
271 	return (cl_is_qcpool_inited(&p_pool->qcpool));  in cl_is_cpool_inited()
333 *		in order, the sizes of the components that make up a composite object.
336 *		[in] Number of components that make up a composite object.
362 *	the maximum size is non-zero and less than the minimum size.
391 	cl_qcpool_destroy(&p_pool->qcpool);  in cl_cpool_destroy()
430 	return (cl_qcpool_count(&p_pool->qcpool));  in cl_cpool_count()
463 	p_pool_obj = (cl_pool_obj_t *) cl_qcpool_get(&p_pool->qcpool);  in cl_cpool_get()
467 	CL_ASSERT(p_pool_obj->p_object);  in cl_cpool_get()
468 	return ((void *)p_pool_obj->p_object);  in cl_cpool_get()
511 	    (((uint8_t *) p_object) - sizeof(cl_pool_obj_t));  in cl_cpool_put()
514 	CL_ASSERT(p_pool_obj->p_object == p_object);  in cl_cpool_put()
516 	cl_qcpool_put(&p_pool->qcpool, &p_pool_obj->pool_item);  in cl_cpool_put()
555 	return (cl_qcpool_grow(&p_pool->qcpool, obj_count));  in cl_cpool_grow()