isci/scil/sci_abstract_list.h

135  *        elements added and removed from it.
150     * This field depicts the number of elements in this list.
163  * @brief This structure provides the pool of free abstract elements to be
169     * Pointer to an array of elements to be managed by this pool.  This
170     * array acts as the memory store for the elements in the free pool or
173    SCI_ABSTRACT_ELEMENT_T * elements;
176     * This field contains the maximum number of free elements for the pool.
182     * Pointer to the list of free elements that can be allocated from
194  *        an element pool from which to draw free elements.
199     * This represents the elements currently managed by the list.
201    SCI_ABSTRACT_ELEMENT_LIST_T  elements;
204     * This field contains elements that are currently available for
205     * allocation into the list of elements;
273  * This method will return the number of elements queued in the list.
387  * This method is simply a wrapper to provide the number of elements in
439  * of free list elements.
449  * list elements.
471 ((list_p)->elements.front_p)
480 ( ( (list_p)->elements.front_p ) ? ((list_p)->elements.front_p->object_p) : NULL )
489 ( ( (list_p)->elements.back_p ) ? ((list_p)->elements.back_p->object_p) : NULL )
497 ( (list_p)->elements.front_p == NULL )
500  * This method will return the number of elements queued in the list.
505 ( (list_p)->elements.size )
522    SCI_ABSTRACT_ELEMENT_T * alElement_p = list_p->elements.front_p;            \
546    sci_abstract_list_get_object(private_find(&(list_p)->elements, (obj_p)));   \
558    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;              \
591                               private_pop_front(&(list_p)->elements);          \
612    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;              \
644    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;              \
677    private_push_front(&(list_p)->elements, alElement_p);                       \
690    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;              \
705       private_push_front(&(list_p)->elements, objToAdd_element);               \
726    while ((list_p)->elements.size > 0)                                         \
746  * This method is simply a wrapper to provide the number of elements in
844  * of free list elements.
858  * list elements.