libkern/kxld/kxld_array.c

68     /* If the array has some pools, we need to see if there is enough space in
69      * those pools to accomodate the requested size array.  If there isn't
70      * enough space, we save the existing pools to a temporary STAILQ and zero
72      * to be created, and we then copy the data from the old pools into the new
79         STAILQ_FOREACH(srcpool, &array->pools, entries) {
83         /* If there's not enough space, save the pools to a temporary STAILQ
84          * and zero out the array structure.  Otherwise, rescan the pools to
88             STAILQ_FOREACH_SAFE(srcpool, &array->pools, entries, tmp) {
89                 STAILQ_REMOVE(&array->pools, srcpool, kxld_array_pool, entries);
106      * pools into the new pool.
113         dstpool = STAILQ_FIRST(&array->pools);
148     pool = STAILQ_FIRST(&array->pools);
159         STAILQ_INSERT_HEAD(&array->pools, pool, entries);
234     dstpool = STAILQ_FIRST(&dstarray->pools);
237     /* Copy the data from the source pools to the single destination pool. */
238     STAILQ_FOREACH(srcpool, &srcarray->pools, entries) {
257         STAILQ_FOREACH(pool, &array->pools, entries) {
273         STAILQ_FOREACH(pool, &array->pools, entries) {
287         STAILQ_FOREACH_SAFE(pool, &array->pools, entries, tmp) {
288             STAILQ_REMOVE(&array->pools, pool, kxld_array_pool, entries);
307     STAILQ_FOREACH(pool, &array->pools, entries) {
332     STAILQ_FOREACH(pool, &array->pools, entries) {
363     STAILQ_FOREACH(pool, &array->pools, entries) {
391     /* Grow the list of pools until we have enough to fit all of the entries */
397         STAILQ_INSERT_TAIL(&array->pools, pool, entries);
425     STAILQ_FOREACH(pool, &array->pools, entries) {
463     pool = STAILQ_FIRST(&array->pools);