Lines Matching refs:n
139 struct notice *nprev, *n;
153 n = (struct notice *)xmalloc(sizeof (struct notice));
154 n->time = LB;
155 n->isdummy = TRUE;
156 n->left = NULL;
157 nprev = n;
162 k->notice = n;
166 n->key = k;
173 n = (struct notice *)xmalloc(sizeof (struct notice));
174 n->time = t;
175 n->isdummy = TRUE;
176 n->left = nprev;
177 nprev->right = n;
178 nprev = n;
182 k->notice = n;
186 n->key = k;
195 n = (struct notice *)xmalloc(sizeof (struct notice));
196 n->time = INFINITY;
197 n->isdummy = TRUE;
198 n->left = nprev;
199 n->right = NULL;
200 nprev->right = n;
205 k->notice = n;
209 n->key = k;
237 struct notice *n, *n2;
252 n = (struct notice *)xmalloc(sizeof (struct notice));
253 n->time = time;
254 n->id = id;
255 n->event = event;
256 n->isdummy = FALSE;
257 n->key = NULL;
288 * the new notice n is ready to be inserted
294 n->right = n2->right;
295 n->left = n2;
296 (n2->right)->left = n;
297 n2->right = n;
300 current = n;
313 * remove finds notices n that need to be removed by traversing thru
314 * the notice list. if n is the sole element of a sublist, the
316 * n's sublist, if that is possible. after these checks, n is removed.
319 struct notice *n, *n2;
325 n = current;
326 while (n != NULL) {
327 while ((n != NULL) && ((n->isdummy) || (n->id != id)))
328 n = n->right;
329 if (n != NULL) {
330 /* n should be deleted */
331 if ((n->key != NULL) && ((n->key)->numnote == 1)) {
332 /* n = sole element of a sublist */
333 k = n->key;
337 } else { if (n->key != NULL) {
338 /* n has a key pointing to it */
339 (n->left)->key = n->key;
340 (n->key)->time = (n->left)->time;
341 (n->key)->notice = n->left; }
343 n2 = n;
371 /* delete n, then advance n down the list */
372 (n->left)->right = n->right;
373 (n->right)->left = n->left;
374 n2 = n->right;
375 free(n);
376 n = n2;
383 n = (k->notice)->right;
384 while ((n != NULL) && (n->isdummy)) n = n->right;
385 current = n;
406 struct notice *n, *fn;
444 n = (k->notice)->left;
446 while (n->time >= next_int) {
448 n = n->left; }
449 n = n->right;
451 * n points to first notice of the new overflow interval
468 fn->left = n->left;
469 fn->right = n;
470 (n->left)->right = fn;
471 n->left = fn; }
477 n = current;
478 while (n->key == NULL) n = n->right;
479 k = n->key;
508 struct notice *n, *n2;
515 n = k->notice;
516 while (n != NULL) {
517 n2 = n->right;
518 free(n);
519 n = n2; }