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
10 #include <afsconfig.h>
11 #include <afs/param.h>
16 #include <afs/afsutil.h>
22 #include <afs/cellconfig.h>
25 #include "vlserver_internal.h"
26 #include "afs/audit.h"
28 #ifdef HAVE_POSIX_REGEX /* use POSIX regexp library */
33 extern int extent_mod;
34 extern struct afsconf_dir *vldb_confdir;
35 extern struct ubik_dbase *VL_dbase;
37 #define ABORT(c) do { \
47 #define VLDBALLOCLIMIT 10000
48 #define VLDBALLOCINCR 2048
50 static int put_attributeentry(struct vl_ctx *ctx,
51 struct vldbentry **, struct vldbentry **,
52 struct vldbentry **, bulkentries *,
53 struct nvlentry *, afs_int32 *, afs_int32 *);
54 static int put_nattributeentry(struct vl_ctx *ctx,
55 struct nvldbentry **, struct nvldbentry **,
56 struct nvldbentry **, nbulkentries *,
57 struct nvlentry *, afs_int32, afs_int32,
58 afs_int32 *, afs_int32 *);
59 static int RemoveEntry(struct vl_ctx *ctx, afs_int32 entryptr,
60 struct nvlentry *tentry);
61 static void ReleaseEntry(struct nvlentry *tentry, afs_int32 releasetype);
62 static int check_vldbentry(struct vldbentry *aentry);
63 static int check_nvldbentry(struct nvldbentry *aentry);
64 static int vldbentry_to_vlentry(struct vl_ctx *ctx,
65 struct vldbentry *VldbEntry,
66 struct nvlentry *VlEntry);
67 static int nvldbentry_to_vlentry(struct vl_ctx *ctx,
68 struct nvldbentry *VldbEntry,
69 struct nvlentry *VlEntry);
70 static int get_vldbupdateentry(struct vl_ctx *ctx, afs_int32 blockindex,
71 struct VldbUpdateEntry *updateentry,
72 struct nvlentry *VlEntry);
73 static int repsite_exists(struct nvlentry *VlEntry, int server, int partition);
74 static void repsite_compress(struct nvlentry *VlEntry, int offset);
75 static int vlentry_to_vldbentry(struct vl_ctx *ctx,
76 struct nvlentry *VlEntry,
77 struct vldbentry *VldbEntry);
78 static int vlentry_to_nvldbentry(struct vl_ctx *ctx,
79 struct nvlentry *VlEntry,
80 struct nvldbentry *VldbEntry);
81 static int vlentry_to_uvldbentry(struct vl_ctx *ctx,
82 struct nvlentry *VlEntry,
83 struct uvldbentry *VldbEntry);
84 static int InvalidVolname(char *volname);
85 static int InvalidVoltype(afs_int32 voltype);
86 static int InvalidOperation(afs_int32 voloper);
87 static int InvalidReleasetype(afs_int32 releasetype);
88 static int IpAddrToRelAddr(struct vl_ctx *ctx, afs_uint32 ipaddr, int create);
89 static int ChangeIPAddr(struct vl_ctx *ctx, afs_uint32 ipaddr1,
93 countRequest(int opcode)
96 dynamic_statistics.requests[opcode - VL_LOWEST_OPCODE]++;
101 countAbort(int opcode)
104 dynamic_statistics.aborts[opcode - VL_LOWEST_OPCODE]++;
110 multiHomedExtentBase(struct vl_ctx *ctx, int srvidx, struct extentaddr **exp,
119 if ((ctx->hostaddress[srvidx] & 0xff000000) == 0xff000000) {
120 base = (ctx->hostaddress[srvidx] >> 16) & 0xff;
121 index = ctx->hostaddress[srvidx] & 0x0000ffff;
122 if (base >= VL_MAX_ADDREXTBLKS) {
123 VLog(0, ("Internal error: Multihome extent base is too large. "
124 "Base %d index %d\n", base, index));
127 if (index >= VL_MHSRV_PERBLK) {
128 VLog(0, ("Internal error: Multihome extent index is too large. "
129 "Base %d index %d\n", base, index));
132 if (!ctx->ex_addr[base]) {
133 VLog(0, ("Internal error: Multihome extent does not exist. "
139 *exp = &ctx->ex_addr[base][index];
146 multiHomedExtent(struct vl_ctx *ctx, int srvidx, struct extentaddr **exp)
150 return multiHomedExtentBase(ctx, srvidx, exp, &base);
153 #define AFS_RXINFO_LEN 128
155 rxkadInfo(char *str, struct rx_connection *conn, struct in_addr hostAddr)
163 code = rxkad_GetServerInfo(conn, NULL, &exp, tname, tinst, tcell,
166 snprintf(str, AFS_RXINFO_LEN,
167 "%s rxkad:%s%s%s%s%s", inet_ntoa(hostAddr), tname,
168 (tinst[0] == '\0') ? "" : ".",
169 (tinst[0] == '\0') ? "" : tinst,
170 (tcell[0] == '\0') ? "" : "@",
171 (tcell[0] == '\0') ? "" : tcell);
173 snprintf(str, AFS_RXINFO_LEN, "%s noauth", inet_ntoa(hostAddr));
178 rxinfo(char *str, struct rx_call *rxcall)
180 struct rx_connection *conn;
181 struct in_addr hostAddr;
182 rx_securityIndex authClass;
184 conn = rx_ConnectionOf(rxcall);
185 authClass = rx_SecurityClassOf(conn);
186 hostAddr.s_addr = rx_HostOf(rx_PeerOf(conn));
190 return rxkadInfo(str, conn, hostAddr);
195 snprintf(str, AFS_RXINFO_LEN, "%s noauth", inet_ntoa(hostAddr));
200 /* This is called to initialize the database, set the appropriate locks and make sure that the vldb header is valid */
202 Init_VLdbase(struct vl_ctx *ctx,
203 int locktype, /* indicate read or write transaction */
206 int code = 0, pass, wl;
208 for (pass = 1; pass <= 3; pass++) {
209 if (pass == 2) { /* take write lock to rebuild the db */
210 code = ubik_BeginTrans(VL_dbase, UBIK_WRITETRANS, &ctx->trans);
212 } else if (locktype == LOCKREAD) {
214 ubik_BeginTransReadAnyWrite(VL_dbase, UBIK_READTRANS, &ctx->trans);
217 code = ubik_BeginTrans(VL_dbase, UBIK_WRITETRANS, &ctx->trans);
223 code = ubik_SetLock(ctx->trans, 1, 1, locktype);
226 ubik_AbortTrans(ctx->trans);
230 /* check that dbase is initialized and setup cheader */
231 /* 2nd pass we try to rebuild the header */
232 code = CheckInit(ctx->trans, ((pass == 2) ? 1 : 0));
233 if (!code && wl && extent_mod)
234 code = readExtents(ctx->trans); /* Fix the mh extent blocks */
237 ubik_AbortTrans(ctx->trans);
238 /* Only rebuld if the database is empty */
239 /* Exit if can't rebuild */
240 if ((pass == 1) && (code != VL_EMPTY))
244 } else { /* No code */
246 ubik_EndTrans(ctx->trans); /* Rebuilt db. End trans, then retake original lock */
248 break; /* didn't rebuild and successful - exit */
253 code = vlsetcache(ctx, locktype);
259 /* Create a new vldb entry; both new volume id and name must be unique
260 * (non-existant in vldb).
264 SVL_CreateEntry(struct rx_call *rxcall, struct vldbentry *newentry)
266 int this_op = VLCREATEENTRY;
268 afs_int32 code, blockindex;
269 struct nvlentry tentry;
270 char rxstr[AFS_RXINFO_LEN];
272 countRequest(this_op);
273 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL)) {
278 /* Do some validity tests on new entry */
279 if ((code = check_vldbentry(newentry))
280 || (code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
284 ("OCreate Volume %d %s\n", newentry->volumeId[RWVOL],
285 rxinfo(rxstr, rxcall)));
286 if (EntryIDExists(&ctx, newentry->volumeId, MAXTYPES, &code)) {
287 /* at least one of the specified IDs already exists; we fail */
294 /* Is this following check (by volume name) necessary?? */
295 /* If entry already exists, we fail */
296 if (FindByName(&ctx, newentry->name, &tentry, &code)) {
303 blockindex = AllocBlock(&ctx, &tentry);
304 if (blockindex == 0) {
305 code = VL_CREATEFAIL;
309 memset(&tentry, 0, sizeof(struct nvlentry));
310 /* Convert to its internal representation; both in host byte order */
311 if ((code = vldbentry_to_vlentry(&ctx, newentry, &tentry))) {
312 FreeBlock(&ctx, blockindex);
316 /* Actually insert the entry in vldb */
317 code = ThreadVLentry(&ctx, blockindex, &tentry);
319 FreeBlock(&ctx, blockindex);
322 code = ubik_EndTrans(ctx.trans);
328 ubik_AbortTrans(ctx.trans);
331 osi_auditU(rxcall, VLCreateEntryEvent, code, AUD_STR,
332 (newentry ? newentry->name : NULL), AUD_END);
338 SVL_CreateEntryN(struct rx_call *rxcall, struct nvldbentry *newentry)
340 int this_op = VLCREATEENTRYN;
342 afs_int32 code, blockindex;
343 struct nvlentry tentry;
344 char rxstr[AFS_RXINFO_LEN];
346 countRequest(this_op);
347 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL)) {
352 /* Do some validity tests on new entry */
353 if ((code = check_nvldbentry(newentry))
354 || (code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
358 ("Create Volume %d %s\n", newentry->volumeId[RWVOL],
359 rxinfo(rxstr, rxcall)));
360 if (EntryIDExists(&ctx, newentry->volumeId, MAXTYPES, &code)) {
361 /* at least one of the specified IDs already exists; we fail */
368 /* Is this following check (by volume name) necessary?? */
369 /* If entry already exists, we fail */
370 if (FindByName(&ctx, newentry->name, &tentry, &code)) {
377 blockindex = AllocBlock(&ctx, &tentry);
378 if (blockindex == 0) {
379 code = VL_CREATEFAIL;
383 memset(&tentry, 0, sizeof(struct nvlentry));
384 /* Convert to its internal representation; both in host byte order */
385 if ((code = nvldbentry_to_vlentry(&ctx, newentry, &tentry))) {
386 FreeBlock(&ctx, blockindex);
390 /* Actually insert the entry in vldb */
391 code = ThreadVLentry(&ctx, blockindex, &tentry);
393 FreeBlock(&ctx, blockindex);
396 code = ubik_EndTrans(ctx.trans);
402 ubik_AbortTrans(ctx.trans);
405 osi_auditU(rxcall, VLCreateEntryEvent, code, AUD_STR,
406 (newentry ? newentry->name : NULL), AUD_END);
412 SVL_ChangeAddr(struct rx_call *rxcall, afs_uint32 ip1, afs_uint32 ip2)
414 int this_op = VLCHANGEADDR;
417 char rxstr[AFS_RXINFO_LEN];
419 countRequest(this_op);
420 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL)) {
425 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
428 VLog(1, ("Change Addr %u -> %u %s\n", ip1, ip2, rxinfo(rxstr, rxcall)));
429 if ((code = ChangeIPAddr(&ctx, ip1, ip2)))
432 code = ubik_EndTrans(ctx.trans);
438 ubik_AbortTrans(ctx.trans);
441 osi_auditU(rxcall, VLChangeAddrEvent, code, AUD_LONG, ip1, AUD_LONG,
446 /* Delete a vldb entry given the volume id. */
448 SVL_DeleteEntry(struct rx_call *rxcall, afs_uint32 volid, afs_int32 voltype)
450 int this_op = VLDELETEENTRY;
452 afs_int32 blockindex, code;
453 struct nvlentry tentry;
454 char rxstr[AFS_RXINFO_LEN];
456 countRequest(this_op);
457 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
460 if ((voltype != -1) && (InvalidVoltype(voltype)))
463 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
466 VLog(1, ("Delete Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
467 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
468 if (blockindex == 0) { /* volid not found */
474 if (tentry.flags & VLDELETED) { /* Already deleted; return */
475 ABORT(VL_ENTDELETED);
477 if ((code = RemoveEntry(&ctx, blockindex, &tentry))) {
480 code = (ubik_EndTrans(ctx.trans));
485 ubik_AbortTrans(ctx.trans);
488 osi_auditU(rxcall, VLDeleteEntryEvent, code, AUD_LONG, volid,
494 /* Get a vldb entry given its volume id; make sure it's not a deleted entry. */
496 GetEntryByID(struct rx_call *rxcall,
499 char *aentry, /* entry data copied here */
504 afs_int32 blockindex, code;
505 struct nvlentry tentry;
506 char rxstr[AFS_RXINFO_LEN];
508 countRequest(this_op);
510 if ((voltype != -1) && (InvalidVoltype(voltype)))
511 return VL_BADVOLTYPE;
512 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
515 VLog(5, ("GetVolumeByID %u (%d) %s\n", volid, new,
516 rxinfo(rxstr, rxcall)));
517 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
518 if (blockindex == 0) { /* entry not found */
523 if (tentry.flags & VLDELETED) { /* Entry is deleted! */
524 code = VL_ENTDELETED;
527 /* Convert from the internal to external form */
529 code = vlentry_to_nvldbentry(&ctx, &tentry, (struct nvldbentry *)aentry);
531 code = vlentry_to_uvldbentry(&ctx, &tentry, (struct uvldbentry *)aentry);
533 code = vlentry_to_vldbentry(&ctx, &tentry, (struct vldbentry *)aentry);
538 return (ubik_EndTrans(ctx.trans));
542 ubik_AbortTrans(ctx.trans);
547 SVL_GetEntryByID(struct rx_call *rxcall,
550 vldbentry *aentry) /* entry data copied here */
552 return (GetEntryByID(rxcall, volid, voltype, (char *)aentry, 0,
557 SVL_GetEntryByIDN(struct rx_call *rxcall,
560 nvldbentry *aentry) /* entry data copied here */
562 return (GetEntryByID(rxcall, volid, voltype, (char *)aentry, 1,
567 SVL_GetEntryByIDU(struct rx_call *rxcall,
570 uvldbentry *aentry) /* entry data copied here */
572 return (GetEntryByID(rxcall, volid, voltype, (char *)aentry, 2,
576 /* returns true if the id is a decimal integer, in which case we interpret
577 * it as an id. make the cache manager much simpler */
579 NameIsId(char *aname)
582 while ((tc = *aname++)) {
583 if (tc > '9' || tc < '0')
589 /* Get a vldb entry given the volume's name; of course, very similar to
590 * VLGetEntryByID() above. */
592 GetEntryByName(struct rx_call *rxcall,
594 char *aentry, /* entry data copied here */
599 afs_int32 blockindex, code;
600 struct nvlentry tentry;
601 char rxstr[AFS_RXINFO_LEN];
603 if (NameIsId(volname)) {
604 return GetEntryByID(rxcall, strtoul(volname, NULL, 10), -1, aentry, new, this_op);
606 if (InvalidVolname(volname))
608 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
610 VLog(5, ("GetVolumeByName %s (%d) %s\n", volname, new, rxinfo(rxstr, rxcall)));
611 blockindex = FindByName(&ctx, volname, &tentry, &code);
612 if (blockindex == 0) { /* entry not found */
617 if (tentry.flags & VLDELETED) { /* Entry is deleted */
618 code = VL_ENTDELETED;
621 /* Convert to external entry representation */
623 code = vlentry_to_nvldbentry(&ctx, &tentry, (struct nvldbentry *)aentry);
625 code = vlentry_to_uvldbentry(&ctx, &tentry, (struct uvldbentry *)aentry);
627 code = vlentry_to_vldbentry(&ctx, &tentry, (struct vldbentry *)aentry);
632 return (ubik_EndTrans(ctx.trans));
636 ubik_AbortTrans(ctx.trans);
642 SVL_GetEntryByNameO(struct rx_call *rxcall,
644 struct vldbentry *aentry) /* entry data copied here */
646 return (GetEntryByName(rxcall, volname, (char *)aentry, 0,
652 SVL_GetEntryByNameN(struct rx_call *rxcall,
654 struct nvldbentry *aentry) /* entry data copied here */
656 return (GetEntryByName(rxcall, volname, (char *)aentry, 1,
661 SVL_GetEntryByNameU(struct rx_call *rxcall,
663 struct uvldbentry *aentry) /* entry data copied here */
665 return (GetEntryByName(rxcall, volname, (char *)aentry, 2,
671 /* Get the current value of the maximum volume id and bump the volume id counter by Maxvolidbump. */
673 SVL_GetNewVolumeId(struct rx_call *rxcall, afs_uint32 Maxvolidbump,
674 afs_uint32 *newvolumeid)
676 int this_op = VLGETNEWVOLUMEID;
678 afs_uint32 maxvolumeid;
680 char rxstr[AFS_RXINFO_LEN];
682 countRequest(this_op);
683 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
686 if (Maxvolidbump > MAXBUMPCOUNT)
687 END(VL_BADVOLIDBUMP);
689 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
692 *newvolumeid = maxvolumeid = NextUnusedID(&ctx,
693 ntohl(ctx.cheader->vital_header.MaxVolumeId), Maxvolidbump, &code);
698 maxvolumeid += Maxvolidbump;
699 VLog(1, ("GetNewVolid newmax=%u %s\n", maxvolumeid, rxinfo(rxstr, rxcall)));
700 ctx.cheader->vital_header.MaxVolumeId = htonl(maxvolumeid);
701 if (write_vital_vlheader(&ctx)) {
704 code = (ubik_EndTrans(ctx.trans));
709 ubik_AbortTrans(ctx.trans);
712 osi_auditU(rxcall, VLGetNewVolumeIdEvent, code, AUD_END);
717 /* Simple replace the contents of the vldb entry, volid, with
718 * newentry. No individual checking/updating per field (alike
719 * VLUpdateEntry) is done. */
722 SVL_ReplaceEntry(struct rx_call *rxcall, afs_uint32 volid, afs_int32 voltype,
723 struct vldbentry *newentry, afs_int32 releasetype)
725 int this_op = VLREPLACEENTRY;
727 afs_int32 blockindex, code, typeindex;
729 int hashVol[MAXTYPES];
730 struct nvlentry tentry;
731 afs_uint32 checkids[MAXTYPES];
732 char rxstr[AFS_RXINFO_LEN];
734 countRequest(this_op);
735 for (typeindex = 0; typeindex < MAXTYPES; typeindex++)
736 hashVol[typeindex] = 0;
738 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
741 if ((code = check_vldbentry(newentry)))
744 if (voltype != -1 && InvalidVoltype(voltype))
747 if (releasetype && InvalidReleasetype(releasetype))
748 END(VL_BADRELLOCKTYPE);
749 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
752 VLog(1, ("OReplace Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
753 /* find vlentry we're changing */
754 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
755 if (blockindex == 0) { /* entry not found */
761 /* check that we're not trying to change the RW vol ID */
762 if (newentry->volumeId[RWVOL] != tentry.volumeId[RWVOL]) {
766 /* make sure none of the IDs we are changing to are already in use */
767 memset(&checkids, 0, sizeof(checkids));
768 for (typeindex = ROVOL; typeindex < MAXTYPES; typeindex++) {
769 if (tentry.volumeId[typeindex] != newentry->volumeId[typeindex]) {
770 checkids[typeindex] = newentry->volumeId[typeindex];
773 if (EntryIDExists(&ctx, checkids, MAXTYPES, &code)) {
779 /* make sure the name we're changing to doesn't already exist */
780 if (strcmp(newentry->name, tentry.name)) {
781 struct nvlentry tmp_entry;
782 if (FindByName(&ctx, newentry->name, &tmp_entry, &code)) {
789 /* unhash volid entries if they're disappearing or changing.
790 * Remember if we need to hash in the new value (we don't have to
791 * rehash if volid stays same */
792 for (typeindex = ROVOL; typeindex <= BACKVOL; typeindex++) {
793 if (tentry.volumeId[typeindex] != newentry->volumeId[typeindex]) {
794 if (tentry.volumeId[typeindex])
796 UnhashVolid(&ctx, typeindex, blockindex, &tentry))) {
799 /* we must rehash new id if the id is different and the ID is nonzero */
800 hashVol[typeindex] = 1; /* must rehash this guy if he exists */
804 /* Rehash volname if it changes */
805 if (strcmp(newentry->name, tentry.name)) { /* Name changes; redo hashing */
806 if ((code = UnhashVolname(&ctx, blockindex, &tentry))) {
812 /* after this, tentry is new entry, not old one. vldbentry_to_vlentry
813 * doesn't touch hash chains */
814 if ((code = vldbentry_to_vlentry(&ctx, newentry, &tentry))) {
818 for (typeindex = ROVOL; typeindex <= BACKVOL; typeindex++) {
819 if (hashVol[typeindex] && tentry.volumeId[typeindex]) {
820 if ((code = HashVolid(&ctx, typeindex, blockindex, &tentry))) {
827 HashVolname(&ctx, blockindex, &tentry);
830 ReleaseEntry(&tentry, releasetype); /* Unlock entry if necessary */
831 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
835 END(ubik_EndTrans(ctx.trans));
839 ubik_AbortTrans(ctx.trans);
842 osi_auditU(rxcall, VLReplaceVLEntryEvent, code, AUD_LONG, volid,
848 SVL_ReplaceEntryN(struct rx_call *rxcall, afs_uint32 volid, afs_int32 voltype,
849 struct nvldbentry *newentry, afs_int32 releasetype)
851 int this_op = VLREPLACEENTRYN;
853 afs_int32 blockindex, code, typeindex;
855 int hashVol[MAXTYPES];
856 struct nvlentry tentry;
857 char rxstr[AFS_RXINFO_LEN];
859 countRequest(this_op);
860 for (typeindex = 0; typeindex < MAXTYPES; typeindex++)
861 hashVol[typeindex] = 0;
863 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
866 if ((code = check_nvldbentry(newentry)))
869 if (voltype != -1 && InvalidVoltype(voltype))
872 if (releasetype && InvalidReleasetype(releasetype))
873 END(VL_BADRELLOCKTYPE);
874 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
877 VLog(1, ("Replace Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
878 /* find vlentry we're changing */
879 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
880 if (blockindex == 0) { /* entry not found */
886 /* check that we're not trying to change the RW vol ID */
887 if (newentry->volumeId[RWVOL] != tentry.volumeId[RWVOL]) {
891 /* unhash volid entries if they're disappearing or changing.
892 * Remember if we need to hash in the new value (we don't have to
893 * rehash if volid stays same */
894 for (typeindex = ROVOL; typeindex <= BACKVOL; typeindex++) {
895 if (tentry.volumeId[typeindex] != newentry->volumeId[typeindex]) {
896 if (tentry.volumeId[typeindex])
898 UnhashVolid(&ctx, typeindex, blockindex, &tentry))) {
901 /* we must rehash new id if the id is different and the ID is nonzero */
902 hashVol[typeindex] = 1; /* must rehash this guy if he exists */
906 /* Rehash volname if it changes */
907 if (strcmp(newentry->name, tentry.name)) { /* Name changes; redo hashing */
908 if ((code = UnhashVolname(&ctx, blockindex, &tentry))) {
914 /* after this, tentry is new entry, not old one. vldbentry_to_vlentry
915 * doesn't touch hash chains */
916 if ((code = nvldbentry_to_vlentry(&ctx, newentry, &tentry))) {
920 for (typeindex = ROVOL; typeindex <= BACKVOL; typeindex++) {
921 if (hashVol[typeindex] && tentry.volumeId[typeindex]) {
922 if ((code = HashVolid(&ctx, typeindex, blockindex, &tentry))) {
929 HashVolname(&ctx, blockindex, &tentry);
932 ReleaseEntry(&tentry, releasetype); /* Unlock entry if necessary */
933 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
937 END(ubik_EndTrans(ctx.trans));
941 ubik_AbortTrans(ctx.trans);
944 osi_auditU(rxcall, VLReplaceVLEntryEvent, code, AUD_LONG, volid,
950 /* Update a vldb entry (accessed thru its volume id). Almost all of the
951 * entry's fields can be modified in a single call by setting the
952 * appropriate bits in the Mask field in VldbUpdateentry. */
953 /* this routine may never have been tested; use replace entry instead
954 * unless you're brave */
956 SVL_UpdateEntry(struct rx_call *rxcall,
959 struct VldbUpdateEntry *updateentry, /* Update entry copied here */
960 afs_int32 releasetype)
962 int this_op = VLUPDATEENTRY;
964 afs_int32 blockindex, code;
965 struct nvlentry tentry;
966 char rxstr[AFS_RXINFO_LEN];
968 countRequest(this_op);
969 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
971 if ((voltype != -1) && (InvalidVoltype(voltype)))
973 if (releasetype && InvalidReleasetype(releasetype))
974 END(VL_BADRELLOCKTYPE);
975 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
978 VLog(1, ("Update Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
979 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
980 if (blockindex == 0) { /* entry not found */
986 /* Do the actual updating of the entry, tentry. */
988 get_vldbupdateentry(&ctx, blockindex, updateentry, &tentry))) {
992 ReleaseEntry(&tentry, releasetype); /* Unlock entry if necessary */
993 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
996 END(ubik_EndTrans(ctx.trans));
1000 ubik_AbortTrans(ctx.trans);
1003 osi_auditU(rxcall, VLUpdateEntryEvent, code, AUD_LONG, volid,
1010 SVL_UpdateEntryByName(struct rx_call *rxcall,
1012 struct VldbUpdateEntry *updateentry, /* Update entry copied here */
1013 afs_int32 releasetype)
1015 int this_op = VLUPDATEENTRYBYNAME;
1017 afs_int32 blockindex, code;
1018 struct nvlentry tentry;
1020 countRequest(this_op);
1021 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
1023 if (releasetype && InvalidReleasetype(releasetype))
1024 END(VL_BADRELLOCKTYPE);
1025 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
1028 blockindex = FindByName(&ctx, volname, &tentry, &code);
1029 if (blockindex == 0) { /* entry not found */
1035 /* Do the actual updating of the entry, tentry. */
1037 get_vldbupdateentry(&ctx, blockindex, updateentry, &tentry))) {
1041 ReleaseEntry(&tentry, releasetype); /* Unlock entry if necessary */
1042 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
1045 END(ubik_EndTrans(ctx.trans));
1048 countAbort(this_op);
1049 ubik_AbortTrans(ctx.trans);
1052 osi_auditU(rxcall, VLUpdateEntryEvent, code, AUD_LONG, -1, AUD_END);
1057 /* Set a lock to the vldb entry for volid (of type voltype if not -1). */
1059 SVL_SetLock(struct rx_call *rxcall, afs_uint32 volid, afs_int32 voltype,
1062 int this_op = VLSETLOCK;
1063 afs_int32 timestamp, blockindex, code;
1065 struct nvlentry tentry;
1066 char rxstr[AFS_RXINFO_LEN];
1068 countRequest(this_op);
1069 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
1071 if ((voltype != -1) && (InvalidVoltype(voltype)))
1073 if (InvalidOperation(voloper))
1075 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
1078 VLog(1, ("SetLock Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
1079 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
1080 if (blockindex == NULLO) {
1085 if (tentry.flags & VLDELETED) {
1086 ABORT(VL_ENTDELETED);
1088 timestamp = FT_ApproxTime();
1090 /* Check if entry is already locked; note that we unlock any entry
1091 * locked more than MAXLOCKTIME seconds */
1092 if ((tentry.LockTimestamp)
1093 && ((timestamp - tentry.LockTimestamp) < MAXLOCKTIME)) {
1094 ABORT(VL_ENTRYLOCKED);
1097 /* Consider it an unlocked entry: set current timestamp, caller
1098 * and active vol operation */
1099 tentry.LockTimestamp = timestamp;
1100 tentry.LockAfsId = 0; /* Not implemented yet */
1101 if (tentry.flags & VLOP_RELEASE) {
1102 ABORT(VL_RERELEASE);
1104 tentry.flags &= ~VLOP_ALLOPERS; /* Clear any possible older operation bit */
1105 tentry.flags |= voloper;
1107 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
1110 END(ubik_EndTrans(ctx.trans));
1113 countAbort(this_op);
1114 ubik_AbortTrans(ctx.trans);
1117 osi_auditU(rxcall, VLSetLockEvent, code, AUD_LONG, volid, AUD_END);
1122 /* Release an already locked vldb entry. Releasetype determines what
1123 * fields (afsid and/or volume operation) will be cleared along with
1124 * the lock time stamp. */
1127 SVL_ReleaseLock(struct rx_call *rxcall, afs_uint32 volid, afs_int32 voltype,
1128 afs_int32 releasetype)
1130 int this_op = VLRELEASELOCK;
1131 afs_int32 blockindex, code;
1133 struct nvlentry tentry;
1134 char rxstr[AFS_RXINFO_LEN];
1136 countRequest(this_op);
1137 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
1139 if ((voltype != -1) && (InvalidVoltype(voltype)))
1141 if (releasetype && InvalidReleasetype(releasetype))
1142 END(VL_BADRELLOCKTYPE);
1143 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
1146 VLog(1, ("ReleaseLock Volume %u %s\n", volid, rxinfo(rxstr, rxcall)));
1147 blockindex = FindByID(&ctx, volid, voltype, &tentry, &code);
1148 if (blockindex == NULLO) {
1153 if (tentry.flags & VLDELETED) {
1154 ABORT(VL_ENTDELETED);
1157 ReleaseEntry(&tentry, releasetype); /* Unlock the appropriate fields */
1158 if (vlentrywrite(ctx.trans, blockindex, &tentry, sizeof(tentry))) {
1161 END(ubik_EndTrans(ctx.trans));
1164 countAbort(this_op);
1165 ubik_AbortTrans(ctx.trans);
1168 osi_auditU(rxcall, VLReleaseLockEvent, code, AUD_LONG, volid,
1174 /* ListEntry returns a single vldb entry, aentry, with offset previous_index;
1175 * the remaining parameters (i.e. next_index) are used so that sequential
1176 * calls to this routine will get the next (all) vldb entries.
1179 SVL_ListEntry(struct rx_call *rxcall, afs_int32 previous_index,
1180 afs_int32 *count, afs_int32 *next_index,
1181 struct vldbentry *aentry)
1183 int this_op = VLLISTENTRY;
1186 struct nvlentry tentry;
1187 char rxstr[AFS_RXINFO_LEN];
1189 countRequest(this_op);
1190 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1192 VLog(25, ("OListEntry index=%d %s\n", previous_index,
1193 rxinfo(rxstr, rxcall)));
1194 *next_index = NextEntry(&ctx, previous_index, &tentry, count);
1196 code = vlentry_to_vldbentry(&ctx, &tentry, aentry);
1198 countAbort(this_op);
1199 ubik_AbortTrans(ctx.trans);
1203 return (ubik_EndTrans(ctx.trans));
1206 /* ListEntry returns a single vldb entry, aentry, with offset previous_index;
1207 * the remaining parameters (i.e. next_index) are used so that sequential
1208 * calls to this routine will get the next (all) vldb entries.
1211 SVL_ListEntryN(struct rx_call *rxcall, afs_int32 previous_index,
1212 afs_int32 *count, afs_int32 *next_index,
1213 struct nvldbentry *aentry)
1215 int this_op = VLLISTENTRYN;
1218 struct nvlentry tentry;
1219 char rxstr[AFS_RXINFO_LEN];
1221 countRequest(this_op);
1222 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1224 VLog(25, ("ListEntry index=%d %s\n", previous_index, rxinfo(rxstr, rxcall)));
1225 *next_index = NextEntry(&ctx, previous_index, &tentry, count);
1227 code = vlentry_to_nvldbentry(&ctx, &tentry, aentry);
1229 countAbort(this_op);
1230 ubik_AbortTrans(ctx.trans);
1235 return (ubik_EndTrans(ctx.trans));
1239 /* Retrieves in vldbentries all vldb entries that match the specified
1240 * attributes (by server number, partition, volume type, and flag); if volume
1241 * id is specified then the associated list for that entry is returned.
1242 * CAUTION: This could be a very expensive call since in most cases
1243 * sequential search of all vldb entries is performed.
1246 SVL_ListAttributes(struct rx_call *rxcall,
1247 struct VldbListByAttributes *attributes,
1248 afs_int32 *nentries,
1249 bulkentries *vldbentries)
1251 int this_op = VLLISTATTRIBUTES;
1252 int code, allocCount = 0;
1254 struct nvlentry tentry;
1255 struct vldbentry *Vldbentry = 0, *VldbentryFirst = 0, *VldbentryLast = 0;
1257 char rxstr[AFS_RXINFO_LEN];
1259 countRequest(this_op);
1260 vldbentries->bulkentries_val = 0;
1261 vldbentries->bulkentries_len = *nentries = 0;
1262 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1264 allocCount = VLDBALLOCCOUNT;
1265 Vldbentry = VldbentryFirst = vldbentries->bulkentries_val =
1266 malloc(allocCount * sizeof(vldbentry));
1267 if (Vldbentry == NULL) {
1271 VldbentryLast = VldbentryFirst + allocCount;
1272 /* Handle the attribute by volume id totally separate of the rest
1273 * (thus additional Mask values are ignored if VLLIST_VOLUMEID is set!) */
1274 if (attributes->Mask & VLLIST_VOLUMEID) {
1275 afs_int32 blockindex;
1278 FindByID(&ctx, attributes->volumeid, -1, &tentry, &code);
1279 if (blockindex == 0) {
1285 code = put_attributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1286 &VldbentryLast, vldbentries, &tentry,
1287 nentries, &allocCount);
1291 afs_int32 nextblockindex = 0, count = 0, k = 0, match = 0;
1292 while ((nextblockindex =
1293 NextEntry(&ctx, nextblockindex, &tentry, &count))) {
1294 if (++pollcount > 50) {
1295 #ifndef AFS_PTHREAD_ENV
1301 if (attributes->Mask & VLLIST_SERVER) {
1304 IpAddrToRelAddr(&ctx, attributes->server, 0)) == -1)
1306 for (k = 0; k < OMAXNSERVERS; k++) {
1307 if (tentry.serverNumber[k] == BADSERVERID)
1309 if (tentry.serverNumber[k] == serverindex) {
1317 if (attributes->Mask & VLLIST_PARTITION) {
1319 if (tentry.serverPartition[k] != attributes->partition)
1322 for (k = 0; k < OMAXNSERVERS; k++) {
1323 if (tentry.serverNumber[k] == BADSERVERID)
1325 if (tentry.serverPartition[k] ==
1326 attributes->partition) {
1336 if (attributes->Mask & VLLIST_FLAG) {
1337 if (!(tentry.flags & attributes->flag))
1340 code = put_attributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1341 &VldbentryLast, vldbentries, &tentry,
1342 nentries, &allocCount);
1347 if (vldbentries->bulkentries_len
1348 && (allocCount > vldbentries->bulkentries_len)) {
1350 vldbentries->bulkentries_val =
1351 realloc(vldbentries->bulkentries_val,
1352 vldbentries->bulkentries_len * sizeof(vldbentry));
1353 if (vldbentries->bulkentries_val == NULL) {
1359 ("ListAttrs nentries=%d %s\n", vldbentries->bulkentries_len,
1360 rxinfo(rxstr, rxcall)));
1361 return (ubik_EndTrans(ctx.trans));
1364 if (vldbentries->bulkentries_val)
1365 free(vldbentries->bulkentries_val);
1366 vldbentries->bulkentries_val = 0;
1367 vldbentries->bulkentries_len = 0;
1369 countAbort(this_op);
1370 ubik_AbortTrans(ctx.trans);
1376 SVL_ListAttributesN(struct rx_call *rxcall,
1377 struct VldbListByAttributes *attributes,
1378 afs_int32 *nentries,
1379 nbulkentries *vldbentries)
1381 int this_op = VLLISTATTRIBUTESN;
1382 int code, allocCount = 0;
1384 struct nvlentry tentry;
1385 struct nvldbentry *Vldbentry = 0, *VldbentryFirst = 0, *VldbentryLast = 0;
1387 char rxstr[AFS_RXINFO_LEN];
1389 countRequest(this_op);
1390 vldbentries->nbulkentries_val = 0;
1391 vldbentries->nbulkentries_len = *nentries = 0;
1392 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1394 allocCount = VLDBALLOCCOUNT;
1395 Vldbentry = VldbentryFirst = vldbentries->nbulkentries_val =
1396 malloc(allocCount * sizeof(nvldbentry));
1397 if (Vldbentry == NULL) {
1401 VldbentryLast = VldbentryFirst + allocCount;
1402 /* Handle the attribute by volume id totally separate of the rest
1403 * (thus additional Mask values are ignored if VLLIST_VOLUMEID is set!) */
1404 if (attributes->Mask & VLLIST_VOLUMEID) {
1405 afs_int32 blockindex;
1408 FindByID(&ctx, attributes->volumeid, -1, &tentry, &code);
1409 if (blockindex == 0) {
1415 code = put_nattributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1416 &VldbentryLast, vldbentries, &tentry,
1417 0, 0, nentries, &allocCount);
1421 afs_int32 nextblockindex = 0, count = 0, k = 0, match = 0;
1422 while ((nextblockindex =
1423 NextEntry(&ctx, nextblockindex, &tentry, &count))) {
1424 if (++pollcount > 50) {
1425 #ifndef AFS_PTHREAD_ENV
1432 if (attributes->Mask & VLLIST_SERVER) {
1435 IpAddrToRelAddr(&ctx, attributes->server, 0)) == -1)
1437 for (k = 0; k < NMAXNSERVERS; k++) {
1438 if (tentry.serverNumber[k] == BADSERVERID)
1440 if (tentry.serverNumber[k] == serverindex) {
1448 if (attributes->Mask & VLLIST_PARTITION) {
1450 if (tentry.serverPartition[k] != attributes->partition)
1453 for (k = 0; k < NMAXNSERVERS; k++) {
1454 if (tentry.serverNumber[k] == BADSERVERID)
1456 if (tentry.serverPartition[k] ==
1457 attributes->partition) {
1467 if (attributes->Mask & VLLIST_FLAG) {
1468 if (!(tentry.flags & attributes->flag))
1471 code = put_nattributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1472 &VldbentryLast, vldbentries,
1473 &tentry, 0, 0, nentries, &allocCount);
1478 if (vldbentries->nbulkentries_len
1479 && (allocCount > vldbentries->nbulkentries_len)) {
1481 vldbentries->nbulkentries_val =
1482 realloc(vldbentries->nbulkentries_val,
1483 vldbentries->nbulkentries_len * sizeof(nvldbentry));
1484 if (vldbentries->nbulkentries_val == NULL) {
1490 ("NListAttrs nentries=%d %s\n", vldbentries->nbulkentries_len,
1491 rxinfo(rxstr, rxcall)));
1492 return (ubik_EndTrans(ctx.trans));
1495 countAbort(this_op);
1496 ubik_AbortTrans(ctx.trans);
1497 if (vldbentries->nbulkentries_val)
1498 free(vldbentries->nbulkentries_val);
1499 vldbentries->nbulkentries_val = 0;
1500 vldbentries->nbulkentries_len = 0;
1506 SVL_ListAttributesN2(struct rx_call *rxcall,
1507 struct VldbListByAttributes *attributes,
1508 char *name, /* Wildcarded volume name */
1509 afs_int32 startindex,
1510 afs_int32 *nentries,
1511 nbulkentries *vldbentries,
1512 afs_int32 *nextstartindex)
1514 int this_op = VLLISTATTRIBUTESN2;
1515 int code = 0, maxCount = VLDBALLOCCOUNT;
1517 struct nvlentry tentry;
1518 struct nvldbentry *Vldbentry = 0, *VldbentryFirst = 0, *VldbentryLast = 0;
1519 afs_int32 blockindex = 0, count = 0, k, match;
1520 afs_int32 matchindex = 0;
1521 int serverindex = -1; /* no server found */
1522 int findserver = 0, findpartition = 0, findflag = 0, findname = 0;
1524 int namematchRWBK, namematchRO, thismatch;
1526 char volumename[VL_MAXNAMELEN+2]; /* regex anchors */
1527 char rxstr[AFS_RXINFO_LEN];
1528 #ifdef HAVE_POSIX_REGEX
1530 int need_regfree = 0;
1535 countRequest(this_op);
1536 vldbentries->nbulkentries_val = 0;
1537 vldbentries->nbulkentries_len = 0;
1539 *nextstartindex = -1;
1541 code = Init_VLdbase(&ctx, LOCKREAD, this_op);
1545 Vldbentry = VldbentryFirst = vldbentries->nbulkentries_val =
1546 malloc(maxCount * sizeof(nvldbentry));
1547 if (Vldbentry == NULL) {
1548 countAbort(this_op);
1549 ubik_AbortTrans(ctx.trans);
1553 VldbentryLast = VldbentryFirst + maxCount;
1555 /* Handle the attribute by volume id totally separate of the rest
1556 * (thus additional Mask values are ignored if VLLIST_VOLUMEID is set!)
1558 if (attributes->Mask & VLLIST_VOLUMEID) {
1560 FindByID(&ctx, attributes->volumeid, -1, &tentry, &code);
1561 if (blockindex == 0) {
1566 put_nattributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1567 &VldbentryLast, vldbentries, &tentry, 0,
1568 0, nentries, &maxCount);
1574 /* Search each entry in the database and return all entries
1575 * that match the request. It checks volumename (with
1576 * wildcarding), entry flags, server, and partition.
1579 /* Get the server index for matching server address */
1580 if (attributes->Mask & VLLIST_SERVER) {
1582 IpAddrToRelAddr(&ctx, attributes->server, 0);
1583 if (serverindex == -1)
1587 findpartition = ((attributes->Mask & VLLIST_PARTITION) ? 1 : 0);
1588 findflag = ((attributes->Mask & VLLIST_FLAG) ? 1 : 0);
1589 if (name && (strcmp(name, ".*") != 0) && (strcmp(name, "") != 0)) {
1590 sprintf(volumename, "^%s$", name);
1591 #ifdef HAVE_POSIX_REGEX
1592 if (regcomp(&re, volumename, REG_NOSUB) != 0) {
1598 t = (char *)re_comp(volumename);
1607 /* Read each entry and see if it is the one we want */
1608 blockindex = startindex;
1609 while ((blockindex = NextEntry(&ctx, blockindex, &tentry, &count))) {
1610 if (++pollcount > 50) {
1611 #ifndef AFS_PTHREAD_ENV
1617 /* Step through each server index searching for a match.
1618 * Match to an existing RW, BK, or RO volume name (preference
1619 * is in this order). Remember which index we matched against.
1621 namematchRWBK = namematchRO = 0; /* 0->notTried; 1->match; 2->noMatch */
1625 && (tentry.serverNumber[k] != BADSERVERID)); k++) {
1626 thismatch = 0; /* does this index match */
1628 /* Match against the RW or BK volume name. Remember
1629 * results in namematchRWBK. Prefer RW over BK.
1631 if (tentry.serverFlags[k] & VLSF_RWVOL) {
1632 /* Does the name match the RW name */
1633 if (tentry.flags & VLF_RWEXISTS) {
1635 sprintf(volumename, "%s", tentry.name);
1636 #ifdef HAVE_POSIX_REGEX
1637 if (regexec(&re, volumename, 0, NULL, 0) == 0) {
1638 thismatch = VLSF_RWVOL;
1641 if (re_exec(volumename)) {
1642 thismatch = VLSF_RWVOL;
1646 thismatch = VLSF_RWVOL;
1650 /* Does the name match the BK name */
1651 if (!thismatch && (tentry.flags & VLF_BACKEXISTS)) {
1653 sprintf(volumename, "%s.backup", tentry.name);
1654 #ifdef HAVE_POSIX_REGEX
1655 if (regexec(&re, volumename, 0, NULL, 0) == 0) {
1656 thismatch = VLSF_BACKVOL;
1659 if (re_exec(volumename)) {
1660 thismatch = VLSF_BACKVOL;
1664 thismatch = VLSF_BACKVOL;
1668 namematchRWBK = (thismatch ? 1 : 2);
1671 /* Match with the RO volume name. Compare once and
1672 * remember results in namematchRO. Note that this will
1673 * pick up entries marked NEWREPSITEs and DONTUSE.
1676 if (tentry.flags & VLF_ROEXISTS) {
1680 ((namematchRO == 1) ? VLSF_ROVOL : 0);
1682 sprintf(volumename, "%s.readonly",
1684 #ifdef HAVE_POSIX_REGEX
1685 if (regexec(&re, volumename, 0, NULL, 0) == 0) {
1686 thismatch = VLSF_ROVOL;
1689 if (re_exec(volumename))
1690 thismatch = VLSF_ROVOL;
1694 thismatch = VLSF_ROVOL;
1697 namematchRO = (thismatch ? 1 : 2);
1700 /* Is there a server match */
1701 if (thismatch && findserver
1702 && (tentry.serverNumber[k] != serverindex))
1705 /* Is there a partition match */
1706 if (thismatch && findpartition
1707 && (tentry.serverPartition[k] != attributes->partition))
1710 /* Is there a flag match */
1711 if (thismatch && findflag
1712 && !(tentry.flags & attributes->flag))
1715 /* We found a match. Remember the index, and type */
1719 matchtype = thismatch;
1722 /* Since we prefer RW and BK volume matches over RO matches,
1723 * if we have already checked the RWBK name, then we already
1724 * found the best match and so end the search.
1726 * If we tried matching against the RW, BK, and RO volume names
1727 * and both failed, then we end the search (none will match).
1729 if ((match && namematchRWBK)
1730 || ((namematchRWBK == 2) && (namematchRO == 2)))
1734 /* Passed all the tests. Take it */
1737 put_nattributeentry(&ctx, &Vldbentry, &VldbentryFirst,
1738 &VldbentryLast, vldbentries, &tentry,
1739 matchtype, matchindex, nentries,
1744 if (*nentries >= maxCount)
1745 break; /* collected the max */
1748 *nextstartindex = (blockindex ? blockindex : -1);
1752 #ifdef HAVE_POSIX_REGEX
1758 countAbort(this_op);
1759 ubik_AbortTrans(ctx.trans);
1760 if (vldbentries->nbulkentries_val)
1761 free(vldbentries->nbulkentries_val);
1762 vldbentries->nbulkentries_val = 0;
1763 vldbentries->nbulkentries_len = 0;
1764 *nextstartindex = -1;
1768 ("N2ListAttrs nentries=%d %s\n", vldbentries->nbulkentries_len,
1769 rxinfo(rxstr, rxcall)));
1770 return (ubik_EndTrans(ctx.trans));
1775 /* Retrieves in vldbentries all vldb entries that match the specified
1776 * attributes (by server number, partition, volume type, and flag); if
1777 * volume id is specified then the associated list for that entry is
1778 * returned. CAUTION: This could be a very expensive call since in most
1779 * cases sequential search of all vldb entries is performed.
1782 SVL_LinkedList(struct rx_call *rxcall,
1783 struct VldbListByAttributes *attributes,
1784 afs_int32 *nentries,
1785 vldb_list *vldbentries)
1787 int this_op = VLLINKEDLIST;
1790 struct nvlentry tentry;
1791 vldblist vllist, *vllistptr;
1792 afs_int32 blockindex, count, match;
1797 countRequest(this_op);
1798 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1802 vldbentries->node = NULL;
1803 vllistptr = &vldbentries->node;
1805 /* List by volumeid */
1806 if (attributes->Mask & VLLIST_VOLUMEID) {
1808 FindByID(&ctx, attributes->volumeid, -1, &tentry, &code);
1815 vllist = malloc(sizeof(single_vldbentry));
1816 if (vllist == NULL) {
1820 code = vlentry_to_vldbentry(&ctx, &tentry, &vllist->VldbEntry);
1824 vllist->next_vldb = NULL;
1826 *vllistptr = vllist; /* Thread onto list */
1827 vllistptr = &vllist->next_vldb;
1831 /* Search by server, partition, and flags */
1833 for (blockindex = NextEntry(&ctx, 0, &tentry, &count); blockindex;
1834 blockindex = NextEntry(&ctx, blockindex, &tentry, &count)) {
1837 if (++pollcount > 50) {
1838 #ifndef AFS_PTHREAD_ENV
1844 /* Does this volume exist on the desired server */
1845 if (attributes->Mask & VLLIST_SERVER) {
1847 IpAddrToRelAddr(&ctx, attributes->server, 0);
1848 if (serverindex == -1)
1850 for (k = 0; k < OMAXNSERVERS; k++) {
1851 if (tentry.serverNumber[k] == BADSERVERID)
1853 if (tentry.serverNumber[k] == serverindex) {
1862 /* Does this volume exist on the desired partition */
1863 if (attributes->Mask & VLLIST_PARTITION) {
1865 if (tentry.serverPartition[k] != attributes->partition)
1868 for (k = 0; k < OMAXNSERVERS; k++) {
1869 if (tentry.serverNumber[k] == BADSERVERID)
1871 if (tentry.serverPartition[k] ==
1872 attributes->partition) {
1882 /* Does this volume have the desired flags */
1883 if (attributes->Mask & VLLIST_FLAG) {
1884 if (!(tentry.flags & attributes->flag))
1888 vllist = malloc(sizeof(single_vldbentry));
1889 if (vllist == NULL) {
1893 code = vlentry_to_vldbentry(&ctx, &tentry, &vllist->VldbEntry);
1897 vllist->next_vldb = NULL;
1899 *vllistptr = vllist; /* Thread onto list */
1900 vllistptr = &vllist->next_vldb;
1902 if (smallMem && (*nentries >= VLDBALLOCCOUNT)) {
1903 code = VL_SIZEEXCEEDED;
1909 return (ubik_EndTrans(ctx.trans));
1912 countAbort(this_op);
1913 ubik_AbortTrans(ctx.trans);
1918 SVL_LinkedListN(struct rx_call *rxcall,
1919 struct VldbListByAttributes *attributes,
1920 afs_int32 *nentries,
1921 nvldb_list *vldbentries)
1923 int this_op = VLLINKEDLISTN;
1926 struct nvlentry tentry;
1927 nvldblist vllist, *vllistptr;
1928 afs_int32 blockindex, count, match;
1933 countRequest(this_op);
1934 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
1938 vldbentries->node = NULL;
1939 vllistptr = &vldbentries->node;
1941 /* List by volumeid */
1942 if (attributes->Mask & VLLIST_VOLUMEID) {
1944 FindByID(&ctx, attributes->volumeid, -1, &tentry, &code);
1951 vllist = malloc(sizeof(single_nvldbentry));
1952 if (vllist == NULL) {
1956 code = vlentry_to_nvldbentry(&ctx, &tentry, &vllist->VldbEntry);
1960 vllist->next_vldb = NULL;
1962 *vllistptr = vllist; /* Thread onto list */
1963 vllistptr = &vllist->next_vldb;
1967 /* Search by server, partition, and flags */
1969 for (blockindex = NextEntry(&ctx, 0, &tentry, &count); blockindex;
1970 blockindex = NextEntry(&ctx, blockindex, &tentry, &count)) {
1973 if (++pollcount > 50) {
1974 #ifndef AFS_PTHREAD_ENV
1980 /* Does this volume exist on the desired server */
1981 if (attributes->Mask & VLLIST_SERVER) {
1983 IpAddrToRelAddr(&ctx, attributes->server, 0);
1984 if (serverindex == -1)
1986 for (k = 0; k < NMAXNSERVERS; k++) {
1987 if (tentry.serverNumber[k] == BADSERVERID)
1989 if (tentry.serverNumber[k] == serverindex) {
1998 /* Does this volume exist on the desired partition */
1999 if (attributes->Mask & VLLIST_PARTITION) {
2001 if (tentry.serverPartition[k] != attributes->partition)
2004 for (k = 0; k < NMAXNSERVERS; k++) {
2005 if (tentry.serverNumber[k] == BADSERVERID)
2007 if (tentry.serverPartition[k] ==
2008 attributes->partition) {
2018 /* Does this volume have the desired flags */
2019 if (attributes->Mask & VLLIST_FLAG) {
2020 if (!(tentry.flags & attributes->flag))
2024 vllist = malloc(sizeof(single_nvldbentry));
2025 if (vllist == NULL) {
2029 code = vlentry_to_nvldbentry(&ctx, &tentry, &vllist->VldbEntry);
2033 vllist->next_vldb = NULL;
2035 *vllistptr = vllist; /* Thread onto list */
2036 vllistptr = &vllist->next_vldb;
2038 if (smallMem && (*nentries >= VLDBALLOCCOUNT)) {
2039 code = VL_SIZEEXCEEDED;
2045 return (ubik_EndTrans(ctx.trans));
2048 countAbort(this_op);
2049 ubik_AbortTrans(ctx.trans);
2053 /* Get back vldb header statistics (allocs, frees, maxvolumeid,
2054 * totalentries, etc) and dynamic statistics (number of requests and/or
2055 * aborts per remote procedure call, etc)
2058 SVL_GetStats(struct rx_call *rxcall,
2060 vital_vlheader *vital_header)
2062 int this_op = VLGETSTATS;
2065 char rxstr[AFS_RXINFO_LEN];
2067 countRequest(this_op);
2069 /* Allow users to get statistics freely */
2070 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL)) /* Must be in 'UserList' to use */
2073 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
2075 VLog(5, ("GetStats %s\n", rxinfo(rxstr, rxcall)));
2076 memcpy((char *)vital_header, (char *)&ctx.cheader->vital_header,
2077 sizeof(vital_vlheader));
2078 memcpy((char *)stats, (char *)&dynamic_statistics, sizeof(vldstats));
2079 return (ubik_EndTrans(ctx.trans));
2082 /* Get the list of file server addresses from the VLDB. Currently it's pretty
2083 * easy to do. In the future, it might require a little bit of grunging
2084 * through the VLDB, but that's life.
2087 SVL_GetAddrs(struct rx_call *rxcall,
2090 struct VLCallBack *spare3,
2091 afs_int32 *nentries,
2094 int this_op = VLGETADDRS;
2100 countRequest(this_op);
2101 addrsp->bulkaddrs_len = *nentries = 0;
2102 addrsp->bulkaddrs_val = 0;
2103 memset(spare3, 0, sizeof(struct VLCallBack));
2105 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
2108 VLog(5, ("GetAddrs\n"));
2109 addrsp->bulkaddrs_val = taddrp =
2110 malloc(sizeof(afs_int32) * (MAXSERVERID + 1));
2111 nservers = *nentries = addrsp->bulkaddrs_len = 0;
2118 for (i = 0; i <= MAXSERVERID; i++) {
2119 if ((*taddrp = ntohl(ctx.cheader->IpMappedAddr[i]))) {
2125 addrsp->bulkaddrs_len = *nentries = nservers;
2126 return (ubik_EndTrans(ctx.trans));
2129 countAbort(this_op);
2130 ubik_AbortTrans(ctx.trans);
2134 #define PADDR(addr) VLog(0,("%d.%d.%d.%d", (addr>>24)&0xff, (addr>>16)&0xff, (addr>>8) &0xff, addr&0xff));
2137 SVL_RegisterAddrs(struct rx_call *rxcall, afsUUID *uuidp, afs_int32 spare1,
2140 int this_op = VLREGADDR;
2143 int cnt, h, i, j, k, m;
2144 struct extentaddr *exp = 0, *tex;
2146 afs_uint32 addrs[VL_MAXIPADDRS_PERMH];
2148 int count, willChangeEntry, foundUuidEntry, willReplaceCnt;
2149 int WillReplaceEntry, WillChange[MAXSERVERID + 1];
2151 int ReplaceEntry = 0;
2154 countRequest(this_op);
2155 if (!afsconf_SuperUser(vldb_confdir, rxcall, NULL))
2157 if ((code = Init_VLdbase(&ctx, LOCKWRITE, this_op)))
2160 /* Eliminate duplicates from IP address list */
2161 for (k = 0, cnt = 0; k < addrsp->bulkaddrs_len; k++) {
2162 if (addrsp->bulkaddrs_val[k] == 0)
2164 for (m = 0; m < cnt; m++) {
2165 if (addrs[m] == addrsp->bulkaddrs_val[k])
2169 if (m == VL_MAXIPADDRS_PERMH) {
2171 ("Number of addresses exceeds %d. Cannot register IP addr 0x%x in VLDB\n",
2172 VL_MAXIPADDRS_PERMH, addrsp->bulkaddrs_val[k]));
2174 addrs[m] = addrsp->bulkaddrs_val[k];
2180 code = VL_INDEXERANGE;
2187 /* For each server registered within the VLDB */
2188 for (srvidx = 0; srvidx <= MAXSERVERID; srvidx++) {
2189 willChangeEntry = 0;
2190 WillReplaceEntry = 1;
2191 code = multiHomedExtent(&ctx, srvidx, &exp);
2196 /* See if the addresses to register will change this server entry */
2197 tuuid = exp->ex_hostuuid;
2198 afs_ntohuuid(&tuuid);
2199 if (afs_uuid_equal(uuidp, &tuuid)) {
2203 for (mhidx = 0; mhidx < VL_MAXIPADDRS_PERMH; mhidx++) {
2204 if (!exp->ex_addrs[mhidx])
2206 for (k = 0; k < cnt; k++) {
2207 if (ntohl(exp->ex_addrs[mhidx]) == addrs[k]) {
2208 willChangeEntry = 1;
2209 WillChange[count] = srvidx;
2214 WillReplaceEntry = 0;
2218 /* The server is not registered as a multihomed.
2219 * See if the addresses to register will replace this server entry.
2221 for (k = 0; k < cnt; k++) {
2222 if (ctx.hostaddress[srvidx] == addrs[k]) {
2223 willChangeEntry = 1;
2224 WillChange[count] = srvidx;
2225 WillReplaceEntry = 1;
2230 if (willChangeEntry) {
2231 if (WillReplaceEntry) {
2233 ReplaceEntry = srvidx;
2239 /* If we found the uuid in the VLDB and if we are replacing another
2240 * entire entry, then complain and fail. Also, if we did not find
2241 * the uuid in the VLDB and the IP addresses being registered was
2242 * found in more than one other entry, then we don't know which one
2243 * to replace and will complain and fail.
2245 if ((foundUuidEntry && (willReplaceCnt > 0))
2246 || (!foundUuidEntry && (count > 1))) {
2248 ("The following fileserver is being registered in the VLDB:\n"));
2250 for (k = 0; k < cnt; k++) {
2257 if (foundUuidEntry) {
2258 code = multiHomedExtent(&ctx, FoundUuid, &exp);
2260 VLog(0, (" It would have replaced the existing VLDB server "
2262 VLog(0, (" entry %d: [", FoundUuid));
2263 for (mhidx = 0; mhidx < VL_MAXIPADDRS_PERMH; mhidx++) {
2264 if (!exp->ex_addrs[mhidx])
2268 PADDR(ntohl(exp->ex_addrs[mhidx]));
2275 VLog(0, (" Yet another VLDB server entry exists:\n"));
2277 VLog(0, (" Yet other VLDB server entries exist:\n"));
2278 for (j = 0; j < count; j++) {
2279 srvidx = WillChange[j];
2280 VLog(0, (" entry %d: ", srvidx));
2282 code = multiHomedExtent(&ctx, srvidx, &exp);
2288 for (mhidx = 0; mhidx < VL_MAXIPADDRS_PERMH; mhidx++) {
2289 if (!exp->ex_addrs[mhidx])
2293 PADDR(ntohl(exp->ex_addrs[mhidx]));
2297 PADDR(ctx.hostaddress[srvidx]);
2303 VLog(0, (" You must 'vos changeaddr' this other server entry\n"));
2306 (" You must 'vos changeaddr' these other server entries\n"));
2309 (" and/or remove the sysid file from the registering fileserver\n"));
2310 VLog(0, (" before the fileserver can be registered in the VLDB.\n"));
2312 code = VL_MULTIPADDR;
2316 /* Passed the checks. Now find and update the existing mh entry, or create
2319 if (foundUuidEntry) {
2320 /* Found the entry with same uuid. See if we need to change it */
2323 code = multiHomedExtentBase(&ctx, FoundUuid, &exp, &base);
2327 /* Determine if the entry has changed */
2328 for (k = 0; ((k < cnt) && !change); k++) {
2329 if (ntohl(exp->ex_addrs[k]) != addrs[k])
2332 for (; ((k < VL_MAXIPADDRS_PERMH) && !change); k++) {
2333 if (exp->ex_addrs[k] != 0)
2337 return (ubik_EndTrans(ctx.trans));
2341 VLog(0, ("The following fileserver is being registered in the VLDB:\n"));
2343 for (k = 0; k < cnt; k++) {
2350 if (foundUuidEntry) {
2352 (" It will replace the following existing entry in the VLDB (same uuid):\n"));
2353 VLog(0, (" entry %d: [", FoundUuid));
2354 for (k = 0; k < VL_MAXIPADDRS_PERMH; k++) {
2355 if (exp->ex_addrs[k] == 0)
2359 PADDR(ntohl(exp->ex_addrs[k]));
2362 } else if (willReplaceCnt || (count == 1)) {
2363 /* If we are not replacing an entry and there is only one entry to change,
2364 * then we will replace that entry.
2366 if (!willReplaceCnt) {
2367 ReplaceEntry = WillChange[0];
2371 /* Have an entry that needs to be replaced */
2372 code = multiHomedExtentBase(&ctx, ReplaceEntry, &exp, &base);
2378 (" It will replace the following existing entry in the VLDB (new uuid):\n"));
2379 VLog(0, (" entry %d: [", ReplaceEntry));
2380 for (k = 0; k < VL_MAXIPADDRS_PERMH; k++) {
2381 if (exp->ex_addrs[k] == 0)
2385 PADDR(ntohl(exp->ex_addrs[k]));
2389 /* Not a mh entry. So we have to create a new mh entry and
2390 * put it on the ReplaceEntry slot of the ctx.hostaddress array.
2392 VLog(0, (" It will replace existing entry %d, ", ReplaceEntry));
2393 PADDR(ctx.hostaddress[ReplaceEntry]);
2394 VLog(0,(", in the VLDB (new uuid):\n"));
2397 FindExtentBlock(&ctx, uuidp, 1, ReplaceEntry, &exp, &base);
2405 /* There is no entry for this server, must create a new mh entry as
2406 * well as use a new slot of the ctx.hostaddress array.
2408 VLog(0, (" It will create a new entry in the VLDB.\n"));
2409 code = FindExtentBlock(&ctx, uuidp, 1, -1, &exp, &base);
2417 /* Now we have a mh entry to fill in. Update the uuid, bump the
2418 * uniquifier, and fill in its IP addresses.
2421 afs_htonuuid(&tuuid);
2422 exp->ex_hostuuid = tuuid;
2423 exp->ex_uniquifier = htonl(ntohl(exp->ex_uniquifier) + 1);
2424 for (k = 0; k < cnt; k++) {
2425 exp->ex_addrs[k] = htonl(addrs[k]);
2427 for (; k < VL_MAXIPADDRS_PERMH; k++) {
2428 exp->ex_addrs[k] = 0;
2431 /* Write the new mh entry out */
2434 DOFFSET(ntohl(ctx.ex_addr[0]->ex_contaddrs[base]),
2435 (char *)ctx.ex_addr[base], (char *)exp), (char *)exp,
2441 /* Remove any common addresses from other mh entres. We know these entries
2442 * are being changed and not replaced so they are mh entries.
2445 for (i = 0; i < count; i++) {
2448 /* Skip the entry we replaced */
2449 if (willReplaceCnt && (WillChange[i] == ReplaceEntry))
2452 code = multiHomedExtentBase(&ctx, WillChange[i], &tex, &base);
2458 (" The following existing entries in the VLDB will be updated:\n"));
2460 VLog(0, (" entry %d: [", WillChange[i]));
2461 for (h = j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
2462 if (tex->ex_addrs[j]) {
2465 PADDR(ntohl(tex->ex_addrs[j]));
2468 for (k = 0; k < cnt; k++) {
2469 if (ntohl(tex->ex_addrs[j]) == addrs[k])
2473 /* Not found, so we keep it */
2474 tex->ex_addrs[h] = tex->ex_addrs[j];
2478 for (j = h; j < VL_MAXIPADDRS_PERMH; j++) {
2479 tex->ex_addrs[j] = 0; /* zero rest of mh entry */
2483 /* Write out the modified mh entry */
2484 tex->ex_uniquifier = htonl(ntohl(tex->ex_uniquifier) + 1);
2486 DOFFSET(ntohl(ctx.ex_addr[0]->ex_contaddrs[base]),
2487 (char *)ctx.ex_addr[base], (char *)tex);
2488 if (vlwrite(ctx.trans, doff, (char *)tex, sizeof(*tex))) {
2494 return (ubik_EndTrans(ctx.trans));
2497 countAbort(this_op);
2498 ubik_AbortTrans(ctx.trans);
2503 SVL_GetAddrsU(struct rx_call *rxcall,
2504 struct ListAddrByAttributes *attributes,
2506 afs_int32 *uniquifier,
2507 afs_int32 *nentries,
2510 int this_op = VLGETADDRSU;
2511 afs_int32 code, index = -1, offset;
2513 int nservers, i, j, base = 0;
2514 struct extentaddr *exp = 0;
2516 afs_uint32 *taddrp, taddr;
2517 char rxstr[AFS_RXINFO_LEN];
2519 countRequest(this_op);
2520 addrsp->bulkaddrs_len = *nentries = 0;
2521 addrsp->bulkaddrs_val = 0;
2522 VLog(5, ("GetAddrsU %s\n", rxinfo(rxstr, rxcall)));
2523 if ((code = Init_VLdbase(&ctx, LOCKREAD, this_op)))
2526 if (attributes->Mask & VLADDR_IPADDR) {
2527 if (attributes->Mask & (VLADDR_INDEX | VLADDR_UUID)) {
2531 for (base = 0; base < VL_MAX_ADDREXTBLKS; base++) {
2532 if (!ctx.ex_addr[base])
2534 for (i = 1; i < VL_MHSRV_PERBLK; i++) {
2535 exp = &ctx.ex_addr[base][i];
2536 tuuid = exp->ex_hostuuid;
2537 afs_ntohuuid(&tuuid);
2538 if (afs_uuid_is_nil(&tuuid))
2540 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
2541 if (exp->ex_addrs[j]
2542 && (ntohl(exp->ex_addrs[j]) == attributes->ipaddr)) {
2546 if (j < VL_MAXIPADDRS_PERMH)
2549 if (i < VL_MHSRV_PERBLK)
2552 if (base >= VL_MAX_ADDREXTBLKS) {
2556 } else if (attributes->Mask & VLADDR_INDEX) {
2557 if (attributes->Mask & (VLADDR_IPADDR | VLADDR_UUID)) {
2561 index = attributes->index;
2562 if (index < 1 || index >= (VL_MAX_ADDREXTBLKS * VL_MHSRV_PERBLK)) {
2563 code = VL_INDEXERANGE;
2566 base = index / VL_MHSRV_PERBLK;
2567 offset = index % VL_MHSRV_PERBLK;
2572 if (!ctx.ex_addr[base]) {
2573 code = VL_INDEXERANGE;
2576 exp = &ctx.ex_addr[base][offset];
2577 } else if (attributes->Mask & VLADDR_UUID) {
2578 if (attributes->Mask & (VLADDR_IPADDR | VLADDR_INDEX)) {
2582 if (!ctx.ex_addr[0]) { /* mh servers probably aren't setup on this vldb */
2586 code = FindExtentBlock(&ctx, &attributes->uuid, 0, -1, &exp, &base);
2598 addrsp->bulkaddrs_val = taddrp =
2599 malloc(sizeof(afs_int32) * (MAXSERVERID + 1));
2600 nservers = *nentries = addrsp->bulkaddrs_len = 0;
2605 tuuid = exp->ex_hostuuid;
2606 afs_ntohuuid(&tuuid);
2607 if (afs_uuid_is_nil(&tuuid)) {
2614 *uniquifier = ntohl(exp->ex_uniquifier);
2615 for (i = 0; i < VL_MAXIPADDRS_PERMH; i++) {
2616 if (exp->ex_addrs[i]) {
2617 taddr = ntohl(exp->ex_addrs[i]);
2618 /* Weed out duplicates */
2619 for (j = 0; j < nservers; j++) {
2620 if (taddrp[j] == taddr)
2623 if ((j == nservers) && (j <= MAXSERVERID)) {
2624 taddrp[nservers] = taddr;
2629 addrsp->bulkaddrs_len = *nentries = nservers;
2630 return (ubik_EndTrans(ctx.trans));
2633 countAbort(this_op);
2634 ubik_AbortTrans(ctx.trans);
2638 /* ============> End of Exported vldb RPC functions <============= */
2641 /* Routine that copies the given vldb entry to the output buffer, vldbentries. */
2643 put_attributeentry(struct vl_ctx *ctx,
2644 struct vldbentry **Vldbentry,
2645 struct vldbentry **VldbentryFirst,
2646 struct vldbentry **VldbentryLast,
2647 bulkentries *vldbentries,
2648 struct nvlentry *entry,
2649 afs_int32 *nentries,
2650 afs_int32 *alloccnt)
2656 if (*Vldbentry == *VldbentryLast) {
2658 return VL_SIZEEXCEEDED; /* no growing if smallMem defined */
2660 /* Allocate another set of memory; each time allocate twice as
2661 * many blocks as the last time. When we reach VLDBALLOCLIMIT,
2662 * then grow in increments of VLDBALLOCINCR.
2664 allo = (*alloccnt > VLDBALLOCLIMIT) ? VLDBALLOCINCR : *alloccnt;
2665 reall = realloc(*VldbentryFirst,
2666 (*alloccnt + allo) * sizeof(vldbentry));
2670 *VldbentryFirst = vldbentries->bulkentries_val = reall;
2671 *Vldbentry = *VldbentryFirst + *alloccnt;
2672 *VldbentryLast = *Vldbentry + allo;
2676 code = vlentry_to_vldbentry(ctx, entry, *Vldbentry);
2682 vldbentries->bulkentries_len++;
2687 put_nattributeentry(struct vl_ctx *ctx,
2688 struct nvldbentry **Vldbentry,
2689 struct nvldbentry **VldbentryFirst,
2690 struct nvldbentry **VldbentryLast,
2691 nbulkentries *vldbentries,
2692 struct nvlentry *entry,
2693 afs_int32 matchtype,
2694 afs_int32 matchindex,
2695 afs_int32 *nentries,
2696 afs_int32 *alloccnt)
2702 if (*Vldbentry == *VldbentryLast) {
2704 return VL_SIZEEXCEEDED; /* no growing if smallMem defined */
2706 /* Allocate another set of memory; each time allocate twice as
2707 * many blocks as the last time. When we reach VLDBALLOCLIMIT,
2708 * then grow in increments of VLDBALLOCINCR.
2710 allo = (*alloccnt > VLDBALLOCLIMIT) ? VLDBALLOCINCR : *alloccnt;
2711 reall = realloc(*VldbentryFirst,
2712 (*alloccnt + allo) * sizeof(nvldbentry));
2716 *VldbentryFirst = vldbentries->nbulkentries_val = reall;
2717 *Vldbentry = *VldbentryFirst + *alloccnt;
2718 *VldbentryLast = *Vldbentry + allo;
2721 code = vlentry_to_nvldbentry(ctx, entry, *Vldbentry);
2725 (*Vldbentry)->matchindex = (matchtype << 16) + matchindex;
2728 vldbentries->nbulkentries_len++;
2733 /* Common code to actually remove a vldb entry from the database. */
2735 RemoveEntry(struct vl_ctx *ctx, afs_int32 entryptr,
2736 struct nvlentry *tentry)
2740 if ((code = UnthreadVLentry(ctx, entryptr, tentry)))
2742 if ((code = FreeBlock(ctx, entryptr)))
2748 ReleaseEntry(struct nvlentry *tentry, afs_int32 releasetype)
2750 if (releasetype & LOCKREL_TIMESTAMP)
2751 tentry->LockTimestamp = 0;
2752 if (releasetype & LOCKREL_OPCODE)
2753 tentry->flags &= ~VLOP_ALLOPERS;
2754 if (releasetype & LOCKREL_AFSID)
2755 tentry->LockAfsId = 0;
2759 /* Verify that the incoming vldb entry is valid; multi type of error codes
2762 check_vldbentry(struct vldbentry *aentry)
2766 if (InvalidVolname(aentry->name))
2768 if (aentry->nServers <= 0 || aentry->nServers > OMAXNSERVERS)
2769 return VL_BADSERVER;
2770 for (i = 0; i < aentry->nServers; i++) {
2771 /* if (aentry->serverNumber[i] < 0 || aentry->serverNumber[i] > MAXSERVERID)
2772 return VL_BADSERVER; */
2773 if (aentry->serverPartition[i] < 0
2774 || aentry->serverPartition[i] > MAXPARTITIONID)
2775 return VL_BADPARTITION;
2776 if (aentry->serverFlags[i] < 0
2777 || aentry->serverFlags[i] > MAXSERVERFLAG)
2778 return VL_BADSERVERFLAG;
2784 check_nvldbentry(struct nvldbentry *aentry)
2788 if (InvalidVolname(aentry->name))
2790 if (aentry->nServers <= 0 || aentry->nServers > NMAXNSERVERS)
2791 return VL_BADSERVER;
2792 for (i = 0; i < aentry->nServers; i++) {
2793 /* if (aentry->serverNumber[i] < 0 || aentry->serverNumber[i] > MAXSERVERID)
2794 return VL_BADSERVER; */
2795 if (aentry->serverPartition[i] < 0
2796 || aentry->serverPartition[i] > MAXPARTITIONID)
2797 return VL_BADPARTITION;
2798 if (aentry->serverFlags[i] < 0
2799 || aentry->serverFlags[i] > MAXSERVERFLAG)
2800 return VL_BADSERVERFLAG;
2806 /* Convert from the external vldb entry representation to its internal
2807 (more compact) form. This call should not change the hash chains! */
2809 vldbentry_to_vlentry(struct vl_ctx *ctx,
2810 struct vldbentry *VldbEntry,
2811 struct nvlentry *VlEntry)
2815 if (strcmp(VlEntry->name, VldbEntry->name))
2816 strncpy(VlEntry->name, VldbEntry->name, sizeof(VlEntry->name));
2817 for (i = 0; i < VldbEntry->nServers; i++) {
2818 serverindex = IpAddrToRelAddr(ctx, VldbEntry->serverNumber[i], 1);
2819 if (serverindex == -1)
2820 return VL_BADSERVER;
2821 VlEntry->serverNumber[i] = serverindex;
2822 VlEntry->serverPartition[i] = VldbEntry->serverPartition[i];
2823 VlEntry->serverFlags[i] = VldbEntry->serverFlags[i];
2825 for (; i < OMAXNSERVERS; i++)
2826 VlEntry->serverNumber[i] = VlEntry->serverPartition[i] =
2827 VlEntry->serverFlags[i] = BADSERVERID;
2828 for (i = 0; i < MAXTYPES; i++)
2829 VlEntry->volumeId[i] = VldbEntry->volumeId[i];
2830 VlEntry->cloneId = VldbEntry->cloneId;
2831 VlEntry->flags = VldbEntry->flags;
2836 nvldbentry_to_vlentry(struct vl_ctx *ctx,
2837 struct nvldbentry *VldbEntry,
2838 struct nvlentry *VlEntry)
2842 if (strcmp(VlEntry->name, VldbEntry->name))
2843 strncpy(VlEntry->name, VldbEntry->name, sizeof(VlEntry->name));
2844 for (i = 0; i < VldbEntry->nServers; i++) {
2845 serverindex = IpAddrToRelAddr(ctx, VldbEntry->serverNumber[i], 1);
2846 if (serverindex == -1)
2847 return VL_BADSERVER;
2848 VlEntry->serverNumber[i] = serverindex;
2849 VlEntry->serverPartition[i] = VldbEntry->serverPartition[i];
2850 VlEntry->serverFlags[i] = VldbEntry->serverFlags[i];
2852 for (; i < NMAXNSERVERS; i++)
2853 VlEntry->serverNumber[i] = VlEntry->serverPartition[i] =
2854 VlEntry->serverFlags[i] = BADSERVERID;
2855 for (i = 0; i < MAXTYPES; i++)
2856 VlEntry->volumeId[i] = VldbEntry->volumeId[i];
2857 VlEntry->cloneId = VldbEntry->cloneId;
2858 VlEntry->flags = VldbEntry->flags;
2863 /* Update the vldb entry with the new fields as indicated by the value of
2864 * the Mask entry in the updateentry structure. All necessary validation
2865 * checks are performed.
2868 get_vldbupdateentry(struct vl_ctx *ctx,
2869 afs_int32 blockindex,
2870 struct VldbUpdateEntry *updateentry,
2871 struct nvlentry *VlEntry)
2873 int i, j, code, serverindex;
2874 afs_uint32 checkids[MAXTYPES];
2876 /* check if any specified new IDs are already present in the db. Do
2877 * this check before doing anything else, so we don't get a half-
2879 memset(&checkids, 0, sizeof(checkids));
2880 if (updateentry->Mask & VLUPDATE_RWID) {
2881 checkids[RWVOL] = updateentry->spares3; /* rw id */
2883 if (updateentry->Mask & VLUPDATE_READONLYID) {
2884 checkids[ROVOL] = updateentry->ReadOnlyId;
2886 if (updateentry->Mask & VLUPDATE_BACKUPID) {
2887 checkids[BACKVOL] = updateentry->BackupId;
2890 if (EntryIDExists(ctx, checkids, MAXTYPES, &code)) {
2896 if (updateentry->Mask & VLUPDATE_VOLUMENAME) {
2897 struct nvlentry tentry;
2899 if (InvalidVolname(updateentry->name))
2902 if (FindByName(ctx, updateentry->name, &tentry, &code)) {
2903 return VL_NAMEEXIST;
2908 if ((code = UnhashVolname(ctx, blockindex, VlEntry)))
2910 strncpy(VlEntry->name, updateentry->name, sizeof(VlEntry->name));
2911 HashVolname(ctx, blockindex, VlEntry);
2914 if (updateentry->Mask & VLUPDATE_VOLNAMEHASH) {
2915 if ((code = UnhashVolname(ctx, blockindex, VlEntry))) {
2916 if (code != VL_NOENT)
2919 HashVolname(ctx, blockindex, VlEntry);
2922 if (updateentry->Mask & VLUPDATE_FLAGS) {
2923 VlEntry->flags = updateentry->flags;
2925 if (updateentry->Mask & VLUPDATE_CLONEID) {
2926 VlEntry->cloneId = updateentry->cloneId;
2928 if (updateentry->Mask & VLUPDATE_RWID) {
2929 if ((code = UnhashVolid(ctx, RWVOL, blockindex, VlEntry))) {
2930 if (code != VL_NOENT)
2933 VlEntry->volumeId[RWVOL] = updateentry->spares3; /* rw id */
2934 if ((code = HashVolid(ctx, RWVOL, blockindex, VlEntry)))
2937 if (updateentry->Mask & VLUPDATE_READONLYID) {
2938 if ((code = UnhashVolid(ctx, ROVOL, blockindex, VlEntry))) {
2939 if (code != VL_NOENT)
2942 VlEntry->volumeId[ROVOL] = updateentry->ReadOnlyId;
2943 if ((code = HashVolid(ctx, ROVOL, blockindex, VlEntry)))
2946 if (updateentry->Mask & VLUPDATE_BACKUPID) {
2947 if ((code = UnhashVolid(ctx, BACKVOL, blockindex, VlEntry))) {
2948 if (code != VL_NOENT)
2951 VlEntry->volumeId[BACKVOL] = updateentry->BackupId;
2952 if ((code = HashVolid(ctx, BACKVOL, blockindex, VlEntry)))
2955 if (updateentry->Mask & VLUPDATE_REPSITES) {
2956 if (updateentry->nModifiedRepsites <= 0
2957 || updateentry->nModifiedRepsites > OMAXNSERVERS)
2958 return VL_BADSERVER;
2959 for (i = 0; i < updateentry->nModifiedRepsites; i++) {
2960 /* if (updateentry->RepsitesTargetServer[i] < 0 || updateentry->RepsitesTargetServer[i] > MAXSERVERID)
2961 return VL_BADSERVER; */
2962 if (updateentry->RepsitesTargetPart[i] < 0
2963 || updateentry->RepsitesTargetPart[i] > MAXPARTITIONID)
2964 return VL_BADPARTITION;
2965 if (updateentry->RepsitesMask[i] & VLUPDATE_REPS_DELETE) {
2967 repsite_exists(VlEntry,
2968 IpAddrToRelAddr(ctx, updateentry->
2969 RepsitesTargetServer[i],
2971 updateentry->RepsitesTargetPart[i])) !=
2973 repsite_compress(VlEntry, j);
2975 return VL_NOREPSERVER;
2977 if (updateentry->RepsitesMask[i] & VLUPDATE_REPS_ADD) {
2978 /* if (updateentry->RepsitesNewServer[i] < 0 || updateentry->RepsitesNewServer[i] > MAXSERVERID)
2979 return VL_BADSERVER; */
2980 if (updateentry->RepsitesNewPart[i] < 0
2981 || updateentry->RepsitesNewPart[i] > MAXPARTITIONID)
2982 return VL_BADPARTITION;
2985 IpAddrToRelAddr(ctx, updateentry->RepsitesNewServer[i], 1),
2986 updateentry->RepsitesNewPart[i]) != -1)
2987 return VL_DUPREPSERVER;
2989 VlEntry->serverNumber[j] != BADSERVERID
2990 && j < OMAXNSERVERS; j++);
2991 if (j >= OMAXNSERVERS)
2994 IpAddrToRelAddr(ctx, updateentry->RepsitesNewServer[i],
2996 return VL_BADSERVER;
2997 VlEntry->serverNumber[j] = serverindex;
2998 VlEntry->serverPartition[j] = updateentry->RepsitesNewPart[i];
2999 if (updateentry->RepsitesNewFlags[i] < 0
3000 || updateentry->RepsitesNewFlags[i] > MAXSERVERFLAG)
3001 return VL_BADSERVERFLAG;
3002 VlEntry->serverFlags[j] = updateentry->RepsitesNewFlags[i];
3004 if (updateentry->RepsitesMask[i] & VLUPDATE_REPS_MODSERV) {
3005 /*n if (updateentry->RepsitesNewServer[i] < 0 || updateentry->RepsitesNewServer[i] > MAXSERVERID)
3006 return VL_BADSERVER; */
3008 repsite_exists(VlEntry,
3009 IpAddrToRelAddr(ctx, updateentry->
3010 RepsitesTargetServer[i],
3012 updateentry->RepsitesTargetPart[i])) !=
3014 VlEntry->serverNumber[j] =
3015 IpAddrToRelAddr(ctx, updateentry->RepsitesNewServer[i],
3018 return VL_NOREPSERVER;
3020 if (updateentry->RepsitesMask[i] & VLUPDATE_REPS_MODPART) {
3021 if (updateentry->RepsitesNewPart[i] < 0
3022 || updateentry->RepsitesNewPart[i] > MAXPARTITIONID)
3023 return VL_BADPARTITION;
3025 repsite_exists(VlEntry,
3026 IpAddrToRelAddr(ctx, updateentry->
3027 RepsitesTargetServer[i],
3029 updateentry->RepsitesTargetPart[i])) !=
3031 VlEntry->serverPartition[j] =
3032 updateentry->RepsitesNewPart[i];
3034 return VL_NOREPSERVER;
3036 if (updateentry->RepsitesMask[i] & VLUPDATE_REPS_MODFLAG) {
3038 repsite_exists(VlEntry,
3039 IpAddrToRelAddr(ctx, updateentry->
3040 RepsitesTargetServer[i],
3042 updateentry->RepsitesTargetPart[i])) !=
3044 if (updateentry->RepsitesNewFlags[i] < 0
3045 || updateentry->RepsitesNewFlags[i] > MAXSERVERFLAG)
3046 return VL_BADSERVERFLAG;
3047 VlEntry->serverFlags[j] =
3048 updateentry->RepsitesNewFlags[i];
3050 return VL_NOREPSERVER;
3058 /* Check if the specified [server,partition] entry is found in the vldb
3059 * entry's repsite table; it's offset in the table is returned, if it's
3062 repsite_exists(struct nvlentry *VlEntry, int server, int partition)
3066 for (i = 0; VlEntry->serverNumber[i] != BADSERVERID && i < OMAXNSERVERS;
3068 if ((VlEntry->serverNumber[i] == server)
3069 && (VlEntry->serverPartition[i] == partition))
3077 /* Repsite table compression: used when deleting a repsite entry so that
3078 * all active repsite entries are on the top of the table. */
3080 repsite_compress(struct nvlentry *VlEntry, int offset)
3082 int repsite_offset = offset;
3084 VlEntry->serverNumber[repsite_offset] != BADSERVERID
3085 && repsite_offset < OMAXNSERVERS - 1; repsite_offset++) {
3086 VlEntry->serverNumber[repsite_offset] =
3087 VlEntry->serverNumber[repsite_offset + 1];
3088 VlEntry->serverPartition[repsite_offset] =
3089 VlEntry->serverPartition[repsite_offset + 1];
3090 VlEntry->serverFlags[repsite_offset] =
3091 VlEntry->serverFlags[repsite_offset + 1];
3093 VlEntry->serverNumber[repsite_offset] = BADSERVERID;
3097 /* Convert from the internal (compacted) vldb entry to the external
3098 * representation used by the interface. */
3100 vlentry_to_vldbentry(struct vl_ctx *ctx, struct nvlentry *VlEntry,
3101 struct vldbentry *VldbEntry)
3104 struct extentaddr *exp;
3106 memset(VldbEntry, 0, sizeof(struct vldbentry));
3107 strncpy(VldbEntry->name, VlEntry->name, sizeof(VldbEntry->name));
3108 for (i = 0; i < OMAXNSERVERS; i++) {
3109 if (VlEntry->serverNumber[i] == BADSERVERID)
3111 j = VlEntry->serverNumber[i];
3112 code = multiHomedExtent(ctx, VlEntry->serverNumber[i], &exp);
3116 /* For now return the first ip address back */
3117 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
3118 if (exp->ex_addrs[j]) {
3119 VldbEntry->serverNumber[i] = ntohl(exp->ex_addrs[j]);
3124 VldbEntry->serverNumber[i] =
3125 ctx->hostaddress[VlEntry->serverNumber[i]];
3126 VldbEntry->serverPartition[i] = VlEntry->serverPartition[i];
3127 VldbEntry->serverFlags[i] = VlEntry->serverFlags[i];
3129 VldbEntry->nServers = i;
3130 for (i = 0; i < MAXTYPES; i++)
3131 VldbEntry->volumeId[i] = VlEntry->volumeId[i];
3132 VldbEntry->cloneId = VlEntry->cloneId;
3133 VldbEntry->flags = VlEntry->flags;
3139 /* Convert from the internal (compacted) vldb entry to the external
3140 * representation used by the interface. */
3142 vlentry_to_nvldbentry(struct vl_ctx *ctx, struct nvlentry *VlEntry,
3143 struct nvldbentry *VldbEntry)
3146 struct extentaddr *exp;
3148 memset(VldbEntry, 0, sizeof(struct nvldbentry));
3149 strncpy(VldbEntry->name, VlEntry->name, sizeof(VldbEntry->name));
3150 for (i = 0; i < NMAXNSERVERS; i++) {
3151 if (VlEntry->serverNumber[i] == BADSERVERID)
3153 code = multiHomedExtent(ctx, VlEntry->serverNumber[i], &exp);
3158 /* For now return the first ip address back */
3159 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
3160 if (exp->ex_addrs[j]) {
3161 VldbEntry->serverNumber[i] = ntohl(exp->ex_addrs[j]);
3166 VldbEntry->serverNumber[i] =
3167 ctx->hostaddress[VlEntry->serverNumber[i]];
3168 VldbEntry->serverPartition[i] = VlEntry->serverPartition[i];
3169 VldbEntry->serverFlags[i] = VlEntry->serverFlags[i];
3171 VldbEntry->nServers = i;
3172 for (i = 0; i < MAXTYPES; i++)
3173 VldbEntry->volumeId[i] = VlEntry->volumeId[i];
3174 VldbEntry->cloneId = VlEntry->cloneId;
3175 VldbEntry->flags = VlEntry->flags;
3181 vlentry_to_uvldbentry(struct vl_ctx *ctx, struct nvlentry *VlEntry,
3182 struct uvldbentry *VldbEntry)
3185 struct extentaddr *exp;
3187 memset(VldbEntry, 0, sizeof(struct uvldbentry));
3188 strncpy(VldbEntry->name, VlEntry->name, sizeof(VldbEntry->name));
3189 for (i = 0; i < NMAXNSERVERS; i++) {
3190 if (VlEntry->serverNumber[i] == BADSERVERID)
3192 VldbEntry->serverFlags[i] = VlEntry->serverFlags[i];
3193 VldbEntry->serverUnique[i] = 0;
3194 code = multiHomedExtent(ctx, VlEntry->serverNumber[i], &exp);
3201 tuuid = exp->ex_hostuuid;
3202 afs_ntohuuid(&tuuid);
3203 VldbEntry->serverFlags[i] |= VLSF_UUID;
3204 VldbEntry->serverNumber[i] = tuuid;
3205 VldbEntry->serverUnique[i] = ntohl(exp->ex_uniquifier);
3207 VldbEntry->serverNumber[i].time_low =
3208 ctx->hostaddress[VlEntry->serverNumber[i]];
3210 VldbEntry->serverPartition[i] = VlEntry->serverPartition[i];
3213 VldbEntry->nServers = i;
3214 for (i = 0; i < MAXTYPES; i++)
3215 VldbEntry->volumeId[i] = VlEntry->volumeId[i];
3216 VldbEntry->cloneId = VlEntry->cloneId;
3217 VldbEntry->flags = VlEntry->flags;
3222 #define LEGALCHARS ".ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_"
3225 /* Verify that the volname is a valid volume name. */
3227 InvalidVolname(char *volname)
3233 slen = strlen(volname);
3234 if (slen >= VL_MAXNAMELEN)
3236 return (slen != strspn(volname, map));
3240 /* Verify that the given volume type is valid. */
3242 InvalidVoltype(afs_int32 voltype)
3244 if (voltype != RWVOL && voltype != ROVOL && voltype != BACKVOL)
3251 InvalidOperation(afs_int32 voloper)
3253 if (voloper != VLOP_MOVE && voloper != VLOP_RELEASE
3254 && voloper != VLOP_BACKUP && voloper != VLOP_DELETE
3255 && voloper != VLOP_DUMP)
3261 InvalidReleasetype(afs_int32 releasetype)
3263 if ((releasetype & LOCKREL_TIMESTAMP) || (releasetype & LOCKREL_OPCODE)
3264 || (releasetype & LOCKREL_AFSID))
3270 IpAddrToRelAddr(struct vl_ctx *ctx, afs_uint32 ipaddr, int create)
3274 struct extentaddr *exp;
3276 for (i = 0; i <= MAXSERVERID; i++) {
3277 if (ctx->hostaddress[i] == ipaddr)
3279 code = multiHomedExtent(ctx, i, &exp);
3283 for (j = 0; j < VL_MAXIPADDRS_PERMH; j++) {
3284 if (exp->ex_addrs[j] && (ntohl(exp->ex_addrs[j]) == ipaddr)) {
3291 /* allocate the new server a server id pronto */
3293 for (i = 0; i <= MAXSERVERID; i++) {
3294 if (ctx->cheader->IpMappedAddr[i] == 0) {
3295 ctx->cheader->IpMappedAddr[i] = htonl(ipaddr);
3298 DOFFSET(0, ctx->cheader, &ctx->cheader->IpMappedAddr[i]),
3299 (char *)&ctx->cheader->IpMappedAddr[i],
3301 ctx->hostaddress[i] = ipaddr;
3312 ChangeIPAddr(struct vl_ctx *ctx, afs_uint32 ipaddr1, afs_uint32 ipaddr2)
3316 struct extentaddr *exp = NULL;
3320 afs_int32 blockindex, count;
3322 struct nvlentry tentry;
3323 int ipaddr1_id = -1, ipaddr2_id = -1;
3325 /* Don't let addr change to 256.*.*.* : Causes internal error below */
3326 if ((ipaddr2 & 0xff000000) == 0xff000000)
3327 return (VL_BADSERVER);
3329 /* If we are removing an address, ip1 will be -1 and ip2 will be
3330 * the original address. This prevents an older revision vlserver
3331 * from removing the IP address (won't find server 0xfffffff in
3332 * the VLDB). An older revision vlserver does not have the check
3333 * to see if any volumes exist on the server being removed.
3335 if (ipaddr1 == 0xffffffff) {
3340 for (i = 0; i <= MAXSERVERID; i++) {
3341 code = multiHomedExtentBase(ctx, i, &exp, &base);
3346 for (mhidx = 0; mhidx < VL_MAXIPADDRS_PERMH; mhidx++) {
3347 if (!exp->ex_addrs[mhidx])
3349 if (ntohl(exp->ex_addrs[mhidx]) == ipaddr1) {
3352 if (ipaddr2 != 0 && ntohl(exp->ex_addrs[mhidx]) == ipaddr2) {
3357 if (ctx->hostaddress[i] == ipaddr1) {
3361 if (ipaddr2 != 0 && ctx->hostaddress[i] == ipaddr2) {
3366 if (ipaddr1_id >= 0 && (ipaddr2 == 0 || ipaddr2_id >= 0)) {
3367 /* we've either found both IPs already in the VLDB, or we found
3368 * ipaddr1, and we're not going to find ipaddr2 because it's 0 */
3373 if (ipaddr1_id < 0) {
3374 return VL_NOENT; /* not found */
3377 if (ipaddr2_id >= 0 && ipaddr2_id != ipaddr1_id) {
3378 char buf1[16], buf2[16];
3379 VLog(0, ("Cannot change IP address from %s to %s because the latter "
3380 "is in use by server id %d\n",
3381 afs_inet_ntoa_r(htonl(ipaddr1), buf1),
3382 afs_inet_ntoa_r(htonl(ipaddr2), buf2),
3384 return VL_MULTIPADDR;
3387 /* If we are removing a server entry, a volume cannot
3388 * exist on the server. If one does, don't remove the
3389 * server entry: return error "volume entry exists".
3392 for (blockindex = NextEntry(ctx, 0, &tentry, &count); blockindex;
3393 blockindex = NextEntry(ctx, blockindex, &tentry, &count)) {
3394 if (++pollcount > 50) {
3395 #ifndef AFS_PTHREAD_ENV
3400 for (j = 0; j < NMAXNSERVERS; j++) {
3401 if (tentry.serverNumber[j] == BADSERVERID)
3403 if (tentry.serverNumber[j] == ipaddr1_id) {
3410 /* Log a message saying we are changing/removing an IP address */
3412 ("The following IP address is being %s:\n",
3413 (ipaddr2 ? "changed" : "removed")));
3414 VLog(0, (" entry %d: ", i));
3417 for (mhidx = 0; mhidx < VL_MAXIPADDRS_PERMH; mhidx++) {
3418 if (!exp->ex_addrs[mhidx])
3422 PADDR(ntohl(exp->ex_addrs[mhidx]));
3434 /* Change the registered uuuid addresses */
3436 memset(&tuuid, 0, sizeof(afsUUID));
3437 afs_htonuuid(&tuuid);
3438 exp->ex_hostuuid = tuuid;
3441 DOFFSET(ntohl(ctx->ex_addr[0]->ex_contaddrs[base]),
3442 (char *)ctx->ex_addr[base], (char *)exp),
3443 (char *)&tuuid, sizeof(tuuid));
3448 /* Now change the host address entry */
3449 ctx->cheader->IpMappedAddr[ipaddr1_id] = htonl(ipaddr2);
3451 vlwrite(ctx->trans, DOFFSET(0, ctx->cheader, &ctx->cheader->IpMappedAddr[ipaddr1_id]),
3453 &ctx->cheader->IpMappedAddr[ipaddr1_id], sizeof(afs_int32));
3454 ctx->hostaddress[ipaddr1_id] = ipaddr2;
3461 /* see if the vlserver is back yet */
3463 SVL_ProbeServer(struct rx_call *rxcall)