974   set->elems = re_malloc (Idx, size);  in re_node_set_alloc()
975   if (BE (set->elems == NULL, 0))  in re_node_set_alloc()
986   set->elems = re_malloc (Idx, 1);  in re_node_set_init_1()
987   if (BE (set->elems == NULL, 0))  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 (BE (set->elems == NULL, 0))  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 (BE (dest->elems == NULL, 0))  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 (REG_VALID_INDEX (id) && dest->elems[id] > src1->elems[i1])  in re_node_set_add_intersect()
1086           if (! REG_VALID_INDEX (id) || 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 (BE (dest->elems == NULL, 0))  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()
1215       memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));  in re_node_set_merge()
1225       if (dest->elems[id] == src->elems[is])  in re_node_set_merge()
1227       else if (dest->elems[id] < src->elems[is])  in re_node_set_merge()
1228         dest->elems[--sbase] = src->elems[is--];  in re_node_set_merge()
1237       memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx));  in re_node_set_merge()
1251       if (dest->elems[is] > dest->elems[id])  in re_node_set_merge()
1254           dest->elems[id + delta--] = dest->elems[is--];  in re_node_set_merge()
1261           dest->elems[id + delta] = dest->elems[id];  in re_node_set_merge()
1265 	      memcpy (dest->elems, dest->elems + sbase,  in re_node_set_merge()
1291       set->elems[0] = elem;  in re_node_set_insert()
1301       new_elems = re_realloc (set->elems, Idx, set->alloc);  in re_node_set_insert()
1304       set->elems = new_elems;  in re_node_set_insert()
1309   if (elem < set->elems[0])  in re_node_set_insert()
1313         set->elems[idx] = set->elems[idx - 1];  in re_node_set_insert()
1317       for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)  in re_node_set_insert()
1318         set->elems[idx] = set->elems[idx - 1];  in re_node_set_insert()
1322   set->elems[idx] = elem;  in re_node_set_insert()
1340       new_elems = re_realloc (set->elems, Idx, set->alloc);  in re_node_set_insert_last()
1343       set->elems = new_elems;  in re_node_set_insert_last()
1347   set->elems[set->nelem++] = elem;  in re_node_set_insert_last()
1362     if (set1->elems[i] != set2->elems[i])  in internal_function()
1383       if (set->elems[mid] < elem)  in internal_function()
1388   return set->elems[idx] == elem ? idx + 1 : 0;  in internal_function()
1399     set->elems[idx] = set->elems[idx + 1];  in re_node_set_remove_at()
1464     hash += nodes->elems[i];  in calc_state_hash()
1580       Idx elem = newstate->nodes.elems[i];  in register_state()
1642       re_token_t *node = dfa->nodes + nodes->elems[i];  in create_ci_newstate()
1694       re_token_t *node = dfa->nodes + nodes->elems[i];  in create_cd_newstate()