Lines Matching defs:last
83 ListNode last; /* the last element in the list. Keeps
96 * last element of list two to be NIL to make the loop easier and
105 * first element of the second list to the last element of the
107 * last element of the list to the first element of the second list
108 * The last element of the second list, if it exists, then becomes
109 * the last element of the first list.
123 * first element to the last and vice versa
131 * We set the nextPtr of the last element of list 2 to be nil to make
135 * datum field of the corresponding element in l2. The 'last' node
136 * follows the last of the new nodes along until the entire l2 has
138 * changes. During the first iteration of the loop, if 'last' is nil,
143 for (last = list1->lastPtr, ln = list2->firstPtr;
149 if (last != NULL) {
150 last->nextPtr = nln;
154 nln->prevPtr = last;
156 last = nln;
160 * Finish bookkeeping. The last new element becomes the last element
163 list1->lastPtr = last;
175 last->nextPtr = NULL;