Lines Matching defs:tmp
59 sack_blk_t tmp[MAX_SACK_BLK - 1];
78 * Use tmp to hold old SACK blks. After the loop, copy them back
90 tmp[j].begin = head[i].begin;
91 tmp[j].end = head[i].end;
113 * copies the original SACK blk into the tmp storage. Other
115 * tmp storage.
123 head[i+1].begin = tmp[i].begin;
124 head[i+1].end = tmp[i].end;
141 sack_blk_t tmp[MAX_SACK_BLK];
150 /* Walk thru the whole list and copy the new list to tmp[]. */
164 tmp[j].begin = end;
165 tmp[j].end = head[i].end;
168 tmp[j].begin = head[i].begin;
169 tmp[j].end = head[i].end;
173 /* Copy tmp[] back to the original list. */
175 head[i].begin = tmp[i].begin;
176 head[i].end = tmp[i].end;
201 notsack_blk_t *prev, *tmp, *new;
208 tmp = *head;
211 while ((tmp != NULL) && SEQ_LEQ(tmp->end, begin)) {
212 prev = tmp;
213 (tmp->sack_cnt)++;
214 tmp = tmp->next;
221 if (tmp == NULL) {
229 if (SEQ_LEQ(end, tmp->begin)) {
234 if (SEQ_LEQ(end, tmp->end)) {
239 if (end == tmp->end && SEQ_LEQ(begin, tmp->begin)) {
241 prev->next = tmp->next;
243 *head = tmp->next;
246 *sum -= tmp->end - tmp->begin;
247 bkmem_free(tmp, sizeof (notsack_blk_t));
251 if (SEQ_GEQ(begin, tmp->begin)) {
253 if (begin == tmp->begin) {
254 *sum -= end - tmp->begin;
255 tmp->begin = end;
256 } else if (end == tmp->end) {
257 *sum -= tmp->end - begin;
258 tmp->end = begin;
259 (tmp->sack_cnt)++;
266 new->end = tmp->end;
268 new->next = tmp->next;
270 tmp->end = begin;
271 tmp->next = new;
272 (tmp->sack_cnt)++;
277 *sum -= end - tmp->begin;
278 tmp->begin = end;
286 if (SEQ_LT(tmp->begin, begin)) {
287 tmp_sum -= tmp->end - begin;
288 tmp->end = begin;
289 (tmp->sack_cnt)++;
290 prev = tmp;
291 tmp = tmp->next;
294 while (tmp != NULL) {
296 if (SEQ_GT(tmp->begin, end)) {
300 if (SEQ_LEQ(tmp->end, end)) {
302 tmp_sum -= tmp->end - tmp->begin;
304 prev->next = tmp->next;
305 bkmem_free((caddr_t)tmp,
307 tmp = prev->next;
309 *head = tmp->next;
310 bkmem_free((caddr_t)tmp,
312 tmp = *head;
319 tmp_sum -= end - tmp->begin;
320 tmp->begin = end;
345 notsack_blk_t *prev, *tmp;
352 tmp = *head;
353 while (tmp != NULL) {
355 if (SEQ_GT(tmp->begin, end)) {
360 if (SEQ_GEQ(end, tmp->end)) {
362 tmp_sum -= tmp->end - tmp->begin;
364 *head = tmp->next;
365 bkmem_free((caddr_t)tmp,
367 tmp = *head;
369 prev->next = tmp->next;
370 bkmem_free((caddr_t)tmp,
372 tmp = tmp->next;
375 tmp_sum -= end - tmp->begin;
376 tmp->begin = end;
401 notsack_blk_t *tmp;
403 tmp = *head;
405 if (tmp == NULL) {
406 if ((tmp = (notsack_blk_t *)bkmem_alloc(
410 tmp->begin = begin;
411 tmp->end = end;
412 tmp->next = NULL;
413 tmp->sack_cnt = 0;
414 *head = tmp;
425 while (tmp->next != NULL) {
426 tmp = tmp->next;
430 if (SEQ_GEQ(tmp->end, begin)) {
431 *sum += end - tmp->end;
432 tmp->end = end;
435 tmp->next = (notsack_blk_t *)bkmem_alloc(
437 if (tmp->next != NULL) {
438 tmp = tmp->next;
439 tmp->begin = begin;
440 tmp->end = end;
441 tmp->next = NULL;
442 tmp->sack_cnt = 0;