136 	struct notice *nprev, *n;  in el_init()  local
150 	n = (struct notice *)xmalloc(sizeof (struct notice));  in el_init()
151 	n->time = LB;  in el_init()
152 	n->isdummy = TRUE;  in el_init()
153 	n->left = NULL;  in el_init()
154 	nprev = n;  in el_init()
159 	k->notice = n;  in el_init()
163 	n->key = k;  in el_init()
170 		n = (struct notice *)xmalloc(sizeof (struct notice));  in el_init()
171 		n->time = t;  in el_init()
172 		n->isdummy = TRUE;  in el_init()
173 		n->left = nprev;  in el_init()
174 		nprev->right = n;  in el_init()
175 		nprev = n;  in el_init()
179 		k->notice = n;  in el_init()
183 		n->key = k;  in el_init()
192 	n = (struct notice *)xmalloc(sizeof (struct notice));  in el_init()
193 	n->time = INFINITY;  in el_init()
194 	n->isdummy = TRUE;  in el_init()
195 	n->left = nprev;  in el_init()
196 	n->right = NULL;  in el_init()
197 	nprev->right = n;  in el_init()
202 	k->notice = n;  in el_init()
206 	n->key = k;  in el_init()
229 	struct notice *n, *n2;  in el_add()  local
244 	n = (struct notice *)xmalloc(sizeof (struct notice));  in el_add()
245 	n->time = time;  in el_add()
246 	n->id = id;  in el_add()
247 	n->event = event;  in el_add()
248 	n->isdummy = FALSE;  in el_add()
249 	n->key = NULL;  in el_add()
286 	n->right = n2->right;  in el_add()
287 	n->left = n2;  in el_add()
288 	(n2->right)->left = n;  in el_add()
289 	n2->right = n;  in el_add()
292 		current = n;  in el_add()
308 	struct notice *n, *n2;  in el_remove()  local
314 	n = current;  in el_remove()
315 	while (n != NULL) {  in el_remove()
316 		while ((n != NULL) && ((n->isdummy) || (n->id != id)))  in el_remove()
317 			n = n->right;  in el_remove()
318 		if (n != NULL) {  in el_remove()
320 			if ((n->key != NULL) && ((n->key)->numnote == 1)) {  in el_remove()
322 				k = n->key;  in el_remove()
327 				if (n->key != NULL) {  in el_remove()
329 					(n->left)->key = n->key;  in el_remove()
330 					(n->key)->time = (n->left)->time;  in el_remove()
331 					(n->key)->notice = n->left;  in el_remove()
334 				n2 = n;  in el_remove()
362 			(n->left)->right = n->right;  in el_remove()
363 			(n->right)->left = n->left;  in el_remove()
364 			n2 = n->right;  in el_remove()
365 			free(n);  in el_remove()
366 			n = n2;  in el_remove()
373 	n = (k->notice)->right;  in el_remove()
374 	while ((n != NULL) && (n->isdummy)) n = n->right;  in el_remove()
375 	current = n;  in el_remove()
392 	struct notice *n, *fn;  in el_first()  local
430 		n = (k->notice)->left;  in el_first()
432 		while (n->time >= next_int) {  in el_first()
434 			n = n->left; }  in el_first()
435 		n = n->right;  in el_first()
454 		fn->left = n->left;  in el_first()
455 		fn->right = n;  in el_first()
456 		(n->left)->right = fn;  in el_first()
457 		n->left = fn; }  in el_first()
463 	n = current;  in el_first()
464 	while (n->key == NULL) n = n->right;  in el_first()
465 	k = n->key;  in el_first()
492 	struct notice *n, *n2;  in el_delete()  local
499 	n = k->notice;  in el_delete()
500 	while (n != NULL) {  in el_delete()
501 		n2 = n->right;  in el_delete()
502 		free(n);  in el_delete()
503 		n = n2; }  in el_delete()