Lines Matching refs:N
1973 long long percentile(long long * A, int N, int ple) { in percentile() argument
1979 if ( N == 0 ) in percentile()
1983 K=N*ple/100; in percentile()
1986 L=0; R=N-1; in percentile()
2028 int N, /* total */ in weighted_percentile() argument
2041 for(I=0; I<N; I++) { in weighted_percentile()
2052 R=N-1; in weighted_percentile()
2113 int N, /* total */ in self_weighted_percentile() argument
2125 for(I=0; I<N; I++) { in self_weighted_percentile()
2139 R=N-1; in self_weighted_percentile()
2542 int N=0; in interval_cr3_schedule_ordered_output() local
2545 N++; in interval_cr3_schedule_ordered_output()
2547 if(!N) in interval_cr3_schedule_ordered_output()
2550 qsort_array = malloc(N * sizeof(struct eip_list_struct *)); in interval_cr3_schedule_ordered_output()
2555 qsort(qsort_array, N, sizeof(struct eip_list_struct *), in interval_cr3_schedule_ordered_output()
2560 for(i=0; i<N; i++) { in interval_cr3_schedule_ordered_output()
2862 int N=0; in dump_eip() local
2867 N++; in dump_eip()
2870 if(!N) in dump_eip()
2873 qsort_array = malloc(N * sizeof(struct eip_list_struct *)); in dump_eip()
2878 qsort(qsort_array, N, sizeof(struct eip_list_struct *), in dump_eip()
2883 if(opt.summary_eip_limit && opt.summary_eip_limit < N) in dump_eip()
2884 N=opt.summary_eip_limit; in dump_eip()
2889 for(i=0; i<N; i++) { in dump_eip()
4012 int i, N=0; in cr3_dump_list() local
4019 N++; in cr3_dump_list()
4022 qsort_array = malloc(N * sizeof(struct eip_list_struct *)); in cr3_dump_list()
4029 qsort(qsort_array, N, sizeof(struct eip_list_struct *), in cr3_dump_list()
4034 if(opt.summary_eip_limit && opt.summary_eip_limit < N) in cr3_dump_list()
4035 N=opt.summary_eip_limit; in cr3_dump_list()
4040 for(i=0; i<N; i++) { in cr3_dump_list()