Lines Matching defs:point
14 Do a binary search over the index for an access point
15 Expose the access point type to enable save and load
27 // An access point can be created at the start of any deflate block, by saving
31 // point in the uncompressed stream. deflate_index_build() decompresses the
34 // new access point. If so, that point is saved in a data structure that grows
38 // the latest access point at or preceding that offset is located in the index.
53 // more memory per access point, and could not be saved to a file due to the
76 // Add an access point to the list. If out of memory, deallocate the existing
109 // Fill in the access point and increment how many we have.
146 off_t last; // last access point uncompressed offset
184 // order generate an access point there. Set data_type to imitate
197 // can add an access point here. Furthermore, we are either at the
198 // very start for the first access point, or there has been span or
199 // more uncompressed bytes since the last access point, so we want
200 // to add an access point here.
345 // Find the access point closest to but not after offset.
347 point_t *point = index->list;
350 if (offset < point[mid].out)
355 point += lo;
358 int ret = fseeko(in, point->in - (point->bits ? 1 : 0), SEEK_SET);
362 if (point->bits && (ch = getc(in)) == EOF)
368 if (point->bits)
369 INFLATEPRIME(&strm, point->bits, ch >> (8 - point->bits));
370 inflateSetDictionary(&strm, point->window, WINSIZE);
375 offset -= point->out; // number of bytes to skip to get to offset