Lines Matching defs:fp
112 * Insert fp before np ... the lock must be held.
115 np_insert(struct available *fp, struct available *np)
117 fp->prev = np->prev;
118 fp->next = np;
121 np->prev->next = fp;
123 nhead = fp;
124 np->prev = fp;
128 * Add fp to the end of the list ... the lock must be held.
131 np_add(struct available *fp)
136 nhead = fp;
143 np->next = fp;
144 fp->prev = np;
224 struct available *np, *fp;
234 fp = np_alloc(KM_SLEEP);
250 np_free(fp);
261 np_free(fp);
268 fp->nodeid = nodeid;
269 fp->count = 1;
270 np_insert(fp, np);
282 fp->nodeid = nodeid;
283 fp->count = 1;
284 np_add(fp);
299 struct available *np, *fp;
318 fp = np_alloc(kmflag); /* if KM_NOSLEEP, fp may be NULL */
344 if (fp)
345 np_free(fp);
360 if (fp)
361 np_free(fp);
371 if (fp == NULL) {
384 fp->nodeid = np->nodeid;
385 fp->count = nodeid - np->nodeid;
387 np->count = np->count - fp->count - 1;
388 ASSERT((fp->count != 0) && (np->count != 0));
389 ASSERT(np->nodeid == (fp->nodeid + fp->count + 1));
390 np_insert(fp, np);
401 if (fp)
402 np_free(fp);