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>
21 #ifdef HAVE_SYS_FILE_H
25 #include <afs/afsutil.h>
26 #include <rx/rx_queue.h>
29 #include "afs/afsint.h"
33 #include <afs/afssyscalls.h>
40 #include "viceinode.h"
41 #include "partition.h"
42 #include "daemon_com.h"
46 /* forward declarations */
47 static int ObliterateRegion(Volume
* avp
, VnodeClass aclass
, StreamHandle_t
* afile
,
48 afs_foff_t
* aoffset
);
50 static void PurgeIndex(Volume
* vp
, VnodeClass
class);
51 static void PurgeHeader(Volume
* vp
);
54 static void PurgeIndex_r(Volume
* vp
, VnodeClass
class);
55 static void PurgeHeader_r(Volume
* vp
);
57 /* No lock needed. Only the volserver will call this, and only one transaction
58 * can have a given volume (volid/partition pair) in use at a time
61 VPurgeVolume(Error
* ec
, Volume
* vp
)
63 struct DiskPartition64
*tpartp
= vp
->partition
;
64 VolumeId volid
, parent
;
68 parent
= V_parentId(vp
);
70 /* so VCheckDetach doesn't try to update the volume header and
71 * dump spurious errors into the logs */
74 /* N.B. it's important here to use the partition pointed to by the
75 * volume header. This routine can, under some circumstances, be called
76 * when two volumes with the same id exist on different partitions.
78 PurgeIndex_r(vp
, vLarge
);
79 PurgeIndex_r(vp
, vSmall
);
82 code
= VDestroyVolumeDiskHeader(tpartp
, volid
, parent
);
84 Log("VPurgeVolume: Error %ld when destroying volume %lu header\n",
85 afs_printable_int32_ld(code
),
86 afs_printable_uint32_lu(volid
));
90 * Call the fileserver to break all call backs for that volume
92 FSYNC_VolOp(V_id(vp
), tpartp
->name
, FSYNC_VOL_BREAKCBKS
, 0, NULL
);
95 #define MAXOBLITATONCE 200
96 /* delete a portion of an index, adjusting offset appropriately. Returns 0 if
97 things work and we should be called again, 1 if success full and done, and -1
98 if an error occurred. It adjusts offset appropriately on 0 or 1 return codes,
99 and otherwise doesn't touch it */
101 ObliterateRegion(Volume
* avp
, VnodeClass aclass
, StreamHandle_t
* afile
,
102 afs_foff_t
* aoffset
)
104 struct VnodeClassInfo
*vcp
;
105 Inode inodes
[MAXOBLITATONCE
];
106 afs_int32 iindex
, nscanned
;
108 char buf
[SIZEOF_LARGEDISKVNODE
];
112 struct VnodeDiskObject
*vnode
= (struct VnodeDiskObject
*)buf
;
115 vcp
= &VnodeClassInfo
[aclass
];
116 offset
= *aoffset
; /* original offset */
119 /* advance over up to MAXOBLITATONCE inodes. nscanned tells us how many we examined.
120 * We remember the inodes in an array, and idec them after zeroing them in the index.
121 * The reason for these contortions is to make volume deletion idempotent, even
122 * if we crash in the middle of a delete operation. */
123 STREAM_ASEEK(afile
, offset
);
125 if (iindex
>= MAXOBLITATONCE
) {
128 code
= STREAM_READ(vnode
, vcp
->diskSize
, 1, afile
);
130 offset
+= vcp
->diskSize
;
135 if (vnode
->type
!= vNull
) {
136 if (vnode
->vnodeMagic
!= vcp
->magic
)
137 goto fail
; /* something really wrong; let salvager take care of it */
138 if (VNDISK_GET_INO(vnode
))
139 inodes
[iindex
++] = VNDISK_GET_INO(vnode
);
143 /* next, obliterate the index and fflush (and fsync) it */
144 STREAM_ASEEK(afile
, *aoffset
); /* seek back to start of vnode index region */
145 memset(buf
, 0, sizeof(buf
)); /* zero out our proto-vnode */
146 for (i
= 0; i
< nscanned
; i
++) {
147 if (STREAM_WRITE(buf
, vcp
->diskSize
, 1, afile
) != 1)
150 STREAM_FLUSH(afile
); /* ensure 0s are on the disk */
151 OS_SYNC(afile
->str_fd
);
153 /* finally, do the idec's */
154 for (i
= 0; i
< iindex
; i
++) {
155 IH_DEC(V_linkHandle(avp
), inodes
[i
], V_parentId(avp
));
159 /* return the new offset */
161 return hitEOF
; /* return 1 if hit EOF (don't call again), otherwise 0 */
169 PurgeIndex(Volume
* vp
, VnodeClass
class)
172 PurgeIndex_r(vp
, class);
178 PurgeIndex_r(Volume
* vp
, VnodeClass
class)
180 StreamHandle_t
*ifile
;
181 struct VnodeClassInfo
*vcp
= &VnodeClassInfo
[class];
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 */
209 PurgeHeader(Volume
* vp
)
218 PurgeHeader_r(Volume
* vp
)
220 #ifndef AFS_NAMEI_ENV
221 /* namei opens and closes the given ihandle during IH_DEC, so don't try to
222 * also close it here */
223 IH_REALLYCLOSE(V_diskDataHandle(vp
));
225 IH_DEC(V_linkHandle(vp
), vp
->vnodeIndex
[vLarge
].handle
->ih_ino
, V_id(vp
));
226 IH_DEC(V_linkHandle(vp
), vp
->vnodeIndex
[vSmall
].handle
->ih_ino
, V_id(vp
));
227 IH_DEC(V_linkHandle(vp
), vp
->diskDataHandle
->ih_ino
, V_id(vp
));
229 /* And last, but not least, the link count table itself. */
230 IH_DEC(V_linkHandle(vp
), vp
->linkHandle
->ih_ino
, V_parentId(vp
));