Lines Matching defs:list

191 /* There is currently no soft context for destination list management.      */
208 /* There is currently no soft context for destination list management. */
238 /* There is currently no such thing as searching a destination list for an */
350 /* list or node on a destination list to be returned as a user process */
351 /* iterates through the list of destination lists or nodes. */
469 /* Add a new node to a destination list. To do this, we only copy in the */
712 /* Parameters: softd(I) - pointer to the destination list context */
713 /* d(I) - pointer to destination list */
822 /* Add a new destination table to the list of those available for the given */
824 /* they are just kept in a simple linked list. */
881 /* Find a named destinstion list table and delete it. If there are other */
913 /* softd(I) - pointer to the destination list context */
914 /* d(I) - pointer to destination list */
916 /* Remove a given destination list from existance. While the IPDST_DELETE */
952 /* Parameters: softd(I) - pointer to the destination list context */
953 /* d(I) - pointer to destination list */
955 /* Free up a destination list data structure and any other memory that was */
956 /* directly allocated as part of creating it. Individual destination list */
958 /* the destination list. */
987 /* Drops the reference count on a destination list table object and free's */
1011 /* Parameters: softd(I) - pointer to the destination list context */
1012 /* dst(I) - pointer to destination list */
1095 /* d(I) - pointer to destination list */
1097 /* Find the next node in the destination list to be used according to the */
1314 /* in a destination list. */
1323 ippool_dst_t *list;
1328 for (list = softd->dstlist[i]; list != NULL;
1329 list = list->ipld_next) {
1330 for (j = 0; j < list->ipld_maxnodes; j++) {
1331 node = list->ipld_dests[j];