2 * Copyright (c) 2000 Silicon Graphics, Inc. All Rights Reserved.
4 * This program is free software; you can redistribute it and/or modify it
5 * under the terms of version 2 of the GNU General Public License as
6 * published by the Free Software Foundation.
8 * This program is distributed in the hope that it would be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
12 * Further, this software is distributed without any warranty that it is
13 * free of the rightful claim of any third person regarding infringement
14 * or the like. Any license provided herein, whether implied or
15 * otherwise, applies only to this software file. Patent licenses, if
16 * any, provided herein do not apply to combinations of this program with
17 * other software, or any other product whatsoever.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write the Free Software Foundation, Inc., 59
21 * Temple Place - Suite 330, Boston MA 02111-1307, USA.
23 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
24 * Mountain View, CA 94043, or:
28 * For further information regarding this notice, see:
30 * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
33 #include <sys/types.h>
46 /*---------------------------------------------------------------------------
48 Test program used to test the DMAPI function dm_get_allocinfo(). The
51 get_allocinfo [-D] [-n nelem] [-o offp] [-s sid] pathname
53 where pathname is the name of a file, 'offp' is a byte offset from the
54 beginning of the file where you want to start dumping, and 'nelem' allows
55 you to specify how many extent structures to use in each dm_get_allocinfo
58 The code checks the returned extents as much as possible for errors.
59 It detects bad ex_type values, verifies that there is always a trailing
60 hole at the end of the file, that the ex_offset of each extent matches the
61 ex_offset+ex_length of the previous extent, and that ex_offset+ex_length
62 is always an even multiple of 512. It verifies that all ex_offset values
63 after the first fall on a 512-byte boundary. It verifies that the '*offp'
64 value returned by dm_get_allocinfo() is 0 at the end of the file, and
65 equals ex_offset+ex_length of the last extent if not at the end of the file.
66 Any error is reported to stderr, and the program then terminates with a
69 The program produces output similar to xfs_bmap in order to make comparison
70 easier. Here is some sample output.
74 0: [0..127]: resv [1..511]
76 Line 1 gives the name of the file and the byte offset within the file where
77 the dump started. Line 2 appears once for each dm_get_allocinfo() call,
78 giving the return value (rc) and the number of extents which were returned.
79 Line 3 is repeated once for each extent. The first field "0:" is the extent
80 number. The second field "[0..127]:" give the starting and ending block for
81 the extent in 512-byte units. The third field is either "resv" to indicate
82 allocated space or "hole" if the extent is a hole. The fourth field
83 "[1..511]" only appears if the dump did not start with byte zero of the
84 first block. In that case, the first number shows the actual byte offset
85 within the block (1 in this case). The second number should always be
86 511 since we always dump to the end of a block.
91 Dump some holey files and compare the output of this program with xfs_bmap.
93 Produce a file with holes, and perform the following tests using just one
95 Dump extents from beginning of the file.
96 Dump from byte 1 of the file.
97 Dump from the last byte of the first extent.
98 Dump from the first byte of the second extent.
99 Dump from the middle of the second extent.
100 Dump the first byte of the last extent.
101 Dump the last byte of the last extent.
102 Dump the first byte after the last extent.
103 Dump starting at an offset way past the end of the file.
105 Produce a fragmented file with many adjacent DM_EXTENT_RES extents.
106 Repeat the above tests.
108 Produce a GRIO file with holes.
109 Repeat the above tests.
111 Run the following shell script.
115 # Dump the same holey file $max times, each time using one less extent
116 # structure than the previous time. The grep and diff code
117 # checks to make sure that you get the same answer each time, no matter
118 # how many extents you use. If all is okay, The only messages you will
119 # see are the "trial $num" messages.
121 max=20 # should be bigger than the number extents in the file
127 ./test_alloc -e $num f1 | grep '\[' > x.$num
135 ----------------------------------------------------------------------------*/
138 extern char *sys_errlist[];
143 static int print_alloc(dm_sessid_t sid, void* hanp, size_t hlen,
144 char *pathname, dm_off_t startoff, u_int nelem);
153 fprintf(stderr, "usage:\t%s [-D] [-n nelem] [-o off] [-s sid] "
154 "pathname\n", Progname);
164 dm_sessid_t sid = DM_NO_SESSION;
165 dm_off_t startoff = 0; /* starting offset */
174 if (Progname = strrchr(argv[0], '/')) {
180 /* Crack and validate the command line options. */
182 while ((opt = getopt(argc, argv, "Dn:o:s:")) != EOF) {
188 nelem = atol(optarg);
191 startoff = atoll(optarg);
200 if (optind + 1 != argc)
202 pathname = argv[optind];
204 if (dm_init_service(&name)) {
205 fprintf(stderr, "dm_init_service failed, %s\n",
210 if (sid == DM_NO_SESSION)
211 find_test_session(&sid);
213 /* Get the file's handle and verify that it is a regular file. */
215 if (dm_path_to_handle(pathname, &hanp, &hlen)) {
216 fprintf(stderr, "can't get handle for %s\n", pathname);
219 if (dm_get_fileattr(sid, hanp, hlen, DM_NO_TOKEN, DM_AT_STAT, &sbuf)) {
220 fprintf(stderr, "dm_get_fileattr failed\n");
223 if (!S_ISREG(sbuf.dt_mode)) {
224 fprintf(stderr, "%s is not a regular file\n", pathname);
228 /* Print the allocation. */
230 if (print_alloc(sid, hanp, hlen, pathname, startoff, nelem))
233 dm_handle_free(hanp, hlen);
256 fprintf(stdout, "%s: starting offset %lld\n", pathname, startoff);
258 fprintf(stdout, "%s: starting offset %d\n", pathname, startoff);
261 /* Allocate space for the number of extents requested by the user. */
263 if ((extent = malloc(nelem * sizeof(*extent))) == NULL) {
264 fprintf(stderr, "can't malloc extent structures\n");
272 rc = dm_get_allocinfo(sid, hanp, hlen, DM_NO_TOKEN, &startoff,
273 nelem, extent, &nelemp);
276 fprintf(stderr, "dm_get_allocinfo failed, %s\n",
281 fprintf(stdout, "\treturned %d, nelemp %d\n", rc, nelemp);
283 fprintf(stdout, " ex_type ex_offset ex_length\n");
285 /* Note: it is possible for nelemp to be zero! */
287 for (i = 0; i < nelemp; i++) {
288 /* The extent must either be reserved space or a hole.
291 switch (extent[i].ex_type) {
299 fprintf(stderr, "invalid extent type %d\n",
306 fprintf(stdout, "\t%d: [%lld..%lld]: %s", num,
308 fprintf(stdout, "\t%d: [%d..%d]: %s", num,
310 extent[i].ex_offset / 512,
311 (extent[i].ex_offset +
312 extent[i].ex_length - 1) / 512, type);
313 if ((extent[i].ex_offset % 512 != 0) ||
314 (endoff % 512 != 0)) {
316 fprintf(stdout, "\t[%lld..%lld]\n",
318 fprintf(stdout, "\t[%d..%d]\n",
320 extent[i].ex_offset % 512,
323 fprintf(stdout, "\n");
327 fprintf(stdout, "%5s %13lld %13lld\n",
329 fprintf(stdout, "%5s %13d %13d\n",
331 type, extent[i].ex_offset,
332 extent[i].ex_length);
335 /* The ex_offset of the first extent should match the
336 'startoff' specified by the caller. The ex_offset
337 in subsequent extents should always match
338 (ex_offset + ex_length) of the previous extent,
339 and should always start on a 512 byte boundary.
342 if (extent[i].ex_offset != endoff) {
344 fprintf(stderr, "new extent (%lld)is not "
345 "adjacent to previous one (%lld)\n",
347 fprintf(stderr, "new extent (%d)is not "
348 "adjacent to previous one (%d)\n",
350 extent[i].ex_offset, endoff);
353 if (num && (extent[i].ex_offset % 512) != 0) {
355 fprintf(stderr, "non-initial ex_offset (%lld) "
357 fprintf(stderr, "non-initial ex_offset (%d) "
359 "is not a 512-byte multiple\n",
360 extent[i].ex_offset);
364 /* Non-initial extents should have ex_length values
365 that are an even multiple of 512. The initial
366 extent should be a multiple of 512 less the offset
367 into the starting 512-byte block.
370 if (((extent[i].ex_offset % 512) + extent[i].ex_length) % 512 != 0) {
371 fprintf(stderr, "ex_length is incorrect based "
372 "upon the ex_offset\n");
376 endoff = extent[i].ex_offset + extent[i].ex_length;
377 num++; /* count of extents printed */
380 /* If not yet at end of file, the startoff parameter should
381 match the ex_offset plus ex_length of the last extent
385 if (rc && startoff != endoff) {
387 fprintf(stderr, "startoff is %lld, should be %lld\n",
389 fprintf(stderr, "startoff is %d, should be %d\n",
395 /* If we are at end of file, the last extent should be a
399 if (!rc && type && strcmp(type, "hole")) {
400 fprintf(stderr, "file didn't end with a hole\n");
405 /* At end of file, startoff should always equal zero. */
408 fprintf(stderr, "ERROR: startoff was not zero at end of file\n");