4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2014, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
34 #include <sys/types.h>
44 #include <lustre/lustreapi.h>
46 struct option longopts[] = {
47 { .name = "lookup", .has_arg = no_argument, .val = 'l' },
48 { .name = "random", .has_arg = no_argument, .val = 'r' },
49 { .name = "stat", .has_arg = no_argument, .val = 's' },
52 char *shortopts = "hlr:s0123456789";
54 static int usage(char *prog, FILE *out)
57 "Usage: %s [-r rand_seed] {-s|-l} filenamebase total_files iterations\n"
59 "-s : regular stat() calls\n"
60 "-l : lookup ioctl only\n", prog);
65 #define LONG_MAX (1 << ((8 * sizeof(long)) - 1))
68 int main(int argc, char ** argv)
70 long i, count, iter = LONG_MAX, mode = 0, offset;
71 long int start, length = LONG_MAX, last;
72 char parent[4096], *t;
73 char *prog = argv[0], *base;
77 while ((rc = getopt_long(argc, argv, shortopts, longopts, NULL)) != -1) {
81 seed = strtoul(optarg, &e, 0);
83 fprintf(stderr, "bad -r option %s\n", optarg);
101 if (length == LONG_MAX)
104 length = length * 10 + (rc - '0');
113 if (optind + 2 + (length == LONG_MAX) != argc) {
114 fprintf(stderr, "missing filenamebase, total_files, or iterations\n");
119 if (strlen(base) > 4080) {
120 fprintf(stderr, "filenamebase too long\n");
125 int f = open("/dev/urandom", O_RDONLY);
127 if (f < 0 || read(f, &seed, sizeof(seed)) < sizeof(seed))
133 printf("using seed %u\n", seed);
136 count = strtoul(argv[optind + 1], NULL, 0);
137 if (length == LONG_MAX) {
138 iter = strtoul(argv[optind + 2], NULL, 0);
139 printf("running for %lu iterations\n", iter);
141 printf("running for %lu seconds\n", length);
143 start = last = time(0);
145 t = strrchr(base, '/');
150 strncpy(parent, base, t - base);
151 offset = t - base + 1;
155 fd = open(parent, O_RDONLY);
157 printf("open(%s) error: %s\n", parent,
163 for (i = 0; i < iter && time(0) - start < length; i++) {
167 tmp = random() % count;
168 sprintf(filename, "%s%d", base, tmp);
173 rc = stat(filename, &buf);
175 printf("stat(%s) error: %s\n", filename,
179 } else if (mode == 'l') {
180 char *name = filename;
185 rc = llapi_file_lookup(fd, name);
187 printf("llapi_file_lookup for (%s) error: %s\n",
188 filename, strerror(errno));
192 if ((i % 10000) == 0) {
193 printf(" - stat %lu (time %ld ; total %ld ; last %ld)\n",
194 i, time(0), time(0) - start, time(0) - last);
202 printf("total: %lu stats in %ld seconds: %f stats/second\n", i,
203 time(0) - start, ((float)i / (time(0) - start)));