Commit b9dbef85 authored by Philip Carns's avatar Philip Carns

get rid of c++ style comments


git-svn-id: https://svn.mcs.anl.gov/repos/darshan/trunk@390 3b7491f3-a168-0410-bf4b-c445ed680a29
parent dbbc93fc
...@@ -21,10 +21,10 @@ ...@@ -21,10 +21,10 @@
/* /*
* Options * Options
*/ */
#define OPTION_BASE (1 << 0) // darshan log fields #define OPTION_BASE (1 << 0) /* darshan log fields */
#define OPTION_TOTAL (1 << 1) // aggregated fields #define OPTION_TOTAL (1 << 1) /* aggregated fields */
#define OPTION_PERF (1 << 2) // derived performance #define OPTION_PERF (1 << 2) /* derived performance */
#define OPTION_FILE (1 << 3) // file count totals #define OPTION_FILE (1 << 3) /* file count totals */
#define OPTION_ALL (\ #define OPTION_ALL (\
OPTION_BASE|\ OPTION_BASE|\
OPTION_TOTAL|\ OPTION_TOTAL|\
......
...@@ -1939,7 +1939,9 @@ static void cp_access_walker(const void* nodep, const VISIT which, const int dep ...@@ -1939,7 +1939,9 @@ static void cp_access_walker(const void* nodep, const VISIT which, const int dep
case postorder: case postorder:
case leaf: case leaf:
counter = *(struct cp_access_counter**)nodep; counter = *(struct cp_access_counter**)nodep;
//printf(" type %d size: %lld, freq: %d\n", walker_validx, counter->size, counter->freq); #if 0
printf(" type %d size: %lld, freq: %d\n", walker_validx, counter->size, counter->freq);
#endif
CP_COUNTER_INC(walker_file, counter->size, counter->freq, 1, walker_validx, walker_cntidx); CP_COUNTER_INC(walker_file, counter->size, counter->freq, 1, walker_validx, walker_cntidx);
default: default:
break; break;
...@@ -1959,7 +1961,9 @@ void darshan_walk_file_accesses(struct darshan_job_runtime* final_job) ...@@ -1959,7 +1961,9 @@ void darshan_walk_file_accesses(struct darshan_job_runtime* final_job)
for(i=0; i<final_job->file_count; i++) for(i=0; i<final_job->file_count; i++)
{ {
//printf("file: %d\n", i); #if 0
printf("file: %d\n", i);
#endif
/* walk trees for both access sizes and stride sizes to pick 4 most /* walk trees for both access sizes and stride sizes to pick 4 most
* common of each * common of each
......
...@@ -1703,7 +1703,7 @@ void darshan_search_bench(int argc, char** argv, int iters) ...@@ -1703,7 +1703,7 @@ void darshan_search_bench(int argc, char** argv, int iters)
} }
tm2 = darshan_wtime(); tm2 = darshan_wtime();
// printf("#<iters>\t<numfiles>\t<numsizes>\t<total time>\t<per iter>\n"); /* printf("#<iters>\t<numfiles>\t<numsizes>\t<total time>\t<per iter>\n"); */
printf("%d\t%d\t%d\t%f\t%.12f\n", iters, nfiles, (j==0?CP_MAX_ACCESS_COUNT_RUNTIME:1), tm2-tm1, (tm2-tm1)/iters); printf("%d\t%d\t%d\t%f\t%.12f\n", iters, nfiles, (j==0?CP_MAX_ACCESS_COUNT_RUNTIME:1), tm2-tm1, (tm2-tm1)/iters);
if(nfiles == 1) if(nfiles == 1)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment