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"
57 /* forward declarations */
58 void PurgeIndex_r(Volume * vp, VnodeClass class);
59 void PurgeHeader_r(Volume * vp);
62 VPurgeVolume_r(Error * ec, Volume * vp)
64 struct DiskPartition *tpartp = vp->partition;
65 char purgePath[MAXPATHLEN];
67 /* N.B. it's important here to use the partition pointed to by the
68 * volume header. This routine can, under some circumstances, be called
69 * when two volumes with the same id exist on different partitions.
71 (void)afs_snprintf(purgePath, sizeof purgePath, "%s/%s",
72 VPartitionPath(vp->partition),
73 VolumeExternalName(V_id(vp)));
74 PurgeIndex_r(vp, vLarge);
75 PurgeIndex_r(vp, vSmall);
79 * Call the fileserver to break all call backs for that volume
81 FSYNC_askfs(V_id(vp), tpartp->name, FSYNC_RESTOREVOLUME, 0);
85 VPurgeVolume(Error * ec, Volume * vp)
87 VOL_LOCK VPurgeVolume_r(ec, vp);
90 #define MAXOBLITATONCE 200
91 /* delete a portion of an index, adjusting offset appropriately. Returns 0 if
92 things work and we should be called again, 1 if success full and done, and -1
93 if an error occurred. It adjusts offset appropriately on 0 or 1 return codes,
94 and otherwise doesn't touch it */
96 ObliterateRegion(Volume * avp, VnodeClass aclass, StreamHandle_t * afile,
99 register struct VnodeClassInfo *vcp;
100 Inode inodes[MAXOBLITATONCE];
101 register afs_int32 iindex, nscanned;
103 char buf[SIZEOF_LARGEDISKVNODE];
106 register afs_int32 code;
107 register struct VnodeDiskObject *vnode = (struct VnodeDiskObject *)buf;
110 vcp = &VnodeClassInfo[aclass];
111 offset = *aoffset; /* original offset */
114 /* advance over up to MAXOBLITATONCE inodes. nscanned tells us how many we examined.
115 * We remember the inodes in an array, and idec them after zeroing them in the index.
116 * The reason for these contortions is to make volume deletion idempotent, even
117 * if we crash in the middle of a delete operation. */
118 STREAM_SEEK(afile, offset, 0);
120 if (iindex >= MAXOBLITATONCE) {
123 code = STREAM_READ(vnode, vcp->diskSize, 1, afile);
125 offset += vcp->diskSize;
130 if (vnode->type != vNull) {
131 if (vnode->vnodeMagic != vcp->magic)
132 goto fail; /* something really wrong; let salvager take care of it */
133 if (VNDISK_GET_INO(vnode))
134 inodes[iindex++] = VNDISK_GET_INO(vnode);
138 /* next, obliterate the index and fflush (and fsync) it */
139 STREAM_SEEK(afile, *aoffset, 0); /* seek back to start of vnode index region */
140 memset(buf, 0, sizeof(buf)); /* zero out our proto-vnode */
141 for (i = 0; i < nscanned; i++) {
142 if (STREAM_WRITE(buf, vcp->diskSize, 1, afile) != 1)
145 STREAM_FLUSH(afile); /* ensure 0s are on the disk */
146 OS_SYNC(afile->str_fd);
148 /* finally, do the idec's */
149 for (i = 0; i < iindex; i++) {
150 IH_DEC(V_linkHandle(avp), inodes[i], V_parentId(avp));
154 /* return the new offset */
156 return hitEOF; /* return 1 if hit EOF (don't call again), otherwise 0 */
163 PurgeIndex(Volume * vp, VnodeClass class)
165 VOL_LOCK PurgeIndex_r(vp, class);
169 PurgeIndex_r(Volume * vp, VnodeClass class)
171 StreamHandle_t *ifile;
172 struct VnodeClassInfo *vcp = &VnodeClassInfo[class];
174 register afs_int32 code;
178 fdP = IH_OPEN(vp->vnodeIndex[class].handle);
182 ifile = FDH_FDOPEN(fdP, "r+");
184 FDH_REALLYCLOSE(fdP);
188 offset = vcp->diskSize;
190 code = ObliterateRegion(vp, class, ifile, &offset);
192 break; /* if error or hit EOF */
199 PurgeHeader(Volume * vp)
201 VOL_LOCK PurgeHeader_r(vp);
205 PurgeHeader_r(Volume * vp)
207 IH_REALLYCLOSE(V_diskDataHandle(vp));
208 IH_DEC(V_linkHandle(vp), vp->vnodeIndex[vLarge].handle->ih_ino, V_id(vp));
209 IH_DEC(V_linkHandle(vp), vp->vnodeIndex[vSmall].handle->ih_ino, V_id(vp));
210 IH_DEC(V_linkHandle(vp), vp->diskDataHandle->ih_ino, V_id(vp));
212 /* And last, but not least, the link count table itself. */
213 IH_REALLYCLOSE(V_linkHandle(vp));
214 IH_DEC(V_linkHandle(vp), vp->linkHandle->ih_ino, V_parentId(vp));