Lines Matching defs:size
212 size_t size;
221 /* For probing (after a collision) we need a step size relative prime
222 to the hash table size, which is a power of 2. We use double-hashing,
225 index was calculated: index = hash & mask, where mask = table->size - 1.
226 We limit the maximum step size to table->size / 4 (mask >> 2) and make
323 int size;
2274 XML_GetInputContext(XML_Parser parser, int *offset, int *size) {
2281 if (size != NULL)
2282 *size = (int)(parser->m_bufferEnd - parser->m_buffer);
2288 (void)size;
2324 XML_MemMalloc(XML_Parser parser, size_t size) {
2327 return MALLOC(parser, size);
2331 XML_MemRealloc(XML_Parser parser, void *ptr, size_t size) {
2334 return REALLOC(parser, ptr, size);
2585 size of tag->buf is a multiple of sizeof(XML_Char).
3481 /* size of hash table must be at least 2 * (# of prefixed attributes) */
3485 /* hash table size must also be a power of 2 and >= 8 */
3493 /* Restore actual size of memory in m_nsAtts */
3506 /* Restore actual size of memory in m_nsAtts */
3515 /* Restore actual size of memory in m_nsAtts */
7042 if (table->size == 0) {
7047 /* table->size is a power of 2 */
7048 table->size = (size_t)1 << INIT_POWER;
7049 tsize = table->size * sizeof(NAMED *);
7052 table->size = 0;
7056 i = hash(parser, name) & ((unsigned long)table->size - 1);
7059 unsigned long mask = (unsigned long)table->size - 1;
7067 i < step ? (i += table->size - step) : (i -= step);
7094 for (i = 0; i < table->size; i++)
7109 table->size = newSize;
7131 for (i = 0; i < table->size; i++) {
7141 for (i = 0; i < table->size; i++)
7149 p->size = 0;
7158 iter->end = iter->p ? iter->p + table->size : NULL;
7326 pool->end = pool->start + pool->blocks->size;
7330 if (pool->end - pool->start < pool->freeBlocks->size) {
7339 pool->end = pool->start + pool->blocks->size;
7371 pool->blocks->size = blockSize;
7410 tem->size = blockSize;