contrib/libgnuregex/regex_internal.c

973   set->elems = re_malloc (int, size);
974   if (BE (set->elems == NULL, 0))
985   set->elems = re_malloc (int, 1);
986   if (BE (set->elems == NULL, 0))
991   set->elems[0] = elem;
1000   set->elems = re_malloc (int, 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 (int, dest->alloc);
1034       if (BE (dest->elems == NULL, 0))
1039       memcpy (dest->elems, src->elems, src->nelem * sizeof (int));
1048    Note: We assume dest->elems is NULL, when dest->alloc is 0.  */
1064       int *new_elems = re_realloc (dest->elems, int, new_alloc);
1067       dest->elems = new_elems;
1079       if (src1->elems[i1] == src2->elems[i2])
1082 	  while (id >= 0 && dest->elems[id] > src1->elems[i1])
1085 	  if (id < 0 || 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 (int));
1150       dest->elems = re_malloc (int, 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       int *new_buffer = re_realloc (dest->elems, int, new_alloc);
1207       dest->elems = new_buffer;
1214       memcpy (dest->elems, src->elems, src->nelem * sizeof (int));
1223       if (dest->elems[id] == src->elems[is])
1225       else if (dest->elems[id] < src->elems[is])
1226 	dest->elems[--sbase] = src->elems[is--];
1227       else /* if (dest->elems[id] > src->elems[is]) */
1235       memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (int));
1249       if (dest->elems[is] > dest->elems[id])
1252 	  dest->elems[id + delta--] = dest->elems[is--];
1259 	  dest->elems[id + delta] = dest->elems[id];
1263 	      memcpy (dest->elems, dest->elems + sbase,
1294       set->elems[0] = elem;
1304       new_elems = re_realloc (set->elems, int, set->alloc);
1307       set->elems = new_elems;
1312   if (elem < set->elems[0])
1316 	set->elems[idx] = set->elems[idx - 1];
1320       for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1321 	set->elems[idx] = set->elems[idx - 1];
1325   set->elems[idx] = elem;
1343       new_elems = re_realloc (set->elems, int, set->alloc);
1346       set->elems = new_elems;
1350   set->elems[set->nelem++] = elem;
1365     if (set1->elems[i] != set2->elems[i])
1386       if (set->elems[mid] < elem)
1391   return set->elems[idx] == elem ? idx + 1 : 0;
1402     set->elems[idx] = set->elems[idx + 1];
1465     hash += nodes->elems[i];
1574       int elem = newstate->nodes.elems[i];
1636       re_token_t *node = dfa->nodes + nodes->elems[i];
1688       re_token_t *node = dfa->nodes + nodes->elems[i];