Lines Matching refs:nelem
975 set->nelem = 0;
987 set->nelem = 1;
991 set->alloc = set->nelem = 0;
1008 set->nelem = 1;
1013 set->nelem = 2;
1032 dest->nelem = src->nelem;
1033 if (src->nelem > 0)
1035 dest->alloc = dest->nelem;
1039 dest->alloc = dest->nelem = 0;
1042 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1059 if (src1->nelem == 0 || src2->nelem == 0)
1062 /* We need dest->nelem + 2 * elems_in_intersection; this is a
1064 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc)
1066 Idx new_alloc = src1->nelem + src2->nelem + dest->alloc;
1076 sbase = dest->nelem + src1->nelem + src2->nelem;
1077 i1 = src1->nelem - 1;
1078 i2 = src2->nelem - 1;
1079 id = dest->nelem - 1;
1108 id = dest->nelem - 1;
1109 is = dest->nelem + src1->nelem + src2->nelem - 1;
1115 dest->nelem += delta;
1150 if (src1 != NULL && src1->nelem > 0 && src2 != NULL && src2->nelem > 0)
1152 dest->alloc = src1->nelem + src2->nelem;
1159 if (src1 != NULL && src1->nelem > 0)
1161 else if (src2 != NULL && src2->nelem > 0)
1167 for (i1 = i2 = id = 0 ; i1 < src1->nelem && i2 < src2->nelem ;)
1178 if (i1 < src1->nelem)
1181 (src1->nelem - i1) * sizeof (Idx));
1182 id += src1->nelem - i1;
1184 else if (i2 < src2->nelem)
1187 (src2->nelem - i2) * sizeof (Idx));
1188 id += src2->nelem - i2;
1190 dest->nelem = id;
1202 if (src == NULL || src->nelem == 0)
1204 if (dest->alloc < 2 * src->nelem + dest->nelem)
1206 Idx new_alloc = 2 * (src->nelem + dest->alloc);
1214 if (BE (dest->nelem == 0, 0))
1216 dest->nelem = src->nelem;
1217 memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx));
1223 for (sbase = dest->nelem + 2 * src->nelem,
1224 is = src->nelem - 1, id = dest->nelem - 1;
1242 id = dest->nelem - 1;
1243 is = dest->nelem + 2 * src->nelem - 1;
1250 dest->nelem += delta;
1290 if (BE (set->nelem, 0) == 0)
1294 ++set->nelem;
1299 if (set->alloc == set->nelem)
1314 for (idx = set->nelem; idx > 0; idx--)
1319 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--)
1325 ++set->nelem;
1338 if (set->alloc == set->nelem)
1349 set->elems[set->nelem++] = elem;
1361 if (set1 == NULL || set2 == NULL || set1->nelem != set2->nelem)
1363 for (i = set1->nelem ; REG_VALID_INDEX (--i) ; )
1376 if (! REG_VALID_NONZERO_INDEX (set->nelem))
1381 right = set->nelem - 1;
1397 if (idx < 0 || idx >= set->nelem)
1399 --set->nelem;
1400 for (; idx < set->nelem; idx++)
1464 re_hashval_t hash = nodes->nelem + context;
1466 for (i = 0 ; i < nodes->nelem ; i++)
1493 if (BE (nodes->nelem == 0, 0))
1541 if (nodes->nelem == 0)
1578 err = re_node_set_alloc (&newstate->non_eps_nodes, newstate->nodes.nelem);
1581 for (i = 0; i < newstate->nodes.nelem; i++)
1643 for (i = 0 ; i < nodes->nelem ; i++)
1695 for (i = 0 ; i < nodes->nelem ; i++)
