Lines Matching defs:span
603 * the specified span of zero's or one's. The
608 putspan(TIFF* tif, int32 span, const tableentry* tab)
615 while (span >= 2624) {
622 span -= te->runlen;
624 if (span >= 64) {
625 const tableentry* te = &tab[63 + (span>>6)];
626 assert(te->runlen == 64*(span>>6));
632 span -= te->runlen;
634 code = tab[span].code, length = tab[span].length;
636 DEBUG_PRINT(" Term", tab[span].runlen);
773 * Find a span of ones or zeros using the supplied
781 int32 n, span;
788 span = zeroruns[(*bp << n) & 0xff];
789 if (span > 8-n) /* table value too generous */
790 span = 8-n;
791 if (span > bits) /* constrain span to bit range */
792 span = bits;
793 if (n+span < 8) /* doesn't extend to edge of byte */
794 return (span);
795 bits -= span;
798 span = 0;
806 return (span + zeroruns[*bp]);
807 span += 8, bits -= 8;
812 span += 8*sizeof (long), bits -= 8*sizeof (long);
822 return (span + zeroruns[*bp]);
823 span += 8, bits -= 8;
831 span += (n > bits ? bits : n);
833 return (span);
840 int32 n, span;
847 span = oneruns[(*bp << n) & 0xff];
848 if (span > 8-n) /* table value too generous */
849 span = 8-n;
850 if (span > bits) /* constrain span to bit range */
851 span = bits;
852 if (n+span < 8) /* doesn't extend to edge of byte */
853 return (span);
854 bits -= span;
857 span = 0;
865 return (span + oneruns[*bp]);
866 span += 8, bits -= 8;
871 span += 8*sizeof (long), bits -= 8*sizeof (long);
881 return (span + oneruns[*bp]);
882 span += 8, bits -= 8;
890 span += (n > bits ? bits : n);
892 return (span);
919 int32 span;
923 span = find0span(bp, bs, bits); /* white span */
924 putspan(tif, span, TIFFFaxWhiteCodes);
925 bs += span;
928 span = find1span(bp, bs, bits); /* black span */
929 putspan(tif, span, TIFFFaxBlackCodes);
930 bs += span;