Lines Matching refs:k
135 struct key *kprev, *k; in el_init() local
156 k = (struct key *)xmalloc(sizeof (struct key)); in el_init()
157 k->time = LB; in el_init()
158 k->numnote = 1; in el_init()
159 k->notice = n; in el_init()
160 k->left = NULL; in el_init()
161 kprev = k; in el_init()
163 n->key = k; in el_init()
176 k = (struct key *)xmalloc(sizeof (struct key)); in el_init()
177 k->time = t; in el_init()
178 k->numnote = 1; in el_init()
179 k->notice = n; in el_init()
180 k->left = kprev; in el_init()
181 kprev->right = k; in el_init()
182 kprev = k; in el_init()
183 n->key = k; in el_init()
185 ind->key = k; in el_init()
199 k = (struct key *)xmalloc(sizeof (struct key)); in el_init()
200 k->time = INFINITY; in el_init()
201 k->numnote = 1; in el_init()
202 k->notice = n; in el_init()
203 k->left = kprev; in el_init()
204 k->right = NULL; in el_init()
205 kprev->right = k; in el_init()
206 n->key = k; in el_init()
209 ind->key = k; in el_init()
228 struct key *k, *k2; in el_add() local
256 k = (ind->key)->left; in el_add()
257 while (k->time > time) k = k->left; in el_add()
258 k = k->right; in el_add()
261 if (k->numnote == NLIM) { in el_add()
263 k->numnote = NLIM / 2; in el_add()
264 n2 = k->notice; in el_add()
271 k2->right = k; in el_add()
272 k2->left = k->left; in el_add()
273 k->left = k2; in el_add()
277 if (k2->time > time) k = k2; } in el_add()
283 k->numnote = k->numnote + 1; in el_add()
284 n2 = k->notice; in el_add()
309 struct key *k, *kl, *kr; in el_remove() local
322 k = n->key; in el_remove()
323 (k->left)->right = k->right; in el_remove()
324 (k->right)->left = k->left; in el_remove()
325 free(k); in el_remove()
336 k = n2->key; in el_remove()
337 k->numnote = k->numnote - 1; in el_remove()
342 kl = k->left; in el_remove()
343 kr = k->right; in el_remove()
345 ((kl->numnote+k->numnote) <= NLIM)) { in el_remove()
348 k->numnote += kl->numnote; in el_remove()
349 (kl->left)->right = k; in el_remove()
350 k->left = kl->left; in el_remove()
352 } else if ((!(k->notice)->isdummy) && in el_remove()
353 ((kr->numnote+k->numnote) <= NLIM)) { in el_remove()
355 (k->notice)->key = NULL; in el_remove()
356 kr->numnote += k->numnote; in el_remove()
357 (k->left)->right = kr; in el_remove()
358 kr->left = k->left; in el_remove()
359 free(k); } in el_remove()
371 k = (index->key)->left; in el_remove()
372 while (k->left != NULL) k = k->left; in el_remove()
373 n = (k->notice)->right; in el_remove()
393 struct key *k, *fk; in el_first() local
404 k = index->key; in el_first()
405 k->time += DT; in el_first()
406 (k->notice)->time += DT; in el_first()
426 k = ind->key; in el_first()
427 next_int = k->time + DT; /* upper bound on new inter. */ in el_first()
428 while (k->time < next_int) k = k->right; in el_first()
430 n = (k->notice)->left; in el_first()
446 fk->numnote = k->numnote - ctr + 1; in el_first()
447 fk->left = k->left; in el_first()
448 fk->right = k; in el_first()
449 (k->left)->right = fk; in el_first()
450 k->left = fk; in el_first()
451 k->numnote = ctr; in el_first()
465 k = n->key; in el_first()
466 k->numnote = k->numnote - 1; in el_first()
468 if (k->numnote == 0) { in el_first()
469 (k->left)->right = k->right; in el_first()
470 (k->right)->left = k->left; in el_first()
471 free(k); } in el_first()
491 struct key *k, *k2; in el_delete() local
497 k = ind->key; in el_delete()
498 while (k->left != NULL) k = k->left; in el_delete()
499 n = k->notice; in el_delete()
504 while (k != NULL) { in el_delete()
505 k2 = k->right; in el_delete()
506 free(k); in el_delete()
507 k = k2; } in el_delete()