Lines Matching refs:nNumUsed

2684 			Z_ARRVAL_P(return_value)->nNumUsed = (uint32_t)(start_key + num);
3121 zend_long i = hash->nNumUsed;
3134 if (hash->nNumUsed != hash->nNumOfElements) {
3135 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
3158 if (hash->nNumUsed != hash->nNumOfElements) {
3159 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
3185 hash->nNumUsed = n_elems;
3240 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, entry++) {
3255 for ( ; pos < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3265 for ( ; pos2 < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3284 for ( ; idx < in_hash->nNumUsed ; idx++, entry++) {
3299 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, p++) {
3320 for ( ; pos < offset + length && idx < in_hash->nNumUsed; idx++, p++) {
3335 for ( ; pos2 < offset + length && idx < in_hash->nNumUsed; idx++, p++) {
3353 for ( ; idx < in_hash->nNumUsed ; idx++, p++) {
3380 in_hash->nNumUsed = out_hash.nNumUsed;
3437 idx = Z_ARRVAL_P(stack)->nNumUsed;
3460 idx = Z_ARRVAL_P(stack)->nNumUsed;
3507 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3522 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3535 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3550 Z_ARRVAL_P(stack)->nNumUsed = k;
3560 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3575 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3639 Z_ARRVAL_P(stack)->nNumUsed = new_hash.nNumUsed;
3737 return ht->arData + ht->nNumUsed;
3764 return ht->arPacked + ht->nNumUsed;
3825 zval *end = ht->arPacked + ht->nNumUsed;
3866 Bucket *end = ht->arData + ht->nNumUsed;
4864 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, zv++) {
4874 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, p++) {
5132 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
5141 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
5527 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
5536 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
6008 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, zv++) {
6017 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, p++) {
6038 hash->nNumUsed = array_size;
6096 if (num_avail < ht->nNumUsed - (ht->nNumUsed >> 1)) {
6123 randval = algo->range(status, 0, ht->nNumUsed - 1);
6135 randval = algo->range(status, 0, ht->nNumUsed - 1);
6546 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6558 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6585 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6597 if (pos >= Z_ARRVAL(arrays[i])->nNumUsed) {
6779 if (pos_values >= values->nNumUsed) {