Lines Matching refs:n
140 struct notice *nprev, *n; local
154 n = (struct notice *)xmalloc(sizeof (struct notice));
155 n->time = LB;
156 n->isdummy = TRUE;
157 n->left = NULL;
158 nprev = n;
163 k->notice = n;
167 n->key = k;
174 n = (struct notice *)xmalloc(sizeof (struct notice));
175 n->time = t;
176 n->isdummy = TRUE;
177 n->left = nprev;
178 nprev->right = n;
179 nprev = n;
183 k->notice = n;
187 n->key = k;
196 n = (struct notice *)xmalloc(sizeof (struct notice));
197 n->time = INFINITY;
198 n->isdummy = TRUE;
199 n->left = nprev;
200 n->right = NULL;
201 nprev->right = n;
206 k->notice = n;
210 n->key = k;
238 struct notice *n, *n2; local
253 n = (struct notice *)xmalloc(sizeof (struct notice));
254 n->time = time;
255 n->id = id;
256 n->event = event;
257 n->isdummy = FALSE;
258 n->key = NULL;
295 n->right = n2->right;
296 n->left = n2;
297 (n2->right)->left = n;
298 n2->right = n;
301 current = n;
320 struct notice *n, *n2; local
326 n = current;
327 while (n != NULL) {
328 while ((n != NULL) && ((n->isdummy) || (n->id != id)))
329 n = n->right;
330 if (n != NULL) {
332 if ((n->key != NULL) && ((n->key)->numnote == 1)) {
334 k = n->key;
338 } else { if (n->key != NULL) {
340 (n->left)->key = n->key;
341 (n->key)->time = (n->left)->time;
342 (n->key)->notice = n->left; }
344 n2 = n;
373 (n->left)->right = n->right;
374 (n->right)->left = n->left;
375 n2 = n->right;
376 free(n);
377 n = n2;
384 n = (k->notice)->right;
385 while ((n != NULL) && (n->isdummy)) n = n->right;
386 current = n;
407 struct notice *n, *fn; in el_first() local
445 n = (k->notice)->left; in el_first()
447 while (n->time >= next_int) { in el_first()
449 n = n->left; } in el_first()
450 n = n->right; in el_first()
469 fn->left = n->left; in el_first()
470 fn->right = n; in el_first()
471 (n->left)->right = fn; in el_first()
472 n->left = fn; } in el_first()
478 n = current; in el_first()
479 while (n->key == NULL) n = n->right; in el_first()
480 k = n->key; in el_first()
509 struct notice *n, *n2; in el_delete() local
516 n = k->notice; in el_delete()
517 while (n != NULL) { in el_delete()
518 n2 = n->right; in el_delete()
519 free(n); in el_delete()
520 n = n2; } in el_delete()