1*40412Sbostic /*
2*40412Sbostic * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
3*40412Sbostic * All rights reserved.
4*40412Sbostic *
5*40412Sbostic * This code is derived from software contributed to Berkeley by
6*40412Sbostic * Adam de Boor.
7*40412Sbostic *
8*40412Sbostic * Redistribution and use in source and binary forms are permitted
9*40412Sbostic * provided that the above copyright notice and this paragraph are
10*40412Sbostic * duplicated in all such forms and that any documentation,
11*40412Sbostic * advertising materials, and other materials related to such
12*40412Sbostic * distribution and use acknowledge that the software was developed
13*40412Sbostic * by the University of California, Berkeley. The name of the
14*40412Sbostic * University may not be used to endorse or promote products derived
15*40412Sbostic * from this software without specific prior written permission.
16*40412Sbostic * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
17*40412Sbostic * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
18*40412Sbostic * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
19*40412Sbostic */
20*40412Sbostic
21*40412Sbostic #ifndef lint
22*40412Sbostic static char sccsid[] = "@(#)lstMove.c 5.2 (Berkeley) 03/11/90";
23*40412Sbostic #endif /* not lint */
24*40412Sbostic
2540411Sbostic /*-
2640411Sbostic * LstMove.c --
2740411Sbostic * Move an existing node after or before one in the same or different
2840411Sbostic * list.
2940411Sbostic */
3040411Sbostic
3140411Sbostic #include "lstInt.h"
3240411Sbostic
3340411Sbostic /*-
3440411Sbostic *-----------------------------------------------------------------------
3540411Sbostic * Lst_Move --
3640411Sbostic * Move a node after or before a destination node. The nodes do not
3740411Sbostic * need to be in the same list, of course.
3840411Sbostic *
3940411Sbostic * Results:
4040411Sbostic * SUCCESS or FAILURE.
4140411Sbostic *
4240411Sbostic * Side Effects:
4340411Sbostic * The firstPtr and lastPtr fields of either or both of the involved
4440411Sbostic * lists may be altered to reflect reality.
4540411Sbostic *
4640411Sbostic *-----------------------------------------------------------------------
4740411Sbostic */
4840411Sbostic ReturnStatus
Lst_Move(ls,lns,ld,lnd,before)4940411Sbostic Lst_Move (ls, lns, ld, lnd, before)
5040411Sbostic Lst ls; /* Source list */
5140411Sbostic register LstNode lns; /* source list node */
5240411Sbostic Lst ld; /* Destination list */
5340411Sbostic register LstNode lnd; /* destination list node */
5440411Sbostic Boolean before; /* true if should use Lst_Insert */
5540411Sbostic {
5640411Sbostic ClientData d;
5740411Sbostic ReturnStatus rval;
5840411Sbostic
5940411Sbostic if (lns == NILLNODE || lnd == NILLNODE) {
6040411Sbostic return (FAILURE);
6140411Sbostic }
6240411Sbostic
6340411Sbostic d = ((ListNode)lns)->datum;
6440411Sbostic
6540411Sbostic if (Lst_Remove (ls, lns) == FAILURE) {
6640411Sbostic return (FAILURE);
6740411Sbostic }
6840411Sbostic
6940411Sbostic if (before == TRUE) {
7040411Sbostic rval = Lst_Insert (ld, lnd, d);
7140411Sbostic } else {
7240411Sbostic rval = Lst_Append (ld, lnd, d);
7340411Sbostic }
7440411Sbostic
7540411Sbostic return (rval);
7640411Sbostic }
7740411Sbostic
78