14#include "ruby/internal/config.h"
19# ifdef HAVE_CRT_EXTERNS_H
20# include <crt_externs.h>
22# include "missing/crt_externs.h"
26#include "debug_counter.h"
29#include "internal/array.h"
30#include "internal/bignum.h"
31#include "internal/basic_operators.h"
32#include "internal/class.h"
33#include "internal/cont.h"
34#include "internal/error.h"
35#include "internal/hash.h"
36#include "internal/object.h"
37#include "internal/proc.h"
38#include "internal/st.h"
39#include "internal/symbol.h"
40#include "internal/thread.h"
41#include "internal/time.h"
42#include "internal/vm.h"
46#include "ruby_assert.h"
74#define SET_DEFAULT(hash, ifnone) ( \
75 FL_UNSET_RAW(hash, RHASH_PROC_DEFAULT), \
76 RHASH_SET_IFNONE(hash, ifnone))
78#define SET_PROC_DEFAULT(hash, proc) set_proc_default(hash, proc)
80#define COPY_DEFAULT(hash, hash2) copy_default(RHASH(hash), RHASH(hash2))
83copy_default(
struct RHash *hash,
const struct RHash *hash2)
85 hash->basic.
flags &= ~RHASH_PROC_DEFAULT;
86 hash->basic.
flags |= hash2->basic.
flags & RHASH_PROC_DEFAULT;
110VALUE rb_cHash_empty_frozen;
113static ID id_hash, id_flatten_bang;
114static ID id_hash_iter_lev;
116#define id_default idDefault
128 if (a == b)
return 0;
133 if (UNDEF_P(a) || UNDEF_P(b))
return -1;
142hash_recursive(
VALUE obj,
VALUE arg,
int recurse)
144 if (recurse)
return INT2FIX(0);
145 return rb_funcallv(obj, id_hash, 0, 0);
148static long rb_objid_hash(st_index_t index);
151dbl_to_index(
double d)
153 union {
double d; st_index_t i;} u;
159rb_dbl_long_hash(
double d)
162 if (d == 0.0) d = 0.0;
163#if SIZEOF_INT == SIZEOF_VOIDP
166 return rb_objid_hash(dbl_to_index(d));
171any_hash(
VALUE a, st_index_t (*other_func)(
VALUE))
183 hnum = RSHIFT(RSYMBOL(a)->hashval, 1);
190 hnum = rb_objid_hash((st_index_t)a);
196 hval = rb_big_hash(a);
200 hnum = rb_dbl_long_hash(rb_float_value(a));
203 hnum = other_func(a);
216obj_any_hash(
VALUE obj)
222 if (cme && METHOD_ENTRY_BASIC(cme)) {
224 if (cme->def->type == VM_METHOD_TYPE_CFUNC && cme->def->body.cfunc.func == (rb_cfunc_t)rb_obj_hash) {
225 hval = rb_obj_hash(obj);
228 hval = rb_vm_call0(GET_EC(), obj, id_hash, 0, 0, cme, 0);
234 hval = rb_exec_recursive_outer_mid(hash_recursive, obj, 0, id_hash);
241 sign = rb_integer_pack(hval, &ul, 1,
sizeof(ul), 0,
259 return any_hash(a, obj_any_hash);
265 return LONG2FIX(any_hash(obj, obj_any_hash));
274static const uint64_t prime1 = ((uint64_t)0x2e0bb864 << 32) | 0xe9ea7df5;
275static const uint32_t prime2 = 0x830fcab9;
278static inline uint64_t
279mult_and_mix(uint64_t m1, uint64_t m2)
281#if defined HAVE_UINT128_T
282 uint128_t r = (uint128_t) m1 * (uint128_t) m2;
283 return (uint64_t) (r >> 64) ^ (uint64_t) r;
285 uint64_t hm1 = m1 >> 32, hm2 = m2 >> 32;
286 uint64_t lm1 = m1, lm2 = m2;
287 uint64_t v64_128 = hm1 * hm2;
288 uint64_t v32_96 = hm1 * lm2 + lm1 * hm2;
289 uint64_t v1_32 = lm1 * lm2;
291 return (v64_128 + (v32_96 >> 32)) ^ ((v32_96 << 32) + v1_32);
295static inline uint64_t
296key64_hash(uint64_t key, uint32_t seed)
298 return mult_and_mix(key + seed, prime1);
302#define st_index_hash(index) key64_hash(rb_hash_start(index), prime2)
305rb_objid_hash(st_index_t index)
307 return (
long)st_index_hash(index);
313 VALUE object_id = rb_obj_id(obj);
315 object_id = rb_big_hash(object_id);
317#if SIZEOF_LONG == SIZEOF_VOIDP
318 return (st_index_t)st_index_hash((st_index_t)
NUM2LONG(object_id));
319#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
320 return (st_index_t)st_index_hash((st_index_t)
NUM2LL(object_id));
355rb_obj_hash(
VALUE obj)
357 long hnum = any_hash(obj, objid_hash);
366#define rb_ident_cmp st_numcmp
369rb_ident_hash(st_data_t n)
378 n ^= dbl_to_index(rb_float_value(n));
382 return (st_index_t)st_index_hash((st_index_t)n);
385#define identhash rb_hashtype_ident
391#define RHASH_IDENTHASH_P(hash) (RHASH_TYPE(hash) == &identhash)
392#define RHASH_STRING_KEY_P(hash, key) (!RHASH_IDENTHASH_P(hash) && (rb_obj_class(key) == rb_cString))
394typedef st_index_t st_hash_t;
404#define RHASH_AR_TABLE_MAX_BOUND RHASH_AR_TABLE_MAX_SIZE
406#define RHASH_AR_TABLE_REF(hash, n) (&RHASH_AR_TABLE(hash)->pairs[n])
407#define RHASH_AR_CLEARED_HINT 0xff
409static inline st_hash_t
410ar_do_hash(st_data_t key)
412 return (st_hash_t)rb_any_hash(key);
415static inline ar_hint_t
416ar_do_hash_hint(st_hash_t hash_value)
418 return (ar_hint_t)hash_value;
421static inline ar_hint_t
422ar_hint(
VALUE hash,
unsigned int index)
424 return RHASH_AR_TABLE(hash)->ar_hint.ary[index];
428ar_hint_set_hint(
VALUE hash,
unsigned int index, ar_hint_t hint)
430 RHASH_AR_TABLE(hash)->ar_hint.ary[index] = hint;
434ar_hint_set(
VALUE hash,
unsigned int index, st_hash_t hash_value)
436 ar_hint_set_hint(hash, index, ar_do_hash_hint(hash_value));
440ar_clear_entry(
VALUE hash,
unsigned int index)
444 ar_hint_set_hint(hash, index, RHASH_AR_CLEARED_HINT);
448ar_cleared_entry(
VALUE hash,
unsigned int index)
450 if (ar_hint(hash, index) == RHASH_AR_CLEARED_HINT) {
455 return UNDEF_P(pair->key);
463ar_set_entry(
VALUE hash,
unsigned int index, st_data_t key, st_data_t val, st_hash_t hash_value)
468 ar_hint_set(hash, index, hash_value);
471#define RHASH_AR_TABLE_SIZE(h) (HASH_ASSERT(RHASH_AR_TABLE_P(h)), \
472 RHASH_AR_TABLE_SIZE_RAW(h))
474#define RHASH_AR_TABLE_BOUND_RAW(h) \
475 ((unsigned int)((RBASIC(h)->flags >> RHASH_AR_TABLE_BOUND_SHIFT) & \
476 (RHASH_AR_TABLE_BOUND_MASK >> RHASH_AR_TABLE_BOUND_SHIFT)))
478#define RHASH_ST_TABLE_SET(h, s) rb_hash_st_table_set(h, s)
479#define RHASH_TYPE(hash) (RHASH_AR_TABLE_P(hash) ? &objhash : RHASH_ST_TABLE(hash)->type)
481#define HASH_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(HASH_DEBUG, expr, #expr)
483static inline unsigned int
484RHASH_AR_TABLE_BOUND(
VALUE h)
486 HASH_ASSERT(RHASH_AR_TABLE_P(h));
487 const unsigned int bound = RHASH_AR_TABLE_BOUND_RAW(h);
488 HASH_ASSERT(bound <= RHASH_AR_TABLE_MAX_SIZE);
493#define hash_verify(hash) hash_verify_(hash, __FILE__, __LINE__)
496rb_hash_dump(
VALUE hash)
498 rb_obj_info_dump(hash);
500 if (RHASH_AR_TABLE_P(hash)) {
501 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
503 fprintf(stderr,
" size:%u bound:%u\n",
504 RHASH_AR_TABLE_SIZE(hash), bound);
506 for (i=0; i<bound; i++) {
509 if (!ar_cleared_entry(hash, i)) {
510 char b1[0x100], b2[0x100];
514 fprintf(stderr,
" %d key:%s val:%s hint:%02x\n", i,
515 rb_raw_obj_info(b1, 0x100, k),
516 rb_raw_obj_info(b2, 0x100, v),
520 fprintf(stderr,
" %d empty\n", i);
527hash_verify_(
VALUE hash,
const char *file,
int line)
531 if (RHASH_AR_TABLE_P(hash)) {
532 unsigned i, n = 0, bound = RHASH_AR_TABLE_BOUND(hash);
534 for (i=0; i<bound; i++) {
536 if (!ar_cleared_entry(hash, i)) {
540 HASH_ASSERT(!UNDEF_P(k));
541 HASH_ASSERT(!UNDEF_P(v));
545 if (n != RHASH_AR_TABLE_SIZE(hash)) {
546 rb_bug(
"n:%u, RHASH_AR_TABLE_SIZE:%u", n, RHASH_AR_TABLE_SIZE(hash));
550 HASH_ASSERT(RHASH_ST_TABLE(hash) != NULL);
551 HASH_ASSERT(RHASH_AR_TABLE_SIZE_RAW(hash) == 0);
552 HASH_ASSERT(RHASH_AR_TABLE_BOUND_RAW(hash) == 0);
559#define hash_verify(h) ((void)0)
563RHASH_TABLE_EMPTY_P(
VALUE hash)
568#define RHASH_SET_ST_FLAG(h) FL_SET_RAW(h, RHASH_ST_TABLE_FLAG)
569#define RHASH_UNSET_ST_FLAG(h) FL_UNSET_RAW(h, RHASH_ST_TABLE_FLAG)
574 st_init_existing_table_with_size(RHASH_ST_TABLE(hash),
type, size);
575 RHASH_SET_ST_FLAG(hash);
581 HASH_ASSERT(st != NULL);
582 RHASH_SET_ST_FLAG(hash);
584 *RHASH_ST_TABLE(hash) = *st;
588RHASH_AR_TABLE_BOUND_SET(
VALUE h, st_index_t n)
590 HASH_ASSERT(RHASH_AR_TABLE_P(h));
591 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_BOUND);
593 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
594 RBASIC(h)->flags |= n << RHASH_AR_TABLE_BOUND_SHIFT;
598RHASH_AR_TABLE_SIZE_SET(
VALUE h, st_index_t n)
600 HASH_ASSERT(RHASH_AR_TABLE_P(h));
601 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_SIZE);
603 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
604 RBASIC(h)->flags |= n << RHASH_AR_TABLE_SIZE_SHIFT;
608HASH_AR_TABLE_SIZE_ADD(
VALUE h, st_index_t n)
610 HASH_ASSERT(RHASH_AR_TABLE_P(h));
612 RHASH_AR_TABLE_SIZE_SET(h, RHASH_AR_TABLE_SIZE(h) + n);
617#define RHASH_AR_TABLE_SIZE_INC(h) HASH_AR_TABLE_SIZE_ADD(h, 1)
620RHASH_AR_TABLE_SIZE_DEC(
VALUE h)
622 HASH_ASSERT(RHASH_AR_TABLE_P(h));
623 int new_size = RHASH_AR_TABLE_SIZE(h) - 1;
626 RHASH_AR_TABLE_SIZE_SET(h, new_size);
629 RHASH_AR_TABLE_SIZE_SET(h, 0);
630 RHASH_AR_TABLE_BOUND_SET(h, 0);
636RHASH_AR_TABLE_CLEAR(
VALUE h)
638 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
639 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
641 memset(RHASH_AR_TABLE(h), 0,
sizeof(
ar_table));
644NOINLINE(
static int ar_equal(
VALUE x,
VALUE y));
649 return rb_any_cmp(x, y) == 0;
653ar_find_entry_hint(
VALUE hash, ar_hint_t hint, st_data_t key)
655 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
656 const ar_hint_t *hints = RHASH_AR_TABLE(hash)->ar_hint.ary;
660 for (i = 0; i < bound; i++) {
661 if (hints[i] == hint) {
663 if (ar_equal(key, pair->key)) {
664 RB_DEBUG_COUNTER_INC(artable_hint_hit);
670 static char fname[256];
673 if (pid != getpid()) {
674 snprintf(fname,
sizeof(fname),
"/tmp/ruby-armiss.%d", pid = getpid());
675 if ((fp = fopen(fname,
"w")) == NULL) rb_bug(
"fopen");
678 st_hash_t h1 = ar_do_hash(key);
679 st_hash_t h2 = ar_do_hash(pair->key);
681 fprintf(fp,
"miss: hash_eq:%d hints[%d]:%02x hint:%02x\n"
683 " pair->key:%016lx %s\n",
684 h1 == h2, i, hints[i], hint,
685 h1, rb_obj_info(key), h2, rb_obj_info(pair->key));
687 RB_DEBUG_COUNTER_INC(artable_hint_miss);
691 RB_DEBUG_COUNTER_INC(artable_hint_notfound);
692 return RHASH_AR_TABLE_MAX_BOUND;
696ar_find_entry(
VALUE hash, st_hash_t hash_value, st_data_t key)
698 ar_hint_t hint = ar_do_hash_hint(hash_value);
699 return ar_find_entry_hint(hash, hint, key);
703hash_ar_free_and_clear_table(
VALUE hash)
705 RHASH_AR_TABLE_CLEAR(hash);
707 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
708 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
711void rb_st_add_direct_with_hash(
st_table *tab, st_data_t key, st_data_t value, st_hash_t hash);
713enum ar_each_key_type {
720ar_each_key(
ar_table *ar,
int max,
enum ar_each_key_type
type, st_data_t *dst_keys,
st_table *new_tab, st_hash_t *hashes)
722 for (
int i = 0; i < max; i++) {
726 case ar_each_key_copy:
727 dst_keys[i] = pair->key;
729 case ar_each_key_cmp:
730 if (dst_keys[i] != pair->key)
return 1;
732 case ar_each_key_insert:
733 if (UNDEF_P(pair->key))
continue;
734 rb_st_add_direct_with_hash(new_tab, pair->key, pair->val, hashes[i]);
743ar_force_convert_table(
VALUE hash,
const char *file,
int line)
745 if (RHASH_ST_TABLE_P(hash)) {
746 return RHASH_ST_TABLE(hash);
749 ar_table *ar = RHASH_AR_TABLE(hash);
750 st_hash_t hashes[RHASH_AR_TABLE_MAX_SIZE];
751 unsigned int bound, size;
755 st_data_t keys[RHASH_AR_TABLE_MAX_SIZE];
756 bound = RHASH_AR_TABLE_BOUND(hash);
757 size = RHASH_AR_TABLE_SIZE(hash);
758 ar_each_key(ar, bound, ar_each_key_copy, keys, NULL, NULL);
760 for (
unsigned int i = 0; i < bound; i++) {
762 hashes[i] = UNDEF_P(keys[i]) ? 0 : ar_do_hash(keys[i]);
766 if (UNLIKELY(!RHASH_AR_TABLE_P(hash)))
return RHASH_ST_TABLE(hash);
767 if (UNLIKELY(RHASH_AR_TABLE_BOUND(hash) != bound))
continue;
768 if (UNLIKELY(ar_each_key(ar, bound, ar_each_key_cmp, keys, NULL, NULL)))
continue;
774 st_init_existing_table_with_size(new_tab, &objhash, size);
775 ar_each_key(ar, bound, ar_each_key_insert, NULL, new_tab, hashes);
776 hash_ar_free_and_clear_table(hash);
777 RHASH_ST_TABLE_SET(hash, new_tab);
778 return RHASH_ST_TABLE(hash);
783ar_compact_table(
VALUE hash)
785 const unsigned bound = RHASH_AR_TABLE_BOUND(hash);
786 const unsigned size = RHASH_AR_TABLE_SIZE(hash);
795 for (i=0; i<bound; i++) {
796 if (ar_cleared_entry(hash, i)) {
798 for (; j<bound; j++) {
799 if (!ar_cleared_entry(hash, j)) {
801 ar_hint_set_hint(hash, i, (st_hash_t)ar_hint(hash, j));
802 ar_clear_entry(hash, j);
813 HASH_ASSERT(i<=bound);
815 RHASH_AR_TABLE_BOUND_SET(hash, size);
822ar_add_direct_with_hash(
VALUE hash, st_data_t key, st_data_t val, st_hash_t hash_value)
824 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
826 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
830 if (UNLIKELY(bin >= RHASH_AR_TABLE_MAX_BOUND)) {
831 bin = ar_compact_table(hash);
833 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
835 ar_set_entry(hash, bin, key, val, hash_value);
836 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
837 RHASH_AR_TABLE_SIZE_INC(hash);
843ensure_ar_table(
VALUE hash)
845 if (!RHASH_AR_TABLE_P(hash)) {
846 rb_raise(
rb_eRuntimeError,
"hash representation was changed during iteration");
851ar_general_foreach(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
853 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
854 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
856 for (i = 0; i < bound; i++) {
857 if (ar_cleared_entry(hash, i))
continue;
860 st_data_t key = (st_data_t)pair->key;
861 st_data_t val = (st_data_t)pair->val;
862 enum st_retval retval = (*func)(key, val, arg, 0);
863 ensure_ar_table(hash);
874 (*replace)(&key, &val, arg, TRUE);
877 HASH_ASSERT(pair == RHASH_AR_TABLE_REF(hash, i));
879 pair->key = (
VALUE)key;
880 pair->val = (
VALUE)val;
884 ar_clear_entry(hash, i);
885 RHASH_AR_TABLE_SIZE_DEC(hash);
894ar_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
896 return ar_general_foreach(hash, func, replace, arg);
900 st_foreach_callback_func *func;
905apply_functor(st_data_t k, st_data_t v, st_data_t d,
int _)
907 const struct functor *f = (
void *)d;
908 return f->func(k, v, f->arg);
912ar_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
914 const struct functor f = { func, arg };
915 return ar_general_foreach(hash, apply_functor, NULL, (st_data_t)&f);
919ar_foreach_check(
VALUE hash, st_foreach_check_callback_func *func, st_data_t arg,
922 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
923 unsigned i, ret = 0, bound = RHASH_AR_TABLE_BOUND(hash);
924 enum st_retval retval;
929 for (i = 0; i < bound; i++) {
930 if (ar_cleared_entry(hash, i))
continue;
932 pair = RHASH_AR_TABLE_REF(hash, i);
934 hint = ar_hint(hash, i);
936 retval = (*func)(key, pair->val, arg, 0);
937 ensure_ar_table(hash);
942 pair = RHASH_AR_TABLE_REF(hash, i);
943 if (pair->key == never)
break;
944 ret = ar_find_entry_hint(hash, hint, key);
945 if (ret == RHASH_AR_TABLE_MAX_BOUND) {
946 (*func)(0, 0, arg, 1);
956 if (!ar_cleared_entry(hash, i)) {
957 ar_clear_entry(hash, i);
958 RHASH_AR_TABLE_SIZE_DEC(hash);
969ar_update(
VALUE hash, st_data_t key,
970 st_update_callback_func *func, st_data_t arg)
972 int retval, existing;
973 unsigned bin = RHASH_AR_TABLE_MAX_BOUND;
974 st_data_t value = 0, old_key;
975 st_hash_t hash_value = ar_do_hash(key);
977 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
982 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
983 bin = ar_find_entry(hash, hash_value, key);
984 existing = (bin != RHASH_AR_TABLE_MAX_BOUND) ? TRUE : FALSE;
996 retval = (*func)(&key, &value, arg, existing);
998 ensure_ar_table(hash);
1003 if (ar_add_direct_with_hash(hash, key, value, hash_value)) {
1009 if (old_key != key) {
1017 ar_clear_entry(hash, bin);
1018 RHASH_AR_TABLE_SIZE_DEC(hash);
1026ar_insert(
VALUE hash, st_data_t key, st_data_t value)
1028 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
1029 st_hash_t hash_value = ar_do_hash(key);
1031 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1036 bin = ar_find_entry(hash, hash_value, key);
1037 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1038 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
1041 else if (bin >= RHASH_AR_TABLE_MAX_BOUND) {
1042 bin = ar_compact_table(hash);
1044 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1046 ar_set_entry(hash, bin, key, value, hash_value);
1047 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
1048 RHASH_AR_TABLE_SIZE_INC(hash);
1052 RHASH_AR_TABLE_REF(hash, bin)->val = value;
1058ar_lookup(
VALUE hash, st_data_t key, st_data_t *value)
1060 if (RHASH_AR_TABLE_SIZE(hash) == 0) {
1064 st_hash_t hash_value = ar_do_hash(key);
1065 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1067 return st_lookup(RHASH_ST_TABLE(hash), key, value);
1069 unsigned bin = ar_find_entry(hash, hash_value, key);
1071 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1075 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1076 if (value != NULL) {
1077 *value = RHASH_AR_TABLE_REF(hash, bin)->val;
1085ar_delete(
VALUE hash, st_data_t *key, st_data_t *value)
1088 st_hash_t hash_value = ar_do_hash(*key);
1090 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1092 return st_delete(RHASH_ST_TABLE(hash), key, value);
1095 bin = ar_find_entry(hash, hash_value, *key);
1097 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1098 if (value != 0) *value = 0;
1106 ar_clear_entry(hash, bin);
1107 RHASH_AR_TABLE_SIZE_DEC(hash);
1113ar_shift(
VALUE hash, st_data_t *key, st_data_t *value)
1115 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
1116 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1118 for (i = 0; i < bound; i++) {
1119 if (!ar_cleared_entry(hash, i)) {
1121 if (value != 0) *value = pair->val;
1123 ar_clear_entry(hash, i);
1124 RHASH_AR_TABLE_SIZE_DEC(hash);
1129 if (value != NULL) *value = 0;
1134ar_keys(
VALUE hash, st_data_t *keys, st_index_t size)
1136 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1137 st_data_t *keys_start = keys, *keys_end = keys + size;
1139 for (i = 0; i < bound; i++) {
1140 if (keys == keys_end) {
1144 if (!ar_cleared_entry(hash, i)) {
1145 *keys++ = RHASH_AR_TABLE_REF(hash, i)->key;
1150 return keys - keys_start;
1154ar_values(
VALUE hash, st_data_t *values, st_index_t size)
1156 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1157 st_data_t *values_start = values, *values_end = values + size;
1159 for (i = 0; i < bound; i++) {
1160 if (values == values_end) {
1164 if (!ar_cleared_entry(hash, i)) {
1165 *values++ = RHASH_AR_TABLE_REF(hash, i)->val;
1170 return values - values_start;
1176 ar_table *old_tab = RHASH_AR_TABLE(hash2);
1177 ar_table *new_tab = RHASH_AR_TABLE(hash1);
1179 *new_tab = *old_tab;
1180 RHASH_AR_TABLE(hash1)->ar_hint.word = RHASH_AR_TABLE(hash2)->ar_hint.word;
1181 RHASH_AR_TABLE_BOUND_SET(hash1, RHASH_AR_TABLE_BOUND(hash2));
1182 RHASH_AR_TABLE_SIZE_SET(hash1, RHASH_AR_TABLE_SIZE(hash2));
1184 rb_gc_writebarrier_remember(hash1);
1192 if (RHASH_AR_TABLE(hash) != NULL) {
1193 RHASH_AR_TABLE_SIZE_SET(hash, 0);
1194 RHASH_AR_TABLE_BOUND_SET(hash, 0);
1197 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
1198 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
1203hash_st_free(
VALUE hash)
1205 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
1207 st_table *tab = RHASH_ST_TABLE(hash);
1210 xfree(tab->entries);
1214hash_st_free_and_clear_table(
VALUE hash)
1218 RHASH_ST_CLEAR(hash);
1222rb_hash_free(
VALUE hash)
1224 if (RHASH_ST_TABLE_P(hash)) {
1229typedef int st_foreach_func(st_data_t, st_data_t, st_data_t);
1233 st_foreach_func *func;
1238foreach_safe_i(st_data_t key, st_data_t value, st_data_t args,
int error)
1243 if (error)
return ST_STOP;
1244 status = (*arg->func)(key, value, arg->arg);
1245 if (status == ST_CONTINUE) {
1257 arg.func = (st_foreach_func *)func;
1259 if (st_foreach_check(table, foreach_safe_i, (st_data_t)&arg, 0)) {
1268 rb_foreach_func *func;
1273hash_iter_status_check(
int status)
1288hash_ar_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1292 if (error)
return ST_STOP;
1294 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1296 return hash_iter_status_check(status);
1300hash_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1304 if (error)
return ST_STOP;
1306 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1308 return hash_iter_status_check(status);
1312iter_lev_in_ivar(
VALUE hash)
1317 HASH_ASSERT(lev >= 0);
1318 return (
unsigned long)lev;
1324iter_lev_in_ivar_set(
VALUE hash,
unsigned long lev)
1326 HASH_ASSERT(lev >= RHASH_LEV_MAX);
1328 rb_ivar_set_internal(hash, id_hash_iter_lev,
LONG2FIX((
long)lev));
1331static inline unsigned long
1332iter_lev_in_flags(
VALUE hash)
1334 return (
unsigned long)((
RBASIC(hash)->flags >> RHASH_LEV_SHIFT) & RHASH_LEV_MAX);
1338iter_lev_in_flags_set(
VALUE hash,
unsigned long lev)
1340 HASH_ASSERT(lev <= RHASH_LEV_MAX);
1341 RBASIC(hash)->flags = ((
RBASIC(hash)->flags & ~RHASH_LEV_MASK) | ((
VALUE)lev << RHASH_LEV_SHIFT));
1345hash_iterating_p(
VALUE hash)
1347 return iter_lev_in_flags(hash) > 0;
1351hash_iter_lev_inc(
VALUE hash)
1353 unsigned long lev = iter_lev_in_flags(hash);
1354 if (lev == RHASH_LEV_MAX) {
1355 lev = iter_lev_in_ivar(hash) + 1;
1362 iter_lev_in_flags_set(hash, lev);
1363 if (lev < RHASH_LEV_MAX)
return;
1365 iter_lev_in_ivar_set(hash, lev);
1369hash_iter_lev_dec(
VALUE hash)
1371 unsigned long lev = iter_lev_in_flags(hash);
1372 if (lev == RHASH_LEV_MAX) {
1373 lev = iter_lev_in_ivar(hash);
1374 if (lev > RHASH_LEV_MAX) {
1375 iter_lev_in_ivar_set(hash, lev-1);
1378 rb_attr_delete(hash, id_hash_iter_lev);
1380 else if (lev == 0) {
1383 iter_lev_in_flags_set(hash, lev - 1);
1387hash_foreach_ensure(
VALUE hash)
1389 hash_iter_lev_dec(hash);
1395rb_hash_stlike_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
1397 if (RHASH_AR_TABLE_P(hash)) {
1398 return ar_foreach(hash, func, arg);
1401 return st_foreach(RHASH_ST_TABLE(hash), func, arg);
1407rb_hash_stlike_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
1409 if (RHASH_AR_TABLE_P(hash)) {
1410 return ar_foreach_with_replace(hash, func, replace, arg);
1413 return st_foreach_with_replace(RHASH_ST_TABLE(hash), func, replace, arg);
1418hash_foreach_call(
VALUE arg)
1422 if (RHASH_AR_TABLE_P(hash)) {
1423 ret = ar_foreach_check(hash, hash_ar_foreach_iter,
1424 (st_data_t)arg, (st_data_t)
Qundef);
1426 else if (RHASH_ST_TABLE_P(hash)) {
1427 ret = st_foreach_check(RHASH_ST_TABLE(hash), hash_foreach_iter,
1428 (st_data_t)arg, (st_data_t)
Qundef);
1431 rb_raise(
rb_eRuntimeError,
"ret: %d, hash modified during iteration", ret);
1437rb_hash_foreach(
VALUE hash, rb_foreach_func *func,
VALUE farg)
1441 if (RHASH_TABLE_EMPTY_P(hash))
1444 arg.func = (rb_foreach_func *)func;
1447 hash_foreach_call((
VALUE)&arg);
1450 hash_iter_lev_inc(hash);
1451 rb_ensure(hash_foreach_call, (
VALUE)&arg, hash_foreach_ensure, hash);
1456void rb_st_compact_table(
st_table *tab);
1459compact_after_delete(
VALUE hash)
1461 if (!hash_iterating_p(hash) && RHASH_ST_TABLE_P(hash)) {
1462 rb_st_compact_table(RHASH_ST_TABLE(hash));
1470 const size_t size =
sizeof(
struct RHash) + (st ? sizeof(
st_table) : sizeof(ar_table));
1472 NEWOBJ_OF(hash, struct RHash, klass, T_HASH | wb | flags, size, 0);
1480hash_alloc(VALUE klass)
1487empty_hash_alloc(
VALUE klass)
1489 RUBY_DTRACE_CREATE_HOOK(HASH, 0);
1491 return hash_alloc(klass);
1503 if (rb_hash_compare_by_id_p(basis)) {
1504 return rb_hash_compare_by_id(hash);
1510rb_hash_new_with_size(st_index_t size)
1512 bool st = size > RHASH_AR_TABLE_MAX_SIZE;
1516 hash_st_table_init(ret, &objhash, size);
1525 return rb_hash_new_with_size((st_index_t)
capa);
1531 if (RHASH_AR_TABLE_P(hash)) {
1532 if (RHASH_AR_TABLE_P(ret)) {
1536 st_table *tab = RHASH_ST_TABLE(ret);
1537 st_init_existing_table_with_size(tab, &objhash, RHASH_AR_TABLE_SIZE(hash));
1539 int bound = RHASH_AR_TABLE_BOUND(hash);
1540 for (
int i = 0; i < bound; i++) {
1541 if (ar_cleared_entry(hash, i))
continue;
1544 st_add_direct(tab, pair->key, pair->val);
1553 RHASH_SET_ST_FLAG(ret);
1554 st_replace(RHASH_ST_TABLE(ret), RHASH_ST_TABLE(hash));
1556 rb_gc_writebarrier_remember(ret);
1562hash_dup_with_compare_by_id(
VALUE hash)
1565 if (RHASH_ST_TABLE_P(hash)) {
1566 RHASH_SET_ST_FLAG(dup);
1569 RHASH_UNSET_ST_FLAG(dup);
1572 return hash_copy(dup, hash);
1588 if (rb_obj_exivar_p(hash)) {
1595rb_hash_resurrect(
VALUE hash)
1602rb_hash_modify_check(
VALUE hash)
1604 rb_check_frozen(hash);
1608rb_hash_tbl_raw(
VALUE hash,
const char *file,
int line)
1610 return ar_force_convert_table(hash, file, line);
1614rb_hash_tbl(
VALUE hash,
const char *file,
int line)
1617 return rb_hash_tbl_raw(hash, file, line);
1621rb_hash_modify(
VALUE hash)
1623 rb_hash_modify_check(hash);
1626NORETURN(
static void no_new_key(
void));
1630 rb_raise(
rb_eRuntimeError,
"can't add a new key into hash during iteration");
1638#define NOINSERT_UPDATE_CALLBACK(func) \
1640func##_noinsert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1642 if (!existing) no_new_key(); \
1643 return func(key, val, (struct update_arg *)arg, existing); \
1647func##_insert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1649 return func(key, val, (struct update_arg *)arg, existing); \
1654 st_update_callback_func *func;
1660typedef int (*tbl_update_func)(st_data_t *, st_data_t *, st_data_t, int);
1663rb_hash_stlike_update(
VALUE hash, st_data_t key, st_update_callback_func *func, st_data_t arg)
1665 if (RHASH_AR_TABLE_P(hash)) {
1666 int result = ar_update(hash, key, func, arg);
1668 ar_force_convert_table(hash, __FILE__, __LINE__);
1675 return st_update(RHASH_ST_TABLE(hash), key, func, arg);
1679tbl_update_modify(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
1682 st_data_t old_key = *key;
1683 st_data_t old_value = *val;
1684 VALUE hash = p->hash;
1685 int ret = (p->func)(key, val, arg, existing);
1690 if (!existing || *key != old_key || *val != old_value) {
1691 rb_hash_modify(hash);
1698 rb_hash_modify(hash);
1706tbl_update(
VALUE hash,
VALUE key, tbl_update_func func, st_data_t optional_arg)
1709 .arg = optional_arg,
1716 int ret = rb_hash_stlike_update(hash, key, tbl_update_modify, (st_data_t)&arg);
1725#define UPDATE_CALLBACK(iter_p, func) ((iter_p) ? func##_noinsert : func##_insert)
1727#define RHASH_UPDATE_ITER(h, iter_p, key, func, a) do { \
1728 tbl_update((h), (key), UPDATE_CALLBACK(iter_p, func), (st_data_t)(a)); \
1731#define RHASH_UPDATE(hash, key, func, arg) \
1732 RHASH_UPDATE_ITER(hash, hash_iterating_p(hash), key, func, arg)
1740 if (n != 2 && (n >= 0 || n < -3)) {
1741 if (n < 0) n = -n-1;
1742 rb_raise(
rb_eTypeError,
"default_proc takes two arguments (2 for %d)", n);
1753 rb_hash_modify(hash);
1755 if (capa_value !=
INT2FIX(0)) {
1757 if (
capa > 0 &&
RHASH_SIZE(hash) == 0 && RHASH_AR_TABLE_P(hash)) {
1758 hash_st_table_init(hash, &objhash,
capa);
1762 if (!
NIL_P(block)) {
1763 if (ifnone_unset !=
Qtrue) {
1767 SET_PROC_DEFAULT(hash, block);
1818rb_hash_s_create(
int argc,
VALUE *argv,
VALUE klass)
1823 tmp = rb_hash_s_try_convert(
Qnil, argv[0]);
1829 tmp = rb_hash_to_a(tmp);
1832 hash = hash_alloc(klass);
1834 hash_copy(hash, tmp);
1845 hash = hash_alloc(klass);
1852 rb_raise(rb_eArgError,
"wrong element type %s at %ld (expected array)",
1853 rb_builtin_class_name(e), i);
1857 rb_raise(rb_eArgError,
"invalid number of elements (%ld for 1..2)",
1863 rb_hash_aset(hash, key, val);
1869 if (argc % 2 != 0) {
1870 rb_raise(rb_eArgError,
"odd number of arguments for Hash");
1873 hash = hash_alloc(klass);
1874 rb_hash_bulk_insert(argc, argv, hash);
1880rb_to_hash_type(
VALUE hash)
1882 return rb_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1884#define to_hash rb_to_hash_type
1889 return rb_check_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1905rb_hash_s_try_convert(
VALUE dummy,
VALUE hash)
1907 return rb_check_hash_type(hash);
1926rb_hash_s_ruby2_keywords_hash_p(
VALUE dummy,
VALUE hash)
1929 return RBOOL(RHASH(hash)->basic.flags & RHASH_PASS_AS_KEYWORDS);
1948rb_hash_s_ruby2_keywords_hash(
VALUE dummy,
VALUE hash)
1951 VALUE tmp = rb_hash_dup(hash);
1953 rb_hash_compare_by_id(tmp);
1955 RHASH(tmp)->basic.flags |= RHASH_PASS_AS_KEYWORDS;
1967 if (RHASH_AR_TABLE_P(arg)) {
1968 ar_insert(arg, (st_data_t)key, (st_data_t)value);
1971 st_insert(RHASH_ST_TABLE(arg), (st_data_t)key, (st_data_t)value);
1990rb_hash_rehash(
VALUE hash)
1995 if (hash_iterating_p(hash)) {
1998 rb_hash_modify_check(hash);
1999 if (RHASH_AR_TABLE_P(hash)) {
2000 tmp = hash_alloc(0);
2001 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
2003 hash_ar_free_and_clear_table(hash);
2006 else if (RHASH_ST_TABLE_P(hash)) {
2007 st_table *old_tab = RHASH_ST_TABLE(hash);
2008 tmp = hash_alloc(0);
2010 hash_st_table_init(tmp, old_tab->type, old_tab->num_entries);
2011 tbl = RHASH_ST_TABLE(tmp);
2013 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
2016 RHASH_ST_TABLE_SET(hash, tbl);
2017 RHASH_ST_CLEAR(tmp);
2026 VALUE args[2] = {hash, key};
2031rb_hash_default_unredefined(
VALUE hash)
2035 return !!BASIC_OP_UNREDEFINED_P(BOP_DEFAULT, HASH_REDEFINED_OP_FLAG);
2038 return LIKELY(rb_method_basic_definition_p(klass, id_default));
2047 if (LIKELY(rb_hash_default_unredefined(hash))) {
2049 if (LIKELY(!
FL_TEST_RAW(hash, RHASH_PROC_DEFAULT)))
return ifnone;
2050 if (UNDEF_P(key))
return Qnil;
2051 return call_default_proc(ifnone, hash, key);
2059hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2063 if (RHASH_AR_TABLE_P(hash)) {
2064 return ar_lookup(hash, key, pval);
2067 extern st_index_t rb_iseq_cdhash_hash(
VALUE);
2069 RHASH_ST_TABLE(hash)->
type->hash == rb_ident_hash ||
2070 RHASH_ST_TABLE(hash)->
type->hash == rb_iseq_cdhash_hash);
2071 return st_lookup(RHASH_ST_TABLE(hash), key, pval);
2076rb_hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2078 return hash_stlike_lookup(hash, key, pval);
2103 if (hash_stlike_lookup(hash, key, &val)) {
2107 return rb_hash_default_value(hash, key);
2116 if (hash_stlike_lookup(hash, key, &val)) {
2127 return rb_hash_lookup2(hash, key,
Qnil);
2157rb_hash_fetch_m(
int argc,
VALUE *argv,
VALUE hash)
2167 if (block_given && argc == 2) {
2168 rb_warn(
"block supersedes default value argument");
2171 if (hash_stlike_lookup(hash, key, &val)) {
2178 else if (argc == 1) {
2184 rb_key_err_raise(rb_sprintf(
"key not found: %"PRIsVALUE, desc), hash, key);
2195 return rb_hash_fetch_m(1, &key, hash);
2219rb_hash_default(
int argc,
VALUE *argv,
VALUE hash)
2225 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2226 if (argc == 0)
return Qnil;
2227 return call_default_proc(ifnone, hash, argv[0]);
2248 rb_hash_modify_check(hash);
2249 SET_DEFAULT(hash, ifnone);
2266rb_hash_default_proc(
VALUE hash)
2268 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2289rb_hash_set_default_proc(
VALUE hash,
VALUE proc)
2293 rb_hash_modify_check(hash);
2295 SET_DEFAULT(hash, proc);
2298 b = rb_check_convert_type_with_id(proc,
T_DATA,
"Proc", idTo_proc);
2301 "wrong default_proc type %s (expected Proc)",
2305 SET_PROC_DEFAULT(hash, proc);
2345 rb_hash_foreach(hash, key_i, (
VALUE)args);
2351rb_hash_stlike_delete(
VALUE hash, st_data_t *pkey, st_data_t *pval)
2353 if (RHASH_AR_TABLE_P(hash)) {
2354 return ar_delete(hash, pkey, pval);
2357 return st_delete(RHASH_ST_TABLE(hash), pkey, pval);
2369 st_data_t ktmp = (st_data_t)key, val;
2371 if (rb_hash_stlike_delete(hash, &ktmp, &val)) {
2387 VALUE deleted_value = rb_hash_delete_entry(hash, key);
2389 if (!UNDEF_P(deleted_value)) {
2390 return deleted_value;
2436 rb_hash_modify_check(hash);
2437 val = rb_hash_delete_entry(hash, key);
2439 if (!UNDEF_P(val)) {
2440 compact_after_delete(hash);
2485rb_hash_shift(
VALUE hash)
2489 rb_hash_modify_check(hash);
2490 if (RHASH_AR_TABLE_P(hash)) {
2492 if (!hash_iterating_p(hash)) {
2493 if (ar_shift(hash, &var.key, &var.val)) {
2498 rb_hash_foreach(hash, shift_i_safe, (
VALUE)&var);
2499 if (!UNDEF_P(var.key)) {
2500 rb_hash_delete_entry(hash, var.key);
2505 if (RHASH_ST_TABLE_P(hash)) {
2507 if (!hash_iterating_p(hash)) {
2508 if (st_shift(RHASH_ST_TABLE(hash), &var.key, &var.val)) {
2513 rb_hash_foreach(hash, shift_i_safe, (
VALUE)&var);
2514 if (!UNDEF_P(var.key)) {
2515 rb_hash_delete_entry(hash, var.key);
2527 rb_hash_modify(hash);
2536 return rb_hash_size(hash);
2560 rb_hash_modify_check(hash);
2561 if (!RHASH_TABLE_EMPTY_P(hash)) {
2562 rb_hash_foreach(hash, delete_if_i, hash);
2563 compact_after_delete(hash);
2588rb_hash_reject_bang(
VALUE hash)
2593 rb_hash_modify(hash);
2595 if (!n)
return Qnil;
2596 rb_hash_foreach(hash, delete_if_i, hash);
2621rb_hash_reject(
VALUE hash)
2626 result = hash_dup_with_compare_by_id(hash);
2628 rb_hash_foreach(result, delete_if_i, result);
2629 compact_after_delete(result);
2648rb_hash_slice(
int argc,
VALUE *argv,
VALUE hash)
2651 VALUE key, value, result;
2654 return copy_compare_by_id(rb_hash_new(), hash);
2656 result = copy_compare_by_id(rb_hash_new_with_size(argc), hash);
2658 for (i = 0; i < argc; i++) {
2660 value = rb_hash_lookup2(hash, key,
Qundef);
2661 if (!UNDEF_P(value))
2662 rb_hash_aset(result, key, value);
2683rb_hash_except(
int argc,
VALUE *argv,
VALUE hash)
2688 result = hash_dup_with_compare_by_id(hash);
2690 for (i = 0; i < argc; i++) {
2692 rb_hash_delete(result, key);
2694 compact_after_delete(result);
2717rb_hash_values_at(
int argc,
VALUE *argv,
VALUE hash)
2722 for (i=0; i<argc; i++) {
2753rb_hash_fetch_values(
int argc,
VALUE *argv,
VALUE hash)
2758 for (i=0; i<argc; i++) {
2759 rb_ary_push(result, rb_hash_fetch(hash, argv[i]));
2768 rb_hash_modify(hash);
2791rb_hash_select(
VALUE hash)
2796 result = hash_dup_with_compare_by_id(hash);
2798 rb_hash_foreach(result, keep_if_i, result);
2799 compact_after_delete(result);
2825rb_hash_select_bang(
VALUE hash)
2830 rb_hash_modify_check(hash);
2832 if (!n)
return Qnil;
2833 rb_hash_foreach(hash, keep_if_i, hash);
2856rb_hash_keep_if(
VALUE hash)
2859 rb_hash_modify_check(hash);
2860 if (!RHASH_TABLE_EMPTY_P(hash)) {
2861 rb_hash_foreach(hash, keep_if_i, hash);
2884 rb_hash_modify_check(hash);
2886 if (hash_iterating_p(hash)) {
2887 rb_hash_foreach(hash, clear_i, 0);
2889 else if (RHASH_AR_TABLE_P(hash)) {
2893 st_clear(RHASH_ST_TABLE(hash));
2894 compact_after_delete(hash);
2901hash_aset(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2908rb_hash_key_str(
VALUE key)
2911 return rb_fstring(key);
2919hash_aset_str(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2922 *key = rb_hash_key_str(*key);
2924 return hash_aset(key, val, arg, existing);
2927NOINSERT_UPDATE_CALLBACK(hash_aset)
2928NOINSERT_UPDATE_CALLBACK(hash_aset_str)
2962 bool iter_p = hash_iterating_p(hash);
2964 rb_hash_modify(hash);
2966 if (!RHASH_STRING_KEY_P(hash, key)) {
2967 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset, val);
2970 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset_str, val);
2999 rb_hash_modify_check(hash);
3000 if (hash == hash2)
return hash;
3001 if (hash_iterating_p(hash)) {
3004 hash2 = to_hash(hash2);
3006 COPY_DEFAULT(hash, hash2);
3008 if (RHASH_AR_TABLE_P(hash)) {
3009 hash_ar_free_and_clear_table(hash);
3012 hash_st_free_and_clear_table(hash);
3015 hash_copy(hash, hash2);
3056rb_hash_empty_p(
VALUE hash)
3089rb_hash_each_value(
VALUE hash)
3092 rb_hash_foreach(hash, each_value_i, 0);
3123rb_hash_each_key(
VALUE hash)
3126 rb_hash_foreach(hash, each_key_i, 0);
3169rb_hash_each_pair(
VALUE hash)
3172 if (rb_block_pair_yield_optimizable())
3173 rb_hash_foreach(hash, each_pair_i_fast, 0);
3175 rb_hash_foreach(hash, each_pair_i, 0);
3189 VALUE trans = p->trans, result = p->result;
3190 VALUE new_key = rb_hash_lookup2(trans, key,
Qundef);
3191 if (UNDEF_P(new_key)) {
3197 rb_hash_aset(result, new_key, value);
3205 rb_hash_aset(result, new_key, value);
3298rb_hash_transform_keys(
int argc,
VALUE *argv,
VALUE hash)
3305 transarg.trans = to_hash(argv[0]);
3311 result = rb_hash_new();
3313 if (transarg.trans) {
3314 transarg.result = result;
3315 rb_hash_foreach(hash, transform_keys_hash_i, (
VALUE)&transarg);
3318 rb_hash_foreach(hash, transform_keys_i, result);
3422rb_hash_transform_keys_bang(
int argc,
VALUE *argv,
VALUE hash)
3425 int block_given = 0;
3429 trans = to_hash(argv[0]);
3435 rb_hash_modify_check(hash);
3436 if (!RHASH_TABLE_EMPTY_P(hash)) {
3438 VALUE new_keys = hash_alloc(0);
3440 rb_hash_foreach(hash, flatten_i, pairs);
3447 else if (!UNDEF_P(new_key = rb_hash_lookup2(trans, key,
Qundef))) {
3450 else if (block_given) {
3457 if (!hash_stlike_lookup(new_keys, key, NULL)) {
3458 rb_hash_stlike_delete(hash, &key, NULL);
3460 rb_hash_aset(hash, new_key, val);
3461 rb_hash_aset(new_keys, new_key,
Qnil);
3464 rb_hash_clear(new_keys);
3466 compact_after_delete(hash);
3471transform_values_foreach_func(st_data_t key, st_data_t value, st_data_t argp,
int error)
3477transform_values_foreach_replace(st_data_t *key, st_data_t *value, st_data_t argp,
int existing)
3481 rb_hash_modify(hash);
3487transform_values_call(
VALUE hash)
3489 rb_hash_stlike_foreach_with_replace(hash, transform_values_foreach_func, transform_values_foreach_replace, hash);
3494transform_values(
VALUE hash)
3496 hash_iter_lev_inc(hash);
3497 rb_ensure(transform_values_call, hash, hash_foreach_ensure, hash);
3519rb_hash_transform_values(
VALUE hash)
3524 result = hash_dup_with_compare_by_id(hash);
3525 SET_DEFAULT(result,
Qnil);
3528 transform_values(result);
3529 compact_after_delete(result);
3557rb_hash_transform_values_bang(
VALUE hash)
3560 rb_hash_modify_check(hash);
3562 if (!RHASH_TABLE_EMPTY_P(hash)) {
3563 transform_values(hash);
3590rb_hash_to_a(
VALUE hash)
3595 rb_hash_foreach(hash, to_a_i, ary);
3601symbol_key_needs_quote(
VALUE str)
3603 long len = RSTRING_LEN(str);
3604 if (
len == 0 || !rb_str_symname_p(str))
return true;
3605 const char *s = RSTRING_PTR(str);
3607 if (first ==
'@' || first ==
'$' || first ==
'!')
return true;
3608 if (!at_char_boundary(s, s +
len - 1,
RSTRING_END(str), rb_enc_get(str)))
return false;
3609 switch (s[
len - 1]) {
3640 quote = symbol_key_needs_quote(str2);
3645 if (RSTRING_LEN(str) > 1) {
3649 rb_enc_copy(str, str2);
3666inspect_hash(
VALUE hash,
VALUE dummy,
int recur)
3672 rb_hash_foreach(hash, inspect_i, str);
3691rb_hash_inspect(
VALUE hash)
3707rb_hash_to_hash(
VALUE hash)
3719 rb_raise(
rb_eTypeError,
"wrong element type %s (expected array)",
3720 rb_builtin_class_name(arg));
3723 rb_raise(rb_eArgError,
"element has wrong array length (expected 2, was %ld)",
3738rb_hash_to_h_block(
VALUE hash)
3741 rb_hash_foreach(hash, to_h_i, h);
3766rb_hash_to_h(
VALUE hash)
3769 return rb_hash_to_h_block(hash);
3773 hash = hash_dup(hash,
rb_cHash, flags & RHASH_PROC_DEFAULT);
3798rb_hash_keys(
VALUE hash)
3803 if (size == 0)
return keys;
3805 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3807 if (RHASH_AR_TABLE_P(hash)) {
3808 size = ar_keys(hash, ptr, size);
3811 st_table *table = RHASH_ST_TABLE(hash);
3812 size = st_keys(table, ptr, size);
3815 rb_gc_writebarrier_remember(keys);
3816 rb_ary_set_len(keys, size);
3819 rb_hash_foreach(hash, keys_i, keys);
3845rb_hash_values(
VALUE hash)
3851 if (size == 0)
return values;
3853 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3854 if (RHASH_AR_TABLE_P(hash)) {
3855 rb_gc_writebarrier_remember(values);
3857 size = ar_values(hash, ptr, size);
3860 else if (RHASH_ST_TABLE_P(hash)) {
3861 st_table *table = RHASH_ST_TABLE(hash);
3862 rb_gc_writebarrier_remember(values);
3864 size = st_values(table, ptr, size);
3867 rb_ary_set_len(values, size);
3870 rb_hash_foreach(hash, values_i, values);
3892 return RBOOL(hash_stlike_lookup(hash, key, NULL));
3923 rb_hash_foreach(hash, rb_hash_search_value, (
VALUE)data);
3939 if (!hash_stlike_lookup(data->hash, key, &val2)) {
3953recursive_eql(
VALUE hash,
VALUE dt,
int recur)
3957 if (recur)
return Qtrue;
3959 data->result =
Qtrue;
3960 rb_hash_foreach(hash, eql_i, dt);
3962 return data->result;
3970 if (hash1 == hash2)
return Qtrue;
3976 if (
rb_eql(hash2, hash1)) {
3989 if (!RHASH_TABLE_EMPTY_P(hash1) && !RHASH_TABLE_EMPTY_P(hash2)) {
3990 if (RHASH_TYPE(hash1) != RHASH_TYPE(hash2)) {
4002 FL_TEST(hash1, RHASH_PROC_DEFAULT) ==
FL_TEST(hash2, RHASH_PROC_DEFAULT)))
4038 return hash_equal(hash1, hash2, FALSE);
4065 return hash_equal(hash1, hash2, TRUE);
4071 st_index_t *hval = (st_index_t *)arg;
4072 st_index_t hdata[2];
4074 hdata[0] = rb_hash(key);
4075 hdata[1] = rb_hash(val);
4076 *hval ^= st_hash(hdata,
sizeof(hdata), 0);
4098rb_hash_hash(
VALUE hash)
4104 rb_hash_foreach(hash, hash_i, (
VALUE)&hval);
4113 rb_hash_aset(hash, value, key);
4137rb_hash_invert(
VALUE hash)
4141 rb_hash_foreach(hash, rb_hash_invert_i, h);
4148 rb_hash_aset(hash, key, value);
4153 VALUE hash, newvalue, *argv;
4160rb_hash_update_block_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
4164 VALUE newvalue = ua->newvalue, hash = arg->hash;
4167 hash_iter_lev_inc(hash);
4168 ua->iterating =
true;
4170 hash_iter_lev_dec(hash);
4171 ua->iterating =
false;
4173 else if (RHASH_STRING_KEY_P(hash, k) && !
RB_OBJ_FROZEN(k)) {
4174 *key = (st_data_t)rb_hash_key_str(k);
4176 *value = (st_data_t)newvalue;
4180NOINSERT_UPDATE_CALLBACK(rb_hash_update_block_callback)
4186 ua->newvalue = value;
4187 RHASH_UPDATE(ua->hash, key, rb_hash_update_block_callback, args);
4192rb_hash_update_call(
VALUE args)
4196 for (
int i = 0; i < arg->argc; i++){
4197 VALUE hash = to_hash(arg->argv[i]);
4198 if (arg->block_given) {
4199 rb_hash_foreach(hash, rb_hash_update_block_i, args);
4202 rb_hash_foreach(hash, rb_hash_update_i, arg->hash);
4209rb_hash_update_ensure(
VALUE args)
4212 if (ua->iterating) hash_iter_lev_dec(ua->hash);
4260rb_hash_update(
int argc,
VALUE *argv,
VALUE self)
4271 rb_hash_modify(self);
4272 return rb_ensure(rb_hash_update_call, arg, rb_hash_update_ensure, arg);
4282rb_hash_update_func_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
4285 VALUE newvalue = uf_arg->value;
4288 newvalue = (*uf_arg->func)((
VALUE)*key, (
VALUE)*value, newvalue);
4294NOINSERT_UPDATE_CALLBACK(rb_hash_update_func_callback)
4300 VALUE hash = arg->hash;
4303 RHASH_UPDATE(hash, key, rb_hash_update_func_callback, (
VALUE)arg);
4310 rb_hash_modify(hash1);
4311 hash2 = to_hash(hash2);
4316 rb_hash_foreach(hash2, rb_hash_update_func_i, (
VALUE)&arg);
4319 rb_hash_foreach(hash2, rb_hash_update_i, hash1);
4371rb_hash_merge(
int argc,
VALUE *argv,
VALUE self)
4373 return rb_hash_update(argc, argv, copy_compare_by_id(rb_hash_dup(self), self));
4388assoc_lookup(
VALUE arg)
4392 if (st_lookup(p->tbl, p->key, &data))
return (
VALUE)data;
4430 if (RHASH_ST_TABLE_P(hash) && !RHASH_IDENTHASH_P(hash)) {
4432 st_table assoctable = *RHASH_ST_TABLE(hash);
4434 .compare = assoc_cmp,
4435 .hash = assoctable.type->hash,
4439 .key = (st_data_t)key,
4443 value = assoc_lookup(arg);
4446 hash_iter_lev_inc(hash);
4447 value =
rb_ensure(assoc_lookup, arg, hash_foreach_ensure, hash);
4455 rb_hash_foreach(hash, assoc_i, (
VALUE)args);
4494 rb_hash_foreach(hash, rassoc_i, (
VALUE)args);
4547rb_hash_flatten(
int argc,
VALUE *argv,
VALUE hash)
4556 if (level == 0)
return rb_hash_to_a(hash);
4559 rb_hash_foreach(hash, flatten_i, ary);
4564 rb_funcallv(ary, id_flatten_bang, 1, &ary_flatten_level);
4566 else if (level < 0) {
4568 rb_funcallv(ary, id_flatten_bang, 0, 0);
4573 rb_hash_foreach(hash, flatten_i, ary);
4601rb_hash_compact(
VALUE hash)
4603 VALUE result = rb_hash_dup(hash);
4605 rb_hash_foreach(result, delete_if_nil, result);
4606 compact_after_delete(result);
4608 else if (rb_hash_compare_by_id_p(hash)) {
4609 result = rb_hash_compare_by_id(result);
4631rb_hash_compact_bang(
VALUE hash)
4634 rb_hash_modify_check(hash);
4637 rb_hash_foreach(hash, delete_if_nil, hash);
4671rb_hash_compare_by_id(
VALUE hash)
4676 if (rb_hash_compare_by_id_p(hash))
return hash;
4678 rb_hash_modify_check(hash);
4679 if (hash_iterating_p(hash)) {
4683 if (RHASH_TABLE_EMPTY_P(hash)) {
4686 ar_force_convert_table(hash, __FILE__, __LINE__);
4687 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
4689 RHASH_ST_TABLE(hash)->type = &identhash;
4694 tmp = hash_alloc(0);
4695 hash_st_table_init(tmp, &identhash,
RHASH_SIZE(hash));
4696 identtable = RHASH_ST_TABLE(tmp);
4698 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
4703 RHASH_ST_TABLE_SET(hash, identtable);
4704 RHASH_ST_CLEAR(tmp);
4726rb_hash_compare_by_id_p(
VALUE hash)
4728 return RBOOL(RHASH_IDENTHASH_P(hash));
4732rb_ident_hash_new(
void)
4734 VALUE hash = rb_hash_new();
4735 hash_st_table_init(hash, &identhash, 0);
4740rb_ident_hash_new_with_size(st_index_t size)
4742 VALUE hash = rb_hash_new();
4743 hash_st_table_init(hash, &identhash, size);
4748rb_init_identtable(
void)
4750 return st_init_table(&identhash);
4827rb_hash_any_p(
int argc,
VALUE *argv,
VALUE hash)
4836 rb_warn(
"given block not used");
4840 rb_hash_foreach(hash, any_p_i_pattern, (
VALUE)args);
4847 if (rb_block_pair_yield_optimizable())
4848 rb_hash_foreach(hash, any_p_i_fast, (
VALUE)args);
4850 rb_hash_foreach(hash, any_p_i, (
VALUE)args);
4891rb_hash_dig(
int argc,
VALUE *argv,
VALUE self)
4894 self = rb_hash_aref(self, *argv);
4895 if (!--argc)
return self;
4897 return rb_obj_dig(argc, argv, self,
Qnil);
4905 if (!UNDEF_P(v) &&
rb_equal(value, v))
return ST_CONTINUE;
4916 rb_hash_foreach(hash1, hash_le_i, (
VALUE)args);
4942 other = to_hash(other);
4944 return hash_le(hash, other);
4971 other = to_hash(other);
4973 return hash_le(hash, other);
4998 other = to_hash(other);
5000 return hash_le(other, hash);
5027 other = to_hash(other);
5029 return hash_le(other, hash);
5036 return rb_hash_aref(hash, *argv);
5055rb_hash_to_proc(
VALUE hash)
5057 return rb_func_lambda_new(hash_proc_call, hash, 1, 1);
5062rb_hash_deconstruct_keys(
VALUE hash,
VALUE keys)
5068add_new_i(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
5070 if (existing)
return ST_STOP;
5085 if (RHASH_AR_TABLE_P(hash)) {
5086 ret = ar_update(hash, (st_data_t)key, add_new_i, (st_data_t)val);
5088 ar_force_convert_table(hash, __FILE__, __LINE__);
5093 tbl = RHASH_TBL_RAW(hash);
5094 ret = st_update(tbl, (st_data_t)key, add_new_i, (st_data_t)val);
5105key_stringify(
VALUE key)
5108 rb_hash_key_str(key) : key;
5112ar_bulk_insert(
VALUE hash,
long argc,
const VALUE *argv)
5115 for (i = 0; i < argc; ) {
5116 st_data_t k = key_stringify(argv[i++]);
5117 st_data_t v = argv[i++];
5118 ar_insert(hash, k, v);
5127 HASH_ASSERT(argc % 2 == 0);
5129 st_index_t size = argc / 2;
5131 if (RHASH_AR_TABLE_P(hash) &&
5132 (RHASH_AR_TABLE_SIZE(hash) + size <= RHASH_AR_TABLE_MAX_SIZE)) {
5133 ar_bulk_insert(hash, argc, argv);
5136 rb_hash_bulk_insert_into_st_table(argc, argv, hash);
5141static char **origenviron;
5143#define GET_ENVIRON(e) ((e) = rb_w32_get_environ())
5144#define FREE_ENVIRON(e) rb_w32_free_environ(e)
5145static char **my_environ;
5147#define environ my_environ
5149#define getenv(n) rb_w32_ugetenv(n)
5150#elif defined(__APPLE__)
5152#define environ (*_NSGetEnviron())
5153#define GET_ENVIRON(e) (e)
5154#define FREE_ENVIRON(e)
5156extern char **environ;
5157#define GET_ENVIRON(e) (e)
5158#define FREE_ENVIRON(e)
5160#ifdef ENV_IGNORECASE
5161#define ENVMATCH(s1, s2) (STRCASECMP((s1), (s2)) == 0)
5162#define ENVNMATCH(s1, s2, n) (STRNCASECMP((s1), (s2), (n)) == 0)
5164#define ENVMATCH(n1, n2) (strcmp((n1), (n2)) == 0)
5165#define ENVNMATCH(s1, s2, n) (memcmp((s1), (s2), (n)) == 0)
5168#define ENV_LOCKING() RB_VM_LOCKING()
5174 return rb_utf8_encoding();
5176 return rb_locale_encoding();
5192 return env_enc_str_new(ptr,
len, enc);
5198 if (!ptr)
return Qnil;
5199 return env_str_new(ptr, strlen(ptr), enc);
5203getenv_with_lock(
const char *name)
5208 const char *val = getenv(name);
5209 ret = env_str_new2(val, enc);
5215has_env_with_lock(
const char *name)
5223 return val ? true :
false;
5226static const char TZ_ENV[] =
"TZ";
5229get_env_cstr(
VALUE str,
const char *name)
5233 if (!rb_enc_asciicompat(enc)) {
5234 rb_raise(rb_eArgError,
"bad environment variable %s: ASCII incompatible encoding: %s",
5235 name, rb_enc_name(enc));
5237 var = RSTRING_PTR(str);
5238 if (memchr(var,
'\0', RSTRING_LEN(str))) {
5239 rb_raise(rb_eArgError,
"bad environment variable %s: contains null byte", name);
5241 return rb_str_fill_terminator(str, 1);
5244#define get_env_ptr(var, val) \
5245 (var = get_env_cstr(val, #var))
5247static inline const char *
5248env_name(
volatile VALUE *s)
5252 get_env_ptr(name, *s);
5256#define env_name(s) env_name(&(s))
5261reset_by_modified_env(
const char *nam,
const char *val)
5269 if (ENVMATCH(nam, TZ_ENV)) {
5270 ruby_reset_timezone(val);
5275env_delete(
VALUE name)
5277 const char *nam = env_name(name);
5278 reset_by_modified_env(nam, NULL);
5279 VALUE val = getenv_with_lock(nam);
5282 ruby_setenv(nam, 0);
5317 val = env_delete(name);
5337 const char *nam = env_name(name);
5338 VALUE env = getenv_with_lock(nam);
5378 if (block_given && argc == 2) {
5379 rb_warn(
"block supersedes default value argument");
5381 nam = env_name(key);
5382 env = getenv_with_lock(nam);
5385 if (block_given)
return rb_yield(key);
5387 rb_key_err_raise(rb_sprintf(
"key not found: \"%"PRIsVALUE
"\"", key), envtbl, key);
5394#if defined(_WIN32) || (defined(HAVE_SETENV) && defined(HAVE_UNSETENV))
5397in_origenv(
const char *str)
5400 for (env = origenviron; *env; ++env) {
5401 if (*env == str)
return 1;
5407envix(
const char *nam)
5411 register int i,
len = strlen(nam);
5414 env = GET_ENVIRON(environ);
5415 for (i = 0; env[i]; i++) {
5416 if (ENVNMATCH(env[i],nam,
len) && env[i][
len] ==
'=')
5419 FREE_ENVIRON(environ);
5424#if defined(_WIN32) || \
5425 (defined(__sun) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV)))
5427NORETURN(
static void invalid_envname(
const char *name));
5430invalid_envname(
const char *name)
5436check_envname(
const char *name)
5438 if (strchr(name,
'=')) {
5439 invalid_envname(name);
5446ruby_setenv(
const char *name,
const char *value)
5454 check_envname(name);
5455 len = MultiByteToWideChar(CP_UTF8, 0, name, -1, NULL, 0);
5458 len2 = MultiByteToWideChar(CP_UTF8, 0, value, -1, NULL, 0);
5460 wvalue = wname +
len;
5461 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5462 MultiByteToWideChar(CP_UTF8, 0, value, -1, wvalue, len2);
5466 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5467 wvalue = wname +
len;
5474 failed = _wputenv_s(wname, wvalue);
5480 if (!value || !*value) {
5482 if (!SetEnvironmentVariableW(wname, value ? wvalue : NULL) &&
5483 GetLastError() != ERROR_ENVVAR_NOT_FOUND)
goto fail;
5487 invalid_envname(name);
5489#elif defined(HAVE_SETENV) && defined(HAVE_UNSETENV)
5493 ret = setenv(name, value, 1);
5496 if (ret) rb_sys_fail_sprintf(
"setenv(%s)", name);
5506 ret = unsetenv(name);
5509 if (ret) rb_sys_fail_sprintf(
"unsetenv(%s)", name);
5517 size_t len, mem_size;
5518 char **env_ptr, *str, *mem_ptr;
5520 check_envname(name);
5523 mem_size =
len + strlen(value) + 2;
5524 mem_ptr = malloc(mem_size);
5525 if (mem_ptr == NULL)
5526 rb_sys_fail_sprintf(
"malloc(%"PRIuSIZE
")", mem_size);
5527 snprintf(mem_ptr, mem_size,
"%s=%s", name, value);
5531 for (env_ptr = GET_ENVIRON(environ); (str = *env_ptr) != 0; ++env_ptr) {
5532 if (!strncmp(str, name,
len) && str[
len] ==
'=') {
5533 if (!in_origenv(str)) free(str);
5534 while ((env_ptr[0] = env_ptr[1]) != 0) env_ptr++;
5543 ret = putenv(mem_ptr);
5548 rb_sys_fail_sprintf(
"putenv(%s)", name);
5558 if (environ == origenviron) {
5563 for (max = i; environ[max]; max++) ;
5564 tmpenv =
ALLOC_N(
char*, max+2);
5565 for (j=0; j<max; j++)
5572 char **envp = origenviron;
5573 while (*envp && *envp != environ[i]) envp++;
5577 while (environ[i]) {
5578 environ[i] = environ[i+1];
5585 if (!value)
goto finish;
5590 len = strlen(name) + strlen(value) + 2;
5592 snprintf(environ[i],
len,
"%s=%s",name,value);
5600ruby_unsetenv(
const char *name)
5602 ruby_setenv(name, 0);
5650 return env_aset(nm, val);
5666 get_env_ptr(name, nm);
5667 get_env_ptr(value, val);
5669 ruby_setenv(name, value);
5670 reset_by_modified_env(name, value);
5677 rb_encoding *enc = raw ? 0 : rb_locale_encoding();
5681 char **env = GET_ENVIRON(environ);
5683 char *s = strchr(*env,
'=');
5685 const char *p = *env;
5692 FREE_ENVIRON(environ);
5714 return env_keys(FALSE);
5724 env = GET_ENVIRON(environ);
5725 for (; *env ; ++env) {
5726 if (strchr(*env,
'=')) {
5730 FREE_ENVIRON(environ);
5754env_each_key(
VALUE ehash)
5760 keys = env_keys(FALSE);
5774 char **env = GET_ENVIRON(environ);
5777 char *s = strchr(*env,
'=');
5783 FREE_ENVIRON(environ);
5804 return env_values();
5825env_each_value(
VALUE ehash)
5831 values = env_values();
5857env_each_pair(
VALUE ehash)
5867 char **env = GET_ENVIRON(environ);
5870 char *s = strchr(*env,
'=');
5877 FREE_ENVIRON(environ);
5880 if (rb_block_pair_yield_optimizable()) {
5917env_reject_bang(
VALUE ehash)
5924 keys = env_keys(FALSE);
5925 RBASIC_CLEAR_CLASS(keys);
5936 if (del == 0)
return Qnil;
5961env_delete_if(
VALUE ehash)
5964 env_reject_bang(ehash);
5992 for (i=0; i<argc; i++) {
6018env_select(
VALUE ehash)
6025 result = rb_hash_new();
6026 keys = env_keys(FALSE);
6032 rb_hash_aset(result, key, val);
6077env_select_bang(
VALUE ehash)
6084 keys = env_keys(FALSE);
6085 RBASIC_CLEAR_CLASS(keys);
6096 if (del == 0)
return Qnil;
6119env_keep_if(
VALUE ehash)
6122 env_select_bang(ehash);
6142 VALUE key, value, result;
6145 return rb_hash_new();
6147 result = rb_hash_new_with_size(argc);
6149 for (i = 0; i < argc; i++) {
6151 value = rb_f_getenv(
Qnil, key);
6153 rb_hash_aset(result, key, value);
6165 keys = env_keys(TRUE);
6168 const char *nam = RSTRING_PTR(key);
6169 ruby_setenv(nam, 0);
6188 return rb_env_clear();
6219 char **env = GET_ENVIRON(environ);
6221 const char *s = strchr(*env,
'=');
6223 if (env != environ) {
6234 FREE_ENVIRON(environ);
6258 char **env = GET_ENVIRON(environ);
6260 char *s = strchr(*env,
'=');
6263 env_str_new2(s+1, enc)));
6267 FREE_ENVIRON(environ);
6288env_size_with_lock(
void)
6293 char **env = GET_ENVIRON(environ);
6295 FREE_ENVIRON(environ);
6314 return INT2FIX(env_size_with_lock());
6333 char **env = GET_ENVIRON(environ);
6337 FREE_ENVIRON(environ);
6340 return RBOOL(empty);
6369 const char *s = env_name(key);
6370 return RBOOL(has_env_with_lock(s));
6396 const char *s = env_name(key);
6397 VALUE e = getenv_with_lock(s);
6428 char **env = GET_ENVIRON(environ);
6430 char *s = strchr(*env,
'=');
6432 long len = strlen(s);
6433 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6440 FREE_ENVIRON(environ);
6469 char **env = GET_ENVIRON(environ);
6472 const char *p = *env;
6473 char *s = strchr(p,
'=');
6475 long len = strlen(s);
6476 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6483 FREE_ENVIRON(environ);
6513 char **env = GET_ENVIRON(environ);
6515 char *s = strchr(*env,
'=');
6517 long len = strlen(s);
6518 if (RSTRING_LEN(value) ==
len && strncmp(s, RSTRING_PTR(value),
len) == 0) {
6519 str = env_str_new(*env, s-*env-1, enc);
6525 FREE_ENVIRON(environ);
6534 VALUE hash = rb_hash_new();
6538 char **env = GET_ENVIRON(environ);
6540 char *s = strchr(*env,
'=');
6542 rb_hash_aset(hash, env_str_new(*env, s-*env, enc),
6543 env_str_new2(s+1, enc));
6547 FREE_ENVIRON(environ);
6562 return env_to_hash();
6577 return env_to_hash();
6601 VALUE hash = env_to_hash();
6603 hash = rb_hash_to_h_block(hash);
6621 VALUE key, hash = env_to_hash();
6623 for (i = 0; i < argc; i++) {
6625 rb_hash_delete(hash, key);
6649 return rb_hash_delete_if(env_to_hash());
6652NORETURN(
static VALUE env_freeze(
VALUE self));
6661env_freeze(
VALUE self)
6690 char **env = GET_ENVIRON(environ);
6692 const char *p = *env;
6693 char *s = strchr(p,
'=');
6695 key = env_str_new(p, s-p, enc);
6696 VALUE val = env_str_new2(getenv(RSTRING_PTR(key)), enc);
6700 FREE_ENVIRON(environ);
6728 return rb_hash_invert(env_to_hash());
6735 const char *keyptr, *eptr;
6743 if (elen != keylen)
continue;
6744 if (!ENVNMATCH(keyptr, eptr, elen))
continue;
6756 keylist_delete(keys, key);
6784 keys = env_keys(TRUE);
6785 if (env == hash)
return env;
6786 hash = to_hash(hash);
6787 rb_hash_foreach(hash, env_replace_i, keys);
6807 if (!
NIL_P(oldval)) {
6854 env_update_block_i : env_update_i;
6855 for (
int i = 0; i < argc; ++i) {
6856 VALUE hash = argv[i];
6857 if (env == hash)
continue;
6858 hash = to_hash(hash);
6859 rb_hash_foreach(hash, func, 0);
6879 rb_get_freeze_opt(1, &opt);
6883 rb_raise(
rb_eTypeError,
"Cannot clone ENV, use ENV.to_h to get a copy of ENV as a hash");
6897 rb_raise(
rb_eTypeError,
"Cannot dup ENV, use ENV.to_h to get a copy of ENV as a hash");
6908 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
7379 id_hash_iter_lev = rb_make_internal_id();
7477 rb_cHash_empty_frozen = rb_hash_freeze(rb_hash_new());
7478 rb_vm_register_global_object(rb_cHash_empty_frozen);
7644 origenviron = environ;
7713 HASH_ASSERT(
sizeof(ar_hint_t) * RHASH_AR_TABLE_MAX_SIZE ==
sizeof(
VALUE));
7716#include "hash.rbinc"
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
static bool RB_OBJ_FROZEN(VALUE obj)
Checks if an object is frozen.
@ RUBY_FL_SHAREABLE
This flag has something to do with Ractor.
void rb_include_module(VALUE klass, VALUE module)
Includes a module to a class.
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
void rb_extend_object(VALUE obj, VALUE module)
Extend the object with the module.
VALUE rb_singleton_class(VALUE obj)
Finds or creates the singleton class of the passed object.
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
void rb_undef_method(VALUE klass, const char *name)
Defines an undef of a method.
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
Retrieves argument from argc and argv to given VALUE references according to the format string.
int rb_block_given_p(void)
Determines if the current method is given a block.
#define TYPE(_)
Old name of rb_type.
#define rb_str_buf_cat2
Old name of rb_usascii_str_new_cstr.
#define NUM2LL
Old name of RB_NUM2LL.
#define REALLOC_N
Old name of RB_REALLOC_N.
#define T_STRING
Old name of RUBY_T_STRING.
#define xfree
Old name of ruby_xfree.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define T_NIL
Old name of RUBY_T_NIL.
#define T_FLOAT
Old name of RUBY_T_FLOAT.
#define T_BIGNUM
Old name of RUBY_T_BIGNUM.
#define rb_str_buf_new2
Old name of rb_str_buf_new_cstr.
#define T_FIXNUM
Old name of RUBY_T_FIXNUM.
#define UNREACHABLE_RETURN
Old name of RBIMPL_UNREACHABLE_RETURN.
#define T_DATA
Old name of RUBY_T_DATA.
#define CLASS_OF
Old name of rb_class_of.
#define LONG2FIX
Old name of RB_INT2FIX.
#define STATIC_SYM_P
Old name of RB_STATIC_SYM_P.
#define T_TRUE
Old name of RUBY_T_TRUE.
#define T_HASH
Old name of RUBY_T_HASH.
#define ALLOC_N
Old name of RB_ALLOC_N.
#define FL_TEST_RAW
Old name of RB_FL_TEST_RAW.
#define rb_usascii_str_new2
Old name of rb_usascii_str_new_cstr.
#define T_FALSE
Old name of RUBY_T_FALSE.
#define FIXNUM_MIN
Old name of RUBY_FIXNUM_MIN.
#define FLONUM_P
Old name of RB_FLONUM_P.
#define Qtrue
Old name of RUBY_Qtrue.
#define ST2FIX
Old name of RB_ST2FIX.
#define FIXNUM_MAX
Old name of RUBY_FIXNUM_MAX.
#define NUM2INT
Old name of RB_NUM2INT.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define FIX2LONG
Old name of RB_FIX2LONG.
#define NIL_P
Old name of RB_NIL_P.
#define ALLOCV_N
Old name of RB_ALLOCV_N.
#define FL_WB_PROTECTED
Old name of RUBY_FL_WB_PROTECTED.
#define POSFIXABLE
Old name of RB_POSFIXABLE.
#define T_SYMBOL
Old name of RUBY_T_SYMBOL.
#define FL_TEST
Old name of RB_FL_TEST.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define OBJ_WB_UNPROTECT
Old name of RB_OBJ_WB_UNPROTECT.
#define rb_ary_new2
Old name of rb_ary_new_capa.
#define FL_SET_RAW
Old name of RB_FL_SET_RAW.
#define ALLOCV_END
Old name of RB_ALLOCV_END.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
void rb_syserr_fail_str(int e, VALUE mesg)
Identical to rb_syserr_fail(), except it takes the message in Ruby's String instead of C's.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eRuntimeError
RuntimeError exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_mKernel
Kernel module.
VALUE rb_any_to_s(VALUE obj)
Generates a textual representation of the given object.
VALUE rb_mEnumerable
Enumerable module.
int rb_eql(VALUE lhs, VALUE rhs)
Checks for equality of the passed objects, in terms of Object#eql?.
VALUE rb_cHash
Hash class.
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
VALUE rb_inspect(VALUE obj)
Generates a human-readable textual representation of the given object.
VALUE rb_equal(VALUE lhs, VALUE rhs)
This function is an optimised version of calling #==.
VALUE rb_obj_freeze(VALUE obj)
Just calls rb_obj_freeze_inline() inside.
VALUE rb_cString
String class.
VALUE rb_to_int(VALUE val)
Identical to rb_check_to_int(), except it raises in case of conversion mismatch.
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
#define RB_OBJ_WRITE(old, slot, young)
Declaration of a "back" pointer.
VALUE rb_external_str_new_with_enc(const char *ptr, long len, rb_encoding *enc)
Identical to rb_external_str_new(), except it additionally takes an encoding.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
#define RGENGC_WB_PROTECTED_HASH
This is a compile-time flag to enable/disable write barrier for struct RHash.
Defines RBIMPL_HAS_BUILTIN.
VALUE rb_ary_delete_at(VALUE ary, long pos)
Destructively removes an element which resides at the specific index of the passed array.
VALUE rb_ary_cat(VALUE ary, const VALUE *train, long len)
Destructively appends multiple elements at the end of the array.
VALUE rb_check_array_type(VALUE obj)
Try converting an object to its array representation using its to_ary method, if any.
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_new_capa(long capa)
Identical to rb_ary_new(), except it additionally specifies how many rooms of objects it should alloc...
VALUE rb_ary_hidden_new(long capa)
Allocates a hidden (no class) empty array.
VALUE rb_ary_clear(VALUE ary)
Destructively removes everything form an array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_assoc_new(VALUE car, VALUE cdr)
Identical to rb_ary_new_from_values(), except it expects exactly two parameters.
#define INTEGER_PACK_NATIVE_BYTE_ORDER
Means either INTEGER_PACK_MSBYTE_FIRST or INTEGER_PACK_LSBYTE_FIRST, depending on the host processor'...
#define RETURN_SIZED_ENUMERATOR(obj, argc, argv, size_fn)
This roughly resembles return enum_for(__callee__) unless block_given?.
#define UNLIMITED_ARGUMENTS
This macro is used in conjunction with rb_check_arity().
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_hash_update_func(VALUE newkey, VALUE oldkey, VALUE value)
Type of callback functions to pass to rb_hash_update_by().
#define st_foreach_safe
Just another name of rb_st_foreach_safe.
VALUE rb_proc_lambda_p(VALUE recv)
Queries if the given object is a lambda.
VALUE rb_proc_call_with_block(VALUE recv, int argc, const VALUE *argv, VALUE proc)
Identical to rb_proc_call(), except you can additionally pass another proc object,...
int rb_proc_arity(VALUE recv)
Queries the number of mandatory arguments of the given Proc.
VALUE rb_obj_is_proc(VALUE recv)
Queries if the given object is a proc.
#define rb_hash_uint(h, i)
Just another name of st_hash_uint.
#define rb_hash_end(h)
Just another name of st_hash_end.
int rb_str_hash_cmp(VALUE str1, VALUE str2)
Compares two strings.
VALUE rb_str_ellipsize(VALUE str, long len)
Shortens str and adds three dots, an ellipsis, if it is longer than len characters.
st_index_t rb_memhash(const void *ptr, long len)
This is a universal hash function.
#define rb_str_new(str, len)
Allocates an instance of rb_cString.
VALUE rb_str_new_frozen(VALUE str)
Creates a frozen copy of the string, if necessary.
st_index_t rb_str_hash(VALUE str)
Calculates a hash value of a string.
VALUE rb_str_buf_append(VALUE dst, VALUE src)
Identical to rb_str_cat_cstr(), except it takes Ruby's string instead of C's.
st_index_t rb_hash_start(st_index_t i)
Starts a series of hashing.
VALUE rb_str_inspect(VALUE str)
Generates a "readable" version of the receiver.
VALUE rb_str_buf_cat_ascii(VALUE dst, const char *src)
Identical to rb_str_cat_cstr(), except it additionally assumes the source string be a NUL terminated ...
VALUE rb_check_string_type(VALUE obj)
Try converting an object to its stringised representation using its to_str method,...
#define rb_utf8_str_new(str, len)
Identical to rb_str_new, except it generates a string of "UTF-8" encoding.
VALUE rb_exec_recursive(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h)
"Recursion" API entry point.
VALUE rb_exec_recursive_paired(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE p, VALUE h)
Identical to rb_exec_recursive(), except it checks for the recursion on the ordered pair of { g,...
VALUE rb_ivar_get(VALUE obj, ID name)
Identical to rb_iv_get(), except it accepts the name as an ID instead of a C string.
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
void rb_define_alloc_func(VALUE klass, rb_alloc_func_t func)
Sets the allocator function of a class.
static ID rb_intern_const(const char *str)
This is a "tiny optimisation" over rb_intern().
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
void rb_define_global_const(const char *name, VALUE val)
Identical to rb_define_const(), except it defines that of "global", i.e.
int capa
Designed capacity of the buffer.
int len
Length of the buffer.
char * ruby_strdup(const char *str)
This is our own version of strdup(3) that uses ruby_xmalloc() instead of system malloc (benefits our ...
#define RB_BLOCK_CALL_FUNC_ARGLIST(yielded_arg, callback_arg)
Shim for block function parameters.
VALUE rb_yield_values(int n,...)
Identical to rb_yield(), except it takes variadic number of parameters and pass them to the block.
VALUE rb_yield_values2(int n, const VALUE *argv)
Identical to rb_yield_values(), except it takes the parameters as a C array instead of variadic argum...
VALUE rb_yield(VALUE val)
Yields the block.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
VALUE type(ANYARGS)
ANYARGS-ed function type.
VALUE rb_ensure(type *q, VALUE w, type *e, VALUE r)
An equivalent of ensure clause.
void rb_copy_generic_ivar(VALUE clone, VALUE obj)
Copies the list of instance variables.
#define RARRAY_LEN
Just another name of rb_array_len.
#define RARRAY_PTR_USE(ary, ptr_name, expr)
Declares a section of code where raw pointers are used.
#define RARRAY_AREF(a, i)
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
#define RBASIC(obj)
Convenient casting macro.
#define RHASH_SET_IFNONE(h, ifnone)
Destructively updates the default value of the hash.
#define RHASH_SIZE(h)
Queries the size of the hash.
#define RHASH_EMPTY_P(h)
Checks if the hash is empty.
#define StringValue(v)
Ensures that the parameter object is a String.
static char * RSTRING_END(VALUE str)
Queries the end of the contents pointer of the string.
#define RSTRING_GETMEM(str, ptrvar, lenvar)
Convenient macro to obtain the contents and length at once.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
const char * rb_obj_classname(VALUE obj)
Queries the name of the class of the passed object.
@ RUBY_SPECIAL_SHIFT
Least significant 8 bits are reserved.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
VALUE flags
Per-object flags.
This is the struct that holds necessary info for a struct.
intptr_t SIGNED_VALUE
A signed integer type that has the same width with VALUE.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
static void Check_Type(VALUE v, enum ruby_value_type t)
Identical to RB_TYPE_P(), except it raises exceptions on predication failure.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.