2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
13 * Instituition: ITC, CMU
17 #include <afsconfig.h>
18 #include <afs/param.h>
22 #include <sys/types.h>
26 #include <netinet/in.h>
29 #include <afs/voldefs.h>
32 #include <afs/vlserver.h>
34 #include <afs/afsint.h>
39 #include "vsutils_prototypes.h"
40 #include "lockprocs_prototypes.h"
42 /* Finds an index in VLDB entry that matches the volume type, server, and partition.
43 * If type is zero, will match first index of ANY type (RW, BK, or RO).
44 * If server is zero, will match first index of ANY server and partition
45 * Zero is a valid partition field.
48 FindIndex(struct uvldbentry *entry, afs_uint32 server, afs_int32 part, afs_int32 type)
53 for (e = 0; (e < entry->nServers) && !error; e++) {
54 if (!type || (entry->serverFlags[e] & type)) {
55 if ((!server || (entry->serverPartition[e] == part))
57 || VLDB_IsSameAddrs(entry->serverUnique[e], server,
61 return -1; /* quit when we are looking for RW entry (there's only 1) */
67 "Failed to get info about server's %d address(es) from vlserver (err=%d)\n",
68 entry->serverUnique[e], error);
72 if (e >= entry->nServers)
73 return -1; /* Didn't find it */
75 return e; /* return the index */
78 /* Changes the rw site only */
80 SetAValue(struct uvldbentry *entry, afs_uint32 oserver, afs_int32 opart,
81 afs_uint32 nserver, afs_int32 npart, afs_int32 type)
85 e = FindIndex(entry, oserver, opart, type);
87 return; /* If didn't find it, just return */
89 entry->serverUnique[e] = nserver;
90 entry->serverPartition[e] = npart;
92 /* Now move rest of entries up */
93 if ((nserver == 0L) && (npart == 0L)) {
94 for (e++; e < entry->nServers; e++) {
95 entry->serverUnique[e - 1] = entry->serverUnique[e];
96 entry->serverPartition[e - 1] = entry->serverPartition[e];
97 entry->serverFlags[e - 1] = entry->serverFlags[e];
102 /* Changes the RW site only */
104 Lp_SetRWValue(struct nvldbentry *entryp, afs_uint32 oserver, afs_int32 opart,
105 afs_uint32 nserver, afs_int32 npart)
107 struct uvldbentry uentry;
109 nvlentry_to_uvlentry(entryp, &uentry);
110 SetAValue(&uentry, oserver, opart, nserver, npart, ITSRWVOL);
111 uvlentry_to_nvlentry(&uentry, entryp);
115 Lp_SetRWValueU(struct uvldbentry *entry, afs_uint32 oserver, afs_int32 opart,
116 afs_uint32 nserver, afs_int32 npart)
118 SetAValue(entry, oserver, opart, nserver, npart, ITSRWVOL);
121 /* Changes the RO site only */
123 Lp_SetROValue(struct nvldbentry *entryp, afs_uint32 oserver,
124 afs_int32 opart, afs_uint32 nserver, afs_int32 npart)
126 struct uvldbentry uentry;
128 nvlentry_to_uvlentry(entryp, &uentry);
129 SetAValue(&uentry, oserver, opart, nserver, npart, ITSROVOL);
130 uvlentry_to_nvlentry(&uentry, entryp);
134 Lp_SetROValueU(struct uvldbentry *entry, afs_uint32 oserver,
135 afs_int32 opart, afs_uint32 nserver, afs_int32 npart)
137 SetAValue(entry, oserver, opart, nserver, npart, ITSROVOL);
140 /* Returns success if this server and partition matches the RW entry */
142 Lp_Match(afs_uint32 server, afs_int32 part,
143 struct nvldbentry *entryp)
145 struct uvldbentry uentry;
147 nvlentry_to_uvlentry(entryp, &uentry);
148 if (FindIndex(&uentry, server, part, ITSRWVOL) == -1)
150 uvlentry_to_nvlentry(&uentry, entryp);
155 Lp_MatchU(afs_uint32 server, afs_int32 part,
156 struct uvldbentry *entry)
158 if (FindIndex(entry, server, part, ITSRWVOL) == -1)
163 /* Return the index of the RO entry (plus 1) if it exists, else return 0 */
165 Lp_ROMatch(afs_uint32 server, afs_int32 part, struct nvldbentry *entryp)
167 struct uvldbentry uentry;
170 nvlentry_to_uvlentry(entryp, &uentry);
171 idx = (FindIndex(&uentry, server, part, ITSROVOL) + 1);
173 uvlentry_to_nvlentry(&uentry, entryp);
178 Lp_ROMatchU(afs_uint32 server, afs_int32 part, struct uvldbentry *entry)
180 return (FindIndex(entry, server, part, ITSROVOL) + 1);
183 /* Return the index of the RW entry if it exists, else return -1 */
185 Lp_GetRwIndex(struct nvldbentry *entryp)
187 struct uvldbentry uentry;
190 nvlentry_to_uvlentry(entryp, &uentry);
191 idx = (FindIndex(&uentry, 0, 0, ITSRWVOL));
193 uvlentry_to_nvlentry(&uentry, entryp);
198 Lp_GetRwIndexU(struct uvldbentry *entry)
200 return (FindIndex(entry, 0, 0, ITSRWVOL));
203 /*initialize queue pointed by <ahead>*/
205 Lp_QInit(struct qHead *ahead)
211 /*add <elem> in front of queue <ahead> */
213 Lp_QAdd(struct qHead *ahead, struct aqueue *elem)
217 if (ahead->count == 0) {
230 Lp_QScan(struct qHead *ahead, afs_int32 id, int *success, struct aqueue **elem)
235 while (cptr != NULL) {
236 if (cptr->ids[RWVOL] == id) {
247 /*return the element in the beginning of the queue <ahead>, free
248 *the space used by that element . <success> indicates if enumeration was ok*/
250 Lp_QEnumerate(struct qHead *ahead, int *success, struct aqueue *elem)
255 if (ahead->count > 0) { /*more elements left */
258 ahead->next = ahead->next->next;
259 strncpy(elem->name, temp->name, VOLSER_OLDMAXVOLNAME);
260 for (i = 0; i < 3; i++) {
261 elem->ids[i] = temp->ids[i];
262 elem->copyDate[i] = temp->copyDate[i];
263 elem->isValid[i] = temp->isValid[i];
268 } else /*queue is empty */
273 Lp_QTraverse(struct qHead *ahead)
276 struct aqueue *old, *new;
280 count = ahead->count;
282 ("traversing the internal queue, which groups all the related volumes on a per partition basis\n");
284 printf("---------------------------\n");
285 printf("%s RW-Id %lu", old->name, (unsigned long)old->ids[RWVOL]);
286 if (old->isValid[RWVOL])
290 printf("RO-Id %lu", (unsigned long)old->ids[ROVOL]);
291 if (old->isValid[ROVOL])
295 printf("BACKUP-Id %lu", (unsigned long)old->ids[BACKVOL]);
296 if (old->isValid[BACKVOL])
301 printf("---------------------------\n");