Lines Matching defs:count
190 range.count*=countBytes(length);
270 lower[length].count=maxBytes[length]-trail;
289 upper[length].count=trail-minBytes[length];
298 middle.count=(int32_t)((middle.end-middle.start)>>(8*(4-middleLength)))+1;
302 if(lower[length].count>0 && upper[length].count>0) {
324 lower[length].count=
327 // count might be <=0 in which case there is no room,
337 lower[length].count+=upper[length].count; // might be >countBytes
344 upper[length].count=0;
346 lower[length].count=upper[length].count=0;
357 if(lower[length].count>0) {
358 printf("lower[%ld] .start=0x%08lx .end=0x%08lx .count=%ld\n", length, lower[length].start, lower[length].end, lower[length].count);
361 if(middle.count>0) {
362 printf("middle .start=0x%08lx .end=0x%08lx .count=%ld\n", middle.start, middle.end, middle.count);
365 if(upper[length].count>0) {
366 printf("upper[%ld] .start=0x%08lx .end=0x%08lx .count=%ld\n", length, upper[length].start, upper[length].end, upper[length].count);
373 if(middle.count>0) {
379 if(upper[length].count>0) {
383 if(lower[length].count>0) {
395 if(n <= ranges[i].count) {
401 ranges[i].count = n;
417 n -= ranges[i].count; // still >0
426 int32_t count = 0;
432 count += ranges[minLengthRangeCount].count;
436 if(n > count * nextCountBytes) { return false; }
449 // count1 + count2 = count
451 // (count - count2) + count2 * nextCountBytes = n
453 int32_t count2 = (n - count) / (nextCountBytes - 1); // number of weights to be lengthened
454 int32_t count1 = count - count2; // number of minLength weights
467 ranges[0].count = count;
479 ranges[0].count = count1;
484 ranges[1].count = count2; // *countBytes when lengthened
538 printf("ranges[%ld] .start=0x%08lx .end=0x%08lx .length=%ld .count=%ld\n",
539 i, ranges[i].start, ranges[i].end, ranges[i].length, ranges[i].count);
555 if(--range.count == 0) {