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));
328rb_obj_hash(
VALUE obj)
330 long hnum = any_hash(obj, objid_hash);
339#define rb_ident_cmp st_numcmp
342rb_ident_hash(st_data_t n)
351 n ^= dbl_to_index(rb_float_value(n));
355 return (st_index_t)st_index_hash((st_index_t)n);
358#define identhash rb_hashtype_ident
364#define RHASH_IDENTHASH_P(hash) (RHASH_TYPE(hash) == &identhash)
365#define RHASH_STRING_KEY_P(hash, key) (!RHASH_IDENTHASH_P(hash) && (rb_obj_class(key) == rb_cString))
367typedef st_index_t st_hash_t;
377#define RHASH_AR_TABLE_MAX_BOUND RHASH_AR_TABLE_MAX_SIZE
379#define RHASH_AR_TABLE_REF(hash, n) (&RHASH_AR_TABLE(hash)->pairs[n])
380#define RHASH_AR_CLEARED_HINT 0xff
382static inline st_hash_t
383ar_do_hash(st_data_t key)
385 return (st_hash_t)rb_any_hash(key);
388static inline ar_hint_t
389ar_do_hash_hint(st_hash_t hash_value)
391 return (ar_hint_t)hash_value;
394static inline ar_hint_t
395ar_hint(
VALUE hash,
unsigned int index)
397 return RHASH_AR_TABLE(hash)->ar_hint.ary[index];
401ar_hint_set_hint(
VALUE hash,
unsigned int index, ar_hint_t hint)
403 RHASH_AR_TABLE(hash)->ar_hint.ary[index] = hint;
407ar_hint_set(
VALUE hash,
unsigned int index, st_hash_t hash_value)
409 ar_hint_set_hint(hash, index, ar_do_hash_hint(hash_value));
413ar_clear_entry(
VALUE hash,
unsigned int index)
417 ar_hint_set_hint(hash, index, RHASH_AR_CLEARED_HINT);
421ar_cleared_entry(
VALUE hash,
unsigned int index)
423 if (ar_hint(hash, index) == RHASH_AR_CLEARED_HINT) {
428 return UNDEF_P(pair->key);
436ar_set_entry(
VALUE hash,
unsigned int index, st_data_t key, st_data_t val, st_hash_t hash_value)
441 ar_hint_set(hash, index, hash_value);
444#define RHASH_AR_TABLE_SIZE(h) (HASH_ASSERT(RHASH_AR_TABLE_P(h)), \
445 RHASH_AR_TABLE_SIZE_RAW(h))
447#define RHASH_AR_TABLE_BOUND_RAW(h) \
448 ((unsigned int)((RBASIC(h)->flags >> RHASH_AR_TABLE_BOUND_SHIFT) & \
449 (RHASH_AR_TABLE_BOUND_MASK >> RHASH_AR_TABLE_BOUND_SHIFT)))
451#define RHASH_ST_TABLE_SET(h, s) rb_hash_st_table_set(h, s)
452#define RHASH_TYPE(hash) (RHASH_AR_TABLE_P(hash) ? &objhash : RHASH_ST_TABLE(hash)->type)
454#define HASH_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(HASH_DEBUG, expr, #expr)
456static inline unsigned int
457RHASH_AR_TABLE_BOUND(
VALUE h)
459 HASH_ASSERT(RHASH_AR_TABLE_P(h));
460 const unsigned int bound = RHASH_AR_TABLE_BOUND_RAW(h);
461 HASH_ASSERT(bound <= RHASH_AR_TABLE_MAX_SIZE);
466#define hash_verify(hash) hash_verify_(hash, __FILE__, __LINE__)
469rb_hash_dump(
VALUE hash)
471 rb_obj_info_dump(hash);
473 if (RHASH_AR_TABLE_P(hash)) {
474 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
476 fprintf(stderr,
" size:%u bound:%u\n",
477 RHASH_AR_TABLE_SIZE(hash), bound);
479 for (i=0; i<bound; i++) {
482 if (!ar_cleared_entry(hash, i)) {
483 char b1[0x100], b2[0x100];
487 fprintf(stderr,
" %d key:%s val:%s hint:%02x\n", i,
488 rb_raw_obj_info(b1, 0x100, k),
489 rb_raw_obj_info(b2, 0x100, v),
493 fprintf(stderr,
" %d empty\n", i);
500hash_verify_(
VALUE hash,
const char *file,
int line)
504 if (RHASH_AR_TABLE_P(hash)) {
505 unsigned i, n = 0, bound = RHASH_AR_TABLE_BOUND(hash);
507 for (i=0; i<bound; i++) {
509 if (!ar_cleared_entry(hash, i)) {
513 HASH_ASSERT(!UNDEF_P(k));
514 HASH_ASSERT(!UNDEF_P(v));
518 if (n != RHASH_AR_TABLE_SIZE(hash)) {
519 rb_bug(
"n:%u, RHASH_AR_TABLE_SIZE:%u", n, RHASH_AR_TABLE_SIZE(hash));
523 HASH_ASSERT(RHASH_ST_TABLE(hash) != NULL);
524 HASH_ASSERT(RHASH_AR_TABLE_SIZE_RAW(hash) == 0);
525 HASH_ASSERT(RHASH_AR_TABLE_BOUND_RAW(hash) == 0);
532#define hash_verify(h) ((void)0)
536RHASH_TABLE_EMPTY_P(
VALUE hash)
541#define RHASH_SET_ST_FLAG(h) FL_SET_RAW(h, RHASH_ST_TABLE_FLAG)
542#define RHASH_UNSET_ST_FLAG(h) FL_UNSET_RAW(h, RHASH_ST_TABLE_FLAG)
547 st_init_existing_table_with_size(RHASH_ST_TABLE(hash),
type, size);
548 RHASH_SET_ST_FLAG(hash);
554 HASH_ASSERT(st != NULL);
555 RHASH_SET_ST_FLAG(hash);
557 *RHASH_ST_TABLE(hash) = *st;
561RHASH_AR_TABLE_BOUND_SET(
VALUE h, st_index_t n)
563 HASH_ASSERT(RHASH_AR_TABLE_P(h));
564 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_BOUND);
566 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
567 RBASIC(h)->flags |= n << RHASH_AR_TABLE_BOUND_SHIFT;
571RHASH_AR_TABLE_SIZE_SET(
VALUE h, st_index_t n)
573 HASH_ASSERT(RHASH_AR_TABLE_P(h));
574 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_SIZE);
576 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
577 RBASIC(h)->flags |= n << RHASH_AR_TABLE_SIZE_SHIFT;
581HASH_AR_TABLE_SIZE_ADD(
VALUE h, st_index_t n)
583 HASH_ASSERT(RHASH_AR_TABLE_P(h));
585 RHASH_AR_TABLE_SIZE_SET(h, RHASH_AR_TABLE_SIZE(h) + n);
590#define RHASH_AR_TABLE_SIZE_INC(h) HASH_AR_TABLE_SIZE_ADD(h, 1)
593RHASH_AR_TABLE_SIZE_DEC(
VALUE h)
595 HASH_ASSERT(RHASH_AR_TABLE_P(h));
596 int new_size = RHASH_AR_TABLE_SIZE(h) - 1;
599 RHASH_AR_TABLE_SIZE_SET(h, new_size);
602 RHASH_AR_TABLE_SIZE_SET(h, 0);
603 RHASH_AR_TABLE_BOUND_SET(h, 0);
609RHASH_AR_TABLE_CLEAR(
VALUE h)
611 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
612 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
614 memset(RHASH_AR_TABLE(h), 0,
sizeof(
ar_table));
617NOINLINE(
static int ar_equal(
VALUE x,
VALUE y));
622 return rb_any_cmp(x, y) == 0;
626ar_find_entry_hint(
VALUE hash, ar_hint_t hint, st_data_t key)
628 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
629 const ar_hint_t *hints = RHASH_AR_TABLE(hash)->ar_hint.ary;
633 for (i = 0; i < bound; i++) {
634 if (hints[i] == hint) {
636 if (ar_equal(key, pair->key)) {
637 RB_DEBUG_COUNTER_INC(artable_hint_hit);
643 static char fname[256];
646 if (pid != getpid()) {
647 snprintf(fname,
sizeof(fname),
"/tmp/ruby-armiss.%d", pid = getpid());
648 if ((fp = fopen(fname,
"w")) == NULL) rb_bug(
"fopen");
651 st_hash_t h1 = ar_do_hash(key);
652 st_hash_t h2 = ar_do_hash(pair->key);
654 fprintf(fp,
"miss: hash_eq:%d hints[%d]:%02x hint:%02x\n"
656 " pair->key:%016lx %s\n",
657 h1 == h2, i, hints[i], hint,
658 h1, rb_obj_info(key), h2, rb_obj_info(pair->key));
660 RB_DEBUG_COUNTER_INC(artable_hint_miss);
664 RB_DEBUG_COUNTER_INC(artable_hint_notfound);
665 return RHASH_AR_TABLE_MAX_BOUND;
669ar_find_entry(
VALUE hash, st_hash_t hash_value, st_data_t key)
671 ar_hint_t hint = ar_do_hash_hint(hash_value);
672 return ar_find_entry_hint(hash, hint, key);
676hash_ar_free_and_clear_table(
VALUE hash)
678 RHASH_AR_TABLE_CLEAR(hash);
680 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
681 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
684void rb_st_add_direct_with_hash(
st_table *tab, st_data_t key, st_data_t value, st_hash_t hash);
686enum ar_each_key_type {
693ar_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)
695 for (
int i = 0; i < max; i++) {
699 case ar_each_key_copy:
700 dst_keys[i] = pair->key;
702 case ar_each_key_cmp:
703 if (dst_keys[i] != pair->key)
return 1;
705 case ar_each_key_insert:
706 if (UNDEF_P(pair->key))
continue;
707 rb_st_add_direct_with_hash(new_tab, pair->key, pair->val, hashes[i]);
716ar_force_convert_table(
VALUE hash,
const char *file,
int line)
718 if (RHASH_ST_TABLE_P(hash)) {
719 return RHASH_ST_TABLE(hash);
722 ar_table *ar = RHASH_AR_TABLE(hash);
723 st_hash_t hashes[RHASH_AR_TABLE_MAX_SIZE];
724 unsigned int bound, size;
728 st_data_t keys[RHASH_AR_TABLE_MAX_SIZE];
729 bound = RHASH_AR_TABLE_BOUND(hash);
730 size = RHASH_AR_TABLE_SIZE(hash);
731 ar_each_key(ar, bound, ar_each_key_copy, keys, NULL, NULL);
733 for (
unsigned int i = 0; i < bound; i++) {
735 hashes[i] = UNDEF_P(keys[i]) ? 0 : ar_do_hash(keys[i]);
739 if (UNLIKELY(!RHASH_AR_TABLE_P(hash)))
return RHASH_ST_TABLE(hash);
740 if (UNLIKELY(RHASH_AR_TABLE_BOUND(hash) != bound))
continue;
741 if (UNLIKELY(ar_each_key(ar, bound, ar_each_key_cmp, keys, NULL, NULL)))
continue;
747 st_init_existing_table_with_size(new_tab, &objhash, size);
748 ar_each_key(ar, bound, ar_each_key_insert, NULL, new_tab, hashes);
749 hash_ar_free_and_clear_table(hash);
750 RHASH_ST_TABLE_SET(hash, new_tab);
751 return RHASH_ST_TABLE(hash);
756ar_compact_table(
VALUE hash)
758 const unsigned bound = RHASH_AR_TABLE_BOUND(hash);
759 const unsigned size = RHASH_AR_TABLE_SIZE(hash);
768 for (i=0; i<bound; i++) {
769 if (ar_cleared_entry(hash, i)) {
771 for (; j<bound; j++) {
772 if (!ar_cleared_entry(hash, j)) {
774 ar_hint_set_hint(hash, i, (st_hash_t)ar_hint(hash, j));
775 ar_clear_entry(hash, j);
786 HASH_ASSERT(i<=bound);
788 RHASH_AR_TABLE_BOUND_SET(hash, size);
795ar_add_direct_with_hash(
VALUE hash, st_data_t key, st_data_t val, st_hash_t hash_value)
797 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
799 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
803 if (UNLIKELY(bin >= RHASH_AR_TABLE_MAX_BOUND)) {
804 bin = ar_compact_table(hash);
806 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
808 ar_set_entry(hash, bin, key, val, hash_value);
809 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
810 RHASH_AR_TABLE_SIZE_INC(hash);
816ensure_ar_table(
VALUE hash)
818 if (!RHASH_AR_TABLE_P(hash)) {
819 rb_raise(
rb_eRuntimeError,
"hash representation was changed during iteration");
824ar_general_foreach(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
826 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
827 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
829 for (i = 0; i < bound; i++) {
830 if (ar_cleared_entry(hash, i))
continue;
833 st_data_t key = (st_data_t)pair->key;
834 st_data_t val = (st_data_t)pair->val;
835 enum st_retval retval = (*func)(key, val, arg, 0);
836 ensure_ar_table(hash);
847 (*replace)(&key, &val, arg, TRUE);
850 HASH_ASSERT(pair == RHASH_AR_TABLE_REF(hash, i));
852 pair->key = (
VALUE)key;
853 pair->val = (
VALUE)val;
857 ar_clear_entry(hash, i);
858 RHASH_AR_TABLE_SIZE_DEC(hash);
867ar_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
869 return ar_general_foreach(hash, func, replace, arg);
873 st_foreach_callback_func *func;
878apply_functor(st_data_t k, st_data_t v, st_data_t d,
int _)
880 const struct functor *f = (
void *)d;
881 return f->func(k, v, f->arg);
885ar_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
887 const struct functor f = { func, arg };
888 return ar_general_foreach(hash, apply_functor, NULL, (st_data_t)&f);
892ar_foreach_check(
VALUE hash, st_foreach_check_callback_func *func, st_data_t arg,
895 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
896 unsigned i, ret = 0, bound = RHASH_AR_TABLE_BOUND(hash);
897 enum st_retval retval;
902 for (i = 0; i < bound; i++) {
903 if (ar_cleared_entry(hash, i))
continue;
905 pair = RHASH_AR_TABLE_REF(hash, i);
907 hint = ar_hint(hash, i);
909 retval = (*func)(key, pair->val, arg, 0);
910 ensure_ar_table(hash);
915 pair = RHASH_AR_TABLE_REF(hash, i);
916 if (pair->key == never)
break;
917 ret = ar_find_entry_hint(hash, hint, key);
918 if (ret == RHASH_AR_TABLE_MAX_BOUND) {
919 (*func)(0, 0, arg, 1);
929 if (!ar_cleared_entry(hash, i)) {
930 ar_clear_entry(hash, i);
931 RHASH_AR_TABLE_SIZE_DEC(hash);
942ar_update(
VALUE hash, st_data_t key,
943 st_update_callback_func *func, st_data_t arg)
945 int retval, existing;
946 unsigned bin = RHASH_AR_TABLE_MAX_BOUND;
947 st_data_t value = 0, old_key;
948 st_hash_t hash_value = ar_do_hash(key);
950 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
955 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
956 bin = ar_find_entry(hash, hash_value, key);
957 existing = (bin != RHASH_AR_TABLE_MAX_BOUND) ? TRUE : FALSE;
969 retval = (*func)(&key, &value, arg, existing);
971 ensure_ar_table(hash);
976 if (ar_add_direct_with_hash(hash, key, value, hash_value)) {
982 if (old_key != key) {
990 ar_clear_entry(hash, bin);
991 RHASH_AR_TABLE_SIZE_DEC(hash);
999ar_insert(
VALUE hash, st_data_t key, st_data_t value)
1001 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
1002 st_hash_t hash_value = ar_do_hash(key);
1004 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1009 bin = ar_find_entry(hash, hash_value, key);
1010 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1011 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
1014 else if (bin >= RHASH_AR_TABLE_MAX_BOUND) {
1015 bin = ar_compact_table(hash);
1017 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1019 ar_set_entry(hash, bin, key, value, hash_value);
1020 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
1021 RHASH_AR_TABLE_SIZE_INC(hash);
1025 RHASH_AR_TABLE_REF(hash, bin)->val = value;
1031ar_lookup(
VALUE hash, st_data_t key, st_data_t *value)
1033 if (RHASH_AR_TABLE_SIZE(hash) == 0) {
1037 st_hash_t hash_value = ar_do_hash(key);
1038 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1040 return st_lookup(RHASH_ST_TABLE(hash), key, value);
1042 unsigned bin = ar_find_entry(hash, hash_value, key);
1044 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1048 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1049 if (value != NULL) {
1050 *value = RHASH_AR_TABLE_REF(hash, bin)->val;
1058ar_delete(
VALUE hash, st_data_t *key, st_data_t *value)
1061 st_hash_t hash_value = ar_do_hash(*key);
1063 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1065 return st_delete(RHASH_ST_TABLE(hash), key, value);
1068 bin = ar_find_entry(hash, hash_value, *key);
1070 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1071 if (value != 0) *value = 0;
1079 ar_clear_entry(hash, bin);
1080 RHASH_AR_TABLE_SIZE_DEC(hash);
1086ar_shift(
VALUE hash, st_data_t *key, st_data_t *value)
1088 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
1089 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1091 for (i = 0; i < bound; i++) {
1092 if (!ar_cleared_entry(hash, i)) {
1094 if (value != 0) *value = pair->val;
1096 ar_clear_entry(hash, i);
1097 RHASH_AR_TABLE_SIZE_DEC(hash);
1102 if (value != NULL) *value = 0;
1107ar_keys(
VALUE hash, st_data_t *keys, st_index_t size)
1109 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1110 st_data_t *keys_start = keys, *keys_end = keys + size;
1112 for (i = 0; i < bound; i++) {
1113 if (keys == keys_end) {
1117 if (!ar_cleared_entry(hash, i)) {
1118 *keys++ = RHASH_AR_TABLE_REF(hash, i)->key;
1123 return keys - keys_start;
1127ar_values(
VALUE hash, st_data_t *values, st_index_t size)
1129 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1130 st_data_t *values_start = values, *values_end = values + size;
1132 for (i = 0; i < bound; i++) {
1133 if (values == values_end) {
1137 if (!ar_cleared_entry(hash, i)) {
1138 *values++ = RHASH_AR_TABLE_REF(hash, i)->val;
1143 return values - values_start;
1149 ar_table *old_tab = RHASH_AR_TABLE(hash2);
1150 ar_table *new_tab = RHASH_AR_TABLE(hash1);
1152 *new_tab = *old_tab;
1153 RHASH_AR_TABLE(hash1)->ar_hint.word = RHASH_AR_TABLE(hash2)->ar_hint.word;
1154 RHASH_AR_TABLE_BOUND_SET(hash1, RHASH_AR_TABLE_BOUND(hash2));
1155 RHASH_AR_TABLE_SIZE_SET(hash1, RHASH_AR_TABLE_SIZE(hash2));
1157 rb_gc_writebarrier_remember(hash1);
1165 if (RHASH_AR_TABLE(hash) != NULL) {
1166 RHASH_AR_TABLE_SIZE_SET(hash, 0);
1167 RHASH_AR_TABLE_BOUND_SET(hash, 0);
1170 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
1171 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
1176hash_st_free(
VALUE hash)
1178 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
1180 st_table *tab = RHASH_ST_TABLE(hash);
1183 xfree(tab->entries);
1187hash_st_free_and_clear_table(
VALUE hash)
1191 RHASH_ST_CLEAR(hash);
1195rb_hash_free(
VALUE hash)
1197 if (RHASH_ST_TABLE_P(hash)) {
1202typedef int st_foreach_func(st_data_t, st_data_t, st_data_t);
1206 st_foreach_func *func;
1211foreach_safe_i(st_data_t key, st_data_t value, st_data_t args,
int error)
1216 if (error)
return ST_STOP;
1217 status = (*arg->func)(key, value, arg->arg);
1218 if (status == ST_CONTINUE) {
1230 arg.func = (st_foreach_func *)func;
1232 if (st_foreach_check(table, foreach_safe_i, (st_data_t)&arg, 0)) {
1241 rb_foreach_func *func;
1246hash_iter_status_check(
int status)
1261hash_ar_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1265 if (error)
return ST_STOP;
1267 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1269 return hash_iter_status_check(status);
1273hash_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1277 if (error)
return ST_STOP;
1279 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1281 return hash_iter_status_check(status);
1285iter_lev_in_ivar(
VALUE hash)
1290 HASH_ASSERT(lev >= 0);
1291 return (
unsigned long)lev;
1297iter_lev_in_ivar_set(
VALUE hash,
unsigned long lev)
1299 HASH_ASSERT(lev >= RHASH_LEV_MAX);
1301 rb_ivar_set_internal(hash, id_hash_iter_lev,
LONG2FIX((
long)lev));
1304static inline unsigned long
1305iter_lev_in_flags(
VALUE hash)
1307 return (
unsigned long)((
RBASIC(hash)->flags >> RHASH_LEV_SHIFT) & RHASH_LEV_MAX);
1311iter_lev_in_flags_set(
VALUE hash,
unsigned long lev)
1313 HASH_ASSERT(lev <= RHASH_LEV_MAX);
1314 RBASIC(hash)->flags = ((
RBASIC(hash)->flags & ~RHASH_LEV_MASK) | ((
VALUE)lev << RHASH_LEV_SHIFT));
1318hash_iterating_p(
VALUE hash)
1320 return iter_lev_in_flags(hash) > 0;
1324hash_iter_lev_inc(
VALUE hash)
1326 unsigned long lev = iter_lev_in_flags(hash);
1327 if (lev == RHASH_LEV_MAX) {
1328 lev = iter_lev_in_ivar(hash) + 1;
1335 iter_lev_in_flags_set(hash, lev);
1336 if (lev < RHASH_LEV_MAX)
return;
1338 iter_lev_in_ivar_set(hash, lev);
1342hash_iter_lev_dec(
VALUE hash)
1344 unsigned long lev = iter_lev_in_flags(hash);
1345 if (lev == RHASH_LEV_MAX) {
1346 lev = iter_lev_in_ivar(hash);
1347 if (lev > RHASH_LEV_MAX) {
1348 iter_lev_in_ivar_set(hash, lev-1);
1351 rb_attr_delete(hash, id_hash_iter_lev);
1353 else if (lev == 0) {
1356 iter_lev_in_flags_set(hash, lev - 1);
1360hash_foreach_ensure(
VALUE hash)
1362 hash_iter_lev_dec(hash);
1368rb_hash_stlike_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
1370 if (RHASH_AR_TABLE_P(hash)) {
1371 return ar_foreach(hash, func, arg);
1374 return st_foreach(RHASH_ST_TABLE(hash), func, arg);
1380rb_hash_stlike_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
1382 if (RHASH_AR_TABLE_P(hash)) {
1383 return ar_foreach_with_replace(hash, func, replace, arg);
1386 return st_foreach_with_replace(RHASH_ST_TABLE(hash), func, replace, arg);
1391hash_foreach_call(
VALUE arg)
1395 if (RHASH_AR_TABLE_P(hash)) {
1396 ret = ar_foreach_check(hash, hash_ar_foreach_iter,
1397 (st_data_t)arg, (st_data_t)
Qundef);
1399 else if (RHASH_ST_TABLE_P(hash)) {
1400 ret = st_foreach_check(RHASH_ST_TABLE(hash), hash_foreach_iter,
1401 (st_data_t)arg, (st_data_t)
Qundef);
1404 rb_raise(
rb_eRuntimeError,
"ret: %d, hash modified during iteration", ret);
1410rb_hash_foreach(
VALUE hash, rb_foreach_func *func,
VALUE farg)
1414 if (RHASH_TABLE_EMPTY_P(hash))
1417 arg.func = (rb_foreach_func *)func;
1420 hash_foreach_call((
VALUE)&arg);
1423 hash_iter_lev_inc(hash);
1424 rb_ensure(hash_foreach_call, (
VALUE)&arg, hash_foreach_ensure, hash);
1429void rb_st_compact_table(
st_table *tab);
1432compact_after_delete(
VALUE hash)
1434 if (!hash_iterating_p(hash) && RHASH_ST_TABLE_P(hash)) {
1435 rb_st_compact_table(RHASH_ST_TABLE(hash));
1443 const size_t size =
sizeof(
struct RHash) + (st ? sizeof(
st_table) : sizeof(ar_table));
1445 NEWOBJ_OF(hash, struct RHash, klass, T_HASH | wb | flags, size, 0);
1453hash_alloc(VALUE klass)
1460empty_hash_alloc(
VALUE klass)
1462 RUBY_DTRACE_CREATE_HOOK(HASH, 0);
1464 return hash_alloc(klass);
1476 if (rb_hash_compare_by_id_p(basis)) {
1477 return rb_hash_compare_by_id(hash);
1483rb_hash_new_with_size(st_index_t size)
1485 bool st = size > RHASH_AR_TABLE_MAX_SIZE;
1489 hash_st_table_init(ret, &objhash, size);
1498 return rb_hash_new_with_size((st_index_t)
capa);
1504 if (RHASH_AR_TABLE_P(hash)) {
1505 if (RHASH_AR_TABLE_P(ret)) {
1509 st_table *tab = RHASH_ST_TABLE(ret);
1510 st_init_existing_table_with_size(tab, &objhash, RHASH_AR_TABLE_SIZE(hash));
1512 int bound = RHASH_AR_TABLE_BOUND(hash);
1513 for (
int i = 0; i < bound; i++) {
1514 if (ar_cleared_entry(hash, i))
continue;
1517 st_add_direct(tab, pair->key, pair->val);
1526 RHASH_SET_ST_FLAG(ret);
1527 st_replace(RHASH_ST_TABLE(ret), RHASH_ST_TABLE(hash));
1529 rb_gc_writebarrier_remember(ret);
1535hash_dup_with_compare_by_id(
VALUE hash)
1538 if (RHASH_ST_TABLE_P(hash)) {
1539 RHASH_SET_ST_FLAG(dup);
1542 RHASH_UNSET_ST_FLAG(dup);
1545 return hash_copy(dup, hash);
1561 if (rb_obj_exivar_p(hash)) {
1568rb_hash_resurrect(
VALUE hash)
1575rb_hash_modify_check(
VALUE hash)
1577 rb_check_frozen(hash);
1581rb_hash_tbl_raw(
VALUE hash,
const char *file,
int line)
1583 return ar_force_convert_table(hash, file, line);
1587rb_hash_tbl(
VALUE hash,
const char *file,
int line)
1590 return rb_hash_tbl_raw(hash, file, line);
1594rb_hash_modify(
VALUE hash)
1596 rb_hash_modify_check(hash);
1599NORETURN(
static void no_new_key(
void));
1603 rb_raise(
rb_eRuntimeError,
"can't add a new key into hash during iteration");
1611#define NOINSERT_UPDATE_CALLBACK(func) \
1613func##_noinsert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1615 if (!existing) no_new_key(); \
1616 return func(key, val, (struct update_arg *)arg, existing); \
1620func##_insert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1622 return func(key, val, (struct update_arg *)arg, existing); \
1627 st_update_callback_func *func;
1633typedef int (*tbl_update_func)(st_data_t *, st_data_t *, st_data_t, int);
1636rb_hash_stlike_update(
VALUE hash, st_data_t key, st_update_callback_func *func, st_data_t arg)
1638 if (RHASH_AR_TABLE_P(hash)) {
1639 int result = ar_update(hash, key, func, arg);
1641 ar_force_convert_table(hash, __FILE__, __LINE__);
1648 return st_update(RHASH_ST_TABLE(hash), key, func, arg);
1652tbl_update_modify(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
1655 st_data_t old_key = *key;
1656 st_data_t old_value = *val;
1657 VALUE hash = p->hash;
1658 int ret = (p->func)(key, val, arg, existing);
1663 if (!existing || *key != old_key || *val != old_value) {
1664 rb_hash_modify(hash);
1671 rb_hash_modify(hash);
1679tbl_update(
VALUE hash,
VALUE key, tbl_update_func func, st_data_t optional_arg)
1682 .arg = optional_arg,
1689 int ret = rb_hash_stlike_update(hash, key, tbl_update_modify, (st_data_t)&arg);
1698#define UPDATE_CALLBACK(iter_p, func) ((iter_p) ? func##_noinsert : func##_insert)
1700#define RHASH_UPDATE_ITER(h, iter_p, key, func, a) do { \
1701 tbl_update((h), (key), UPDATE_CALLBACK(iter_p, func), (st_data_t)(a)); \
1704#define RHASH_UPDATE(hash, key, func, arg) \
1705 RHASH_UPDATE_ITER(hash, hash_iterating_p(hash), key, func, arg)
1713 if (n != 2 && (n >= 0 || n < -3)) {
1714 if (n < 0) n = -n-1;
1715 rb_raise(
rb_eTypeError,
"default_proc takes two arguments (2 for %d)", n);
1726 rb_hash_modify(hash);
1728 if (capa_value !=
INT2FIX(0)) {
1730 if (
capa > 0 &&
RHASH_SIZE(hash) == 0 && RHASH_AR_TABLE_P(hash)) {
1731 hash_st_table_init(hash, &objhash,
capa);
1735 if (!
NIL_P(block)) {
1736 if (ifnone_unset !=
Qtrue) {
1740 SET_PROC_DEFAULT(hash, block);
1791rb_hash_s_create(
int argc,
VALUE *argv,
VALUE klass)
1796 tmp = rb_hash_s_try_convert(
Qnil, argv[0]);
1802 tmp = rb_hash_to_a(tmp);
1805 hash = hash_alloc(klass);
1807 hash_copy(hash, tmp);
1818 hash = hash_alloc(klass);
1825 rb_raise(rb_eArgError,
"wrong element type %s at %ld (expected array)",
1826 rb_builtin_class_name(e), i);
1830 rb_raise(rb_eArgError,
"invalid number of elements (%ld for 1..2)",
1836 rb_hash_aset(hash, key, val);
1842 if (argc % 2 != 0) {
1843 rb_raise(rb_eArgError,
"odd number of arguments for Hash");
1846 hash = hash_alloc(klass);
1847 rb_hash_bulk_insert(argc, argv, hash);
1853rb_to_hash_type(
VALUE hash)
1855 return rb_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1857#define to_hash rb_to_hash_type
1862 return rb_check_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1878rb_hash_s_try_convert(
VALUE dummy,
VALUE hash)
1880 return rb_check_hash_type(hash);
1899rb_hash_s_ruby2_keywords_hash_p(
VALUE dummy,
VALUE hash)
1902 return RBOOL(RHASH(hash)->basic.flags & RHASH_PASS_AS_KEYWORDS);
1921rb_hash_s_ruby2_keywords_hash(
VALUE dummy,
VALUE hash)
1924 VALUE tmp = rb_hash_dup(hash);
1926 rb_hash_compare_by_id(tmp);
1928 RHASH(tmp)->basic.flags |= RHASH_PASS_AS_KEYWORDS;
1940 if (RHASH_AR_TABLE_P(arg)) {
1941 ar_insert(arg, (st_data_t)key, (st_data_t)value);
1944 st_insert(RHASH_ST_TABLE(arg), (st_data_t)key, (st_data_t)value);
1963rb_hash_rehash(
VALUE hash)
1968 if (hash_iterating_p(hash)) {
1971 rb_hash_modify_check(hash);
1972 if (RHASH_AR_TABLE_P(hash)) {
1973 tmp = hash_alloc(0);
1974 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
1976 hash_ar_free_and_clear_table(hash);
1979 else if (RHASH_ST_TABLE_P(hash)) {
1980 st_table *old_tab = RHASH_ST_TABLE(hash);
1981 tmp = hash_alloc(0);
1983 hash_st_table_init(tmp, old_tab->type, old_tab->num_entries);
1984 tbl = RHASH_ST_TABLE(tmp);
1986 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
1989 RHASH_ST_TABLE_SET(hash, tbl);
1990 RHASH_ST_CLEAR(tmp);
1999 VALUE args[2] = {hash, key};
2004rb_hash_default_unredefined(
VALUE hash)
2008 return !!BASIC_OP_UNREDEFINED_P(BOP_DEFAULT, HASH_REDEFINED_OP_FLAG);
2011 return LIKELY(rb_method_basic_definition_p(klass, id_default));
2020 if (LIKELY(rb_hash_default_unredefined(hash))) {
2022 if (LIKELY(!
FL_TEST_RAW(hash, RHASH_PROC_DEFAULT)))
return ifnone;
2023 if (UNDEF_P(key))
return Qnil;
2024 return call_default_proc(ifnone, hash, key);
2032hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2036 if (RHASH_AR_TABLE_P(hash)) {
2037 return ar_lookup(hash, key, pval);
2040 extern st_index_t rb_iseq_cdhash_hash(
VALUE);
2042 RHASH_ST_TABLE(hash)->
type->hash == rb_ident_hash ||
2043 RHASH_ST_TABLE(hash)->
type->hash == rb_iseq_cdhash_hash);
2044 return st_lookup(RHASH_ST_TABLE(hash), key, pval);
2049rb_hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2051 return hash_stlike_lookup(hash, key, pval);
2076 if (hash_stlike_lookup(hash, key, &val)) {
2080 return rb_hash_default_value(hash, key);
2089 if (hash_stlike_lookup(hash, key, &val)) {
2100 return rb_hash_lookup2(hash, key,
Qnil);
2130rb_hash_fetch_m(
int argc,
VALUE *argv,
VALUE hash)
2140 if (block_given && argc == 2) {
2141 rb_warn(
"block supersedes default value argument");
2144 if (hash_stlike_lookup(hash, key, &val)) {
2151 else if (argc == 1) {
2157 rb_key_err_raise(rb_sprintf(
"key not found: %"PRIsVALUE, desc), hash, key);
2168 return rb_hash_fetch_m(1, &key, hash);
2192rb_hash_default(
int argc,
VALUE *argv,
VALUE hash)
2198 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2199 if (argc == 0)
return Qnil;
2200 return call_default_proc(ifnone, hash, argv[0]);
2221 rb_hash_modify_check(hash);
2222 SET_DEFAULT(hash, ifnone);
2239rb_hash_default_proc(
VALUE hash)
2241 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2262rb_hash_set_default_proc(
VALUE hash,
VALUE proc)
2266 rb_hash_modify_check(hash);
2268 SET_DEFAULT(hash, proc);
2271 b = rb_check_convert_type_with_id(proc,
T_DATA,
"Proc", idTo_proc);
2274 "wrong default_proc type %s (expected Proc)",
2278 SET_PROC_DEFAULT(hash, proc);
2318 rb_hash_foreach(hash, key_i, (
VALUE)args);
2324rb_hash_stlike_delete(
VALUE hash, st_data_t *pkey, st_data_t *pval)
2326 if (RHASH_AR_TABLE_P(hash)) {
2327 return ar_delete(hash, pkey, pval);
2330 return st_delete(RHASH_ST_TABLE(hash), pkey, pval);
2342 st_data_t ktmp = (st_data_t)key, val;
2344 if (rb_hash_stlike_delete(hash, &ktmp, &val)) {
2360 VALUE deleted_value = rb_hash_delete_entry(hash, key);
2362 if (!UNDEF_P(deleted_value)) {
2363 return deleted_value;
2409 rb_hash_modify_check(hash);
2410 val = rb_hash_delete_entry(hash, key);
2412 if (!UNDEF_P(val)) {
2413 compact_after_delete(hash);
2458rb_hash_shift(
VALUE hash)
2462 rb_hash_modify_check(hash);
2463 if (RHASH_AR_TABLE_P(hash)) {
2465 if (!hash_iterating_p(hash)) {
2466 if (ar_shift(hash, &var.key, &var.val)) {
2471 rb_hash_foreach(hash, shift_i_safe, (
VALUE)&var);
2472 if (!UNDEF_P(var.key)) {
2473 rb_hash_delete_entry(hash, var.key);
2478 if (RHASH_ST_TABLE_P(hash)) {
2480 if (!hash_iterating_p(hash)) {
2481 if (st_shift(RHASH_ST_TABLE(hash), &var.key, &var.val)) {
2486 rb_hash_foreach(hash, shift_i_safe, (
VALUE)&var);
2487 if (!UNDEF_P(var.key)) {
2488 rb_hash_delete_entry(hash, var.key);
2500 rb_hash_modify(hash);
2509 return rb_hash_size(hash);
2533 rb_hash_modify_check(hash);
2534 if (!RHASH_TABLE_EMPTY_P(hash)) {
2535 rb_hash_foreach(hash, delete_if_i, hash);
2536 compact_after_delete(hash);
2561rb_hash_reject_bang(
VALUE hash)
2566 rb_hash_modify(hash);
2568 if (!n)
return Qnil;
2569 rb_hash_foreach(hash, delete_if_i, hash);
2594rb_hash_reject(
VALUE hash)
2599 result = hash_dup_with_compare_by_id(hash);
2601 rb_hash_foreach(result, delete_if_i, result);
2602 compact_after_delete(result);
2621rb_hash_slice(
int argc,
VALUE *argv,
VALUE hash)
2624 VALUE key, value, result;
2627 return copy_compare_by_id(rb_hash_new(), hash);
2629 result = copy_compare_by_id(rb_hash_new_with_size(argc), hash);
2631 for (i = 0; i < argc; i++) {
2633 value = rb_hash_lookup2(hash, key,
Qundef);
2634 if (!UNDEF_P(value))
2635 rb_hash_aset(result, key, value);
2656rb_hash_except(
int argc,
VALUE *argv,
VALUE hash)
2661 result = hash_dup_with_compare_by_id(hash);
2663 for (i = 0; i < argc; i++) {
2665 rb_hash_delete(result, key);
2667 compact_after_delete(result);
2690rb_hash_values_at(
int argc,
VALUE *argv,
VALUE hash)
2695 for (i=0; i<argc; i++) {
2726rb_hash_fetch_values(
int argc,
VALUE *argv,
VALUE hash)
2731 for (i=0; i<argc; i++) {
2732 rb_ary_push(result, rb_hash_fetch(hash, argv[i]));
2741 rb_hash_modify(hash);
2764rb_hash_select(
VALUE hash)
2769 result = hash_dup_with_compare_by_id(hash);
2771 rb_hash_foreach(result, keep_if_i, result);
2772 compact_after_delete(result);
2798rb_hash_select_bang(
VALUE hash)
2803 rb_hash_modify_check(hash);
2805 if (!n)
return Qnil;
2806 rb_hash_foreach(hash, keep_if_i, hash);
2829rb_hash_keep_if(
VALUE hash)
2832 rb_hash_modify_check(hash);
2833 if (!RHASH_TABLE_EMPTY_P(hash)) {
2834 rb_hash_foreach(hash, keep_if_i, hash);
2857 rb_hash_modify_check(hash);
2859 if (hash_iterating_p(hash)) {
2860 rb_hash_foreach(hash, clear_i, 0);
2862 else if (RHASH_AR_TABLE_P(hash)) {
2866 st_clear(RHASH_ST_TABLE(hash));
2867 compact_after_delete(hash);
2874hash_aset(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2881rb_hash_key_str(
VALUE key)
2884 return rb_fstring(key);
2892hash_aset_str(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2895 *key = rb_hash_key_str(*key);
2897 return hash_aset(key, val, arg, existing);
2900NOINSERT_UPDATE_CALLBACK(hash_aset)
2901NOINSERT_UPDATE_CALLBACK(hash_aset_str)
2935 bool iter_p = hash_iterating_p(hash);
2937 rb_hash_modify(hash);
2939 if (!RHASH_STRING_KEY_P(hash, key)) {
2940 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset, val);
2943 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset_str, val);
2972 rb_hash_modify_check(hash);
2973 if (hash == hash2)
return hash;
2974 if (hash_iterating_p(hash)) {
2977 hash2 = to_hash(hash2);
2979 COPY_DEFAULT(hash, hash2);
2981 if (RHASH_AR_TABLE_P(hash)) {
2982 hash_ar_free_and_clear_table(hash);
2985 hash_st_free_and_clear_table(hash);
2988 hash_copy(hash, hash2);
3029rb_hash_empty_p(
VALUE hash)
3062rb_hash_each_value(
VALUE hash)
3065 rb_hash_foreach(hash, each_value_i, 0);
3096rb_hash_each_key(
VALUE hash)
3099 rb_hash_foreach(hash, each_key_i, 0);
3142rb_hash_each_pair(
VALUE hash)
3145 if (rb_block_pair_yield_optimizable())
3146 rb_hash_foreach(hash, each_pair_i_fast, 0);
3148 rb_hash_foreach(hash, each_pair_i, 0);
3162 VALUE trans = p->trans, result = p->result;
3163 VALUE new_key = rb_hash_lookup2(trans, key,
Qundef);
3164 if (UNDEF_P(new_key)) {
3170 rb_hash_aset(result, new_key, value);
3178 rb_hash_aset(result, new_key, value);
3271rb_hash_transform_keys(
int argc,
VALUE *argv,
VALUE hash)
3278 transarg.trans = to_hash(argv[0]);
3284 result = rb_hash_new();
3286 if (transarg.trans) {
3287 transarg.result = result;
3288 rb_hash_foreach(hash, transform_keys_hash_i, (
VALUE)&transarg);
3291 rb_hash_foreach(hash, transform_keys_i, result);
3395rb_hash_transform_keys_bang(
int argc,
VALUE *argv,
VALUE hash)
3398 int block_given = 0;
3402 trans = to_hash(argv[0]);
3408 rb_hash_modify_check(hash);
3409 if (!RHASH_TABLE_EMPTY_P(hash)) {
3411 VALUE new_keys = hash_alloc(0);
3413 rb_hash_foreach(hash, flatten_i, pairs);
3420 else if (!UNDEF_P(new_key = rb_hash_lookup2(trans, key,
Qundef))) {
3423 else if (block_given) {
3430 if (!hash_stlike_lookup(new_keys, key, NULL)) {
3431 rb_hash_stlike_delete(hash, &key, NULL);
3433 rb_hash_aset(hash, new_key, val);
3434 rb_hash_aset(new_keys, new_key,
Qnil);
3437 rb_hash_clear(new_keys);
3439 compact_after_delete(hash);
3444transform_values_foreach_func(st_data_t key, st_data_t value, st_data_t argp,
int error)
3450transform_values_foreach_replace(st_data_t *key, st_data_t *value, st_data_t argp,
int existing)
3454 rb_hash_modify(hash);
3460transform_values_call(
VALUE hash)
3462 rb_hash_stlike_foreach_with_replace(hash, transform_values_foreach_func, transform_values_foreach_replace, hash);
3467transform_values(
VALUE hash)
3469 hash_iter_lev_inc(hash);
3470 rb_ensure(transform_values_call, hash, hash_foreach_ensure, hash);
3492rb_hash_transform_values(
VALUE hash)
3497 result = hash_dup_with_compare_by_id(hash);
3498 SET_DEFAULT(result,
Qnil);
3501 transform_values(result);
3502 compact_after_delete(result);
3530rb_hash_transform_values_bang(
VALUE hash)
3533 rb_hash_modify_check(hash);
3535 if (!RHASH_TABLE_EMPTY_P(hash)) {
3536 transform_values(hash);
3563rb_hash_to_a(
VALUE hash)
3568 rb_hash_foreach(hash, to_a_i, ary);
3574symbol_key_needs_quote(
VALUE str)
3576 long len = RSTRING_LEN(str);
3577 if (
len == 0 || !rb_str_symname_p(str))
return true;
3578 const char *s = RSTRING_PTR(str);
3580 if (first ==
'@' || first ==
'$' || first ==
'!')
return true;
3581 if (!at_char_boundary(s, s +
len - 1,
RSTRING_END(str), rb_enc_get(str)))
return false;
3582 switch (s[
len - 1]) {
3613 quote = symbol_key_needs_quote(str2);
3618 if (RSTRING_LEN(str) > 1) {
3622 rb_enc_copy(str, str2);
3639inspect_hash(
VALUE hash,
VALUE dummy,
int recur)
3645 rb_hash_foreach(hash, inspect_i, str);
3664rb_hash_inspect(
VALUE hash)
3680rb_hash_to_hash(
VALUE hash)
3692 rb_raise(
rb_eTypeError,
"wrong element type %s (expected array)",
3693 rb_builtin_class_name(arg));
3696 rb_raise(rb_eArgError,
"element has wrong array length (expected 2, was %ld)",
3711rb_hash_to_h_block(
VALUE hash)
3714 rb_hash_foreach(hash, to_h_i, h);
3739rb_hash_to_h(
VALUE hash)
3742 return rb_hash_to_h_block(hash);
3746 hash = hash_dup(hash,
rb_cHash, flags & RHASH_PROC_DEFAULT);
3771rb_hash_keys(
VALUE hash)
3776 if (size == 0)
return keys;
3778 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3780 if (RHASH_AR_TABLE_P(hash)) {
3781 size = ar_keys(hash, ptr, size);
3784 st_table *table = RHASH_ST_TABLE(hash);
3785 size = st_keys(table, ptr, size);
3788 rb_gc_writebarrier_remember(keys);
3789 rb_ary_set_len(keys, size);
3792 rb_hash_foreach(hash, keys_i, keys);
3818rb_hash_values(
VALUE hash)
3824 if (size == 0)
return values;
3826 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3827 if (RHASH_AR_TABLE_P(hash)) {
3828 rb_gc_writebarrier_remember(values);
3830 size = ar_values(hash, ptr, size);
3833 else if (RHASH_ST_TABLE_P(hash)) {
3834 st_table *table = RHASH_ST_TABLE(hash);
3835 rb_gc_writebarrier_remember(values);
3837 size = st_values(table, ptr, size);
3840 rb_ary_set_len(values, size);
3843 rb_hash_foreach(hash, values_i, values);
3865 return RBOOL(hash_stlike_lookup(hash, key, NULL));
3896 rb_hash_foreach(hash, rb_hash_search_value, (
VALUE)data);
3912 if (!hash_stlike_lookup(data->hash, key, &val2)) {
3926recursive_eql(
VALUE hash,
VALUE dt,
int recur)
3930 if (recur)
return Qtrue;
3932 data->result =
Qtrue;
3933 rb_hash_foreach(hash, eql_i, dt);
3935 return data->result;
3943 if (hash1 == hash2)
return Qtrue;
3949 if (
rb_eql(hash2, hash1)) {
3962 if (!RHASH_TABLE_EMPTY_P(hash1) && !RHASH_TABLE_EMPTY_P(hash2)) {
3963 if (RHASH_TYPE(hash1) != RHASH_TYPE(hash2)) {
3975 FL_TEST(hash1, RHASH_PROC_DEFAULT) ==
FL_TEST(hash2, RHASH_PROC_DEFAULT)))
4011 return hash_equal(hash1, hash2, FALSE);
4038 return hash_equal(hash1, hash2, TRUE);
4044 st_index_t *hval = (st_index_t *)arg;
4045 st_index_t hdata[2];
4047 hdata[0] = rb_hash(key);
4048 hdata[1] = rb_hash(val);
4049 *hval ^= st_hash(hdata,
sizeof(hdata), 0);
4071rb_hash_hash(
VALUE hash)
4077 rb_hash_foreach(hash, hash_i, (
VALUE)&hval);
4086 rb_hash_aset(hash, value, key);
4110rb_hash_invert(
VALUE hash)
4114 rb_hash_foreach(hash, rb_hash_invert_i, h);
4121 rb_hash_aset(hash, key, value);
4126 VALUE hash, newvalue, *argv;
4133rb_hash_update_block_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
4137 VALUE newvalue = ua->newvalue, hash = arg->hash;
4140 hash_iter_lev_inc(hash);
4141 ua->iterating =
true;
4143 hash_iter_lev_dec(hash);
4144 ua->iterating =
false;
4146 else if (RHASH_STRING_KEY_P(hash, k) && !
RB_OBJ_FROZEN(k)) {
4147 *key = (st_data_t)rb_hash_key_str(k);
4149 *value = (st_data_t)newvalue;
4153NOINSERT_UPDATE_CALLBACK(rb_hash_update_block_callback)
4159 ua->newvalue = value;
4160 RHASH_UPDATE(ua->hash, key, rb_hash_update_block_callback, args);
4165rb_hash_update_call(
VALUE args)
4169 for (
int i = 0; i < arg->argc; i++){
4170 VALUE hash = to_hash(arg->argv[i]);
4171 if (arg->block_given) {
4172 rb_hash_foreach(hash, rb_hash_update_block_i, args);
4175 rb_hash_foreach(hash, rb_hash_update_i, arg->hash);
4182rb_hash_update_ensure(
VALUE args)
4185 if (ua->iterating) hash_iter_lev_dec(ua->hash);
4233rb_hash_update(
int argc,
VALUE *argv,
VALUE self)
4244 rb_hash_modify(self);
4245 return rb_ensure(rb_hash_update_call, arg, rb_hash_update_ensure, arg);
4255rb_hash_update_func_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
4258 VALUE newvalue = uf_arg->value;
4261 newvalue = (*uf_arg->func)((
VALUE)*key, (
VALUE)*value, newvalue);
4267NOINSERT_UPDATE_CALLBACK(rb_hash_update_func_callback)
4273 VALUE hash = arg->hash;
4276 RHASH_UPDATE(hash, key, rb_hash_update_func_callback, (
VALUE)arg);
4283 rb_hash_modify(hash1);
4284 hash2 = to_hash(hash2);
4289 rb_hash_foreach(hash2, rb_hash_update_func_i, (
VALUE)&arg);
4292 rb_hash_foreach(hash2, rb_hash_update_i, hash1);
4344rb_hash_merge(
int argc,
VALUE *argv,
VALUE self)
4346 return rb_hash_update(argc, argv, copy_compare_by_id(rb_hash_dup(self), self));
4361assoc_lookup(
VALUE arg)
4365 if (st_lookup(p->tbl, p->key, &data))
return (
VALUE)data;
4403 if (RHASH_ST_TABLE_P(hash) && !RHASH_IDENTHASH_P(hash)) {
4405 st_table assoctable = *RHASH_ST_TABLE(hash);
4407 .compare = assoc_cmp,
4408 .hash = assoctable.type->hash,
4412 .key = (st_data_t)key,
4416 value = assoc_lookup(arg);
4419 hash_iter_lev_inc(hash);
4420 value =
rb_ensure(assoc_lookup, arg, hash_foreach_ensure, hash);
4428 rb_hash_foreach(hash, assoc_i, (
VALUE)args);
4467 rb_hash_foreach(hash, rassoc_i, (
VALUE)args);
4520rb_hash_flatten(
int argc,
VALUE *argv,
VALUE hash)
4529 if (level == 0)
return rb_hash_to_a(hash);
4532 rb_hash_foreach(hash, flatten_i, ary);
4537 rb_funcallv(ary, id_flatten_bang, 1, &ary_flatten_level);
4539 else if (level < 0) {
4541 rb_funcallv(ary, id_flatten_bang, 0, 0);
4546 rb_hash_foreach(hash, flatten_i, ary);
4574rb_hash_compact(
VALUE hash)
4576 VALUE result = rb_hash_dup(hash);
4578 rb_hash_foreach(result, delete_if_nil, result);
4579 compact_after_delete(result);
4581 else if (rb_hash_compare_by_id_p(hash)) {
4582 result = rb_hash_compare_by_id(result);
4604rb_hash_compact_bang(
VALUE hash)
4607 rb_hash_modify_check(hash);
4610 rb_hash_foreach(hash, delete_if_nil, hash);
4644rb_hash_compare_by_id(
VALUE hash)
4649 if (rb_hash_compare_by_id_p(hash))
return hash;
4651 rb_hash_modify_check(hash);
4652 if (hash_iterating_p(hash)) {
4656 if (RHASH_TABLE_EMPTY_P(hash)) {
4659 ar_force_convert_table(hash, __FILE__, __LINE__);
4660 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
4662 RHASH_ST_TABLE(hash)->type = &identhash;
4667 tmp = hash_alloc(0);
4668 hash_st_table_init(tmp, &identhash,
RHASH_SIZE(hash));
4669 identtable = RHASH_ST_TABLE(tmp);
4671 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
4676 RHASH_ST_TABLE_SET(hash, identtable);
4677 RHASH_ST_CLEAR(tmp);
4699rb_hash_compare_by_id_p(
VALUE hash)
4701 return RBOOL(RHASH_IDENTHASH_P(hash));
4705rb_ident_hash_new(
void)
4707 VALUE hash = rb_hash_new();
4708 hash_st_table_init(hash, &identhash, 0);
4713rb_ident_hash_new_with_size(st_index_t size)
4715 VALUE hash = rb_hash_new();
4716 hash_st_table_init(hash, &identhash, size);
4721rb_init_identtable(
void)
4723 return st_init_table(&identhash);
4800rb_hash_any_p(
int argc,
VALUE *argv,
VALUE hash)
4809 rb_warn(
"given block not used");
4813 rb_hash_foreach(hash, any_p_i_pattern, (
VALUE)args);
4820 if (rb_block_pair_yield_optimizable())
4821 rb_hash_foreach(hash, any_p_i_fast, (
VALUE)args);
4823 rb_hash_foreach(hash, any_p_i, (
VALUE)args);
4864rb_hash_dig(
int argc,
VALUE *argv,
VALUE self)
4867 self = rb_hash_aref(self, *argv);
4868 if (!--argc)
return self;
4870 return rb_obj_dig(argc, argv, self,
Qnil);
4878 if (!UNDEF_P(v) &&
rb_equal(value, v))
return ST_CONTINUE;
4889 rb_hash_foreach(hash1, hash_le_i, (
VALUE)args);
4915 other = to_hash(other);
4917 return hash_le(hash, other);
4944 other = to_hash(other);
4946 return hash_le(hash, other);
4971 other = to_hash(other);
4973 return hash_le(other, hash);
5000 other = to_hash(other);
5002 return hash_le(other, hash);
5009 return rb_hash_aref(hash, *argv);
5028rb_hash_to_proc(
VALUE hash)
5030 return rb_func_lambda_new(hash_proc_call, hash, 1, 1);
5035rb_hash_deconstruct_keys(
VALUE hash,
VALUE keys)
5041add_new_i(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
5043 if (existing)
return ST_STOP;
5058 if (RHASH_AR_TABLE_P(hash)) {
5059 ret = ar_update(hash, (st_data_t)key, add_new_i, (st_data_t)val);
5061 ar_force_convert_table(hash, __FILE__, __LINE__);
5066 tbl = RHASH_TBL_RAW(hash);
5067 ret = st_update(tbl, (st_data_t)key, add_new_i, (st_data_t)val);
5078key_stringify(
VALUE key)
5081 rb_hash_key_str(key) : key;
5085ar_bulk_insert(
VALUE hash,
long argc,
const VALUE *argv)
5088 for (i = 0; i < argc; ) {
5089 st_data_t k = key_stringify(argv[i++]);
5090 st_data_t v = argv[i++];
5091 ar_insert(hash, k, v);
5100 HASH_ASSERT(argc % 2 == 0);
5102 st_index_t size = argc / 2;
5104 if (RHASH_AR_TABLE_P(hash) &&
5105 (RHASH_AR_TABLE_SIZE(hash) + size <= RHASH_AR_TABLE_MAX_SIZE)) {
5106 ar_bulk_insert(hash, argc, argv);
5109 rb_hash_bulk_insert_into_st_table(argc, argv, hash);
5114static char **origenviron;
5116#define GET_ENVIRON(e) ((e) = rb_w32_get_environ())
5117#define FREE_ENVIRON(e) rb_w32_free_environ(e)
5118static char **my_environ;
5120#define environ my_environ
5122#define getenv(n) rb_w32_ugetenv(n)
5123#elif defined(__APPLE__)
5125#define environ (*_NSGetEnviron())
5126#define GET_ENVIRON(e) (e)
5127#define FREE_ENVIRON(e)
5129extern char **environ;
5130#define GET_ENVIRON(e) (e)
5131#define FREE_ENVIRON(e)
5133#ifdef ENV_IGNORECASE
5134#define ENVMATCH(s1, s2) (STRCASECMP((s1), (s2)) == 0)
5135#define ENVNMATCH(s1, s2, n) (STRNCASECMP((s1), (s2), (n)) == 0)
5137#define ENVMATCH(n1, n2) (strcmp((n1), (n2)) == 0)
5138#define ENVNMATCH(s1, s2, n) (memcmp((s1), (s2), (n)) == 0)
5141#define ENV_LOCKING() RB_VM_LOCKING()
5147 return rb_utf8_encoding();
5149 return rb_locale_encoding();
5163env_str_new(
const char *ptr,
long len)
5165 return env_enc_str_new(ptr,
len, env_encoding());
5169env_str_new2(
const char *ptr)
5171 if (!ptr)
return Qnil;
5172 return env_str_new(ptr, strlen(ptr));
5176getenv_with_lock(
const char *name)
5180 const char *val = getenv(name);
5181 ret = env_str_new2(val);
5187has_env_with_lock(
const char *name)
5195 return val ? true :
false;
5198static const char TZ_ENV[] =
"TZ";
5201get_env_cstr(
VALUE str,
const char *name)
5205 if (!rb_enc_asciicompat(enc)) {
5206 rb_raise(rb_eArgError,
"bad environment variable %s: ASCII incompatible encoding: %s",
5207 name, rb_enc_name(enc));
5209 var = RSTRING_PTR(str);
5210 if (memchr(var,
'\0', RSTRING_LEN(str))) {
5211 rb_raise(rb_eArgError,
"bad environment variable %s: contains null byte", name);
5213 return rb_str_fill_terminator(str, 1);
5216#define get_env_ptr(var, val) \
5217 (var = get_env_cstr(val, #var))
5219static inline const char *
5220env_name(
volatile VALUE *s)
5224 get_env_ptr(name, *s);
5228#define env_name(s) env_name(&(s))
5233reset_by_modified_env(
const char *nam,
const char *val)
5241 if (ENVMATCH(nam, TZ_ENV)) {
5242 ruby_reset_timezone(val);
5247env_delete(
VALUE name)
5249 const char *nam = env_name(name);
5250 reset_by_modified_env(nam, NULL);
5251 VALUE val = getenv_with_lock(nam);
5254 ruby_setenv(nam, 0);
5289 val = env_delete(name);
5309 const char *nam = env_name(name);
5310 VALUE env = getenv_with_lock(nam);
5350 if (block_given && argc == 2) {
5351 rb_warn(
"block supersedes default value argument");
5353 nam = env_name(key);
5354 env = getenv_with_lock(nam);
5357 if (block_given)
return rb_yield(key);
5359 rb_key_err_raise(rb_sprintf(
"key not found: \"%"PRIsVALUE
"\"", key), envtbl, key);
5366#if defined(_WIN32) || (defined(HAVE_SETENV) && defined(HAVE_UNSETENV))
5369in_origenv(
const char *str)
5372 for (env = origenviron; *env; ++env) {
5373 if (*env == str)
return 1;
5379envix(
const char *nam)
5383 register int i,
len = strlen(nam);
5386 env = GET_ENVIRON(environ);
5387 for (i = 0; env[i]; i++) {
5388 if (ENVNMATCH(env[i],nam,
len) && env[i][
len] ==
'=')
5391 FREE_ENVIRON(environ);
5396#if defined(_WIN32) || \
5397 (defined(__sun) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV)))
5399NORETURN(
static void invalid_envname(
const char *name));
5402invalid_envname(
const char *name)
5408check_envname(
const char *name)
5410 if (strchr(name,
'=')) {
5411 invalid_envname(name);
5418ruby_setenv(
const char *name,
const char *value)
5426 check_envname(name);
5427 len = MultiByteToWideChar(CP_UTF8, 0, name, -1, NULL, 0);
5430 len2 = MultiByteToWideChar(CP_UTF8, 0, value, -1, NULL, 0);
5432 wvalue = wname +
len;
5433 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5434 MultiByteToWideChar(CP_UTF8, 0, value, -1, wvalue, len2);
5438 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5439 wvalue = wname +
len;
5446 failed = _wputenv_s(wname, wvalue);
5452 if (!value || !*value) {
5454 if (!SetEnvironmentVariableW(wname, value ? wvalue : NULL) &&
5455 GetLastError() != ERROR_ENVVAR_NOT_FOUND)
goto fail;
5459 invalid_envname(name);
5461#elif defined(HAVE_SETENV) && defined(HAVE_UNSETENV)
5465 ret = setenv(name, value, 1);
5468 if (ret) rb_sys_fail_sprintf(
"setenv(%s)", name);
5478 ret = unsetenv(name);
5481 if (ret) rb_sys_fail_sprintf(
"unsetenv(%s)", name);
5489 size_t len, mem_size;
5490 char **env_ptr, *str, *mem_ptr;
5492 check_envname(name);
5495 mem_size =
len + strlen(value) + 2;
5496 mem_ptr = malloc(mem_size);
5497 if (mem_ptr == NULL)
5498 rb_sys_fail_sprintf(
"malloc(%"PRIuSIZE
")", mem_size);
5499 snprintf(mem_ptr, mem_size,
"%s=%s", name, value);
5503 for (env_ptr = GET_ENVIRON(environ); (str = *env_ptr) != 0; ++env_ptr) {
5504 if (!strncmp(str, name,
len) && str[
len] ==
'=') {
5505 if (!in_origenv(str)) free(str);
5506 while ((env_ptr[0] = env_ptr[1]) != 0) env_ptr++;
5515 ret = putenv(mem_ptr);
5520 rb_sys_fail_sprintf(
"putenv(%s)", name);
5530 if (environ == origenviron) {
5535 for (max = i; environ[max]; max++) ;
5536 tmpenv =
ALLOC_N(
char*, max+2);
5537 for (j=0; j<max; j++)
5544 char **envp = origenviron;
5545 while (*envp && *envp != environ[i]) envp++;
5549 while (environ[i]) {
5550 environ[i] = environ[i+1];
5557 if (!value)
goto finish;
5562 len = strlen(name) + strlen(value) + 2;
5564 snprintf(environ[i],
len,
"%s=%s",name,value);
5572ruby_unsetenv(
const char *name)
5574 ruby_setenv(name, 0);
5622 return env_aset(nm, val);
5638 get_env_ptr(name, nm);
5639 get_env_ptr(value, val);
5641 ruby_setenv(name, value);
5642 reset_by_modified_env(name, value);
5649 rb_encoding *enc = raw ? 0 : rb_locale_encoding();
5653 char **env = GET_ENVIRON(environ);
5655 char *s = strchr(*env,
'=');
5657 const char *p = *env;
5664 FREE_ENVIRON(environ);
5686 return env_keys(FALSE);
5696 env = GET_ENVIRON(environ);
5697 for (; *env ; ++env) {
5698 if (strchr(*env,
'=')) {
5702 FREE_ENVIRON(environ);
5726env_each_key(
VALUE ehash)
5732 keys = env_keys(FALSE);
5745 char **env = GET_ENVIRON(environ);
5748 char *s = strchr(*env,
'=');
5754 FREE_ENVIRON(environ);
5775 return env_values();
5796env_each_value(
VALUE ehash)
5802 values = env_values();
5828env_each_pair(
VALUE ehash)
5837 char **env = GET_ENVIRON(environ);
5840 char *s = strchr(*env,
'=');
5847 FREE_ENVIRON(environ);
5850 if (rb_block_pair_yield_optimizable()) {
5887env_reject_bang(
VALUE ehash)
5894 keys = env_keys(FALSE);
5895 RBASIC_CLEAR_CLASS(keys);
5906 if (del == 0)
return Qnil;
5931env_delete_if(
VALUE ehash)
5934 env_reject_bang(ehash);
5962 for (i=0; i<argc; i++) {
5988env_select(
VALUE ehash)
5995 result = rb_hash_new();
5996 keys = env_keys(FALSE);
6002 rb_hash_aset(result, key, val);
6047env_select_bang(
VALUE ehash)
6054 keys = env_keys(FALSE);
6055 RBASIC_CLEAR_CLASS(keys);
6066 if (del == 0)
return Qnil;
6089env_keep_if(
VALUE ehash)
6092 env_select_bang(ehash);
6112 VALUE key, value, result;
6115 return rb_hash_new();
6117 result = rb_hash_new_with_size(argc);
6119 for (i = 0; i < argc; i++) {
6121 value = rb_f_getenv(
Qnil, key);
6123 rb_hash_aset(result, key, value);
6135 keys = env_keys(TRUE);
6138 const char *nam = RSTRING_PTR(key);
6139 ruby_setenv(nam, 0);
6158 return rb_env_clear();
6189 char **env = GET_ENVIRON(environ);
6191 const char *s = strchr(*env,
'=');
6193 if (env != environ) {
6204 FREE_ENVIRON(environ);
6227 char **env = GET_ENVIRON(environ);
6229 char *s = strchr(*env,
'=');
6232 env_str_new2(s+1)));
6236 FREE_ENVIRON(environ);
6257env_size_with_lock(
void)
6262 char **env = GET_ENVIRON(environ);
6264 FREE_ENVIRON(environ);
6283 return INT2FIX(env_size_with_lock());
6302 char **env = GET_ENVIRON(environ);
6306 FREE_ENVIRON(environ);
6309 return RBOOL(empty);
6338 const char *s = env_name(key);
6339 return RBOOL(has_env_with_lock(s));
6365 const char *s = env_name(key);
6366 VALUE e = getenv_with_lock(s);
6397 char **env = GET_ENVIRON(environ);
6399 char *s = strchr(*env,
'=');
6401 long len = strlen(s);
6402 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6409 FREE_ENVIRON(environ);
6438 char **env = GET_ENVIRON(environ);
6441 const char *p = *env;
6442 char *s = strchr(p,
'=');
6444 long len = strlen(s);
6445 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6452 FREE_ENVIRON(environ);
6481 char **env = GET_ENVIRON(environ);
6483 char *s = strchr(*env,
'=');
6485 long len = strlen(s);
6486 if (RSTRING_LEN(value) ==
len && strncmp(s, RSTRING_PTR(value),
len) == 0) {
6487 str = env_str_new(*env, s-*env-1);
6493 FREE_ENVIRON(environ);
6502 VALUE hash = rb_hash_new();
6505 char **env = GET_ENVIRON(environ);
6507 char *s = strchr(*env,
'=');
6509 rb_hash_aset(hash, env_str_new(*env, s-*env),
6514 FREE_ENVIRON(environ);
6529 return env_to_hash();
6544 return env_to_hash();
6568 VALUE hash = env_to_hash();
6570 hash = rb_hash_to_h_block(hash);
6588 VALUE key, hash = env_to_hash();
6590 for (i = 0; i < argc; i++) {
6592 rb_hash_delete(hash, key);
6616 return rb_hash_delete_if(env_to_hash());
6619NORETURN(
static VALUE env_freeze(
VALUE self));
6628env_freeze(
VALUE self)
6656 char **env = GET_ENVIRON(environ);
6658 const char *p = *env;
6659 char *s = strchr(p,
'=');
6661 key = env_str_new(p, s-p);
6662 VALUE val = env_str_new2(getenv(RSTRING_PTR(key)));
6666 FREE_ENVIRON(environ);
6694 return rb_hash_invert(env_to_hash());
6701 const char *keyptr, *eptr;
6709 if (elen != keylen)
continue;
6710 if (!ENVNMATCH(keyptr, eptr, elen))
continue;
6722 keylist_delete(keys, key);
6750 keys = env_keys(TRUE);
6751 if (env == hash)
return env;
6752 hash = to_hash(hash);
6753 rb_hash_foreach(hash, env_replace_i, keys);
6773 if (!
NIL_P(oldval)) {
6820 env_update_block_i : env_update_i;
6821 for (
int i = 0; i < argc; ++i) {
6822 VALUE hash = argv[i];
6823 if (env == hash)
continue;
6824 hash = to_hash(hash);
6825 rb_hash_foreach(hash, func, 0);
6845 rb_get_freeze_opt(1, &opt);
6849 rb_raise(
rb_eTypeError,
"Cannot clone ENV, use ENV.to_h to get a copy of ENV as a hash");
6863 rb_raise(
rb_eTypeError,
"Cannot dup ENV, use ENV.to_h to get a copy of ENV as a hash");
6874 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
7345 id_hash_iter_lev = rb_make_internal_id();
7443 rb_cHash_empty_frozen = rb_hash_freeze(rb_hash_new());
7444 rb_vm_register_global_object(rb_cHash_empty_frozen);
7610 origenviron = environ;
7679 HASH_ASSERT(
sizeof(ar_hint_t) * RHASH_AR_TABLE_MAX_SIZE ==
sizeof(
VALUE));
7682#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.