2 * Copyright (C) 1995, 1997-1999 Jeffrey A. Uphoff
3 * Modified by Olaf Kirch, 1996.
4 * Modified by H.J. Lu, 1998.
5 * Modified by Lon Hohberger, Oct. 2000.
6 * - Fixed memory leaks, run-off-end problems, etc.
12 * Simple list management for notify list
27 * LH - The linked list code had some bugs. Used this to help debug
31 plist(notify_list *head, int en)
33 /* case where we ran off the end */
36 printf("Entry %d: %s\n",en, NL_MON_NAME(head));
37 plist(head->next, ++en);
41 nlist_print(notify_list **head)
43 printf("--- Begin notify list dump ---\n");
45 printf("--- End notify list dump ---\n");
50 * Allocate memory and set up a new notify list entry.
53 nlist_new(char *my_name, char *mon_name, int state)
57 if (!(new = (notify_list *) xmalloc(sizeof(notify_list))))
59 memset(new, 0, sizeof(*new));
61 NL_TIMES(new) = MAX_TRIES;
62 NL_STATE(new) = state;
63 if (!(NL_MY_NAME(new) = xstrdup(my_name))
64 || !(NL_MON_NAME(new) = xstrdup(mon_name)))
71 * Insert *entry into a notify list at the point specified by
72 * **head. This can be in the middle. However, we do not handle
73 * list _append_ in this function; rather, the only place we should
74 * have to worry about this case is in nlist_insert_timer below.
75 * - entry must not be NULL.
78 nlist_insert(notify_list **head, notify_list *entry)
82 * Cases where we're prepending a non-empty list
83 * or inserting possibly in the middle somewhere (eg,
84 * nlist_insert_timer...)
86 entry->next = (*head); /* Forward pointer */
87 entry->prev = (*head)->prev; /* Back pointer */
88 (*head)->prev = entry; /* head's new back pointer */
91 /* Common to all cases, including new list creation */
92 *head = entry; /* New head */
100 * (re)insert *entry into notify_list **head. This requires that
101 * NL_WHEN(entry) has been set (usually, this is time() + 5 seconds).
102 * - entry must not be NULL
104 * LH - This used to cause (a) a memory leak and (b) dropped notify-list
105 * entries. The pointer ran off the end of the list, and changed the
106 * head-end to point to the new, one-entry list. All other entries became garbage.
108 * FIXME: Optimize this function. (I'll work on it - LH)
111 nlist_insert_timer(notify_list **head, notify_list *entry)
113 notify_list *spot = *head, /* Insertion location */
114 /* ...Start at head */
115 *back = NULL; /* Back pointer */
118 /* Find first entry with higher timeout value or end of list */
119 while (spot && NL_WHEN(spot) <= NL_WHEN(entry)) {
121 * Keep the back pointer in case we
122 * run off the end... (see below)
128 if (spot == (*head)) {
130 * case where we're prepending an empty or non-empty
131 * list or inserting in the middle somewhere. Pass
132 * the real head of the list, since we'll be changing
133 * during the insert...
135 nlist_insert(head, entry);
137 /* all other cases - don't move the real head pointer */
138 nlist_insert(&spot, entry);
141 * If spot == entry, then spot was NULL when we called
142 * nlist_insert. This happened because we had run off
143 * the end of the list. Append entry to original list.
153 * Remove *entry from the list pointed to by **head.
154 * Do not destroy *entry. This is normally done before
155 * a re-insertion with a timer, but can be done anywhere.
156 * - entry must not be NULL.
159 nlist_remove(notify_list **head, notify_list *entry)
161 notify_list *prev = entry->prev,
169 /* Case(s) where entry isn't at the front */
172 /* cases where entry is at the front */
176 entry->next = entry->prev = NULL;
183 * Clone an entry in the notify list -
184 * - entry must not be NULL
187 nlist_clone(notify_list *entry)
191 new = nlist_new(NL_MY_NAME(entry), NL_MON_NAME(entry), NL_STATE(entry));
192 NL_MY_PROG(new) = NL_MY_PROG(entry);
193 NL_MY_VERS(new) = NL_MY_VERS(entry);
194 NL_MY_PROC(new) = NL_MY_PROC(entry);
195 NL_ADDR(new) = NL_ADDR(entry);
196 memcpy(NL_PRIV(new), NL_PRIV(entry), SM_PRIV_SIZE);
202 * Destroy an entry in a notify list and free the memory.
203 * If *head is NULL, just free the entry. This would be
204 * done only when we know entry isn't in any list.
205 * - entry must not be NULL.
208 nlist_free(notify_list **head, notify_list *entry)
211 nlist_remove(head, entry);
212 if (NL_MY_NAME(entry))
213 free(NL_MY_NAME(entry));
214 if (NL_MON_NAME(entry))
215 free(NL_MON_NAME(entry));
220 * Destroy an entire notify list
223 nlist_kill(notify_list **head)
226 nlist_free(head, *head);
230 * Walk a list looking for a matching name in the NL_MON_NAME field.
233 nlist_gethost(notify_list *list, char *host, int myname)
237 for (lp = list; lp; lp = lp->next) {
238 if (matchhostname(host, myname? NL_MY_NAME(lp) : NL_MON_NAME(lp)))
242 return (notify_list *) NULL;