Lines Matching refs:n

34 # define ZEND_BITSET_ELM_NUM(n)		((n) >> 5)  argument
35 # define ZEND_BITSET_BIT_NUM(n) ((zend_ulong)(n) & Z_UL(0x1f)) argument
37 # define ZEND_BITSET_ELM_NUM(n) ((n) >> 6) argument
38 # define ZEND_BITSET_BIT_NUM(n) ((zend_ulong)(n) & Z_UL(0x3f)) argument
40 # define ZEND_BITSET_ELM_NUM(n) ((n) / (sizeof(zend_long) * 8)) argument
41 # define ZEND_BITSET_BIT_NUM(n) ((n) % (sizeof(zend_long) * 8)) argument
44 #define ZEND_BITSET_ALLOCA(n, use_heap) \ argument
45 (zend_bitset)do_alloca((n) * ZEND_BITSET_ELM_SIZE, use_heap)
69 int n;
73 n = 1;
75 if ((num & 0xffffffff) == 0) {n += 32; num = num >> Z_UL(32);}
77 if ((num & 0x0000ffff) == 0) {n += 16; num = num >> 16;}
78 if ((num & 0x000000ff) == 0) {n += 8; num = num >> 8;}
79 if ((num & 0x0000000f) == 0) {n += 4; num = num >> 4;}
80 if ((num & 0x00000003) == 0) {n += 2; num = num >> 2;}
81 return n - (num & 1);
108 int n;
111 n = 64;
112 x = num >> 32; if (x != 0) {n -= 32; num = x;}
114 n = 32;
116 x = num >> 16; if (x != 0) {n -= 16; num = x;}
117 x = num >> 8; if (x != 0) {n -= 8; num = x;}
118 x = num >> 4; if (x != 0) {n -= 4; num = x;}
119 x = num >> 2; if (x != 0) {n -= 2; num = x;}
120 x = num >> 1; if (x != 0) return n - 2;
121 return n - num;
127 static inline uint32_t zend_bitset_len(uint32_t n) argument
129 return (n + ((sizeof(zend_long) * 8) - 1)) / (sizeof(zend_long) * 8);
132 static inline bool zend_bitset_in(zend_bitset set, uint32_t n) argument
134 return ZEND_BIT_TEST(set, n);
137 static inline void zend_bitset_incl(zend_bitset set, uint32_t n) argument
139 set[ZEND_BITSET_ELM_NUM(n)] |= Z_UL(1) << ZEND_BITSET_BIT_NUM(n);
142 static inline void zend_bitset_excl(zend_bitset set, uint32_t n) argument
144 set[ZEND_BITSET_ELM_NUM(n)] &= ~(Z_UL(1) << ZEND_BITSET_BIT_NUM(n));