restore jobq node recycler
Haldean Brown
5 years ago
126 | 126 | |
127 | 127 | elem = n->elem; |
128 | 128 | |
129 | /* | |
130 | 129 | n->elem = NULL; |
130 | n->left = NULL; | |
131 | 131 | n->right = sq->recycle; |
132 | 132 | sq->recycle = n; |
133 | */ | |
134 | free(n); | |
135 | 133 | |
136 | 134 | return elem; |
137 | 135 | } |
144 | 142 | n = *head; |
145 | 143 | while (n != NULL) |
146 | 144 | { |
147 | *head = n->left; | |
145 | *head = n->right; | |
148 | 146 | free(n); |
149 | 147 | n = *head; |
150 | 148 | } |
159 | 157 | for (i = 0; i < q->n_queues; i++) |
160 | 158 | { |
161 | 159 | sq = q->qs + i; |
162 | free_ll(&sq->head); | |
160 | free_ll(&sq->tail); | |
163 | 161 | free_ll(&sq->recycle); |
164 | 162 | } |
165 | free_ll(&q->global_head); | |
163 | free_ll(&q->global_tail); | |
166 | 164 | free(q->qs); |
167 | 165 | } |
168 | 166 |