Lines Matching defs:prior
2146 nfs4_ephemeral_t *prior;
2229 prior = mi_parent->mi_ephemeral;
2230 if (prior == NULL) {
2243 if (prior->ne_child == NULL) {
2244 prior->ne_child = eph;
2246 child = prior->ne_child;
2248 prior->ne_child = eph;
2254 eph->ne_prior = prior;
2294 nfs4_ephemeral_t *prior;
2297 prior = e->ne_prior;
2303 if (prior) {
2304 if (prior->ne_child == e) {
2305 prior->ne_child = peer;
2307 prior->ne_peer = peer;
2311 peer->ne_prior = prior;
2331 nfs4_ephemeral_t *prior;
2344 prior = e;
2365 prior = e;
2382 * Note that prior can only be NULL if
2386 prior = e->ne_prior;
2427 ASSERT(prior == NULL);
2432 * Stitch up the prior node. Note that since
2433 * we have handled the root of the tree, prior
2436 ASSERT(prior != NULL);
2437 if (prior->ne_child == e) {
2438 prior->ne_child = NULL;
2440 ASSERT(prior->ne_peer == e);
2442 prior->ne_peer = NULL;
2445 e = prior;
2791 nfs4_ephemeral_t *e, nfs4_ephemeral_t *prior)
2803 if (prior) {
2804 if (prior->ne_child == e)
2805 prior->ne_state |=
2808 prior->ne_state |=
2851 nfs4_ephemeral_t *prior;
2932 prior = e->ne_prior;
2938 * If your prior node is a parent,
2942 * However, if your prior is a sibling,
2945 if (prior) {
2946 if (prior->ne_child == e)
2947 prior->ne_state |=
2950 prior->ne_state |=
2962 e = prior;
2967 prior = e->ne_prior;
2969 if (prior) {
2970 if (prior->ne_child == e)
2971 prior->ne_state =
2974 prior->ne_state =
2986 prior = e->ne_prior;
3015 e, prior);
3018 e = prior;