i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added option '-b' for setting the buffer size used for the scheduling

Browse Source 
analysis.


git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@27992 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold
2008-10-12 12:30:59 +00:00
parent c73aeac11e
commit 8037829025
1 changed files with 21 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/tests/system/kernel/time_stats.cpp
+21 -7
View File
@@ -37,6 +37,8 @@ static const char* kUsage =
"the user and kernel times of all threads that ran during that time.\n" "the user and kernel times of all threads that ran during that time.\n"
"\n" "\n"
"Options:\n" "Options:\n"
" -b <size> - When doing scheduling analysis: the size of the buffer\n"
" used (in MB)\n"
" -h, --help - Print this usage info.\n" " -h, --help - Print this usage info.\n"
" -o <output> - Print the results to file <output>.\n" " -o <output> - Print the results to file <output>.\n"
" -s - Also perform a scheduling analysis over the time the\n" " -s - Also perform a scheduling analysis over the time the\n"
@@ -212,12 +214,13 @@ wait_object_to_string(scheduling_analysis_wait_object* waitObject, char* buffer,
static void static void
do_scheduling_analysis(bigtime_t startTime, bigtime_t endTime) do_scheduling_analysis(bigtime_t startTime, bigtime_t endTime,
size_t bufferSize)
{ {
printf("\n"); printf("\n");
// allocate a chunk of memory for the scheduling analysis // allocate a chunk of memory for the scheduling analysis
void* buffer = malloc(SCHEDULING_ANALYSIS_BUFFER_SIZE); void* buffer = malloc(bufferSize);
if (buffer == NULL) { if (buffer == NULL) {
fprintf(stderr, "Error: Failed to allocate memory for the scheduling " fprintf(stderr, "Error: Failed to allocate memory for the scheduling "
"analysis.\n"); "analysis.\n");
@@ -228,7 +231,7 @@ do_scheduling_analysis(bigtime_t startTime, bigtime_t endTime)
// do the scheduling analysis // do the scheduling analysis
scheduling_analysis analysis; scheduling_analysis analysis;
status_t error = _kern_analyze_scheduling(startTime, endTime, buffer, status_t error = _kern_analyze_scheduling(startTime, endTime, buffer,
SCHEDULING_ANALYSIS_BUFFER_SIZE, &analysis); bufferSize, &analysis);
if (error != B_OK) { if (error != B_OK) {
fprintf(stderr, "Error: Scheduling analysis failed: %s\n", fprintf(stderr, "Error: Scheduling analysis failed: %s\n",
strerror(error)); strerror(error));
@@ -359,7 +362,7 @@ do_scheduling_analysis(bigtime_t startTime, bigtime_t endTime)
static void static void
do_timing_analysis(int argc, const char* const* argv, bool schedulingAnalysis, do_timing_analysis(int argc, const char* const* argv, bool schedulingAnalysis,
int outFD) int outFD, size_t bufferSize)
{ {
// gather initial usage info // gather initial usage info
thread_info initialUsage[MAX_THREADS]; thread_info initialUsage[MAX_THREADS];
@@ -478,7 +481,7 @@ do_timing_analysis(int argc, const char* const* argv, bool schedulingAnalysis,
} }
if (schedulingAnalysis) if (schedulingAnalysis)
do_scheduling_analysis(startTime, endTime); do_scheduling_analysis(startTime, endTime, bufferSize);
} }
@@ -487,6 +490,7 @@ main(int argc, const char* const* argv)
{ {
const char* outputFile = NULL; const char* outputFile = NULL;
bool schedulingAnalysis = false; bool schedulingAnalysis = false;
size_t bufferSize = SCHEDULING_ANALYSIS_BUFFER_SIZE;
while (true) { while (true) {
static struct option sLongOptions[] = { static struct option sLongOptions[] = {
@@ -496,11 +500,20 @@ main(int argc, const char* const* argv)
}; };
opterr = 0; // don't print errors opterr = 0; // don't print errors
int c = getopt_long(argc, (char**)argv, "+ho:s", sLongOptions, NULL); int c = getopt_long(argc, (char**)argv, "+b:ho:s", sLongOptions, NULL);
if (c == -1) if (c == -1)
break; break;
switch (c) { switch (c) {
case 'b':
bufferSize = atol(optarg);
if (bufferSize < 1 || bufferSize > 1024) {
fprintf(stderr, "Error: Invalid buffer size. Should be "
"between 1 and 1024 MB\n");
exit(1);
}
bufferSize *= 1024 * 1024;
break;
case 'h': case 'h':
print_usage_and_exit(false); print_usage_and_exit(false);
break; break;
@@ -532,7 +545,8 @@ main(int argc, const char* const* argv)
} }
} }
do_timing_analysis(argc - optind, argv + optind, schedulingAnalysis, outFD); do_timing_analysis(argc - optind, argv + optind, schedulingAnalysis, outFD,
bufferSize);
return 0; return 0;
} }