Lines Matching refs:next

389 	struct safefile *next;
1014 ent = ent->next)
1024 for (lp = ent->start; lp != NULL; lp = lp->next) {
1752 for (lp = flistp->head; lp; lp = lp->next) {
1852 for (; start; start = start->next) {
2315 safefilep->next = NULL;
2318 safefilep->next = s_calloc(1,
2320 safefilep = safefilep->next;
2323 safefilep->next = NULL;
2422 safefilep = safefilep->next;
3009 for (lp = flistp->head; lp; lp = lp->next) {
3054 bam_error(_("failed to update the timestamp file, next"
3264 for (lp = flist.head; lp; lp = lp->next) {
3280 for (lp = flist.head; lp; lp = lp->next)
4515 mp->end->next = lp;
4526 lp->prev->next = lp->next;
4528 mp->start = lp->next;
4529 if (lp->next)
4530 lp->next->prev = lp->prev;
4557 while (prev->next)
4558 prev = prev->next;
4559 prev->next = ent;
4921 for (lp = mp->start; lp; prev = lp, lp = lp->next) {
5126 for (lp = mp->start; lp; lp = lp->next) {
5297 ent = ent->next;
5304 lp = lp->next; /* prev stays the same */
5314 ent = ent->next;
5316 tmp->prev->next = ent;
7891 for (lp = flist.head; lp; lp = lp->next) {
7905 for (lp = flist.head; lp; lp = lp->next) {
7921 startlp = lp->next;
7922 for (i = 0, lp = startlp; lp; lp = lp->next) {
7943 for (i = 0, lp = startlp; lp; lp = lp->next) {
8160 for (i = 0, lp = flist.head->next; lp; lp = lp->next) {
8174 for (i = 0, lp = flist.head->next; lp; lp = lp->next) {
8372 lp->next = prev->next;
8373 if (prev->next) {
8374 BAM_DPRINTF(("%s: previous next exists\n", fcn));
8375 prev->next->prev = lp;
8377 BAM_DPRINTF(("%s: previous next does not exist\n", fcn));
8379 prev->next = lp;
8387 assert(lp->next == NULL);
8421 for (i = 0, ent = mp->entries; ent; i++, ent = ent->next) {
8432 lp = lp->next;
8445 lp = lp->next; /* advance to root line */
8465 lp = lp->next; /* advance to kernel line */
8481 lp = lp->next; /* advance to kernel line */
8495 if (lp == NULL || lp->next == NULL) {
8518 lp = lp->next; /* advance to module line */
8520 (((lp = lp->next) != NULL) &&
8591 lp = lp->next; /* title line */
8601 lp = lp->next; /* root line */
8626 lp = lp->next;
8669 lp = lp->next;
8684 lp = lp->next;
8691 lp = lp->next;
8705 lp = lp->next;
9282 for (lp = mp->start; lp; lp = lp->next) {
9310 lp->next = mp->start;
9314 lp->next = last->next;
9315 last->next = lp;
9316 if (lp->next == NULL)
9424 for (; lp != NULL; lp = lp->next) {
9533 for (entryp = mp->entries; entryp; entryp = entryp->next) {
9550 ptr = ptr->next) {
9953 for (lp = mp->start; lp; lp = lp->next) {
10019 start = start->next;
10043 ent = tmp->next;
10341 flistp->tail->next = lp;