lib/libregex/regex_internal.c

898   set->elems = re_malloc (int, size);
899   if (BE (set->elems == NULL, 0))
911   set->elems = re_malloc (int, 1);
912   if (BE (set->elems == NULL, 0))
917   set->elems[0] = elem;
927   set->elems = re_malloc (int, 2);
928   if (BE (set->elems == NULL, 0))
933       set->elems[0] = elem1;
940 	  set->elems[0] = elem1;
941 	  set->elems[1] = elem2;
945 	  set->elems[0] = elem2;
946 	  set->elems[1] = elem1;
961       dest->elems = re_malloc (int, dest->alloc);
962       if (BE (dest->elems == NULL, 0))
967       memcpy (dest->elems, src->elems, src->nelem * sizeof (int));
976    Note: We assume dest->elems is NULL, when dest->alloc is 0.  */
992       int *new_elems = re_realloc (dest->elems, int, new_alloc);
995       dest->elems = new_elems;
1007       if (src1->elems[i1] == src2->elems[i2])
1010 	  while (id >= 0 && dest->elems[id] > src1->elems[i1])
1013           if (id < 0 || dest->elems[id] != src1->elems[i1])
1014             dest->elems[--sbase] = src1->elems[i1];
1021       else if (src1->elems[i1] < src2->elems[i2])
1044         if (dest->elems[is] > dest->elems[id])
1047             dest->elems[id + delta--] = dest->elems[is--];
1054             dest->elems[id + delta] = dest->elems[id];
1061   memcpy (dest->elems, dest->elems + sbase, delta * sizeof (int));
1078       dest->elems = re_malloc (int, dest->alloc);
1079       if (BE (dest->elems == NULL, 0))
1094       if (src1->elems[i1] > src2->elems[i2])
1096 	  dest->elems[id++] = src2->elems[i2++];
1099       if (src1->elems[i1] == src2->elems[i2])
1101       dest->elems[id++] = src1->elems[i1++];
1105       memcpy (dest->elems + id, src1->elems + i1,
1111       memcpy (dest->elems + id, src2->elems + i2,
1133       int *new_buffer = re_realloc (dest->elems, int, new_alloc);
1136       dest->elems = new_buffer;
1143       memcpy (dest->elems, src->elems, src->nelem * sizeof (int));
1152       if (dest->elems[id] == src->elems[is])
1154       else if (dest->elems[id] < src->elems[is])
1155         dest->elems[--sbase] = src->elems[is--];
1156       else /* if (dest->elems[id] > src->elems[is]) */
1164       memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (int));
1178       if (dest->elems[is] > dest->elems[id])
1181           dest->elems[id + delta--] = dest->elems[is--];
1188           dest->elems[id + delta] = dest->elems[id];
1192 	      memcpy (dest->elems, dest->elems + sbase,
1224       set->elems[0] = elem;
1234       new_array = re_realloc (set->elems, int, set->alloc);
1237       set->elems = new_array;
1242   if (elem < set->elems[0])
1246         set->elems[idx] = set->elems[idx - 1];
1250       for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1251         set->elems[idx] = set->elems[idx - 1];
1255   set->elems[idx] = elem;
1274       new_array = re_realloc (set->elems, int, set->alloc);
1277       set->elems = new_array;
1281   set->elems[set->nelem++] = elem;
1296     if (set1->elems[i] != set2->elems[i])
1318       if (set->elems[mid] < elem)
1323   return set->elems[idx] == elem ? idx + 1 : 0;
1335     set->elems[idx] = set->elems[idx + 1];
1393     hash += nodes->elems[i];
1512       int elem = newstate->nodes.elems[i];
1558       re_token_t *node = dfa->nodes + nodes->elems[i];
1612       re_token_t *node = dfa->nodes + nodes->elems[i];