HomeSort by: relevance | last modified time | path
    Searched defs:maxcode (Results 1 - 4 of 4) sorted by relevancy

  /src/external/bsd/libarchive/dist/libarchive/
archive_read_support_filter_compress.c 109 int maxcode; /* Largest code. */ member in struct:private_data
249 state->maxcode = (1 << state->maxcode_bits);
390 if (code < state->maxcode && state->oldcode >= 0) {
399 state->section_end_code = state->maxcode;
  /src/sys/arch/sgimips/stand/undist/
util.c 142 static code_int maxcode; /* maximum code, given n_bits */ variable
144 #define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
231 maxcode = MAXCODE(n_bits = INIT_BITS);
358 if ( clear_flg > 0 || offset >= size || free_ent > maxcode ) {
371 if ( free_ent > maxcode ) {
374 maxcode = maxmaxcode; /* won't get any bigger now */
376 maxcode = MAXCODE(n_bits);
379 maxcode = MAXCODE (n_bits = INIT_BITS)
    [all...]
  /src/usr.bin/compress/
zopen.c 96 #define MAXCODE(n_bits) ((1 << (n_bits)) - 1)
148 #define maxcode zs->zs_maxcode macro
270 maxcode = MAXCODE(n_bits = INIT_BITS);
413 if (free_ent > maxcode || (clear_flg > 0)) {
426 maxcode = MAXCODE(n_bits = INIT_BITS);
431 maxcode = maxmaxcode;
433 maxcode = MAXCODE(n_bits)
    [all...]
  /src/sys/dev/stbi/
stb_image.c 1118 unsigned int maxcode[18]; member in struct:__anon3675
1182 h->maxcode[j] = code << (16-j);
1185 h->maxcode[j] = 0xffffffff;
1244 // valid, then test against maxcode. To speed this up, we've
1245 // preshifted maxcode left so that it has (16-k) 0s at the
1251 if (temp < h->maxcode[k])
2194 int maxcode[17]; member in struct:__anon3679
2238 z->maxcode[i] = code << (16-i); // preshift for inner loop
2242 z->maxcode[16] = 0x10000; // sentinel
2323 if (k < z->maxcode[s]
    [all...]

Completed in 26 milliseconds