Lines Matching refs:fp
113 np_insert(struct available *fp, struct available *np) in np_insert() argument
115 fp->prev = np->prev; in np_insert()
116 fp->next = np; in np_insert()
119 np->prev->next = fp; in np_insert()
121 nhead = fp; in np_insert()
122 np->prev = fp; in np_insert()
129 np_add(struct available *fp) in np_add() argument
134 nhead = fp; in np_add()
141 np->next = fp; in np_add()
142 fp->prev = np; in np_add()
222 struct available *np, *fp; in impl_ddi_free_nodeid() local
232 fp = np_alloc(KM_SLEEP); in impl_ddi_free_nodeid()
248 np_free(fp); in impl_ddi_free_nodeid()
259 np_free(fp); in impl_ddi_free_nodeid()
266 fp->nodeid = nodeid; in impl_ddi_free_nodeid()
267 fp->count = 1; in impl_ddi_free_nodeid()
268 np_insert(fp, np); in impl_ddi_free_nodeid()
280 fp->nodeid = nodeid; in impl_ddi_free_nodeid()
281 fp->count = 1; in impl_ddi_free_nodeid()
282 np_add(fp); in impl_ddi_free_nodeid()
297 struct available *np, *fp; in impl_ddi_take_nodeid() local
316 fp = np_alloc(kmflag); /* if KM_NOSLEEP, fp may be NULL */ in impl_ddi_take_nodeid()
342 if (fp) in impl_ddi_take_nodeid()
343 np_free(fp); in impl_ddi_take_nodeid()
358 if (fp) in impl_ddi_take_nodeid()
359 np_free(fp); in impl_ddi_take_nodeid()
369 if (fp == NULL) { in impl_ddi_take_nodeid()
382 fp->nodeid = np->nodeid; in impl_ddi_take_nodeid()
383 fp->count = nodeid - np->nodeid; in impl_ddi_take_nodeid()
385 np->count = np->count - fp->count - 1; in impl_ddi_take_nodeid()
386 ASSERT((fp->count != 0) && (np->count != 0)); in impl_ddi_take_nodeid()
387 ASSERT(np->nodeid == (fp->nodeid + fp->count + 1)); in impl_ddi_take_nodeid()
388 np_insert(fp, np); in impl_ddi_take_nodeid()
399 if (fp) in impl_ddi_take_nodeid()
400 np_free(fp); in impl_ddi_take_nodeid()