Lines Matching defs:last
735 * take the longest, so we perform them last.
2289 int64_t this = 1, last, next;
2302 if (value < (last = this))
2326 return (base + (value - last) / (this / nbuckets));
2330 last = this;
4366 * is DIF_SUBR_STRRCHR, we will look for the last occurrence
5216 * character is the last character in the basename.
5227 * Starting from the last character in the basename, move
5242 * character is the last character in the dirname.
5291 * "/basename".) In this case, the last
6934 * action loop will use the last iteration's value.
9186 * 5. The last instruction must be a "ret" instruction
9469 "expected 'ret' as last DIF instruction\n");
10569 * This probe is already active. Swing the last pointer to
10807 * If the last action in the tuple has a size of zero, it's actually
10884 dtrace_action_t *action, *last;
11111 if ((last = ecb->dte_action_last) != NULL) {
11113 action->dta_prev = last;
11114 last->dta_next = action;
11206 * That was the last ECB on the probe; clear the predicate
12928 dtrace_actdesc_t *act, *first = NULL, *last = NULL, *next;
13024 if (last != NULL) {
13025 last->dtad_next = act;
13030 last = act;
13521 * CPU. And if we're on the last CPU, we're going to allocate
14280 * processed last.
14298 * this is the last enabling to have an unprivileged call
14801 dtrace_helper_action_t *last = NULL, *h, *next;
14807 if (last != NULL) {
14808 last->dtha_next = next;
14815 last = h;
14847 * Move the last helper provider into this slot.
14893 dtrace_helper_action_t *helper, *last;
14903 last = help->dthps_actions[which];
14906 for (count = 0; last != NULL; last = last->dtha_next) {
14908 if (last->dtha_next == NULL)
14949 if (last == NULL) {
14952 last->dtha_next = helper;
15548 dtrace_helper_action_t *helper, *new, *last;
15571 for (last = NULL; helper != NULL; helper = helper->dtha_next) {
15593 if (last != NULL) {
15594 last->dtha_next = new;
15599 last = new;