Lines Matching refs:nNumUsed
2598 Z_ARRVAL_P(return_value)->nNumUsed = (uint32_t)(start_key + num);
2899 zend_long i = hash->nNumUsed;
2912 if (hash->nNumUsed != hash->nNumOfElements) {
2913 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
2936 if (hash->nNumUsed != hash->nNumOfElements) {
2937 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
2963 hash->nNumUsed = n_elems;
3018 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, entry++) {
3033 for ( ; pos < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3043 for ( ; pos2 < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3062 for ( ; idx < in_hash->nNumUsed ; idx++, entry++) {
3077 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, p++) {
3098 for ( ; pos < offset + length && idx < in_hash->nNumUsed; idx++, p++) {
3113 for ( ; pos2 < offset + length && idx < in_hash->nNumUsed; idx++, p++) {
3131 for ( ; idx < in_hash->nNumUsed ; idx++, p++) {
3158 in_hash->nNumUsed = out_hash.nNumUsed;
3216 idx = Z_ARRVAL_P(stack)->nNumUsed;
3239 idx = Z_ARRVAL_P(stack)->nNumUsed;
3286 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3301 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3314 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3329 Z_ARRVAL_P(stack)->nNumUsed = k;
3339 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3354 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3419 Z_ARRVAL_P(stack)->nNumUsed = new_hash.nNumUsed;
3517 return ht->arData + ht->nNumUsed;
3544 return ht->arPacked + ht->nNumUsed;
3605 zval *end = ht->arPacked + ht->nNumUsed;
3650 Bucket *end = ht->arData + ht->nNumUsed;
4616 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, zv++) {
4626 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, p++) {
4878 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
4887 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
5263 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
5272 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
5742 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, zv++) {
5751 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, p++) {
5772 hash->nNumUsed = array_size;
5832 if (num_avail < ht->nNumUsed - (ht->nNumUsed >> 1)) {
5859 randval = algo->range(status, 0, ht->nNumUsed - 1);
5871 randval = algo->range(status, 0, ht->nNumUsed - 1);
6278 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6290 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6317 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6329 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6511 if (pos_values >= values->nNumUsed) {