Lines Matching full:bucket

35  * number of buckets, adding one bucket at the end that is one past the end of
109 	 * now need to generate the array of bucket bounds.  There are  in dist_geometric()
117 	 * bucket size.  Since b_idx is an exponentially growing function,  in dist_geometric()
124 	 * of oddness around the 0 bucket, but it's mostly reasonable.  in dist_geometric()
152  * Print the distribution header with the given bucket label. The header is
156  * for the bucket counts.
180  * Print one distribution bucket whose range is from distarray[i] inclusive to
183  * Each bucket is labeled by its range in the form "first-last" (omit "-last" if
185  * one less than the first value of the next bucket range. The bucket label is
194 	int b;				/* bucket range index */  in dist_print_bucket()
195 	int bb = distarray[i];		/* bucket begin */  in dist_print_bucket()
196 	int be = distarray[i + 1] - 1;	/* bucket end */  in dist_print_bucket()
197 	uint64_t count = 0;		/* bucket value */  in dist_print_bucket()