Lines Matching refs:elems
973 set->elems = re_malloc (Idx, size);
974 if (BE (set->elems == NULL, 0) && (MALLOC_0_IS_NONNULL || size != 0))
985 set->elems = re_malloc (Idx, 1);
986 if (BE (set->elems == NULL, 0))
991 set->elems[0] = elem;
1000 set->elems = re_malloc (Idx, 2);
1001 if (BE (set->elems == NULL, 0))
1006 set->elems[0] = elem1;
1013 set->elems[0] = elem1;
1014 set->elems[1] = elem2;
1018 set->elems[0] = elem2;
1019 set->elems[1] = elem1;
1033 dest->elems = re_malloc (Idx, dest->alloc);
1034 if (BE (dest->elems == NULL, 0))
1039 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1048 Note: We assume dest->elems is NULL, when dest->alloc is 0. */
1064 Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc);
1067 dest->elems = new_elems;
1079 if (src1->elems[i1] == src2->elems[i2])
1082 while (REG_VALID_INDEX (id) && dest->elems[id] > src1->elems[i1])
1085 if (! REG_VALID_INDEX (id) || dest->elems[id] != src1->elems[i1])
1086 dest->elems[--sbase] = src1->elems[i1];
1093 else if (src1->elems[i1] < src2->elems[i2])
1116 if (dest->elems[is] > dest->elems[id])
1119 dest->elems[id + delta--] = dest->elems[is--];
1126 dest->elems[id + delta] = dest->elems[id];
1133 memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx));
1150 dest->elems = re_malloc (Idx, dest->alloc);
1151 if (BE (dest->elems == NULL, 0))
1166 if (src1->elems[i1] > src2->elems[i2])
1168 dest->elems[id++] = src2->elems[i2++];
1171 if (src1->elems[i1] == src2->elems[i2])
1173 dest->elems[id++] = src1->elems[i1++];
1177 memcpy (dest->elems + id, src1->elems + i1,
1183 memcpy (dest->elems + id, src2->elems + i2,
1204 Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc);
1207 dest->elems = new_buffer;
1214 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1224 if (dest->elems[id] == src->elems[is])
1226 else if (dest->elems[id] < src->elems[is])
1227 dest->elems[--sbase] = src->elems[is--];
1228 else /* if (dest->elems[id] > src->elems[is]) */
1236 memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx));
1250 if (dest->elems[is] > dest->elems[id])
1253 dest->elems[id + delta--] = dest->elems[is--];
1260 dest->elems[id + delta] = dest->elems[id];
1264 memcpy (dest->elems, dest->elems + sbase,
1290 set->elems[0] = elem;
1300 new_elems = re_realloc (set->elems, Idx, set->alloc);
1303 set->elems = new_elems;
1308 if (elem < set->elems[0])
1312 set->elems[idx] = set->elems[idx - 1];
1316 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1317 set->elems[idx] = set->elems[idx - 1];
1321 set->elems[idx] = elem;
1339 new_elems = re_realloc (set->elems, Idx, set->alloc);
1342 set->elems = new_elems;
1346 set->elems[set->nelem++] = elem;
1361 if (set1->elems[i] != set2->elems[i])
1382 if (set->elems[mid] < elem)
1387 return set->elems[idx] == elem ? idx + 1 : 0;
1398 set->elems[idx] = set->elems[idx + 1];
1461 hash += nodes->elems[i];
1578 Idx elem = newstate->nodes.elems[i];
1640 re_token_t *node = dfa->nodes + nodes->elems[i];
1692 re_token_t *node = dfa->nodes + nodes->elems[i];