89 struct notice {	time_t	time;  member
108 struct key {	time_t	time;  member
154 	n->time = LB;
160 	k->time = LB;
174 		n->time = t;
180 		k->time = t;
196 	n->time = INFINITY;
203 	k->time = INFINITY;
222 el_add(event, time, id)  in el_add()  argument
226 time_t	time;
244 	if ((index == NULL) || (time <= 0)) {
247 	if (time < LB) {
253 	n->time = time;
261 	while ((ind->key)->time <= time) ind = ind->right;
265 	while (k->time > time) k = k->left;
276 		k2->time = n2->time;
285 		if (k2->time > time) k = k2; }
293 	while (n2->time > time) n2 = n2->left;
299 	if ((current == NULL) || (current->time > time))
340 					(n->key)->time = (n->left)->time;
415 	while ((index->key)->time < current->time) {  in el_first()
419 			k->time += DT;  in el_first()
420 			(k->notice)->time += DT;  in el_first()
441 		next_int = k->time + DT;	/* upper bound on new inter.  */  in el_first()
442 		while (k->time < next_int) k = k->right;  in el_first()
446 		while (n->time >= next_int) {  in el_first()
459 		fk->time = next_int;  in el_first()
467 		fn->time = next_int;  in el_first()