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.
64 * The Quick Composite Pool provides a self-contained and self-sustaining
68 * sub-objects, each of which needs to be treated separately for
162 * The pool object structure is used by non-quick pools to store object.
191 * [in] Number of components that in the component array.
214 * to chain components to form a composite object and perform any necessary
217 * and causes the initiating function to fail. Any non-CL_SUCCESS status
220 * All memory for the requested number of components is pre-allocated. Users
221 * should include space in one of their components for the cl_pool_item_t
303 * Number of components per object.
309 * Array of pointers to components, used for the constructor callback.
383 /* CL_ASSERT that a non-null pointer is provided. */ in cl_is_qcpool_inited()
386 CL_ASSERT(cl_is_state_valid(p_pool->state)); in cl_is_qcpool_inited()
388 return (p_pool->state == CL_INITIALIZED); in cl_is_qcpool_inited()
449 * in order, the sizes of the components that make up a composite object.
452 * [in] Number of components that make up a composite object.
479 * the maximum size is non-zero and less than the minimum size.
544 CL_ASSERT(p_pool->state == CL_INITIALIZED); in cl_qcpool_count()
546 return (cl_qlist_count(&p_pool->free_list)); in cl_qcpool_count()
609 CL_ASSERT(p_pool->state == CL_INITIALIZED); in cl_qcpool_put()
612 CL_ASSERT(p_pool_item->p_pool == p_pool); in cl_qcpool_put()
615 cl_qlist_insert_head(&p_pool->free_list, &p_pool_item->list_item); in cl_qcpool_put()
659 CL_ASSERT(p_pool->state == CL_INITIALIZED); in cl_qcpool_put_list()
666 CL_ASSERT(((cl_pool_item_t *) p_item)->p_pool == p_pool); in cl_qcpool_put_list()
672 cl_qlist_insert_list_head(&p_pool->free_list, p_list); in cl_qcpool_put_list()