Searched refs:nTableSize (Results 1 - 3 of 3) sorted by relevance

/PHP_5_4/Zend/
H A Dzend_hash.c95 if ((ht)->nNumOfElements > (ht)->nTableSize) { \
141 (ht)->arBuckets = (Bucket **) pecalloc((ht)->nTableSize, sizeof(Bucket *), (ht)->persistent); \
142 (ht)->nTableMask = (ht)->nTableSize - 1; \
156 ht->nTableSize = 0x80000000;
161 ht->nTableSize = 1 << i;
449 if ((ht->nTableSize << 1) > 0) { /* Let's double the table size */
450 t = (Bucket **) perealloc_recoverable(ht->arBuckets, (ht->nTableSize << 1) * sizeof(Bucket *), ht->persistent);
454 ht->nTableSize = (ht->nTableSize << 1);
455 ht->nTableMask = ht->nTableSize
[all...]
H A Dzend_hash.h67 uint nTableSize; member in struct:_hashtable
H A Dzend_string.c57 CG(interned_strings).nTableMask = CG(interned_strings).nTableSize - 1;
58 CG(interned_strings).arBuckets = (Bucket **) pecalloc(CG(interned_strings).nTableSize, sizeof(Bucket *), CG(interned_strings).persistent);
155 if (CG(interned_strings).nNumOfElements > CG(interned_strings).nTableSize) {
156 if ((CG(interned_strings).nTableSize << 1) > 0) { /* Let's double the table size */
157 Bucket **t = (Bucket **) perealloc_recoverable(CG(interned_strings).arBuckets, (CG(interned_strings).nTableSize << 1) * sizeof(Bucket *), CG(interned_strings).persistent);
162 CG(interned_strings).nTableSize = (CG(interned_strings).nTableSize << 1);
163 CG(interned_strings).nTableMask = CG(interned_strings).nTableSize - 1;
199 for (i = 0; i < CG(interned_strings).nTableSize; i++) {

Completed in 21 milliseconds