| Line 1726... |
Line 1726... |
// Fish out the copy (0 to n-1 will be the instruction index, n will be
|
// Fish out the copy (0 to n-1 will be the instruction index, n will be
|
// the count)
|
// the count)
|
set_count_copy[set_count+1] = set[n];
|
set_count_copy[set_count+1] = set[n];
|
}
|
}
|
|
|
|
|
|
#ifdef DISPLAY_CSV
|
|
for(set_count2=0;set_count2<n;set_count2++)
|
|
fprintf(stream, "\"insn%d\",",n-1-set_count2);
|
|
fprintf(stream, "\"count\",\n");
|
|
#endif
|
|
|
|
|
// Now go through, finding the most frequent n-tuple of instructions and
|
// Now go through, finding the most frequent n-tuple of instructions and
|
// print it out
|
// print it out
|
int largest_indx = 0;
|
int largest_indx = 0;
|
set_count=0;
|
set_count=0;
|
while(set_count < total_sets_for_ntuple && set_count < MAX_NTUPLE_LISTING)
|
while(set_count < total_sets_for_ntuple && set_count < MAX_NTUPLE_LISTING)
|
| Line 1745... |
Line 1753... |
|
|
// Print out the sequence of prior isntructions
|
// Print out the sequence of prior isntructions
|
#ifdef DISPLAY_STRING
|
#ifdef DISPLAY_STRING
|
fprintf(stream,"Seq:\t");
|
fprintf(stream,"Seq:\t");
|
#endif
|
#endif
|
#ifdef DISPLAY_CSV
|
|
for(set_count2=0;set_count2<n;set_count2++)
|
|
fprintf(stream, "\"insn%d\",",n-1-set_count2);
|
|
fprintf(stream, "\"count\",\n");
|
|
#endif
|
|
// Go through the indexes of the previous instructions, get their
|
// Go through the indexes of the previous instructions, get their
|
// strings, and print them out
|
// strings, and print them out
|
for(set_count2=0;set_count2<n;set_count2++)
|
for(set_count2=0;set_count2<n;set_count2++)
|
fprintf(stream,
|
fprintf(stream,
|
#ifdef DISPLAY_STRING
|
#ifdef DISPLAY_STRING
|
