Searched refs:Z_UL (Results 1 – 7 of 7) sorted by relevance
30 # define ZEND_BITSET_BIT_NUM(n) ((zend_ulong)(n) & Z_UL(0x1f))33 # define ZEND_BITSET_BIT_NUM(n) ((zend_ulong)(n) & Z_UL(0x3f))66 if (num == Z_UL(0)) return SIZEOF_ZEND_LONG * 8;70 if ((num & 0xffffffff) == 0) {n += 32; num = num >> Z_UL(32);}89 return (set[ZEND_BITSET_ELM_NUM(n)] & (Z_UL(1) << ZEND_BITSET_BIT_NUM(n))) != Z_UL(0);211 while (x != Z_UL(0)) {212 x = x >> Z_UL(1);228 for (; _x != 0; _x >>= Z_UL(1), (bit)++) { \229 if (!(_x & Z_UL(1))) continue;234 zend_ulong _test = Z_UL(1) << (ZEND_BITSET_ELM_SIZE * 8 - 1); \[all …]
41 # define Z_UL(i) UINT64_C(i) macro51 # define Z_UL(i) UINT32_C(i) macro
327 zend_ulong hash = Z_UL(5381); in zend_inline_hash_func()354 return hash | Z_UL(0x8000000000000000); in zend_inline_hash_func()356 return hash | Z_UL(0x80000000); in zend_inline_hash_func()
632 for (h = Z_UL(2166136261); bucket_key < e;) { in realpath_cache_key()633 h *= Z_UL(16777619); in realpath_cache_key()646 for (h = Z_UL(2166136261); path < e;) { in realpath_cache_key()647 h *= Z_UL(16777619); in realpath_cache_key()
533 if ((bitset & 0xffffffff) == 0xffffffff) {n += 32; bitset = bitset >> Z_UL(32);}580 bitset[i] |= Z_UL(1) << n;
98 ((size_t)(ptr) & Z_UL(1))213 ret = (void*)(info->str_size | Z_UL(1)); in zend_file_cache_serialize_interned()231 str = (zend_string*)((char*)ZCG(mem) + ((size_t)(str) & ~Z_UL(1))); in zend_file_cache_unserialize_interned()
2969 num_bitset[len / sizeof(zend_ulong)] |= Z_UL(1) << (len % sizeof(zend_ulong));2970 …bitset[((unsigned char)ZSTR_VAL(str_key)[0]) / sizeof(zend_ulong)] |= Z_UL(1) << (((unsigned char)…2993 num_bitset[len / sizeof(zend_ulong)] |= Z_UL(1) << (len % sizeof(zend_ulong));2994 …bitset[((unsigned char)ZSTR_VAL(key_used)[0]) / sizeof(zend_ulong)] |= Z_UL(1) << (((unsigned char…3023 …if (bitset[((unsigned char)key[0]) / sizeof(zend_ulong)] & (Z_UL(1) << (((unsigned char)key[0]) % …3029 if ((num_bitset[len / sizeof(zend_ulong)] & (Z_UL(1) << (len % sizeof(zend_ulong))))) {
Completed in 41 milliseconds