/dports/archivers/libmspack/libmspack-0.10.1alpha/mspack/ |
H A D | readhuff.h | 88 unsigned int table_mask = 1 << nbits; in make_decode_table() local 89 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 103 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 117 if (pos == table_mask) return 0; in make_decode_table() 120 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 131 next_symbol = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 136 table_mask <<= 16; in make_decode_table() 142 if (pos >= table_mask) return 1; /* table overflow */ in make_decode_table() 170 return (pos == table_mask) ? 0 : 1; in make_decode_table()
|
/dports/archivers/cabextract/cabextract-1.9.1/mspack/ |
H A D | readhuff.h | 88 unsigned int table_mask = 1 << nbits; in make_decode_table() local 89 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 103 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 117 if (pos == table_mask) return 0; in make_decode_table() 120 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 131 next_symbol = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 136 table_mask <<= 16; in make_decode_table() 142 if (pos >= table_mask) return 1; /* table overflow */ in make_decode_table() 170 return (pos == table_mask) ? 0 : 1; in make_decode_table()
|
/dports/security/clamav/clamav-0.104.2/libclammspack/mspack/ |
H A D | readhuff.h | 88 unsigned int table_mask = 1 << nbits; in make_decode_table() local 89 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 103 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 117 if (pos == table_mask) return 0; in make_decode_table() 120 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 131 next_symbol = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 136 table_mask <<= 16; in make_decode_table() 142 if (pos >= table_mask) return 1; /* table overflow */ in make_decode_table() 170 return (pos == table_mask) ? 0 : 1; in make_decode_table()
|
/dports/security/clamav-lts/clamav-0.103.5/libclammspack/mspack/ |
H A D | readhuff.h | 88 unsigned int table_mask = 1 << nbits; in make_decode_table() local 89 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 103 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 117 if (pos == table_mask) return 0; in make_decode_table() 120 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 131 next_symbol = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 136 table_mask <<= 16; in make_decode_table() 142 if (pos >= table_mask) return 1; /* table overflow */ in make_decode_table() 170 return (pos == table_mask) ? 0 : 1; in make_decode_table()
|
/dports/mail/evolution-ews/evolution-ews-3.42.1/src/EWS/addressbook/mspack/ |
H A D | readhuff.h | 89 unsigned int table_mask = 1 << nbits; in make_decode_table() local 90 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 104 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 118 if (pos == table_mask) return 0; in make_decode_table() 121 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 132 next_symbol = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 137 table_mask <<= 16; in make_decode_table() 165 if ((pos += bit_mask) > table_mask) return 1; /* table overflow */ in make_decode_table() 171 return (pos == table_mask) ? 0 : 1; in make_decode_table()
|
/dports/lang/mono/mono-5.10.1.57/mono/utils/ |
H A D | mono-conc-hashtable.c | 84 int i = hash & table_mask; in insert_one_local() 87 i = (i + 1) & table_mask; in insert_one_local() 162 int hash, i, table_mask; in mono_conc_hashtable_lookup() local 171 i = hash & table_mask; in mono_conc_hashtable_lookup() 184 i = (i + 1) & table_mask; in mono_conc_hashtable_lookup() 203 i = (i + 1) & table_mask; in mono_conc_hashtable_lookup() 226 int hash, i, table_mask; in mono_conc_hashtable_remove() local 235 i = hash & table_mask; in mono_conc_hashtable_remove() 257 i = (i + 1) & table_mask; in mono_conc_hashtable_remove() 294 int hash, i, table_mask; in mono_conc_hashtable_insert() local [all …]
|
H A D | mono-value-hash.c | 75 int table_mask; member 94 hash_table->table_mask = mask; in mono_value_hash_table_set_shift() 185 hash_val = HASH (hash, s_key) & hash->table_mask; in do_rehash() 191 hash_val &= hash->table_mask; in do_rehash() 230 s_index = hashcode & hash->table_mask; in mono_value_hash_table_insert_replace() 255 s_index &= hash->table_mask; in mono_value_hash_table_insert_replace() 288 s_index = hashcode & hash->table_mask; in lookup_internal() 302 s_index &= hash->table_mask; in lookup_internal()
|
/dports/lang/mono/mono-5.10.1.57/mono/metadata/ |
H A D | mono-conc-hash.c | 142 int i = hash & table_mask; in insert_one_local() 145 i = (i + 1) & table_mask; in insert_one_local() 212 int hash, i, table_mask; in mono_conc_g_hash_table_lookup_extended() local 219 i = hash & table_mask; in mono_conc_g_hash_table_lookup_extended() 240 i = (i + 1) & table_mask; in mono_conc_g_hash_table_lookup_extended() 263 i = (i + 1) & table_mask; in mono_conc_g_hash_table_lookup_extended() 317 int hash, i, table_mask; in mono_conc_g_hash_table_insert() local 329 i = hash & table_mask; in mono_conc_g_hash_table_insert() 347 i = (i + 1) & table_mask; in mono_conc_g_hash_table_insert() 374 int hash, i, table_mask; in mono_conc_g_hash_table_remove() local [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/sat/ |
H A D | sat_cutset.h | 41 uint64_t table_mask() const { return (1ull << (1ull << m_size)) - 1ull; } in table_mask() function 75 void set_table(uint64_t t) { m_table = t & table_mask(); } in set_table() 76 uint64_t table() const { return (m_table | m_dont_care) & table_mask(); } in table() 77 uint64_t ntable() const { return (~m_table | m_dont_care) & table_mask(); } in ntable() 82 bool is_true() const { return 0 == (table_mask() & ~table()); } in is_true() 83 bool is_false() const { return 0 == (table_mask() & ~m_dont_care & m_table); } in is_false()
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/ |
H A D | sat_cutset.h | 41 uint64_t table_mask() const { return (1ull << (1ull << m_size)) - 1ull; } in table_mask() function 75 void set_table(uint64_t t) { m_table = t & table_mask(); } in set_table() 76 uint64_t table() const { return (m_table | m_dont_care) & table_mask(); } in table() 77 uint64_t ntable() const { return (~m_table | m_dont_care) & table_mask(); } in ntable() 82 bool is_true() const { return 0 == (table_mask() & ~table()); } in is_true() 83 bool is_false() const { return 0 == (table_mask() & ~m_dont_care & m_table); } in is_false()
|
/dports/games/scummvm-tools/scummvm-tools-2.5.0/engines/grim/patchex/ |
H A D | mszipd.cpp | 137 unsigned int table_mask = 1 << nbits; in make_decode_table() local 138 unsigned int bmask = table_mask >> 1; in make_decode_table() 147 if((pos += bmask) > table_mask) return 1; in make_decode_table() 155 if (pos == table_mask) return 0; in make_decode_table() 157 for (sym = pos; sym < table_mask; sym++) { in make_decode_table() 163 next_sym = ((table_mask >> 1) < nsyms) ? nsyms : (table_mask >> 1); in make_decode_table() 166 table_mask <<= 16; in make_decode_table() 186 if ((pos += bmask) > table_mask) return 1; in make_decode_table() 191 return (pos != table_mask) ? 1 : 0; in make_decode_table()
|
/dports/games/openage/openage-0.3.0-1262-ga554ab49/libopenage/util/compress/ |
H A D | lzxd.cpp | 286 unsigned int table_mask = 1 << tablebits; in try_make_decode_table() local 287 unsigned int bit_mask = table_mask >> 1; // don't do 0 length codes in try_make_decode_table() 296 if ((pos += bit_mask) > table_mask) { in try_make_decode_table() 309 if (pos == table_mask) { in try_make_decode_table() 314 for (sym = pos; sym < table_mask; sym++) { in try_make_decode_table() 319 next_symbol = ((table_mask >> 1) < maxsymbols) ? maxsymbols : (table_mask >> 1); in try_make_decode_table() 324 table_mask <<= 16; in try_make_decode_table() 348 if ((pos += bit_mask) > table_mask) { in try_make_decode_table() 358 return pos == table_mask; in try_make_decode_table()
|
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/ulong_extras/ |
H A D | cbrt_chebyshev_approximation.c | 72 const mp_limb_t table_mask = 0x000F000000000000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 81 const mp_limb_t table_mask = 0x00780000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 96 table_index = alias.uword_val & table_mask; in n_cbrt_chebyshev_approx()
|
/dports/math/e-antic/flint2-ae7ec89/ulong_extras/ |
H A D | cbrt_chebyshev_approximation.c | 72 const mp_limb_t table_mask = 0x000F000000000000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 81 const mp_limb_t table_mask = 0x00780000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 96 table_index = alias.uword_val & table_mask; in n_cbrt_chebyshev_approx()
|
/dports/math/flint2/flint-2.8.4/ulong_extras/ |
H A D | cbrt_chebyshev_approximation.c | 72 const mp_limb_t table_mask = 0x000F000000000000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 81 const mp_limb_t table_mask = 0x00780000; /* first 4 bits of mantissa */ in n_cbrt_chebyshev_approx() local 96 table_index = alias.uword_val & table_mask; in n_cbrt_chebyshev_approx()
|
/dports/games/libretro-uae/libretro-uae-8333daa/sources/src/archivers/lzx/ |
H A D | unlzx.c | 170 unsigned int table_mask, bit_mask, pos, fill, next_symbol, reverse; in make_decode_table() local 175 bit_mask = table_mask = 1 << table_size; in make_decode_table() 194 if((pos += bit_mask) > table_mask) in make_decode_table() 212 if((!abort) && (pos != table_mask)) in make_decode_table() 214 for(symbol = pos; symbol < table_mask; symbol++) /* clear the rest of the table */ in make_decode_table() 226 next_symbol = table_mask >> 1; in make_decode_table() 228 table_mask <<= 16; in make_decode_table() 257 if((pos += bit_mask) > table_mask) in make_decode_table() 268 if(pos != table_mask) abort = 1; /* the table is incomplete! */ in make_decode_table()
|
/dports/archivers/undms/undms-1.3/ |
H A D | undms-1.3.c | 490 unsigned int table_mask, bit_mask, pos, fill, next_symbol, leaf; in make_decode_table() local 495 bit_mask = table_mask = 1 << table_size; in make_decode_table() 503 if((pos += bit_mask) > table_mask) in make_decode_table() 516 if((!abort) && (pos != table_mask)) in make_decode_table() 518 for(; fill < table_mask; fill++) in make_decode_table() 520 next_symbol = table_mask >> 1; in make_decode_table() 522 table_mask <<= 16; in make_decode_table() 544 if((pos += bit_mask) > table_mask) in make_decode_table() 556 if(DEBUG)printf(" ...table %s",((pos != table_mask) || abort) ? "bad" : "good"); in make_decode_table() 557 return((pos != table_mask) || abort); in make_decode_table()
|
/dports/deskutils/coolreader/coolreader-cr3.2.55/thirdparty_unman/chmlib/src/ |
H A D | lzx.c | 354 ULONG table_mask = 1 << nbits; in make_decode_table() local 355 ULONG bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 364 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 376 if (pos != table_mask) { in make_decode_table() 378 for (sym = pos; sym < table_mask; sym++) table[sym] = 0; in make_decode_table() 382 table_mask <<= 16; in make_decode_table() 402 if ((pos += bit_mask) > table_mask) return 1; /* table overflow */ in make_decode_table() 411 if (pos == table_mask) return 0; in make_decode_table()
|
/dports/misc/chmlib/chmlib-0.40/src/ |
H A D | lzx.c | 354 ULONG table_mask = 1 << nbits; in make_decode_table() local 355 ULONG bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 364 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 376 if (pos != table_mask) { in make_decode_table() 378 for (sym = pos; sym < table_mask; sym++) table[sym] = 0; in make_decode_table() 382 table_mask <<= 16; in make_decode_table() 402 if ((pos += bit_mask) > table_mask) return 1; /* table overflow */ in make_decode_table() 411 if (pos == table_mask) return 0; in make_decode_table()
|
/dports/lang/fpc-source/fpc-3.2.2/packages/chm/src/ |
H A D | paslzx.pas | 176 table_mask: dword; 181 table_mask := 1 shl nbits; 182 bit_mask := table_mask shr 1; 191 if pos > table_mask then begin 211 if pos <> table_mask then begin 213 for sym := pos to table_mask-1 do table[sym] := 0; 217 table_mask := table_mask shl 16; 239 if (pos > table_mask) then begin 251 if (pos = table_mask) then begin
|
/dports/misc/fpc-chm/fpc-3.2.2/packages/chm/src/ |
H A D | paslzx.pas | 176 table_mask: dword; 181 table_mask := 1 shl nbits; 182 bit_mask := table_mask shr 1; 191 if pos > table_mask then begin 211 if pos <> table_mask then begin 213 for sym := pos to table_mask-1 do table[sym] := 0; 217 table_mask := table_mask shl 16; 239 if (pos > table_mask) then begin 251 if (pos = table_mask) then begin
|
/dports/archivers/unlzx/unlzx.c/ |
H A D | unlzx.c | 195 unsigned int table_mask, bit_mask, pos, fill, next_symbol, reverse; in make_decode_table() local 200 bit_mask = table_mask = 1 << table_size; in make_decode_table() 219 if((pos += bit_mask) > table_mask) in make_decode_table() 237 if((!abort) && (pos != table_mask)) in make_decode_table() 239 for(symbol = pos; symbol < table_mask; symbol++) /* clear the rest of the table */ in make_decode_table() 251 next_symbol = table_mask >> 1; in make_decode_table() 253 table_mask <<= 16; in make_decode_table() 282 if((pos += bit_mask) > table_mask) in make_decode_table() 293 if(pos != table_mask) abort = 1; /* the table is incomplete! */ in make_decode_table()
|
/dports/audio/libxmp/libxmp-4.5.0/src/depackers/ |
H A D | unlzx.c | 370 uint32 table_mask, bit_mask, pos, fill, next_symbol, reverse; in make_decode_table() local 374 bit_mask = table_mask = 1 << table_size; in make_decode_table() 391 if ((pos += bit_mask) > table_mask) in make_decode_table() 407 if (pos != table_mask) { in make_decode_table() 408 for (symbol = pos; symbol < table_mask; symbol++) { /* clear the rest of the table */ in make_decode_table() 421 next_symbol = table_mask >> 1; in make_decode_table() 423 table_mask <<= 16; in make_decode_table() 451 if (pos > table_mask) in make_decode_table() 460 if (pos != table_mask) in make_decode_table()
|
/dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/utils/lzx/ |
H A D | lzxd.c | 222 unsigned int table_mask = 1 << nbits; in make_decode_table() local 223 unsigned int bit_mask = table_mask >> 1; /* don't do 0 length codes */ in make_decode_table() 231 if((pos += bit_mask) > table_mask) return 1; /* table overrun */ in make_decode_table() 239 if (pos == table_mask) return 0; in make_decode_table() 242 for (sym = pos; sym < table_mask; sym++) table[sym] = 0xFFFF; in make_decode_table() 246 table_mask <<= 16; in make_decode_table() 267 if ((pos += bit_mask) > table_mask) return 1; /* table overflow */ in make_decode_table() 273 if (pos == table_mask) return 0; in make_decode_table()
|
/dports/audio/milkytracker/MilkyTracker-1.03.00/src/compression/ |
H A D | unlzx.cpp | 234 unsigned long leaf, table_mask, bit_mask, pos, fill, next_symbol, reverse; in make_decode_table() local 237 table_mask = 1 << table_size; in make_decode_table() 238 bit_mask = table_mask >> 1; in make_decode_table() 254 if ((pos += bit_mask) > table_mask) in make_decode_table() 271 if ((!abort) && (pos != table_mask)) in make_decode_table() 273 for (symbol = pos; symbol < (signed)table_mask; symbol++) in make_decode_table() 285 next_symbol = table_mask >> 1; in make_decode_table() 287 table_mask <<= 16; in make_decode_table() 315 if ((pos += bit_mask) > table_mask) in make_decode_table() 326 if (pos != table_mask) abort = 1; in make_decode_table()
|