Lines Matching refs:idx
2883 int64_t idx, j, n_elems, rnd_idx, n_left; local
2913 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
2914 zv = hash->arPacked + idx;
2916 if (j != idx) {
2937 for (j = 0, idx = 0; idx < hash->nNumUsed; idx++) {
2938 zv = hash->arPacked + idx;
2940 if (j != idx) {
2942 if (idx == iter_pos) {
2943 zend_hash_iterators_update(hash, idx, j);
2991 uint32_t idx; local
3018 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, entry++) {
3022 if (idx == iter_pos) {
3023 if ((zend_long)idx != pos) {
3024 zend_hash_iterators_update(in_hash, idx, pos);
3033 for ( ; pos < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3043 for ( ; pos2 < offset + length && idx < in_hash->nNumUsed; idx++, entry++) {
3061 entry = in_hash->arPacked + idx;
3062 for ( ; idx < in_hash->nNumUsed ; idx++, entry++) {
3065 if (idx == iter_pos) {
3066 if ((zend_long)idx != pos) {
3067 zend_hash_iterators_update(in_hash, idx, pos);
3077 for (pos = 0, idx = 0; pos < offset && idx < in_hash->nNumUsed; idx++, p++) {
3087 if (idx == iter_pos) {
3088 if ((zend_long)idx != pos) {
3089 zend_hash_iterators_update(in_hash, idx, pos);
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++) {
3139 if (idx == iter_pos) {
3140 if ((zend_long)idx != pos) {
3141 zend_hash_iterators_update(in_hash, idx, pos);
3204 uint32_t idx; local
3216 idx = Z_ARRVAL_P(stack)->nNumUsed;
3218 if (idx == 0) {
3221 idx--;
3222 val = Z_ARRVAL_P(stack)->arPacked + idx;
3229 if (idx == (Z_ARRVAL_P(stack)->nNextFreeElement - 1)) {
3239 idx = Z_ARRVAL_P(stack)->nNumUsed;
3241 if (idx == 0) {
3244 idx--;
3245 p = Z_ARRVAL_P(stack)->arData + idx;
3269 uint32_t idx; local
3284 idx = 0;
3286 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3289 val = Z_ARRVAL_P(stack)->arPacked + idx;
3293 idx++;
3301 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3302 val = Z_ARRVAL_P(stack)->arPacked + idx;
3304 if (idx != k) {
3314 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3315 val = Z_ARRVAL_P(stack)->arPacked + idx;
3317 if (idx != k) {
3321 if (idx == iter_pos) {
3322 zend_hash_iterators_update(Z_ARRVAL_P(stack), idx, k);
3337 idx = 0;
3339 if (idx == Z_ARRVAL_P(stack)->nNumUsed) {
3342 p = Z_ARRVAL_P(stack)->arData + idx;
3347 idx++;
3354 for (idx = 0; idx < Z_ARRVAL_P(stack)->nNumUsed; idx++) {
3355 p = Z_ARRVAL_P(stack)->arData + idx;
3629 zend_long idx = zv - ht->arPacked; local
3631 for (; zv != end; zv++, idx++) {
3640 entry = zend_hash_index_add_new(Z_ARRVAL_P(return_value), idx, zv);
4556 uint32_t i, idx; local
4616 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, zv++) {
4619 arTmp[i].b.h = idx;
4626 for (i = 0, idx = 0; idx < Z_ARRVAL_P(array)->nNumUsed; idx++, p++) {
4772 uint32_t idx; local
4878 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
4881 list->h = idx;
4887 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
5157 uint32_t idx; local
5263 for (idx = 0; idx < hash->nNumUsed; idx++, zv++) {
5266 list->h = idx;
5272 for (idx = 0; idx < hash->nNumUsed; idx++, p++) {
5427 zend_long idx; local
5525 ZEND_HASH_FOREACH_KEY_VAL(Z_ARRVAL(args[0]), idx, key, value) {
5531 value = zend_hash_index_add_new(Z_ARRVAL_P(return_value), idx, value);
5623 uint32_t idx; local
5742 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, zv++) {
5745 indirect[k][i].h = idx;
5751 for (idx = 0; idx < Z_ARRVAL_P(arrays[i])->nNumUsed; idx++, p++) {
