gonzui


Format: Advanced Search

SearchGoogle itResults 1 - 1 of 1 for funcall:TAILQ_FOREACH from t2ex/bsd_source/t2ex/network/net/src_bsd/kern/subr_pool.c (0.00 seconds)
t2ex
bsd_source/t2ex/network/net/src_bsd/kern/subr_pool.c - 105.3KB - 3,534 lines
645:         pa->pa_backingmap = map;
646:         TAILQ_FOREACH(pp, &pa->pa_list, pr_alloc_list) {
647:                 pool_reclaim_register(pp);
863: */ 864: TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { 865: if (pp == pp1)
1132: mutex_enter(&pool_head_lock); 1133: TAILQ_FOREACH(pp1, &pool_head, pr_poollist) { 1134: if (strcmp(pp1->pr_wchan, pp->pr_wchan) > 0)
2084: 2085: TAILQ_FOREACH(pp, &pool_head, pr_poollist) { 2086: pool_printit(pp, modif, pr);
2470: mutex_enter(&pool_head_lock); 2471: TAILQ_FOREACH(pc1, &pool_cache_head, pc_cachelist) { 2472: if (strcmp(pc1->pc_pool.pr_wchan, pc->pc_pool.pr_wchan) > 0)
2659: mutex_enter(&pool_head_lock); 2660: TAILQ_FOREACH(pc, &pool_cache_head, pc_cachelist) { 2661: pc->pc_refcnt++;
2682: mutex_enter(&pool_head_lock); 2683: TAILQ_FOREACH(pc2, &pool_cache_head, pc_cachelist) { 2684: if ( pc2 == pc ) {
3455: 3456: TAILQ_FOREACH(pp, &pool_head, pr_poollist) { 3457: struct pool_item_header *ph;