isci/scil/sci_abstract_list.c

96  *            utilized as the repository of free elements for list usage.
113  *    the free pool from which the elements will be extracted
115  *    the array of list elements to be added to the free list
117  *    the count of the elements to be added to the free list these should be
118  *    the same as the array size of list elements
133    pool->elements     = list_elements;
136    // Loop through all of the elements in the array and push them onto the
161    return (list_p)->elements.front_p;
173       ( ( (list_p)->elements.front_p ) ? ((list_p)->elements.front_p->object_p) : NULL );
185       ( ( (list_p)->elements.back_p ) ? ((list_p)->elements.back_p->object_p) : NULL );
195    return ( (list_p)->elements.front_p == NULL );
200  * This method will return the number of elements queued in the list.
206    return ( (list_p)->elements.size );
229    SCI_ABSTRACT_ELEMENT_T * alElement_p = list_p->elements.front_p;
257       sci_abstract_list_get_object(private_find(&(list_p)->elements, (obj_p)));
270    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;
303                               private_pop_front(&(list_p)->elements);
326    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;
359    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;
394    private_push_front(&(list_p)->elements, alElement_p);
408    SCI_ABSTRACT_ELEMENT_LIST_T * elem_list = &(list_p)->elements;
423       private_push_front(&(list_p)->elements, objToAdd_element);
444    while ((list_p)->elements.size > 0)
465  * This method is simply a wrapper to provide the number of elements in
568  * of free list elements.
582  * list elements.