Lines Matching refs:nelem
973 set->nelem = 0;
985 set->nelem = 1;
989 set->alloc = set->nelem = 0;
1006 set->nelem = 1;
1011 set->nelem = 2;
1030 dest->nelem = src->nelem;
1031 if (src->nelem > 0)
1033 dest->alloc = dest->nelem;
1037 dest->alloc = dest->nelem = 0;
1040 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1057 if (src1->nelem == 0 || src2->nelem == 0)
1060 /* We need dest->nelem + 2 * elems_in_intersection; this is a
1062 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc)
1064 Idx new_alloc = src1->nelem + src2->nelem + dest->alloc;
1074 sbase = dest->nelem + src1->nelem + src2->nelem;
1075 i1 = src1->nelem - 1;
1076 i2 = src2->nelem - 1;
1077 id = dest->nelem - 1;
1106 id = dest->nelem - 1;
1107 is = dest->nelem + src1->nelem + src2->nelem - 1;
1113 dest->nelem += delta;
1148 if (src1 != NULL && src1->nelem > 0 && src2 != NULL && src2->nelem > 0)
1150 dest->alloc = src1->nelem + src2->nelem;
1157 if (src1 != NULL && src1->nelem > 0)
1159 else if (src2 != NULL && src2->nelem > 0)
1165 for (i1 = i2 = id = 0 ; i1 < src1->nelem && i2 < src2->nelem ;)
1176 if (i1 < src1->nelem)
1179 (src1->nelem - i1) * sizeof (Idx));
1180 id += src1->nelem - i1;
1182 else if (i2 < src2->nelem)
1185 (src2->nelem - i2) * sizeof (Idx));
1186 id += src2->nelem - i2;
1188 dest->nelem = id;
1200 if (src == NULL || src->nelem == 0)
1202 if (dest->alloc < 2 * src->nelem + dest->nelem)
1204 Idx new_alloc = 2 * (src->nelem + dest->alloc);
1212 if (BE (dest->nelem == 0, 0))
1214 dest->nelem = src->nelem;
1215 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1221 for (sbase = dest->nelem + 2 * src->nelem,
1222 is = src->nelem - 1, id = dest->nelem - 1;
1240 id = dest->nelem - 1;
1241 is = dest->nelem + 2 * src->nelem - 1;
1248 dest->nelem += delta;
1288 if (BE (set->nelem, 0) == 0)
1292 ++set->nelem;
1297 if (set->alloc == set->nelem)
1312 for (idx = set->nelem; idx > 0; idx--)
1317 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1323 ++set->nelem;
1336 if (set->alloc == set->nelem)
1347 set->elems[set->nelem++] = elem;
1359 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
1361 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; )
1374 if (! REG_VALID_NONZERO_INDEX (set->nelem))
1379 right = set->nelem - 1;
1395 if (idx < 0 || idx >= set->nelem)
1397 --set->nelem;
1398 for (; idx < set->nelem; idx++)
1462 re_hashval_t hash = nodes->nelem + context;
1464 for (i = 0 ; i < nodes->nelem ; i++)
1491 if (BE (nodes->nelem == 0, 0))
1539 if (nodes->nelem == 0)
1576 err = re_node_set_alloc (&newstate->non_eps_nodes, newstate->nodes.nelem);
1579 for (i = 0; i < newstate->nodes.nelem; i++)
1641 for (i = 0 ; i < nodes->nelem ; i++)
1693 for (i = 0 ; i < nodes->nelem ; i++)