This repository has been archived by the owner on Nov 30, 2017. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 16
/
mdtest.c
3009 lines (2665 loc) · 93.6 KB
/
mdtest.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (C) 2003, The Regents of the University of California.
* Produced at the Lawrence Livermore National Laboratory.
* Written by Christopher J. Morrone <morrone@llnl.gov>,
* Bill Loewe <loewe@loewe.net>, Tyce McLarty <mclarty@llnl.gov>,
* and Ryan Kroiss <rrkroiss@lanl.gov>.
* All rights reserved.
* UCRL-CODE-155800
*
* Please read the COPYRIGHT file.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License (as published by
* the Free Software Foundation) version 2, dated June 1991.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the IMPLIED WARRANTY OF
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* terms and conditions of the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* CVS info:
* $RCSfile: mdtest.c,v $
* $Revision: 1.4 $
* $Date: 2013/11/27 17:05:31 $
* $Author: brettkettering $
*/
#include "mpi.h"
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#ifdef Darwin
#include <sys/param.h>
#include <sys/mount.h>
#else
#include <sys/statfs.h>
#endif
#ifdef _HAS_PLFS
#include <plfs.h>
#include <plfs_error.h>
#include <sys/statvfs.h>
#endif
#include <fcntl.h>
#include <string.h>
#include <unistd.h>
#include <dirent.h>
#include <errno.h>
#include <time.h>
#include <sys/time.h>
#define FILEMODE S_IRUSR|S_IWUSR|S_IRGRP|S_IWGRP|S_IROTH
#define DIRMODE S_IRUSR|S_IWUSR|S_IXUSR|S_IRGRP|S_IWGRP|S_IXGRP|S_IROTH|S_IXOTH
/*
* Try using the system's PATH_MAX, which is what realpath and such use.
*/
#define MAX_LEN PATH_MAX
/*
#define MAX_LEN 1024
*/
#define RELEASE_VERS "1.9.3"
#define TEST_DIR "#test-dir"
#define ITEM_COUNT 25000
typedef struct
{
double entry[10];
} table_t;
int rank;
int size;
unsigned long long* rand_array;
char testdir[MAX_LEN];
char testdirpath[MAX_LEN];
char top_dir[MAX_LEN];
char base_tree_name[MAX_LEN];
char ** filenames = NULL;
char hostname[MAX_LEN];
char unique_dir[MAX_LEN];
char mk_name[MAX_LEN];
char stat_name[MAX_LEN];
char read_name[MAX_LEN];
char rm_name[MAX_LEN];
char unique_mk_dir[MAX_LEN];
char unique_chdir_dir[MAX_LEN];
char unique_stat_dir[MAX_LEN];
char unique_read_dir[MAX_LEN];
char unique_rm_dir[MAX_LEN];
char unique_rm_uni_dir[MAX_LEN];
char * write_buffer = NULL;
char * read_buffer = NULL;
int barriers = 1;
int create_only = 0;
int stat_only = 0;
int read_only = 0;
int remove_only = 0;
int leaf_only = 0;
int branch_factor = 1;
int depth = 0;
/*
* This is likely a small value, but it's sometimes computed by
* branch_factor^(depth+1), so we'll make it a larger variable,
* just in case.
*/
unsigned long long num_dirs_in_tree = 0;
/*
* As we start moving towards Exascale, we could have billions
* of files in a directory. Make room for that possibility with
* a larger variable.
*/
unsigned long long items_per_dir = 0;
int random_seed = 0;
int shared_file = 0;
int files_only = 0;
int dirs_only = 0;
int pre_delay = 0;
int unique_dir_per_task = 0;
int time_unique_dir_overhead = 0;
int verbose = 0;
int throttle = 1;
unsigned long long items = 0;
int collective_creates = 0;
size_t write_bytes = 0;
size_t read_bytes = 0;
int sync_file = 0;
int path_count = 0;
int nstride = 0; /* neighbor stride */
MPI_Comm testcomm;
table_t * summary_table;
#ifdef _HAS_PLFS
char using_plfs_path = 0;
pid_t pid;
uid_t uid;
Plfs_fd *wpfd = NULL;
Plfs_fd *rpfd = NULL;
Plfs_fd *cpfd = NULL;
#endif
/* for making/removing unique directory && stating/deleting subdirectory */
enum {MK_UNI_DIR, STAT_SUB_DIR, READ_SUB_DIR, RM_SUB_DIR, RM_UNI_DIR};
#ifdef __linux__
#define FAIL(msg) do { \
fprintf(stdout, "%s: Process %d(%s): FAILED in %s, %s: %s\n",\
timestamp(), rank, hostname, __func__, \
msg, strerror(errno)); \
fflush(stdout);\
MPI_Abort(MPI_COMM_WORLD, 1); \
} while(0)
#else
#define FAIL(msg) do { \
fprintf(stdout, "%s: Process %d(%s): FAILED at %d, %s: %s\n",\
timestamp(), rank, hostname, __LINE__, \
msg, strerror(errno)); \
fflush(stdout);\
MPI_Abort(MPI_COMM_WORLD, 1); \
} while(0)
#endif
char *timestamp() {
static char datestring[80];
time_t timestamp;
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering timestamp...\n" );
}
fflush(stdout);
timestamp = time(NULL);
strftime(datestring, 80, "%m/%d/%Y %T", localtime(×tamp));
return datestring;
}
int count_tasks_per_node(void) {
char localhost[MAX_LEN],
hostname[MAX_LEN];
int count = 1,
i;
MPI_Status status;
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering count_tasks_per_node...\n" );
fflush( stdout );
}
if (gethostname(localhost, MAX_LEN) != 0) {
FAIL("gethostname()");
}
if (rank == 0) {
/* MPI_receive all hostnames, and compare to local hostname */
for (i = 0; i < size-1; i++) {
MPI_Recv(hostname, MAX_LEN, MPI_CHAR, MPI_ANY_SOURCE,
MPI_ANY_TAG, MPI_COMM_WORLD, &status);
if (strcmp(hostname, localhost) == 0) {
count++;
}
}
} else {
/* MPI_send hostname to root node */
MPI_Send(localhost, MAX_LEN, MPI_CHAR, 0, 0, MPI_COMM_WORLD);
}
MPI_Bcast(&count, 1, MPI_INT, 0, MPI_COMM_WORLD);
return(count);
}
void delay_secs(int delay) {
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering delay_secs...\n" );
fflush( stdout );
}
if (rank == 0 && delay > 0) {
if (verbose >= 1) {
fprintf(stdout, "delaying %d seconds . . .\n", delay);
fflush(stdout);
}
sleep(delay);
}
MPI_Barrier(testcomm);
}
void offset_timers(double * t, int tcount) {
double toffset;
int i;
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering offset_timers...\n" );
fflush( stdout );
}
toffset = MPI_Wtime() - t[tcount];
for (i = 0; i < tcount+1; i++) {
t[i] += toffset;
}
}
void parse_dirpath(char *dirpath_arg) {
char * tmp, * token;
char delimiter_string[3] = { '@', '\n', '\0' };
int i = 0;
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering parse_dirpath...\n" );
fflush( stdout );
}
tmp = dirpath_arg;
if (* tmp != '\0') path_count++;
while (* tmp != '\0') {
if (* tmp == '@') {
path_count++;
}
tmp++;
}
filenames = (char **)malloc(path_count * sizeof(char **));
if (filenames == NULL) {
FAIL("out of memory");
}
token = strtok(dirpath_arg, delimiter_string);
while (token != NULL) {
filenames[i] = token;
token = strtok(NULL, delimiter_string);
i++;
}
}
/*
* This function copies the unique directory name for a given option to
* the "to" parameter. Some memory must be allocated to the "to" parameter.
*/
void unique_dir_access(int opt, char *to) {
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering unique_dir_access...\n" );
fflush( stdout );
}
if (opt == MK_UNI_DIR) {
MPI_Barrier(testcomm);
strcpy( to, unique_chdir_dir );
} else if (opt == STAT_SUB_DIR) {
strcpy( to, unique_stat_dir );
} else if (opt == READ_SUB_DIR) {
strcpy( to, unique_read_dir );
} else if (opt == RM_SUB_DIR) {
strcpy( to, unique_rm_dir );
} else if (opt == RM_UNI_DIR) {
strcpy( to, unique_rm_uni_dir );
}
}
/* helper for creating/removing items */
void create_remove_items_helper(int dirs,
int create, char* path, unsigned long long itemNum) {
unsigned long long i;
char curr_item[MAX_LEN];
#ifdef _HAS_PLFS
int open_flags;
plfs_error_t plfs_ret;
ssize_t bytes_written;
int num_ref;
#endif
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering create_remove_items_helper...\n" );
fflush( stdout );
}
for (i=0; i<items_per_dir; i++) {
if (dirs) {
if (create) {
if (( rank == 0 ) &&
( verbose >= 3 ) &&
((itemNum+i) % ITEM_COUNT==0 && (itemNum+i != 0))) {
printf("V-3: create dir: %llu\n", itemNum+i);
fflush(stdout);
}
//create dirs
sprintf(curr_item, "%s/dir.%s%llu", path, mk_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create_remove_items_helper (dirs create): curr_item is \"%s\"\n", curr_item);
fflush(stdout);
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_mkdir( curr_item, DIRMODE );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL("Unable to plfs_mkdir directory");
}
} else {
if ( mkdir( curr_item, DIRMODE ) == -1 ) {
FAIL("unable to create directory");
}
}
#else
if (mkdir(curr_item, DIRMODE) == -1) {
FAIL("unable to create directory");
}
#endif
/*
* !create
*/
} else {
if (( rank == 0 ) &&
( verbose >= 3 ) &&
((itemNum+i) % ITEM_COUNT==0 && (itemNum+i != 0))) {
printf("V-3: remove dir: %llu\n", itemNum+i);
fflush(stdout);
}
//remove dirs
sprintf(curr_item, "%s/dir.%s%llu", path, rm_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create_remove_items_helper (dirs remove): curr_item is \"%s\"\n", curr_item);
fflush(stdout);
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_rmdir( curr_item );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL("Unable to plfs_rmdir directory");
}
} else {
if (rmdir(curr_item) == -1) {
FAIL("unable to remove directory");
}
}
#else
if (rmdir(curr_item) == -1) {
FAIL("unable to remove directory");
}
#endif
}
/*
* !dirs
*/
} else {
int fd;
if (create) {
if (( rank == 0 ) &&
( verbose >= 3 ) &&
((itemNum+i) % ITEM_COUNT==0 && (itemNum+i != 0))) {
printf("V-3: create file: %llu\n", itemNum+i);
fflush(stdout);
}
//create files
sprintf(curr_item, "%s/file.%s%llu", path, mk_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create_remove_items_helper (non-dirs create): curr_item is \"%s\"\n", curr_item);
fflush(stdout);
}
if (collective_creates) {
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (collective): plfs_open...\n" );
fflush( stdout );
}
/*
* If PLFS opens a file as O_RDWR, it suffers a bad performance hit. Looking through the
* code that follows up to the close, this file only gets one write, so we'll open it as
* write-only.
*/
open_flags = O_WRONLY;
wpfd = NULL;
plfs_ret = plfs_open( &wpfd, curr_item, open_flags, rank, FILEMODE, NULL );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_open file" );
}
} else {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (collective): open...\n" );
fflush( stdout );
}
if ((fd = open(curr_item, O_RDWR)) == -1) {
FAIL("unable to open file");
}
}
#else
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (collective): open...\n" );
fflush( stdout );
}
if ((fd = open(curr_item, O_RDWR)) == -1) {
FAIL("unable to open file");
}
#endif
/*
* !collective_creates
*/
} else {
if (shared_file) {
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, shared): plfs_open...\n" );
fflush( stdout );
}
/*
* If PLFS opens a file as O_RDWR, it suffers a bad performance hit. Looking through the
* code that follows up to the close, this file only gets one write, so we'll open it as
* write-only.
*/
open_flags = O_CREAT | O_WRONLY;
wpfd = NULL;
plfs_ret = plfs_open( &wpfd, curr_item, open_flags, rank, FILEMODE, NULL );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_open for create file" );
}
} else {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, shared): open...\n" );
fflush( stdout );
}
if ((fd = open(curr_item, O_CREAT|O_RDWR, FILEMODE)) == -1) {
FAIL("unable to create file");
}
}
#else
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, shared): open...\n" );
fflush( stdout );
}
if ((fd = open(curr_item, O_CREAT|O_RDWR, FILEMODE)) == -1) {
FAIL("unable to create file");
}
#endif
/*
* !shared_file
*/
} else {
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, non-shared): plfs_open...\n" );
fflush( stdout );
}
/*
* If PLFS opens a file as O_RDWR, it suffers a bad performance hit. Looking through the
* code that follows up to the close, this file only gets one write, so we'll open it as
* write-only.
*/
open_flags = O_CREAT | O_WRONLY;
wpfd = NULL;
plfs_ret = plfs_open( &wpfd, curr_item, open_flags, rank, FILEMODE, NULL );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_open for create file" );
}
} else {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, non-shared): open...\n" );
fflush( stdout );
}
if ((fd = creat(curr_item, FILEMODE)) == -1) {
FAIL("unable to create file");
}
}
#else
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper (non-collective, non-shared): open...\n" );
fflush( stdout );
}
if ((fd = creat(curr_item, FILEMODE)) == -1) {
FAIL("unable to create file");
}
#endif
}
}
if (write_bytes > 0) {
#ifdef _HAS_PLFS
/*
* According to Bill Loewe, writes are only done one time, so they are always at
* offset 0 (zero).
*/
if ( using_plfs_path ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: plfs_write...\n" );
fflush( stdout );
}
plfs_ret = plfs_write( wpfd, write_buffer, write_bytes, 0, pid, &bytes_written );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_write file" );
}
if ( bytes_written != write_bytes ) {
FAIL( "Did not plfs_write the correct number of bytes to the file" );
}
} else {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: write...\n" );
fflush( stdout );
}
if (write(fd, write_buffer, write_bytes) != write_bytes) {
FAIL("unable to write file");
}
}
#else
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: write...\n" );
fflush( stdout );
}
if (write(fd, write_buffer, write_bytes) != write_bytes) {
FAIL("unable to write file");
}
#endif
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
if ( sync_file ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: plfs_sync...\n" );
fflush( stdout );
}
plfs_ret = plfs_sync( wpfd );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_sync file" );
}
}
} else {
if ( sync_file ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: fsync...\n" );
fflush( stdout );
}
if ( fsync(fd) == -1 ) {
FAIL("unable to sync file");
}
}
}
#else
if ( sync_file ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: fsync...\n" );
fflush( stdout );
}
if ( fsync(fd) == -1 ) {
FAIL("unable to sync file");
}
}
#endif
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: plfs_close...\n" );
fflush( stdout );
}
plfs_ret = plfs_close( wpfd, rank, uid, open_flags, NULL, &num_ref );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_close file" );
}
} else {
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: close...\n" );
fflush( stdout );
}
if (close(fd) == -1) {
FAIL("unable to close file");
}
}
#else
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items_helper: close...\n" );
fflush( stdout );
}
if (close(fd) == -1) {
FAIL("unable to close file");
}
#endif
/*
* !create
*/
} else {
if (( rank == 0 ) &&
( verbose >= 3 ) &&
((itemNum+i) % ITEM_COUNT==0 && (itemNum+i != 0))) {
printf("V-3: remove file: %llu\n", itemNum+i);
fflush(stdout);
}
//remove files
sprintf(curr_item, "%s/file.%s%llu", path, rm_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create_remove_items_helper (non-dirs remove): curr_item is \"%s\"\n", curr_item);
fflush(stdout);
}
if (!(shared_file && rank != 0)) {
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_unlink( curr_item );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_unlink file" );
}
} else {
if (unlink(curr_item) == -1) {
FAIL("unable to unlink file");
}
}
#else
if (unlink(curr_item) == -1) {
FAIL("unable to unlink file");
}
#endif
}
}
}
}
}
/* helper function to do collective operations */
void collective_helper(int dirs, int create, char* path, unsigned long long itemNum) {
unsigned long long i;
char curr_item[MAX_LEN];
#ifdef _HAS_PLFS
int open_flags;
plfs_error_t plfs_ret;
int num_ref;
#endif
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering collective_helper...\n" );
fflush( stdout );
}
for (i=0; i<items_per_dir; i++) {
if (dirs) {
if (create) {
//create dirs
sprintf(curr_item, "%s/dir.%s%llu", path, mk_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create dir : %s\n", curr_item);
fflush(stdout);
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_mkdir( curr_item, DIRMODE );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL("Unable to plfs_mkdir directory");
}
} else {
if (mkdir(curr_item, DIRMODE) == -1) {
FAIL("unable to create directory");
}
}
#else
if (mkdir(curr_item, DIRMODE) == -1) {
FAIL("unable to create directory");
}
#endif
} else {
//remove dirs
sprintf(curr_item, "%s/dir.%s%llu", path, rm_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: remove dir : %s\n", curr_item);
fflush(stdout);
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_rmdir( curr_item );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL("Unable to plfs_rmdir directory");
}
} else {
if (rmdir(curr_item) == -1) {
FAIL("unable to remove directory");
}
}
#else
if (rmdir(curr_item) == -1) {
FAIL("unable to remove directory");
}
#endif
}
} else {
int fd;
if (create) {
//create files
sprintf(curr_item, "%s/file.%s%llu", path, mk_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: create file: %s\n", curr_item);
fflush(stdout);
}
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
open_flags = O_CREAT | O_WRONLY;
cpfd = NULL;
plfs_ret = plfs_open( &cpfd, curr_item, open_flags, rank, FILEMODE, NULL );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_open for create file" );
}
} else {
if ((fd = creat(curr_item, FILEMODE)) == -1) {
FAIL("unable to create file");
}
}
#else
if ((fd = creat(curr_item, FILEMODE)) == -1) {
FAIL("unable to create file");
}
#endif
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_close( cpfd, rank, uid, open_flags, NULL, &num_ref );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_close file" );
}
} else {
if (close(fd) == -1) {
FAIL("unable to close file");
}
}
#else
if (close(fd) == -1) {
FAIL("unable to close file");
}
#endif
} else {
//remove files
sprintf(curr_item, "%s/file.%s%llu", path, rm_name, itemNum+i);
if (rank == 0 && verbose >= 3) {
printf("V-3: remove file: curr_item is \"%s\"\n", curr_item);
fflush(stdout);
}
if (!(shared_file && rank != 0)) {
#ifdef _HAS_PLFS
if ( using_plfs_path ) {
plfs_ret = plfs_unlink( curr_item );
if ( plfs_ret != PLFS_SUCCESS ) {
FAIL( "Unable to plfs_unlink file" );
}
} else {
if (unlink(curr_item) == -1) {
FAIL("unable to unlink file");
}
}
#else
if (unlink(curr_item) == -1) {
FAIL("unable to unlink file");
}
#endif
}
}
}
}
}
/* recusive function to create and remove files/directories from the
directory tree */
void create_remove_items(int currDepth, int dirs, int create, int collective,
char *path, unsigned long long dirNum) {
int i;
char dir[MAX_LEN];
char temp_path[MAX_LEN];
unsigned long long currDir = dirNum;
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering create_remove_items, currDepth = %d...\n", currDepth );
fflush( stdout );
}
memset(dir, 0, MAX_LEN);
strcpy(temp_path, path);
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items (start): temp_path is \"%s\"\n", temp_path );
fflush(stdout);
}
if (currDepth == 0) {
/* create items at this depth */
if (!leaf_only || (depth == 0 && leaf_only)) {
if (collective) {
collective_helper(dirs, create, temp_path, 0);
} else {
create_remove_items_helper(dirs, create, temp_path, 0);
}
}
if (depth > 0) {
create_remove_items(++currDepth, dirs, create,
collective, temp_path, ++dirNum);
}
} else if (currDepth <= depth) {
/* iterate through the branches */
for (i=0; i<branch_factor; i++) {
/* determine the current branch and append it to the path */
sprintf(dir, "%s.%llu/", base_tree_name, currDir);
strcat(temp_path, "/");
strcat(temp_path, dir);
if (rank == 0 && verbose >= 3) {
printf( "V-3: create_remove_items (for loop): temp_path is \"%s\"\n", temp_path );
fflush(stdout);
}
/* create the items in this branch */
if (!leaf_only || (leaf_only && currDepth == depth)) {
if (collective) {
collective_helper(dirs, create, temp_path, currDir*items_per_dir);
} else {
create_remove_items_helper(dirs, create, temp_path, currDir*items_per_dir);
}
}
/* make the recursive call for the next level below this branch */
create_remove_items(
++currDepth,
dirs,
create,
collective,
temp_path,
( currDir * ( unsigned long long )branch_factor ) + 1 );
currDepth--;
/* reset the path */
strcpy(temp_path, path);
currDir++;
}
}
}
/* stats all of the items created as specified by the input parameters */
void mdtest_stat(int random, int dirs, char *path) {
struct stat buf;
unsigned long long i, parent_dir, item_num = 0;
char item[MAX_LEN], temp[MAX_LEN];
#ifdef _HAS_PLFS
plfs_error_t plfs_ret;
#endif
if (( rank == 0 ) && ( verbose >= 1 )) {
fprintf( stdout, "V-1: Entering mdtest_stat...\n" );
fflush( stdout );
}
/* determine the number of items to stat*/
unsigned long long stop = 0;
if (leaf_only) {
stop = items_per_dir * ( unsigned long long )pow( branch_factor, depth );
} else {
stop = items;
}
/* iterate over all of the item IDs */
for (i = 0; i < stop; i++) {
/*
* It doesn't make sense to pass the address of the array because that would
* be like passing char **. Tested it on a Cray and it seems to work either
* way, but it seems that it is correct without the "&".
*
memset(&item, 0, MAX_LEN);
*/
memset(item, 0, MAX_LEN);
memset(temp, 0, MAX_LEN);
/* determine the item number to stat */
if (random) {
item_num = rand_array[i];
} else {
item_num = i;
}
/* make adjustments if in leaf only mode*/
if (leaf_only) {
item_num += items_per_dir *
(num_dirs_in_tree - ( unsigned long long )pow( branch_factor, depth ));
}
/* create name of file/dir to stat */
if (dirs) {
if (rank == 0 && verbose >= 3 && (i%ITEM_COUNT == 0) && (i != 0)) {
printf("V-3: stat dir: %llu\n", i);
fflush(stdout);
}
sprintf(item, "dir.%s%llu", stat_name, item_num);
} else {
if (rank == 0 && verbose >= 3 && (i%ITEM_COUNT == 0) && (i != 0)) {
printf("V-3: stat file: %llu\n", i);
fflush(stdout);
}
sprintf(item, "file.%s%llu", stat_name, item_num);
}
/* determine the path to the file/dir to be stat'ed */
parent_dir = item_num / items_per_dir;
if (parent_dir > 0) { //item is not in tree's root directory
/* prepend parent directory to item's path */
sprintf(temp, "%s.%llu/%s", base_tree_name, parent_dir, item);
strcpy(item, temp);