Searched refs:vec (Results 1 – 6 of 6) sorted by relevance
181 void **vec = ht->ht_vec; in hash_free_items() local182 void **end = &vec[ht->ht_size]; in hash_free_items()183 for (; vec < end; vec++) in hash_free_items()185 void *item = *vec; in hash_free_items()188 *vec = 0; in hash_free_items()197 void **vec = ht->ht_vec; in hash_delete_items() local198 void **end = &vec[ht->ht_size]; in hash_delete_items()199 for (; vec < end; vec++) in hash_delete_items()200 *vec = 0; in hash_delete_items()
837 reset_addresses(vec) in reset_addresses() argument838 struct vector *vec; in reset_addresses()843 for (cur_cmd = vec->v, n = vec->v_length; n--; cur_cmd++)1359 shrink_program(vec, cur_cmd) in shrink_program() argument1360 struct vector *vec; in shrink_program()1363 struct sed_cmd *v = vec->v;1364 struct sed_cmd *last_cmd = v + vec->v_length;1371 cmd_cnt = v - vec->v;1376 vec->v_length = v - vec->v;1378 return (0 < vec->v_length) ? (vec->v + cmd_cnt) : CAST(struct sed_cmd *)0;[all …]
48 typedef vector<const char*> vec; in iter1() typedef50 for (vec::iterator i = v.begin(); i != v.end(); ++i, ++counter) { in iter1()
400 ctype_base::mask * vec) const { in do_is()404 for ( ; low < high; ++low, ++vec) { in do_is()406 *vec = _WCharIndex::in_range(c, ctype<char>::table_size) ? table[c] : ctype_base::mask(0); in do_is()
2402 it could read past the end of vec (because `n' was