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 Institution: The Information Technology Center, Carnegie-Mellon University
16 #include <afsconfig.h>
17 #include <afs/param.h>
27 #include <sys/param.h>
39 #include <afs/assert.h>
42 #include "afs/afsint.h"
46 #include <afs/afssyscalls.h>
53 #include "viceinode.h"
54 #include "partition.h"
55 #include "daemon_com.h"
58 /* forward declarations */
59 static int ObliterateRegion(Volume * avp, VnodeClass aclass, StreamHandle_t * afile,
61 static void PurgeIndex(Volume * vp, VnodeClass class);
62 static void PurgeIndex_r(Volume * vp, VnodeClass class);
63 static void PurgeHeader_r(Volume * vp);
64 static void PurgeHeader(Volume * vp);
67 VPurgeVolume_r(Error * ec, Volume * vp)
69 struct DiskPartition *tpartp = vp->partition;
70 char purgePath[MAXPATHLEN];
72 /* N.B. it's important here to use the partition pointed to by the
73 * volume header. This routine can, under some circumstances, be called
74 * when two volumes with the same id exist on different partitions.
76 (void)afs_snprintf(purgePath, sizeof purgePath, "%s/%s",
77 VPartitionPath(vp->partition),
78 VolumeExternalName(V_id(vp)));
79 PurgeIndex_r(vp, vLarge);
80 PurgeIndex_r(vp, vSmall);
84 * Call the fileserver to break all call backs for that volume
86 FSYNC_VolOp(V_id(vp), tpartp->name, FSYNC_VOL_BREAKCBKS, 0, NULL);
90 VPurgeVolume(Error * ec, Volume * vp)
93 VPurgeVolume_r(ec, vp);
97 #define MAXOBLITATONCE 200
98 /* delete a portion of an index, adjusting offset appropriately. Returns 0 if
99 things work and we should be called again, 1 if success full and done, and -1
100 if an error occurred. It adjusts offset appropriately on 0 or 1 return codes,
101 and otherwise doesn't touch it */
103 ObliterateRegion(Volume * avp, VnodeClass aclass, StreamHandle_t * afile,
106 register struct VnodeClassInfo *vcp;
107 Inode inodes[MAXOBLITATONCE];
108 register afs_int32 iindex, nscanned;
110 char buf[SIZEOF_LARGEDISKVNODE];
113 register afs_int32 code;
114 register struct VnodeDiskObject *vnode = (struct VnodeDiskObject *)buf;
117 vcp = &VnodeClassInfo[aclass];
118 offset = *aoffset; /* original offset */
121 /* advance over up to MAXOBLITATONCE inodes. nscanned tells us how many we examined.
122 * We remember the inodes in an array, and idec them after zeroing them in the index.
123 * The reason for these contortions is to make volume deletion idempotent, even
124 * if we crash in the middle of a delete operation. */
125 STREAM_SEEK(afile, offset, 0);
127 if (iindex >= MAXOBLITATONCE) {
130 code = STREAM_READ(vnode, vcp->diskSize, 1, afile);
132 offset += vcp->diskSize;
137 if (vnode->type != vNull) {
138 if (vnode->vnodeMagic != vcp->magic)
139 goto fail; /* something really wrong; let salvager take care of it */
140 if (VNDISK_GET_INO(vnode))
141 inodes[iindex++] = VNDISK_GET_INO(vnode);
145 /* next, obliterate the index and fflush (and fsync) it */
146 STREAM_SEEK(afile, *aoffset, 0); /* seek back to start of vnode index region */
147 memset(buf, 0, sizeof(buf)); /* zero out our proto-vnode */
148 for (i = 0; i < nscanned; i++) {
149 if (STREAM_WRITE(buf, vcp->diskSize, 1, afile) != 1)
152 STREAM_FLUSH(afile); /* ensure 0s are on the disk */
153 OS_SYNC(afile->str_fd);
155 /* finally, do the idec's */
156 for (i = 0; i < iindex; i++) {
157 IH_DEC(V_linkHandle(avp), inodes[i], V_parentId(avp));
161 /* return the new offset */
163 return hitEOF; /* return 1 if hit EOF (don't call again), otherwise 0 */
170 PurgeIndex(Volume * vp, VnodeClass class)
173 PurgeIndex_r(vp, class);
178 PurgeIndex_r(Volume * vp, VnodeClass class)
180 StreamHandle_t *ifile;
181 struct VnodeClassInfo *vcp = &VnodeClassInfo[class];
183 register afs_int32 code;
187 fdP = IH_OPEN(vp->vnodeIndex[class].handle);
191 ifile = FDH_FDOPEN(fdP, "r+");
193 FDH_REALLYCLOSE(fdP);
197 offset = vcp->diskSize;
199 code = ObliterateRegion(vp, class, ifile, &offset);
201 break; /* if error or hit EOF */
208 PurgeHeader(Volume * vp)
216 PurgeHeader_r(Volume * vp)
218 IH_REALLYCLOSE(V_diskDataHandle(vp));
219 IH_DEC(V_linkHandle(vp), vp->vnodeIndex[vLarge].handle->ih_ino, V_id(vp));
220 IH_DEC(V_linkHandle(vp), vp->vnodeIndex[vSmall].handle->ih_ino, V_id(vp));
221 IH_DEC(V_linkHandle(vp), vp->diskDataHandle->ih_ino, V_id(vp));
223 /* And last, but not least, the link count table itself. */
224 IH_REALLYCLOSE(V_linkHandle(vp));
225 IH_DEC(V_linkHandle(vp), vp->linkHandle->ih_ino, V_parentId(vp));