hash_table_add hash_table_destroy hash_table_hash hash_table_init hash_table_iter_init hash_table_iter_up pool_alloc pool_destroy pool_init pool_strdup sparse_array_add sparse_array_find sparse_array_init sparse_array_length sparse_array_lookup vector_add vector_at vector_init vector_length WINE_DEFAULT_DEBUG_CHANNEL

void* vector_add ( struct vector *  v, struct pool *  pool  ) Definition at line 170 of file storage.c. Referenced by dwarf2_parse_line_numbers(), dwarf2_read_one_debug_info(), pev_push(), sparse_array_add(), symt_add_enum_element(), symt_add_func_line(), symt_add_func_local(), symt_add_function_point(), symt_add_function_signature_parameter(), symt_add_type(), symt_add_udt_element(), symt_new_constant(), symt_new_function(), symt_new_global_variable(), symt_new_label(), symt_new_public(), symt_new_thunk(), symt_open_func_block(), and symt_ptr2index(). { unsigned ncurr = v->num_elts++; /* check that we don't wrap around */ assert(v->num_elts > ncurr); if (ncurr == (v->num_buckets << v->shift)) { if(v->num_buckets == v->buckets_allocated) { /* Double the bucket cache, so it scales well with big vectors.*/ unsigned new_reserved; void* new; new_reserved = 2*v->buckets_allocated; if(new_reserved == 0) new_reserved = 1; /* Don't even try to resize memory. Pool datastructure is very inefficient with reallocs. */ new = pool_alloc(pool, new_reserved * sizeof(void*)); memcpy(new, v->buckets, v->buckets_allocated * sizeof(void*)); v->buckets = new; v->buckets_allocated = new_reserved; } v->buckets[v->num_buckets] = pool_alloc(pool, v->elt_size << v->shift); return v->buckets[v->num_buckets++]; } return vector_at(v, ncurr); }