Searched refs:bytes_to_consume (Results 1 - 3 of 3) sorted by relevance
| /third_party/ltp/testcases/kernel/fs/mongo/ |
| H A D | reiser_fract_tree.c | 36 bytes_to_consume/10. If maximum/median is a small integer, then in print_usage()
46 not more than bytes_to_consume/10. Using a distribution function for in print_usage()
50 ("Usage: reiser_fract_tree bytes_to_consume median_file_size max_file_size median_dir_nr_files max_directory_nr_files median_dir_branching max_dir_branching write_buffer_size /testfs_mount_point print_stats_flag\n\n"); in print_usage()
60 long bytes_to_consume = 0; /* create files until their total number of variable
251 long bytes_to_consume) in determine_nr_of_files()
258 while (byte_total < bytes_to_consume) { in determine_nr_of_files()
410 /* We have already determined that nr_files can fit in bytes_to_consume space.
478 bytes_to_consume = atol(argv[1]); in main()
481 /* Figure out how many random files will fit into bytes_to_consume bytes. We in main()
485 bytes_to_consume); in main()
250 determine_nr_of_files(int median_file_size, double max_file_size, long bytes_to_consume) determine_nr_of_files() argument
[all...] |
| H A D | mongo.pl | 129 $bytes_to_consume = 10000000;
405 $cmd_1 = "$TOPDIR/reiser_fract_tree $bytes_to_consume $median_file_size $max_file_size $median_dir_nr_files $max_directory_nr_files $median_dir_branching $max_dir_branching $write_buffer_size";
485 $bytes_to_consume = $numb_of_bytes[$n];
|
| /third_party/ltp/testcases/kernel/fs/doio/ |
| H A D | growfiles.c | 207 int bytes_to_consume = 0; /* non-zero if -B was specified, total bytes */ variable
424 switch (sscanf(optarg, "%i%c", &bytes_to_consume, &chr)) { in main()
430 bytes_to_consume *= BSIZE; in main()
1054 if (bytes_to_consume) in main()
1055 printf("%s: %d DEBUG3 bytes_to_consume = %d\n", in main()
1056 Progname, Pid, bytes_to_consume); in main()
1343 if (bytes_to_consume && bytes_to_consume < total_grow_value) { in main()
1344 total_grow_value = bytes_to_consume; in main()
1398 if (bytes_to_consume in main()
[all...] |
Completed in 4 milliseconds