bsd/netinet/ip_dummynet.c

589     int son = h->elements ;
594 	son = h->elements ;
596 	    if (heap_init(h, h->elements+1) )
600 	h->elements++ ;
623     int child, father, maxelt = h->elements - 1 ;
634 	if (father < 0 || father >= h->elements) {
636 		father, h->elements);
650     h->elements-- ;
669     for (i = 0 ; i < h->elements ; i++ )
902     while ( p_numbytes >=0 && (sch->elements>0 || neh->elements >0) ) {
903 	if (sch->elements > 0) { /* have some eligible pkts to send out */
933 	 * now compute V = max(V, min(S_i)). Remember that all elements in sch
938 	if (sch->elements == 0 && neh->elements > 0)
941 	while (neh->elements > 0 && DN_KEY_LEQ(neh->p[0].key, p->V) ) {
952     if (sch->elements == 0 && neh->elements == 0 && p_numbytes >= 0
953 	    && p->idle_heap.elements > 0) {
959 	for (i = 0 ; i < p->idle_heap.elements ; i++) {
967 	p->idle_heap.elements = 0 ;
1035 	while (h->elements > 0 && DN_KEY_LEQ(h->p[0].key, curr_time) ) {
1058 	if (pe->idle_heap.elements > 0 &&
1073 		if (h->elements > 0) { // set the timer
1740 	if (pipe->not_eligible_heap.elements == 0 &&
1741 		pipe->scheduler_heap.elements == 0)
1758 	    if (pipe->scheduler_heap.elements == 0)
1764 		if (pipe->scheduler_heap.elements != 1)
2116 	    x->idle_heap.size = x->idle_heap.elements = 0 ;
2203     for (; i < h->elements ;)
2205 	    h->elements-- ;
2206 	    h->p[i] = h->p[h->elements] ;
2220     if (h->elements > 0) {
2222 	for (i=0; i < h->elements ; i++ ) {
2224 		h->elements-- ;
2225 		h->p[i] = h->p[h->elements] ;
2581 	ready_heap.size = ready_heap.elements = 0 ;
2584 	wfq_ready_heap.size = wfq_ready_heap.elements = 0 ;
2587 	extract_heap.size = extract_heap.elements = 0 ;