Lines Matching refs:elems
973 set->elems = re_malloc (Idx, size); in re_node_set_alloc()
974 if (__glibc_unlikely (set->elems == NULL) in re_node_set_alloc()
986 set->elems = re_malloc (Idx, 1); in re_node_set_init_1()
987 if (__glibc_unlikely (set->elems == NULL)) in re_node_set_init_1()
992 set->elems[0] = elem; in re_node_set_init_1()
1001 set->elems = re_malloc (Idx, 2); in re_node_set_init_2()
1002 if (__glibc_unlikely (set->elems == NULL)) in re_node_set_init_2()
1007 set->elems[0] = elem1; in re_node_set_init_2()
1014 set->elems[0] = elem1; in re_node_set_init_2()
1015 set->elems[1] = elem2; in re_node_set_init_2()
1019 set->elems[0] = elem2; in re_node_set_init_2()
1020 set->elems[1] = elem1; in re_node_set_init_2()
1034 dest->elems = re_malloc (Idx, dest->alloc); in re_node_set_init_copy()
1035 if (__glibc_unlikely (dest->elems == NULL)) in re_node_set_init_copy()
1040 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); in re_node_set_init_copy()
1065 Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc); in re_node_set_add_intersect()
1068 dest->elems = new_elems; in re_node_set_add_intersect()
1080 if (src1->elems[i1] == src2->elems[i2]) in re_node_set_add_intersect()
1083 while (id >= 0 && dest->elems[id] > src1->elems[i1]) in re_node_set_add_intersect()
1086 if (id < 0 || dest->elems[id] != src1->elems[i1]) in re_node_set_add_intersect()
1087 dest->elems[--sbase] = src1->elems[i1]; in re_node_set_add_intersect()
1094 else if (src1->elems[i1] < src2->elems[i2]) in re_node_set_add_intersect()
1117 if (dest->elems[is] > dest->elems[id]) in re_node_set_add_intersect()
1120 dest->elems[id + delta--] = dest->elems[is--]; in re_node_set_add_intersect()
1127 dest->elems[id + delta] = dest->elems[id]; in re_node_set_add_intersect()
1134 memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx)); in re_node_set_add_intersect()
1151 dest->elems = re_malloc (Idx, dest->alloc); in re_node_set_init_union()
1152 if (__glibc_unlikely (dest->elems == NULL)) in re_node_set_init_union()
1167 if (src1->elems[i1] > src2->elems[i2]) in re_node_set_init_union()
1169 dest->elems[id++] = src2->elems[i2++]; in re_node_set_init_union()
1172 if (src1->elems[i1] == src2->elems[i2]) in re_node_set_init_union()
1174 dest->elems[id++] = src1->elems[i1++]; in re_node_set_init_union()
1178 memcpy (dest->elems + id, src1->elems + i1, in re_node_set_init_union()
1184 memcpy (dest->elems + id, src2->elems + i2, in re_node_set_init_union()
1205 Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc); in re_node_set_merge()
1208 dest->elems = new_buffer; in re_node_set_merge()
1217 DEBUG_ASSERT (dest->elems); in re_node_set_merge()
1219 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); in re_node_set_merge()
1228 if (dest->elems[id] == src->elems[is]) in re_node_set_merge()
1230 else if (dest->elems[id] < src->elems[is]) in re_node_set_merge()
1231 dest->elems[--sbase] = src->elems[is--]; in re_node_set_merge()
1240 memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx)); in re_node_set_merge()
1254 if (dest->elems[is] > dest->elems[id]) in re_node_set_merge()
1257 dest->elems[id + delta--] = dest->elems[is--]; in re_node_set_merge()
1264 dest->elems[id + delta] = dest->elems[id]; in re_node_set_merge()
1268 memcpy (dest->elems, dest->elems + sbase, in re_node_set_merge()
1296 DEBUG_ASSERT (set->elems); in re_node_set_insert()
1297 set->elems[0] = elem; in re_node_set_insert()
1307 new_elems = re_realloc (set->elems, Idx, set->alloc); in re_node_set_insert()
1310 set->elems = new_elems; in re_node_set_insert()
1315 if (elem < set->elems[0]) in re_node_set_insert()
1318 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1322 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--) in re_node_set_insert()
1323 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1324 DEBUG_ASSERT (set->elems[idx - 1] < elem); in re_node_set_insert()
1328 set->elems[idx] = elem; in re_node_set_insert()
1346 new_elems = re_realloc (set->elems, Idx, set->alloc); in re_node_set_insert_last()
1349 set->elems = new_elems; in re_node_set_insert_last()
1353 set->elems[set->nelem++] = elem; in re_node_set_insert_last()
1368 if (set1->elems[i] != set2->elems[i]) in re_node_set_compare()
1389 if (set->elems[mid] < elem) in re_node_set_contains()
1394 return set->elems[idx] == elem ? idx + 1 : 0; in re_node_set_contains()
1404 set->elems[idx] = set->elems[idx + 1]; in re_node_set_remove_at()
1471 hash += nodes->elems[i]; in calc_state_hash()
1588 Idx elem = newstate->nodes.elems[i]; in register_state()
1650 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1702 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_cd_newstate()