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/symbol.h"
39#include "internal/thread.h"
40#include "internal/time.h"
41#include "internal/vm.h"
45#include "ruby_assert.h"
73#include "internal/gc.h"
76#define SET_DEFAULT(hash, ifnone) ( \
77 FL_UNSET_RAW(hash, RHASH_PROC_DEFAULT), \
78 RHASH_SET_IFNONE(hash, ifnone))
80#define SET_PROC_DEFAULT(hash, proc) set_proc_default(hash, proc)
82#define COPY_DEFAULT(hash, hash2) copy_default(RHASH(hash), RHASH(hash2))
85copy_default(
struct RHash *hash,
const struct RHash *hash2)
87 hash->basic.
flags &= ~RHASH_PROC_DEFAULT;
88 hash->basic.
flags |= hash2->basic.
flags & RHASH_PROC_DEFAULT;
107 return rb_obj_freeze(hash);
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 = RSYMBOL(a)->hashval;
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);
213obj_any_hash(
VALUE obj)
215 VALUE hval = rb_check_funcall_basic_kw(obj, id_hash,
rb_mKernel, 0, 0, 0);
218 hval = rb_exec_recursive_outer_mid(hash_recursive, obj, 0, id_hash);
225 sign = rb_integer_pack(hval, &ul, 1,
sizeof(ul), 0,
243 return any_hash(a, obj_any_hash);
249 return LONG2FIX(any_hash(obj, obj_any_hash));
258static const uint64_t prime1 = ((uint64_t)0x2e0bb864 << 32) | 0xe9ea7df5;
259static const uint32_t prime2 = 0x830fcab9;
262static inline uint64_t
263mult_and_mix(uint64_t m1, uint64_t m2)
265#if defined HAVE_UINT128_T
266 uint128_t r = (uint128_t) m1 * (uint128_t) m2;
267 return (uint64_t) (r >> 64) ^ (uint64_t) r;
269 uint64_t hm1 = m1 >> 32, hm2 = m2 >> 32;
270 uint64_t lm1 = m1, lm2 = m2;
271 uint64_t v64_128 = hm1 * hm2;
272 uint64_t v32_96 = hm1 * lm2 + lm1 * hm2;
273 uint64_t v1_32 = lm1 * lm2;
275 return (v64_128 + (v32_96 >> 32)) ^ ((v32_96 << 32) + v1_32);
279static inline uint64_t
280key64_hash(uint64_t key, uint32_t seed)
282 return mult_and_mix(key + seed, prime1);
286#define st_index_hash(index) key64_hash(rb_hash_start(index), prime2)
289rb_objid_hash(st_index_t index)
291 return (
long)st_index_hash(index);
297 VALUE object_id = rb_obj_id(obj);
299 object_id = rb_big_hash(object_id);
301#if SIZEOF_LONG == SIZEOF_VOIDP
302 return (st_index_t)st_index_hash((st_index_t)
NUM2LONG(object_id));
303#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
304 return (st_index_t)st_index_hash((st_index_t)
NUM2LL(object_id));
312rb_obj_hash(
VALUE obj)
314 long hnum = any_hash(obj, objid_hash);
323#define rb_ident_cmp st_numcmp
326rb_ident_hash(st_data_t n)
335 n ^= dbl_to_index(rb_float_value(n));
339 return (st_index_t)st_index_hash((st_index_t)n);
342#define identhash rb_hashtype_ident
348#define RHASH_IDENTHASH_P(hash) (RHASH_TYPE(hash) == &identhash)
349#define RHASH_STRING_KEY_P(hash, key) (!RHASH_IDENTHASH_P(hash) && (rb_obj_class(key) == rb_cString))
351typedef st_index_t st_hash_t;
361#define RHASH_AR_TABLE_MAX_BOUND RHASH_AR_TABLE_MAX_SIZE
363#define RHASH_AR_TABLE_REF(hash, n) (&RHASH_AR_TABLE(hash)->pairs[n])
364#define RHASH_AR_CLEARED_HINT 0xff
366static inline st_hash_t
367ar_do_hash(st_data_t key)
369 return (st_hash_t)rb_any_hash(key);
372static inline ar_hint_t
373ar_do_hash_hint(st_hash_t hash_value)
375 return (ar_hint_t)hash_value;
378static inline ar_hint_t
379ar_hint(
VALUE hash,
unsigned int index)
381 return RHASH_AR_TABLE(hash)->ar_hint.ary[index];
385ar_hint_set_hint(
VALUE hash,
unsigned int index, ar_hint_t hint)
387 RHASH_AR_TABLE(hash)->ar_hint.ary[index] = hint;
391ar_hint_set(
VALUE hash,
unsigned int index, st_hash_t hash_value)
393 ar_hint_set_hint(hash, index, ar_do_hash_hint(hash_value));
397ar_clear_entry(
VALUE hash,
unsigned int index)
401 ar_hint_set_hint(hash, index, RHASH_AR_CLEARED_HINT);
405ar_cleared_entry(
VALUE hash,
unsigned int index)
407 if (ar_hint(hash, index) == RHASH_AR_CLEARED_HINT) {
412 return UNDEF_P(pair->key);
420ar_set_entry(
VALUE hash,
unsigned int index, st_data_t key, st_data_t val, st_hash_t hash_value)
425 ar_hint_set(hash, index, hash_value);
428#define RHASH_AR_TABLE_SIZE(h) (HASH_ASSERT(RHASH_AR_TABLE_P(h)), \
429 RHASH_AR_TABLE_SIZE_RAW(h))
431#define RHASH_AR_TABLE_BOUND_RAW(h) \
432 ((unsigned int)((RBASIC(h)->flags >> RHASH_AR_TABLE_BOUND_SHIFT) & \
433 (RHASH_AR_TABLE_BOUND_MASK >> RHASH_AR_TABLE_BOUND_SHIFT)))
435#define RHASH_ST_TABLE_SET(h, s) rb_hash_st_table_set(h, s)
436#define RHASH_TYPE(hash) (RHASH_AR_TABLE_P(hash) ? &objhash : RHASH_ST_TABLE(hash)->type)
438#define HASH_ASSERT(expr) RUBY_ASSERT_MESG_WHEN(HASH_DEBUG, expr, #expr)
440static inline unsigned int
441RHASH_AR_TABLE_BOUND(
VALUE h)
443 HASH_ASSERT(RHASH_AR_TABLE_P(h));
444 const unsigned int bound = RHASH_AR_TABLE_BOUND_RAW(h);
445 HASH_ASSERT(bound <= RHASH_AR_TABLE_MAX_SIZE);
450#define hash_verify(hash) hash_verify_(hash, __FILE__, __LINE__)
453rb_hash_dump(
VALUE hash)
455 rb_obj_info_dump(hash);
457 if (RHASH_AR_TABLE_P(hash)) {
458 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
460 fprintf(stderr,
" size:%u bound:%u\n",
461 RHASH_AR_TABLE_SIZE(hash), bound);
463 for (i=0; i<bound; i++) {
466 if (!ar_cleared_entry(hash, i)) {
467 char b1[0x100], b2[0x100];
471 fprintf(stderr,
" %d key:%s val:%s hint:%02x\n", i,
472 rb_raw_obj_info(b1, 0x100, k),
473 rb_raw_obj_info(b2, 0x100, v),
477 fprintf(stderr,
" %d empty\n", i);
484hash_verify_(
VALUE hash,
const char *file,
int line)
486 HASH_ASSERT(RB_TYPE_P(hash,
T_HASH));
488 if (RHASH_AR_TABLE_P(hash)) {
489 unsigned i, n = 0, bound = RHASH_AR_TABLE_BOUND(hash);
491 for (i=0; i<bound; i++) {
493 if (!ar_cleared_entry(hash, i)) {
497 HASH_ASSERT(!UNDEF_P(k));
498 HASH_ASSERT(!UNDEF_P(v));
502 if (n != RHASH_AR_TABLE_SIZE(hash)) {
503 rb_bug(
"n:%u, RHASH_AR_TABLE_SIZE:%u", n, RHASH_AR_TABLE_SIZE(hash));
507 HASH_ASSERT(RHASH_ST_TABLE(hash) != NULL);
508 HASH_ASSERT(RHASH_AR_TABLE_SIZE_RAW(hash) == 0);
509 HASH_ASSERT(RHASH_AR_TABLE_BOUND_RAW(hash) == 0);
516#define hash_verify(h) ((void)0)
520RHASH_TABLE_EMPTY_P(
VALUE hash)
525#define RHASH_SET_ST_FLAG(h) FL_SET_RAW(h, RHASH_ST_TABLE_FLAG)
526#define RHASH_UNSET_ST_FLAG(h) FL_UNSET_RAW(h, RHASH_ST_TABLE_FLAG)
531 st_init_existing_table_with_size(RHASH_ST_TABLE(hash),
type, size);
532 RHASH_SET_ST_FLAG(hash);
538 HASH_ASSERT(st != NULL);
539 RHASH_SET_ST_FLAG(hash);
541 *RHASH_ST_TABLE(hash) = *st;
545RHASH_AR_TABLE_BOUND_SET(
VALUE h, st_index_t n)
547 HASH_ASSERT(RHASH_AR_TABLE_P(h));
548 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_BOUND);
550 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
551 RBASIC(h)->flags |= n << RHASH_AR_TABLE_BOUND_SHIFT;
555RHASH_AR_TABLE_SIZE_SET(
VALUE h, st_index_t n)
557 HASH_ASSERT(RHASH_AR_TABLE_P(h));
558 HASH_ASSERT(n <= RHASH_AR_TABLE_MAX_SIZE);
560 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
561 RBASIC(h)->flags |= n << RHASH_AR_TABLE_SIZE_SHIFT;
565HASH_AR_TABLE_SIZE_ADD(
VALUE h, st_index_t n)
567 HASH_ASSERT(RHASH_AR_TABLE_P(h));
569 RHASH_AR_TABLE_SIZE_SET(h, RHASH_AR_TABLE_SIZE(h) + n);
574#define RHASH_AR_TABLE_SIZE_INC(h) HASH_AR_TABLE_SIZE_ADD(h, 1)
577RHASH_AR_TABLE_SIZE_DEC(
VALUE h)
579 HASH_ASSERT(RHASH_AR_TABLE_P(h));
580 int new_size = RHASH_AR_TABLE_SIZE(h) - 1;
583 RHASH_AR_TABLE_SIZE_SET(h, new_size);
586 RHASH_AR_TABLE_SIZE_SET(h, 0);
587 RHASH_AR_TABLE_BOUND_SET(h, 0);
593RHASH_AR_TABLE_CLEAR(
VALUE h)
595 RBASIC(h)->flags &= ~RHASH_AR_TABLE_SIZE_MASK;
596 RBASIC(h)->flags &= ~RHASH_AR_TABLE_BOUND_MASK;
598 memset(RHASH_AR_TABLE(h), 0,
sizeof(
ar_table));
601NOINLINE(
static int ar_equal(
VALUE x,
VALUE y));
606 return rb_any_cmp(x, y) == 0;
610ar_find_entry_hint(
VALUE hash, ar_hint_t hint, st_data_t key)
612 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
613 const ar_hint_t *hints = RHASH_AR_TABLE(hash)->ar_hint.ary;
617 for (i = 0; i < bound; i++) {
618 if (hints[i] == hint) {
620 if (ar_equal(key, pair->key)) {
621 RB_DEBUG_COUNTER_INC(artable_hint_hit);
627 static char fname[256];
630 if (pid != getpid()) {
631 snprintf(fname,
sizeof(fname),
"/tmp/ruby-armiss.%d", pid = getpid());
632 if ((fp = fopen(fname,
"w")) == NULL) rb_bug(
"fopen");
635 st_hash_t h1 = ar_do_hash(key);
636 st_hash_t h2 = ar_do_hash(pair->key);
638 fprintf(fp,
"miss: hash_eq:%d hints[%d]:%02x hint:%02x\n"
640 " pair->key:%016lx %s\n",
641 h1 == h2, i, hints[i], hint,
642 h1, rb_obj_info(key), h2, rb_obj_info(pair->key));
644 RB_DEBUG_COUNTER_INC(artable_hint_miss);
648 RB_DEBUG_COUNTER_INC(artable_hint_notfound);
649 return RHASH_AR_TABLE_MAX_BOUND;
653ar_find_entry(
VALUE hash, st_hash_t hash_value, st_data_t key)
655 ar_hint_t hint = ar_do_hash_hint(hash_value);
656 return ar_find_entry_hint(hash, hint, key);
660hash_ar_free_and_clear_table(
VALUE hash)
662 RHASH_AR_TABLE_CLEAR(hash);
664 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
665 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
668void rb_st_add_direct_with_hash(
st_table *tab, st_data_t key, st_data_t value, st_hash_t hash);
670enum ar_each_key_type {
677ar_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)
679 for (
int i = 0; i < max; i++) {
683 case ar_each_key_copy:
684 dst_keys[i] = pair->key;
686 case ar_each_key_cmp:
687 if (dst_keys[i] != pair->key)
return 1;
689 case ar_each_key_insert:
690 if (UNDEF_P(pair->key))
continue;
691 rb_st_add_direct_with_hash(new_tab, pair->key, pair->val, hashes[i]);
700ar_force_convert_table(
VALUE hash,
const char *file,
int line)
702 if (RHASH_ST_TABLE_P(hash)) {
703 return RHASH_ST_TABLE(hash);
706 ar_table *ar = RHASH_AR_TABLE(hash);
707 st_hash_t hashes[RHASH_AR_TABLE_MAX_SIZE];
708 unsigned int bound, size;
712 st_data_t keys[RHASH_AR_TABLE_MAX_SIZE];
713 bound = RHASH_AR_TABLE_BOUND(hash);
714 size = RHASH_AR_TABLE_SIZE(hash);
715 ar_each_key(ar, bound, ar_each_key_copy, keys, NULL, NULL);
717 for (
unsigned int i = 0; i < bound; i++) {
719 hashes[i] = UNDEF_P(keys[i]) ? 0 : ar_do_hash(keys[i]);
723 if (UNLIKELY(!RHASH_AR_TABLE_P(hash)))
return RHASH_ST_TABLE(hash);
724 if (UNLIKELY(RHASH_AR_TABLE_BOUND(hash) != bound))
continue;
725 if (UNLIKELY(ar_each_key(ar, bound, ar_each_key_cmp, keys, NULL, NULL)))
continue;
731 rb_st_init_existing_table_with_size(new_tab, &objhash, size);
732 ar_each_key(ar, bound, ar_each_key_insert, NULL, new_tab, hashes);
733 hash_ar_free_and_clear_table(hash);
734 RHASH_ST_TABLE_SET(hash, new_tab);
735 return RHASH_ST_TABLE(hash);
740ar_compact_table(
VALUE hash)
742 const unsigned bound = RHASH_AR_TABLE_BOUND(hash);
743 const unsigned size = RHASH_AR_TABLE_SIZE(hash);
752 for (i=0; i<bound; i++) {
753 if (ar_cleared_entry(hash, i)) {
755 for (; j<bound; j++) {
756 if (!ar_cleared_entry(hash, j)) {
758 ar_hint_set_hint(hash, i, (st_hash_t)ar_hint(hash, j));
759 ar_clear_entry(hash, j);
770 HASH_ASSERT(i<=bound);
772 RHASH_AR_TABLE_BOUND_SET(hash, size);
779ar_add_direct_with_hash(
VALUE hash, st_data_t key, st_data_t val, st_hash_t hash_value)
781 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
783 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
787 if (UNLIKELY(bin >= RHASH_AR_TABLE_MAX_BOUND)) {
788 bin = ar_compact_table(hash);
790 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
792 ar_set_entry(hash, bin, key, val, hash_value);
793 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
794 RHASH_AR_TABLE_SIZE_INC(hash);
800ensure_ar_table(
VALUE hash)
802 if (!RHASH_AR_TABLE_P(hash)) {
803 rb_raise(
rb_eRuntimeError,
"hash representation was changed during iteration");
808ar_general_foreach(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
810 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
811 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
813 for (i = 0; i < bound; i++) {
814 if (ar_cleared_entry(hash, i))
continue;
817 enum st_retval retval = (*func)(pair->key, pair->val, arg, 0);
818 ensure_ar_table(hash);
829 VALUE key = pair->key;
830 VALUE val = pair->val;
831 retval = (*replace)(&key, &val, arg, TRUE);
840 ar_clear_entry(hash, i);
841 RHASH_AR_TABLE_SIZE_DEC(hash);
850ar_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
852 return ar_general_foreach(hash, func, replace, arg);
856 st_foreach_callback_func *func;
861apply_functor(st_data_t k, st_data_t v, st_data_t d,
int _)
863 const struct functor *f = (
void *)d;
864 return f->func(k, v, f->arg);
868ar_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
870 const struct functor f = { func, arg };
871 return ar_general_foreach(hash, apply_functor, NULL, (st_data_t)&f);
875ar_foreach_check(
VALUE hash, st_foreach_check_callback_func *func, st_data_t arg,
878 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
879 unsigned i, ret = 0, bound = RHASH_AR_TABLE_BOUND(hash);
880 enum st_retval retval;
885 for (i = 0; i < bound; i++) {
886 if (ar_cleared_entry(hash, i))
continue;
888 pair = RHASH_AR_TABLE_REF(hash, i);
890 hint = ar_hint(hash, i);
892 retval = (*func)(key, pair->val, arg, 0);
893 ensure_ar_table(hash);
898 pair = RHASH_AR_TABLE_REF(hash, i);
899 if (pair->key == never)
break;
900 ret = ar_find_entry_hint(hash, hint, key);
901 if (ret == RHASH_AR_TABLE_MAX_BOUND) {
902 retval = (*func)(0, 0, arg, 1);
912 if (!ar_cleared_entry(hash, i)) {
913 ar_clear_entry(hash, i);
914 RHASH_AR_TABLE_SIZE_DEC(hash);
925ar_update(
VALUE hash, st_data_t key,
926 st_update_callback_func *func, st_data_t arg)
928 int retval, existing;
929 unsigned bin = RHASH_AR_TABLE_MAX_BOUND;
930 st_data_t value = 0, old_key;
931 st_hash_t hash_value = ar_do_hash(key);
933 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
938 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
939 bin = ar_find_entry(hash, hash_value, key);
940 existing = (bin != RHASH_AR_TABLE_MAX_BOUND) ? TRUE : FALSE;
952 retval = (*func)(&key, &value, arg, existing);
954 ensure_ar_table(hash);
959 if (ar_add_direct_with_hash(hash, key, value, hash_value)) {
965 if (old_key != key) {
973 ar_clear_entry(hash, bin);
974 RHASH_AR_TABLE_SIZE_DEC(hash);
982ar_insert(
VALUE hash, st_data_t key, st_data_t value)
984 unsigned bin = RHASH_AR_TABLE_BOUND(hash);
985 st_hash_t hash_value = ar_do_hash(key);
987 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
992 bin = ar_find_entry(hash, hash_value, key);
993 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
994 if (RHASH_AR_TABLE_SIZE(hash) >= RHASH_AR_TABLE_MAX_SIZE) {
997 else if (bin >= RHASH_AR_TABLE_MAX_BOUND) {
998 bin = ar_compact_table(hash);
1000 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1002 ar_set_entry(hash, bin, key, value, hash_value);
1003 RHASH_AR_TABLE_BOUND_SET(hash, bin+1);
1004 RHASH_AR_TABLE_SIZE_INC(hash);
1008 RHASH_AR_TABLE_REF(hash, bin)->val = value;
1014ar_lookup(
VALUE hash, st_data_t key, st_data_t *value)
1016 if (RHASH_AR_TABLE_SIZE(hash) == 0) {
1020 st_hash_t hash_value = ar_do_hash(key);
1021 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1023 return st_lookup(RHASH_ST_TABLE(hash), key, value);
1025 unsigned bin = ar_find_entry(hash, hash_value, key);
1027 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1031 HASH_ASSERT(bin < RHASH_AR_TABLE_MAX_BOUND);
1032 if (value != NULL) {
1033 *value = RHASH_AR_TABLE_REF(hash, bin)->val;
1041ar_delete(
VALUE hash, st_data_t *key, st_data_t *value)
1044 st_hash_t hash_value = ar_do_hash(*key);
1046 if (UNLIKELY(!RHASH_AR_TABLE_P(hash))) {
1048 return st_delete(RHASH_ST_TABLE(hash), key, value);
1051 bin = ar_find_entry(hash, hash_value, *key);
1053 if (bin == RHASH_AR_TABLE_MAX_BOUND) {
1054 if (value != 0) *value = 0;
1062 ar_clear_entry(hash, bin);
1063 RHASH_AR_TABLE_SIZE_DEC(hash);
1069ar_shift(
VALUE hash, st_data_t *key, st_data_t *value)
1071 if (RHASH_AR_TABLE_SIZE(hash) > 0) {
1072 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1074 for (i = 0; i < bound; i++) {
1075 if (!ar_cleared_entry(hash, i)) {
1077 if (value != 0) *value = pair->val;
1079 ar_clear_entry(hash, i);
1080 RHASH_AR_TABLE_SIZE_DEC(hash);
1085 if (value != NULL) *value = 0;
1090ar_keys(
VALUE hash, st_data_t *keys, st_index_t size)
1092 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1093 st_data_t *keys_start = keys, *keys_end = keys + size;
1095 for (i = 0; i < bound; i++) {
1096 if (keys == keys_end) {
1100 if (!ar_cleared_entry(hash, i)) {
1101 *keys++ = RHASH_AR_TABLE_REF(hash, i)->key;
1106 return keys - keys_start;
1110ar_values(
VALUE hash, st_data_t *values, st_index_t size)
1112 unsigned i, bound = RHASH_AR_TABLE_BOUND(hash);
1113 st_data_t *values_start = values, *values_end = values + size;
1115 for (i = 0; i < bound; i++) {
1116 if (values == values_end) {
1120 if (!ar_cleared_entry(hash, i)) {
1121 *values++ = RHASH_AR_TABLE_REF(hash, i)->val;
1126 return values - values_start;
1132 ar_table *old_tab = RHASH_AR_TABLE(hash2);
1133 ar_table *new_tab = RHASH_AR_TABLE(hash1);
1135 *new_tab = *old_tab;
1136 RHASH_AR_TABLE(hash1)->ar_hint.word = RHASH_AR_TABLE(hash2)->ar_hint.word;
1137 RHASH_AR_TABLE_BOUND_SET(hash1, RHASH_AR_TABLE_BOUND(hash2));
1138 RHASH_AR_TABLE_SIZE_SET(hash1, RHASH_AR_TABLE_SIZE(hash2));
1140 rb_gc_writebarrier_remember(hash1);
1148 if (RHASH_AR_TABLE(hash) != NULL) {
1149 RHASH_AR_TABLE_SIZE_SET(hash, 0);
1150 RHASH_AR_TABLE_BOUND_SET(hash, 0);
1153 HASH_ASSERT(RHASH_AR_TABLE_SIZE(hash) == 0);
1154 HASH_ASSERT(RHASH_AR_TABLE_BOUND(hash) == 0);
1159hash_st_free(
VALUE hash)
1161 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
1163 st_table *tab = RHASH_ST_TABLE(hash);
1166 xfree(tab->entries);
1170hash_st_free_and_clear_table(
VALUE hash)
1174 RHASH_ST_CLEAR(hash);
1178rb_hash_free(
VALUE hash)
1180 if (RHASH_ST_TABLE_P(hash)) {
1185typedef int st_foreach_func(st_data_t, st_data_t, st_data_t);
1189 st_foreach_func *func;
1194foreach_safe_i(st_data_t key, st_data_t value, st_data_t args,
int error)
1199 if (error)
return ST_STOP;
1200 status = (*arg->func)(key, value, arg->arg);
1201 if (status == ST_CONTINUE) {
1213 arg.func = (st_foreach_func *)func;
1215 if (st_foreach_check(table, foreach_safe_i, (st_data_t)&arg, 0)) {
1224 rb_foreach_func *func;
1229hash_iter_status_check(
int status)
1244hash_ar_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1248 if (error)
return ST_STOP;
1250 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1253 return hash_iter_status_check(status);
1257hash_foreach_iter(st_data_t key, st_data_t value, st_data_t argp,
int error)
1261 if (error)
return ST_STOP;
1263 st_table *tbl = RHASH_ST_TABLE(arg->hash);
1264 int status = (*arg->func)((
VALUE)key, (
VALUE)value, arg->arg);
1266 if (RHASH_ST_TABLE(arg->hash) != tbl) {
1270 return hash_iter_status_check(status);
1274iter_lev_in_ivar(
VALUE hash)
1279 HASH_ASSERT(lev >= 0);
1280 return (
unsigned long)lev;
1286iter_lev_in_ivar_set(
VALUE hash,
unsigned long lev)
1288 HASH_ASSERT(lev >= RHASH_LEV_MAX);
1290 rb_ivar_set_internal(hash, id_hash_iter_lev,
LONG2FIX((
long)lev));
1293static inline unsigned long
1294iter_lev_in_flags(
VALUE hash)
1296 return (
unsigned long)((
RBASIC(hash)->flags >> RHASH_LEV_SHIFT) & RHASH_LEV_MAX);
1300iter_lev_in_flags_set(
VALUE hash,
unsigned long lev)
1302 HASH_ASSERT(lev <= RHASH_LEV_MAX);
1303 RBASIC(hash)->flags = ((
RBASIC(hash)->flags & ~RHASH_LEV_MASK) | ((
VALUE)lev << RHASH_LEV_SHIFT));
1307hash_iterating_p(
VALUE hash)
1309 return iter_lev_in_flags(hash) > 0;
1313hash_iter_lev_inc(
VALUE hash)
1315 unsigned long lev = iter_lev_in_flags(hash);
1316 if (lev == RHASH_LEV_MAX) {
1317 lev = iter_lev_in_ivar(hash) + 1;
1324 iter_lev_in_flags_set(hash, lev);
1325 if (lev < RHASH_LEV_MAX)
return;
1327 iter_lev_in_ivar_set(hash, lev);
1331hash_iter_lev_dec(
VALUE hash)
1333 unsigned long lev = iter_lev_in_flags(hash);
1334 if (lev == RHASH_LEV_MAX) {
1335 lev = iter_lev_in_ivar(hash);
1336 if (lev > RHASH_LEV_MAX) {
1337 iter_lev_in_ivar_set(hash, lev-1);
1340 rb_attr_delete(hash, id_hash_iter_lev);
1342 else if (lev == 0) {
1345 iter_lev_in_flags_set(hash, lev - 1);
1349hash_foreach_ensure_rollback(
VALUE hash)
1351 hash_iter_lev_inc(hash);
1356hash_foreach_ensure(
VALUE hash)
1358 hash_iter_lev_dec(hash);
1363rb_hash_stlike_foreach(
VALUE hash, st_foreach_callback_func *func, st_data_t arg)
1365 if (RHASH_AR_TABLE_P(hash)) {
1366 return ar_foreach(hash, func, arg);
1369 return st_foreach(RHASH_ST_TABLE(hash), func, arg);
1374rb_hash_stlike_foreach_with_replace(
VALUE hash, st_foreach_check_callback_func *func, st_update_callback_func *replace, st_data_t arg)
1376 if (RHASH_AR_TABLE_P(hash)) {
1377 return ar_foreach_with_replace(hash, func, replace, arg);
1380 return st_foreach_with_replace(RHASH_ST_TABLE(hash), func, replace, arg);
1385hash_foreach_call(
VALUE arg)
1389 if (RHASH_AR_TABLE_P(hash)) {
1390 ret = ar_foreach_check(hash, hash_ar_foreach_iter,
1391 (st_data_t)arg, (st_data_t)
Qundef);
1393 else if (RHASH_ST_TABLE_P(hash)) {
1394 ret = st_foreach_check(RHASH_ST_TABLE(hash), hash_foreach_iter,
1395 (st_data_t)arg, (st_data_t)
Qundef);
1398 rb_raise(
rb_eRuntimeError,
"ret: %d, hash modified during iteration", ret);
1404rb_hash_foreach(
VALUE hash, rb_foreach_func *func,
VALUE farg)
1408 if (RHASH_TABLE_EMPTY_P(hash))
1411 arg.func = (rb_foreach_func *)func;
1413 if (RB_OBJ_FROZEN(hash)) {
1414 hash_foreach_call((
VALUE)&arg);
1417 hash_iter_lev_inc(hash);
1418 rb_ensure(hash_foreach_call, (
VALUE)&arg, hash_foreach_ensure, hash);
1423void rb_st_compact_table(
st_table *tab);
1426compact_after_delete(
VALUE hash)
1428 if (!hash_iterating_p(hash) && RHASH_ST_TABLE_P(hash)) {
1429 rb_st_compact_table(RHASH_ST_TABLE(hash));
1437 const size_t size =
sizeof(
struct RHash) + (st ? sizeof(
st_table) : sizeof(ar_table));
1439 NEWOBJ_OF(hash, struct RHash, klass, T_HASH | wb | flags, size, 0);
1447hash_alloc(VALUE klass)
1454empty_hash_alloc(
VALUE klass)
1456 RUBY_DTRACE_CREATE_HOOK(HASH, 0);
1458 return hash_alloc(klass);
1470 if (rb_hash_compare_by_id_p(basis)) {
1471 return rb_hash_compare_by_id(hash);
1477rb_hash_new_with_size(st_index_t size)
1479 bool st = size > RHASH_AR_TABLE_MAX_SIZE;
1483 hash_st_table_init(ret, &objhash, size);
1492 return rb_hash_new_with_size((st_index_t)
capa);
1498 if (RHASH_AR_TABLE_P(hash)) {
1499 if (RHASH_AR_TABLE_P(ret)) {
1503 st_table *tab = RHASH_ST_TABLE(ret);
1504 rb_st_init_existing_table_with_size(tab, &objhash, RHASH_AR_TABLE_SIZE(hash));
1506 int bound = RHASH_AR_TABLE_BOUND(hash);
1507 for (
int i = 0; i < bound; i++) {
1508 if (ar_cleared_entry(hash, i))
continue;
1511 st_add_direct(tab, pair->key, pair->val);
1520 RHASH_SET_ST_FLAG(ret);
1521 st_replace(RHASH_ST_TABLE(ret), RHASH_ST_TABLE(hash));
1523 rb_gc_writebarrier_remember(ret);
1529hash_dup_with_compare_by_id(
VALUE hash)
1532 if (RHASH_ST_TABLE_P(hash)) {
1533 RHASH_SET_ST_FLAG(dup);
1536 RHASH_UNSET_ST_FLAG(dup);
1539 return hash_copy(dup, hash);
1554 flags & (
FL_EXIVAR|RHASH_PROC_DEFAULT));
1561rb_hash_resurrect(
VALUE hash)
1568rb_hash_modify_check(
VALUE hash)
1573RUBY_FUNC_EXPORTED
struct st_table *
1574rb_hash_tbl_raw(
VALUE hash,
const char *file,
int line)
1576 return ar_force_convert_table(hash, file, line);
1580rb_hash_tbl(
VALUE hash,
const char *file,
int line)
1583 return rb_hash_tbl_raw(hash, file, line);
1587rb_hash_modify(
VALUE hash)
1589 rb_hash_modify_check(hash);
1592NORETURN(
static void no_new_key(
void));
1596 rb_raise(
rb_eRuntimeError,
"can't add a new key into hash during iteration");
1604#define NOINSERT_UPDATE_CALLBACK(func) \
1606func##_noinsert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1608 if (!existing) no_new_key(); \
1609 return func(key, val, (struct update_arg *)arg, existing); \
1613func##_insert(st_data_t *key, st_data_t *val, st_data_t arg, int existing) \
1615 return func(key, val, (struct update_arg *)arg, existing); \
1620 st_update_callback_func *func;
1626typedef int (*tbl_update_func)(st_data_t *, st_data_t *, st_data_t, int);
1629rb_hash_stlike_update(
VALUE hash, st_data_t key, st_update_callback_func *func, st_data_t arg)
1631 if (RHASH_AR_TABLE_P(hash)) {
1632 int result = ar_update(hash, key, func, arg);
1634 ar_force_convert_table(hash, __FILE__, __LINE__);
1641 return st_update(RHASH_ST_TABLE(hash), key, func, arg);
1645tbl_update_modify(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
1648 st_data_t old_key = *key;
1649 st_data_t old_value = *val;
1650 VALUE hash = p->hash;
1651 int ret = (p->func)(key, val, arg, existing);
1656 if (!existing || *key != old_key || *val != old_value) {
1657 rb_hash_modify(hash);
1664 rb_hash_modify(hash);
1672tbl_update(
VALUE hash,
VALUE key, tbl_update_func func, st_data_t optional_arg)
1675 .arg = optional_arg,
1679 .value = (
VALUE)optional_arg,
1682 int ret = rb_hash_stlike_update(hash, key, tbl_update_modify, (st_data_t)&arg);
1691#define UPDATE_CALLBACK(iter_p, func) ((iter_p) ? func##_noinsert : func##_insert)
1693#define RHASH_UPDATE_ITER(h, iter_p, key, func, a) do { \
1694 tbl_update((h), (key), UPDATE_CALLBACK(iter_p, func), (st_data_t)(a)); \
1697#define RHASH_UPDATE(hash, key, func, arg) \
1698 RHASH_UPDATE_ITER(hash, hash_iterating_p(hash), key, func, arg)
1706 if (n != 2 && (n >= 0 || n < -3)) {
1707 if (n < 0) n = -n-1;
1708 rb_raise(
rb_eTypeError,
"default_proc takes two arguments (2 for %d)", n);
1748rb_hash_initialize(
int argc,
VALUE *argv,
VALUE hash)
1750 rb_hash_modify(hash);
1759 VALUE options, ifnone;
1763 rb_warn_deprecated_to_remove(
"3.4",
"Calling Hash.new with keyword arguments",
"Hash.new({ key: value })");
1809rb_hash_s_create(
int argc,
VALUE *argv,
VALUE klass)
1814 tmp = rb_hash_s_try_convert(
Qnil, argv[0]);
1820 tmp = rb_hash_to_a(tmp);
1823 hash = hash_alloc(klass);
1825 hash_copy(hash, tmp);
1830 tmp = rb_check_array_type(argv[0]);
1836 hash = hash_alloc(klass);
1839 VALUE v = rb_check_array_type(e);
1843 rb_raise(rb_eArgError,
"wrong element type %s at %ld (expected array)",
1844 rb_builtin_class_name(e), i);
1848 rb_raise(rb_eArgError,
"invalid number of elements (%ld for 1..2)",
1854 rb_hash_aset(hash, key, val);
1860 if (argc % 2 != 0) {
1861 rb_raise(rb_eArgError,
"odd number of arguments for Hash");
1864 hash = hash_alloc(klass);
1865 rb_hash_bulk_insert(argc, argv, hash);
1871rb_to_hash_type(
VALUE hash)
1873 return rb_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1875#define to_hash rb_to_hash_type
1880 return rb_check_convert_type_with_id(hash,
T_HASH,
"Hash", idTo_hash);
1897rb_hash_s_try_convert(
VALUE dummy,
VALUE hash)
1899 return rb_check_hash_type(hash);
1918rb_hash_s_ruby2_keywords_hash_p(
VALUE dummy,
VALUE hash)
1921 return RBOOL(RHASH(hash)->basic.flags & RHASH_PASS_AS_KEYWORDS);
1940rb_hash_s_ruby2_keywords_hash(
VALUE dummy,
VALUE hash)
1943 VALUE tmp = rb_hash_dup(hash);
1945 rb_hash_compare_by_id(tmp);
1947 RHASH(tmp)->basic.flags |= RHASH_PASS_AS_KEYWORDS;
1959 if (RHASH_AR_TABLE_P(arg)) {
1960 ar_insert(arg, (st_data_t)key, (st_data_t)value);
1963 st_insert(RHASH_ST_TABLE(arg), (st_data_t)key, (st_data_t)value);
1981rb_hash_rehash(
VALUE hash)
1986 if (hash_iterating_p(hash)) {
1989 rb_hash_modify_check(hash);
1990 if (RHASH_AR_TABLE_P(hash)) {
1991 tmp = hash_alloc(0);
1992 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
1994 hash_ar_free_and_clear_table(hash);
1997 else if (RHASH_ST_TABLE_P(hash)) {
1998 st_table *old_tab = RHASH_ST_TABLE(hash);
1999 tmp = hash_alloc(0);
2001 hash_st_table_init(tmp, old_tab->type, old_tab->num_entries);
2002 tbl = RHASH_ST_TABLE(tmp);
2004 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
2007 RHASH_ST_TABLE_SET(hash, tbl);
2008 RHASH_ST_CLEAR(tmp);
2017 VALUE args[2] = {hash, key};
2022rb_hash_default_unredefined(
VALUE hash)
2026 return !!BASIC_OP_UNREDEFINED_P(BOP_DEFAULT, HASH_REDEFINED_OP_FLAG);
2029 return LIKELY(rb_method_basic_definition_p(klass, id_default));
2038 if (LIKELY(rb_hash_default_unredefined(hash))) {
2040 if (LIKELY(!
FL_TEST_RAW(hash, RHASH_PROC_DEFAULT)))
return ifnone;
2041 if (UNDEF_P(key))
return Qnil;
2042 return call_default_proc(ifnone, hash, key);
2050hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2054 if (RHASH_AR_TABLE_P(hash)) {
2055 return ar_lookup(hash, key, pval);
2058 extern st_index_t rb_iseq_cdhash_hash(
VALUE);
2060 RHASH_ST_TABLE(hash)->
type->hash == rb_ident_hash ||
2061 RHASH_ST_TABLE(hash)->
type->hash == rb_iseq_cdhash_hash);
2062 return st_lookup(RHASH_ST_TABLE(hash), key, pval);
2067rb_hash_stlike_lookup(
VALUE hash, st_data_t key, st_data_t *pval)
2069 return hash_stlike_lookup(hash, key, pval);
2091 if (hash_stlike_lookup(hash, key, &val)) {
2095 return rb_hash_default_value(hash, key);
2104 if (hash_stlike_lookup(hash, key, &val)) {
2115 return rb_hash_lookup2(hash, key,
Qnil);
2142rb_hash_fetch_m(
int argc,
VALUE *argv,
VALUE hash)
2152 if (block_given && argc == 2) {
2153 rb_warn(
"block supersedes default value argument");
2156 if (hash_stlike_lookup(hash, key, &val)) {
2163 else if (argc == 1) {
2169 rb_key_err_raise(rb_sprintf(
"key not found: %"PRIsVALUE, desc), hash, key);
2180 return rb_hash_fetch_m(1, &key, hash);
2204rb_hash_default(
int argc,
VALUE *argv,
VALUE hash)
2210 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2211 if (argc == 0)
return Qnil;
2212 return call_default_proc(ifnone, hash, argv[0]);
2233 rb_hash_modify_check(hash);
2234 SET_DEFAULT(hash, ifnone);
2251rb_hash_default_proc(
VALUE hash)
2253 if (
FL_TEST(hash, RHASH_PROC_DEFAULT)) {
2274rb_hash_set_default_proc(
VALUE hash,
VALUE proc)
2278 rb_hash_modify_check(hash);
2280 SET_DEFAULT(hash, proc);
2283 b = rb_check_convert_type_with_id(proc,
T_DATA,
"Proc", idTo_proc);
2286 "wrong default_proc type %s (expected Proc)",
2290 SET_PROC_DEFAULT(hash, proc);
2327 rb_hash_foreach(hash, key_i, (
VALUE)args);
2333rb_hash_stlike_delete(
VALUE hash, st_data_t *pkey, st_data_t *pval)
2335 if (RHASH_AR_TABLE_P(hash)) {
2336 return ar_delete(hash, pkey, pval);
2339 return st_delete(RHASH_ST_TABLE(hash), pkey, pval);
2351 st_data_t ktmp = (st_data_t)key, val;
2353 if (rb_hash_stlike_delete(hash, &ktmp, &val)) {
2369 VALUE deleted_value = rb_hash_delete_entry(hash, key);
2371 if (!UNDEF_P(deleted_value)) {
2372 return deleted_value;
2411 rb_hash_modify_check(hash);
2412 val = rb_hash_delete_entry(hash, key);
2414 if (!UNDEF_P(val)) {
2415 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)) {
2467 return rb_assoc_new(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);
2474 return rb_assoc_new(var.key, var.val);
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)) {
2482 return rb_assoc_new(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);
2489 return rb_assoc_new(var.key, var.val);
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);
2560rb_hash_reject_bang(
VALUE hash)
2565 rb_hash_modify(hash);
2567 if (!n)
return Qnil;
2568 rb_hash_foreach(hash, delete_if_i, hash);
2592rb_hash_reject(
VALUE hash)
2597 result = hash_dup_with_compare_by_id(hash);
2599 rb_hash_foreach(result, delete_if_i, result);
2600 compact_after_delete(result);
2617rb_hash_slice(
int argc,
VALUE *argv,
VALUE hash)
2620 VALUE key, value, result;
2623 return copy_compare_by_id(rb_hash_new(), hash);
2625 result = copy_compare_by_id(rb_hash_new_with_size(argc), hash);
2627 for (i = 0; i < argc; i++) {
2629 value = rb_hash_lookup2(hash, key,
Qundef);
2630 if (!UNDEF_P(value))
2631 rb_hash_aset(result, key, value);
2649rb_hash_except(
int argc,
VALUE *argv,
VALUE hash)
2654 result = hash_dup_with_compare_by_id(hash);
2656 for (i = 0; i < argc; i++) {
2658 rb_hash_delete(result, key);
2660 compact_after_delete(result);
2679rb_hash_values_at(
int argc,
VALUE *argv,
VALUE hash)
2684 for (i=0; i<argc; i++) {
2685 rb_ary_push(result, rb_hash_aref(hash, argv[i]));
2711rb_hash_fetch_values(
int argc,
VALUE *argv,
VALUE hash)
2716 for (i=0; i<argc; i++) {
2717 rb_ary_push(result, rb_hash_fetch(hash, argv[i]));
2726 rb_hash_modify(hash);
2748rb_hash_select(
VALUE hash)
2753 result = hash_dup_with_compare_by_id(hash);
2755 rb_hash_foreach(result, keep_if_i, result);
2756 compact_after_delete(result);
2779rb_hash_select_bang(
VALUE hash)
2784 rb_hash_modify_check(hash);
2786 if (!n)
return Qnil;
2787 rb_hash_foreach(hash, keep_if_i, hash);
2810rb_hash_keep_if(
VALUE hash)
2813 rb_hash_modify_check(hash);
2814 if (!RHASH_TABLE_EMPTY_P(hash)) {
2815 rb_hash_foreach(hash, keep_if_i, hash);
2836 rb_hash_modify_check(hash);
2838 if (hash_iterating_p(hash)) {
2839 rb_hash_foreach(hash, clear_i, 0);
2841 else if (RHASH_AR_TABLE_P(hash)) {
2845 st_clear(RHASH_ST_TABLE(hash));
2846 compact_after_delete(hash);
2853hash_aset(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2860rb_hash_key_str(
VALUE key)
2863 return rb_fstring(key);
2866 return rb_str_new_frozen(key);
2871hash_aset_str(st_data_t *key, st_data_t *val,
struct update_arg *arg,
int existing)
2873 if (!existing && !RB_OBJ_FROZEN(*key)) {
2874 *key = rb_hash_key_str(*key);
2876 return hash_aset(key, val, arg, existing);
2879NOINSERT_UPDATE_CALLBACK(hash_aset)
2880NOINSERT_UPDATE_CALLBACK(hash_aset_str)
2909 bool iter_p = hash_iterating_p(hash);
2911 rb_hash_modify(hash);
2913 if (!RHASH_STRING_KEY_P(hash, key)) {
2914 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset, val);
2917 RHASH_UPDATE_ITER(hash, iter_p, key, hash_aset_str, val);
2935 rb_hash_modify_check(hash);
2936 if (hash == hash2)
return hash;
2937 if (hash_iterating_p(hash)) {
2940 hash2 = to_hash(hash2);
2942 COPY_DEFAULT(hash, hash2);
2944 if (RHASH_AR_TABLE_P(hash)) {
2945 hash_ar_free_and_clear_table(hash);
2948 hash_st_free_and_clear_table(hash);
2951 hash_copy(hash, hash2);
2989rb_hash_empty_p(
VALUE hash)
3026rb_hash_each_value(
VALUE hash)
3029 rb_hash_foreach(hash, each_value_i, 0);
3064rb_hash_each_key(
VALUE hash)
3067 rb_hash_foreach(hash, each_key_i, 0);
3074 rb_yield(rb_assoc_new(key, value));
3115rb_hash_each_pair(
VALUE hash)
3118 if (rb_block_pair_yield_optimizable())
3119 rb_hash_foreach(hash, each_pair_i_fast, 0);
3121 rb_hash_foreach(hash, each_pair_i, 0);
3135 VALUE trans = p->trans, result = p->result;
3136 VALUE new_key = rb_hash_lookup2(trans, key,
Qundef);
3137 if (UNDEF_P(new_key)) {
3143 rb_hash_aset(result, new_key, value);
3151 rb_hash_aset(result, new_key, value);
3193rb_hash_transform_keys(
int argc,
VALUE *argv,
VALUE hash)
3200 transarg.trans = to_hash(argv[0]);
3206 result = rb_hash_new();
3208 if (transarg.trans) {
3209 transarg.result = result;
3210 rb_hash_foreach(hash, transform_keys_hash_i, (
VALUE)&transarg);
3213 rb_hash_foreach(hash, transform_keys_i, result);
3233rb_hash_transform_keys_bang(
int argc,
VALUE *argv,
VALUE hash)
3236 int block_given = 0;
3240 trans = to_hash(argv[0]);
3246 rb_hash_modify_check(hash);
3247 if (!RHASH_TABLE_EMPTY_P(hash)) {
3249 VALUE new_keys = hash_alloc(0);
3251 rb_hash_foreach(hash, flatten_i, pairs);
3258 else if (!UNDEF_P(new_key = rb_hash_lookup2(trans, key,
Qundef))) {
3261 else if (block_given) {
3268 if (!hash_stlike_lookup(new_keys, key, NULL)) {
3269 rb_hash_stlike_delete(hash, &key, NULL);
3271 rb_hash_aset(hash, new_key, val);
3272 rb_hash_aset(new_keys, new_key,
Qnil);
3274 rb_ary_clear(pairs);
3275 rb_hash_clear(new_keys);
3277 compact_after_delete(hash);
3282transform_values_foreach_func(st_data_t key, st_data_t value, st_data_t argp,
int error)
3288transform_values_foreach_replace(st_data_t *key, st_data_t *value, st_data_t argp,
int existing)
3292 rb_hash_modify(hash);
3318rb_hash_transform_values(
VALUE hash)
3323 result = hash_dup_with_compare_by_id(hash);
3324 SET_DEFAULT(result,
Qnil);
3327 rb_hash_stlike_foreach_with_replace(result, transform_values_foreach_func, transform_values_foreach_replace, result);
3328 compact_after_delete(result);
3350rb_hash_transform_values_bang(
VALUE hash)
3353 rb_hash_modify_check(hash);
3355 if (!RHASH_TABLE_EMPTY_P(hash)) {
3356 rb_hash_stlike_foreach_with_replace(hash, transform_values_foreach_func, transform_values_foreach_replace, hash);
3365 rb_ary_push(ary, rb_assoc_new(key, value));
3380rb_hash_to_a(
VALUE hash)
3385 rb_hash_foreach(hash, to_a_i, ary);
3396 if (RSTRING_LEN(str) > 1) {
3400 rb_enc_copy(str, str2);
3402 rb_str_buf_append(str, str2);
3405 rb_str_buf_append(str, str2);
3411inspect_hash(
VALUE hash,
VALUE dummy,
int recur)
3417 rb_hash_foreach(hash, inspect_i, str);
3435rb_hash_inspect(
VALUE hash)
3449rb_hash_to_hash(
VALUE hash)
3459 pair = rb_check_array_type(arg);
3461 rb_raise(
rb_eTypeError,
"wrong element type %s (expected array)",
3462 rb_builtin_class_name(arg));
3465 rb_raise(rb_eArgError,
"element has wrong array length (expected 2, was %ld)",
3480rb_hash_to_h_block(
VALUE hash)
3483 rb_hash_foreach(hash, to_h_i, h);
3507rb_hash_to_h(
VALUE hash)
3510 return rb_hash_to_h_block(hash);
3514 hash = hash_dup(hash,
rb_cHash, flags & RHASH_PROC_DEFAULT);
3522 rb_ary_push(ary, key);
3536rb_hash_keys(
VALUE hash)
3539 VALUE keys = rb_ary_new_capa(size);
3541 if (size == 0)
return keys;
3543 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3545 if (RHASH_AR_TABLE_P(hash)) {
3546 size = ar_keys(hash, ptr, size);
3549 st_table *table = RHASH_ST_TABLE(hash);
3550 size = st_keys(table, ptr, size);
3553 rb_gc_writebarrier_remember(keys);
3554 rb_ary_set_len(keys, size);
3557 rb_hash_foreach(hash, keys_i, keys);
3566 rb_ary_push(ary, value);
3580rb_hash_values(
VALUE hash)
3585 values = rb_ary_new_capa(size);
3586 if (size == 0)
return values;
3588 if (ST_DATA_COMPATIBLE_P(
VALUE)) {
3589 if (RHASH_AR_TABLE_P(hash)) {
3590 rb_gc_writebarrier_remember(values);
3592 size = ar_values(hash, ptr, size);
3595 else if (RHASH_ST_TABLE_P(hash)) {
3596 st_table *table = RHASH_ST_TABLE(hash);
3597 rb_gc_writebarrier_remember(values);
3599 size = st_values(table, ptr, size);
3602 rb_ary_set_len(values, size);
3606 rb_hash_foreach(hash, values_i, values);
3625 return RBOOL(hash_stlike_lookup(hash, key, NULL));
3655 rb_hash_foreach(hash, rb_hash_search_value, (
VALUE)data);
3671 if (!hash_stlike_lookup(data->hash, key, &val2)) {
3685recursive_eql(
VALUE hash,
VALUE dt,
int recur)
3689 if (recur)
return Qtrue;
3691 data->result =
Qtrue;
3692 rb_hash_foreach(hash, eql_i, dt);
3694 return data->result;
3702 if (hash1 == hash2)
return Qtrue;
3703 if (!RB_TYPE_P(hash2,
T_HASH)) {
3708 if (
rb_eql(hash2, hash1)) {
3721 if (!RHASH_TABLE_EMPTY_P(hash1) && !RHASH_TABLE_EMPTY_P(hash2)) {
3722 if (RHASH_TYPE(hash1) != RHASH_TYPE(hash2)) {
3734 FL_TEST(hash1, RHASH_PROC_DEFAULT) ==
FL_TEST(hash2, RHASH_PROC_DEFAULT)))
3762 return hash_equal(hash1, hash2, FALSE);
3787 return hash_equal(hash1, hash2, TRUE);
3793 st_index_t *hval = (st_index_t *)arg;
3794 st_index_t hdata[2];
3796 hdata[0] = rb_hash(key);
3797 hdata[1] = rb_hash(val);
3798 *hval ^= st_hash(hdata,
sizeof(hdata), 0);
3817rb_hash_hash(
VALUE hash)
3823 rb_hash_foreach(hash, hash_i, (
VALUE)&hval);
3832 rb_hash_aset(hash, value, key);
3852rb_hash_invert(
VALUE hash)
3856 rb_hash_foreach(hash, rb_hash_invert_i, h);
3863 rb_hash_aset(hash, key, value);
3868rb_hash_update_block_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
3870 st_data_t newvalue = arg->arg;
3875 else if (RHASH_STRING_KEY_P(arg->hash, *key) && !RB_OBJ_FROZEN(*key)) {
3876 *key = rb_hash_key_str(*key);
3882NOINSERT_UPDATE_CALLBACK(rb_hash_update_block_callback)
3887 RHASH_UPDATE(hash, key, rb_hash_update_block_callback, value);
3940rb_hash_update(
int argc,
VALUE *argv,
VALUE self)
3945 rb_hash_modify(self);
3946 for (i = 0; i < argc; i++){
3947 VALUE hash = to_hash(argv[i]);
3949 rb_hash_foreach(hash, rb_hash_update_block_i, self);
3952 rb_hash_foreach(hash, rb_hash_update_i, self);
3965rb_hash_update_func_callback(st_data_t *key, st_data_t *value,
struct update_arg *arg,
int existing)
3968 VALUE newvalue = uf_arg->value;
3971 newvalue = (*uf_arg->func)((
VALUE)*key, (
VALUE)*value, newvalue);
3977NOINSERT_UPDATE_CALLBACK(rb_hash_update_func_callback)
3983 VALUE hash = arg->hash;
3986 RHASH_UPDATE(hash, key, rb_hash_update_func_callback, (
VALUE)arg);
3993 rb_hash_modify(hash1);
3994 hash2 = to_hash(hash2);
3999 rb_hash_foreach(hash2, rb_hash_update_func_i, (
VALUE)&arg);
4002 rb_hash_foreach(hash2, rb_hash_update_i, hash1);
4059rb_hash_merge(
int argc,
VALUE *argv,
VALUE self)
4061 return rb_hash_update(argc, argv, copy_compare_by_id(rb_hash_dup(self), self));
4076assoc_lookup(
VALUE arg)
4080 if (st_lookup(p->tbl, p->key, &data))
return (
VALUE)data;
4090 args[1] = rb_assoc_new(key, val);
4114 if (RHASH_ST_TABLE_P(hash) && !RHASH_IDENTHASH_P(hash)) {
4116 st_table assoctable = *RHASH_ST_TABLE(hash);
4118 .compare = assoc_cmp,
4119 .hash = assoctable.type->hash,
4123 .key = (st_data_t)key,
4126 if (RB_OBJ_FROZEN(hash)) {
4127 value = assoc_lookup(arg);
4130 hash_iter_lev_inc(hash);
4131 value =
rb_ensure(assoc_lookup, arg, hash_foreach_ensure, hash);
4134 if (!UNDEF_P(value))
return rb_assoc_new(key, value);
4139 rb_hash_foreach(hash, assoc_i, (
VALUE)args);
4149 args[1] = rb_assoc_new(key, val);
4175 rb_hash_foreach(hash, rassoc_i, (
VALUE)args);
4186 rb_ary_cat(ary, pair, 2);
4223rb_hash_flatten(
int argc,
VALUE *argv,
VALUE hash)
4232 if (level == 0)
return rb_hash_to_a(hash);
4235 rb_hash_foreach(hash, flatten_i, ary);
4240 rb_funcallv(ary, id_flatten_bang, 1, &ary_flatten_level);
4242 else if (level < 0) {
4244 rb_funcallv(ary, id_flatten_bang, 0, 0);
4249 rb_hash_foreach(hash, flatten_i, ary);
4275rb_hash_compact(
VALUE hash)
4277 VALUE result = rb_hash_dup(hash);
4279 rb_hash_foreach(result, delete_if_nil, result);
4280 compact_after_delete(result);
4282 else if (rb_hash_compare_by_id_p(hash)) {
4283 result = rb_hash_compare_by_id(result);
4300rb_hash_compact_bang(
VALUE hash)
4303 rb_hash_modify_check(hash);
4306 rb_hash_foreach(hash, delete_if_nil, hash);
4342rb_hash_compare_by_id(
VALUE hash)
4347 if (rb_hash_compare_by_id_p(hash))
return hash;
4349 rb_hash_modify_check(hash);
4350 if (hash_iterating_p(hash)) {
4354 if (RHASH_TABLE_EMPTY_P(hash)) {
4357 ar_force_convert_table(hash, __FILE__, __LINE__);
4358 HASH_ASSERT(RHASH_ST_TABLE_P(hash));
4360 RHASH_ST_TABLE(hash)->type = &identhash;
4365 tmp = hash_alloc(0);
4366 hash_st_table_init(tmp, &identhash,
RHASH_SIZE(hash));
4367 identtable = RHASH_ST_TABLE(tmp);
4369 rb_hash_foreach(hash, rb_hash_rehash_i, (
VALUE)tmp);
4374 RHASH_ST_TABLE_SET(hash, identtable);
4375 RHASH_ST_CLEAR(tmp);
4389rb_hash_compare_by_id_p(
VALUE hash)
4391 return RBOOL(RHASH_IDENTHASH_P(hash));
4395rb_ident_hash_new(
void)
4397 VALUE hash = rb_hash_new();
4398 hash_st_table_init(hash, &identhash, 0);
4403rb_ident_hash_new_with_size(st_index_t size)
4405 VALUE hash = rb_hash_new();
4406 hash_st_table_init(hash, &identhash, size);
4411rb_init_identtable(
void)
4413 return st_init_table(&identhash);
4484rb_hash_any_p(
int argc,
VALUE *argv,
VALUE hash)
4493 rb_warn(
"given block not used");
4497 rb_hash_foreach(hash, any_p_i_pattern, (
VALUE)args);
4504 if (rb_block_pair_yield_optimizable())
4505 rb_hash_foreach(hash, any_p_i_fast, (
VALUE)args);
4507 rb_hash_foreach(hash, any_p_i, (
VALUE)args);
4542rb_hash_dig(
int argc,
VALUE *argv,
VALUE self)
4545 self = rb_hash_aref(self, *argv);
4546 if (!--argc)
return self;
4548 return rb_obj_dig(argc, argv, self,
Qnil);
4556 if (!UNDEF_P(v) &&
rb_equal(value, v))
return ST_CONTINUE;
4567 rb_hash_foreach(hash1, hash_le_i, (
VALUE)args);
4585 other = to_hash(other);
4587 return hash_le(hash, other);
4604 other = to_hash(other);
4606 return hash_le(hash, other);
4623 other = to_hash(other);
4625 return hash_le(other, hash);
4642 other = to_hash(other);
4644 return hash_le(other, hash);
4651 return rb_hash_aref(hash, *argv);
4667rb_hash_to_proc(
VALUE hash)
4669 return rb_func_lambda_new(hash_proc_call, hash, 1, 1);
4674rb_hash_deconstruct_keys(
VALUE hash,
VALUE keys)
4680add_new_i(st_data_t *key, st_data_t *val, st_data_t arg,
int existing)
4683 if (existing)
return ST_STOP;
4702 if (RHASH_AR_TABLE_P(hash)) {
4703 ret = ar_update(hash, (st_data_t)key, add_new_i, (st_data_t)args);
4707 ar_force_convert_table(hash, __FILE__, __LINE__);
4710 tbl = RHASH_TBL_RAW(hash);
4711 return st_update(tbl, (st_data_t)key, add_new_i, (st_data_t)args);
4716key_stringify(
VALUE key)
4719 rb_hash_key_str(key) : key;
4723ar_bulk_insert(
VALUE hash,
long argc,
const VALUE *argv)
4726 for (i = 0; i < argc; ) {
4727 st_data_t k = key_stringify(argv[i++]);
4728 st_data_t v = argv[i++];
4729 ar_insert(hash, k, v);
4738 HASH_ASSERT(argc % 2 == 0);
4740 st_index_t size = argc / 2;
4742 if (RHASH_AR_TABLE_P(hash) &&
4743 (RHASH_AR_TABLE_SIZE(hash) + size <= RHASH_AR_TABLE_MAX_SIZE)) {
4744 ar_bulk_insert(hash, argc, argv);
4747 rb_hash_bulk_insert_into_st_table(argc, argv, hash);
4752static char **origenviron;
4754#define GET_ENVIRON(e) ((e) = rb_w32_get_environ())
4755#define FREE_ENVIRON(e) rb_w32_free_environ(e)
4756static char **my_environ;
4758#define environ my_environ
4760#define getenv(n) rb_w32_ugetenv(n)
4761#elif defined(__APPLE__)
4763#define environ (*_NSGetEnviron())
4764#define GET_ENVIRON(e) (e)
4765#define FREE_ENVIRON(e)
4767extern char **environ;
4768#define GET_ENVIRON(e) (e)
4769#define FREE_ENVIRON(e)
4771#ifdef ENV_IGNORECASE
4772#define ENVMATCH(s1, s2) (STRCASECMP((s1), (s2)) == 0)
4773#define ENVNMATCH(s1, s2, n) (STRNCASECMP((s1), (s2), (n)) == 0)
4775#define ENVMATCH(n1, n2) (strcmp((n1), (n2)) == 0)
4776#define ENVNMATCH(s1, s2, n) (memcmp((s1), (s2), (n)) == 0)
4779#define ENV_LOCK() RB_VM_LOCK_ENTER()
4780#define ENV_UNLOCK() RB_VM_LOCK_LEAVE()
4786 return rb_utf8_encoding();
4788 return rb_locale_encoding();
4802env_str_new(
const char *ptr,
long len)
4804 return env_enc_str_new(ptr,
len, env_encoding());
4808env_str_new2(
const char *ptr)
4810 if (!ptr)
return Qnil;
4811 return env_str_new(ptr, strlen(ptr));
4815getenv_with_lock(
const char *name)
4820 const char *val = getenv(name);
4821 ret = env_str_new2(val);
4828has_env_with_lock(
const char *name)
4838 return val ? true :
false;
4841static const char TZ_ENV[] =
"TZ";
4844get_env_cstr(
VALUE str,
const char *name)
4848 if (!rb_enc_asciicompat(enc)) {
4849 rb_raise(rb_eArgError,
"bad environment variable %s: ASCII incompatible encoding: %s",
4850 name, rb_enc_name(enc));
4852 var = RSTRING_PTR(str);
4853 if (memchr(var,
'\0', RSTRING_LEN(str))) {
4854 rb_raise(rb_eArgError,
"bad environment variable %s: contains null byte", name);
4856 return rb_str_fill_terminator(str, 1);
4859#define get_env_ptr(var, val) \
4860 (var = get_env_cstr(val, #var))
4862static inline const char *
4863env_name(
volatile VALUE *s)
4867 get_env_ptr(name, *s);
4871#define env_name(s) env_name(&(s))
4876reset_by_modified_env(
const char *nam)
4884 if (ENVMATCH(nam, TZ_ENV)) {
4885 ruby_reset_timezone();
4890env_delete(
VALUE name)
4892 const char *nam = env_name(name);
4893 reset_by_modified_env(nam);
4894 VALUE val = getenv_with_lock(nam);
4897 ruby_setenv(nam, 0);
4932 val = env_delete(name);
4952 const char *nam = env_name(name);
4953 VALUE env = getenv_with_lock(nam);
4993 if (block_given && argc == 2) {
4994 rb_warn(
"block supersedes default value argument");
4996 nam = env_name(key);
4997 env = getenv_with_lock(nam);
5000 if (block_given)
return rb_yield(key);
5002 rb_key_err_raise(rb_sprintf(
"key not found: \"%"PRIsVALUE
"\"", key), envtbl, key);
5009#if defined(_WIN32) || (defined(HAVE_SETENV) && defined(HAVE_UNSETENV))
5012in_origenv(
const char *str)
5015 for (env = origenviron; *env; ++env) {
5016 if (*env == str)
return 1;
5022envix(
const char *nam)
5026 register int i,
len = strlen(nam);
5029 env = GET_ENVIRON(environ);
5030 for (i = 0; env[i]; i++) {
5031 if (ENVNMATCH(env[i],nam,
len) && env[i][
len] ==
'=')
5034 FREE_ENVIRON(environ);
5041getenvsize(
const WCHAR* p)
5043 const WCHAR* porg = p;
5044 while (*p++) p += lstrlenW(p) + 1;
5045 return p - porg + 1;
5049getenvblocksize(
void)
5059check_envsize(
size_t n)
5061 if (_WIN32_WINNT < 0x0600 && rb_w32_osver() < 6) {
5065 WCHAR* p = GetEnvironmentStringsW();
5068 FreeEnvironmentStringsW(p);
5069 if (n >= getenvblocksize()) {
5077#if defined(_WIN32) || \
5078 (defined(__sun) && !(defined(HAVE_SETENV) && defined(HAVE_UNSETENV)))
5080NORETURN(
static void invalid_envname(
const char *name));
5083invalid_envname(
const char *name)
5089check_envname(
const char *name)
5091 if (strchr(name,
'=')) {
5092 invalid_envname(name);
5099ruby_setenv(
const char *name,
const char *value)
5102# if defined(MINGW_HAS_SECURE_API) || RUBY_MSVCRT_VERSION >= 80
5103# define HAVE__WPUTENV_S 1
5110 check_envname(name);
5111 len = MultiByteToWideChar(CP_UTF8, 0, name, -1, NULL, 0);
5114 len2 = MultiByteToWideChar(CP_UTF8, 0, value, -1, NULL, 0);
5115 if (check_envsize((
size_t)
len + len2)) {
5119 wvalue = wname +
len;
5120 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5121 MultiByteToWideChar(CP_UTF8, 0, value, -1, wvalue, len2);
5122#ifndef HAVE__WPUTENV_S
5123 wname[
len-1] = L
'=';
5128 MultiByteToWideChar(CP_UTF8, 0, name, -1, wname,
len);
5129 wvalue = wname +
len;
5131#ifndef HAVE__WPUTENV_S
5132 wname[
len-1] = L
'=';
5138#ifndef HAVE__WPUTENV_S
5139 failed = _wputenv(wname);
5141 failed = _wputenv_s(wname, wvalue);
5149 if (!value || !*value) {
5151 if (!SetEnvironmentVariable(name, value) &&
5152 GetLastError() != ERROR_ENVVAR_NOT_FOUND)
goto fail;
5156 invalid_envname(name);
5158#elif defined(HAVE_SETENV) && defined(HAVE_UNSETENV)
5163 ret = setenv(name, value, 1);
5167 if (ret) rb_sys_fail_sprintf(
"setenv(%s)", name);
5180 ret = unsetenv(name);
5184 if (ret) rb_sys_fail_sprintf(
"unsetenv(%s)", name);
5192 size_t len, mem_size;
5193 char **env_ptr, *str, *mem_ptr;
5195 check_envname(name);
5198 mem_size =
len + strlen(value) + 2;
5199 mem_ptr = malloc(mem_size);
5200 if (mem_ptr == NULL)
5201 rb_sys_fail_sprintf(
"malloc(%"PRIuSIZE
")", mem_size);
5202 snprintf(mem_ptr, mem_size,
"%s=%s", name, value);
5207 for (env_ptr = GET_ENVIRON(environ); (str = *env_ptr) != 0; ++env_ptr) {
5208 if (!strncmp(str, name,
len) && str[
len] ==
'=') {
5209 if (!in_origenv(str)) free(str);
5210 while ((env_ptr[0] = env_ptr[1]) != 0) env_ptr++;
5221 ret = putenv(mem_ptr);
5227 rb_sys_fail_sprintf(
"putenv(%s)", name);
5238 if (environ == origenviron) {
5243 for (max = i; environ[max]; max++) ;
5244 tmpenv =
ALLOC_N(
char*, max+2);
5245 for (j=0; j<max; j++)
5252 char **envp = origenviron;
5253 while (*envp && *envp != environ[i]) envp++;
5257 while (environ[i]) {
5258 environ[i] = environ[i+1];
5265 if (!value)
goto finish;
5270 len = strlen(name) + strlen(value) + 2;
5272 snprintf(environ[i],
len,
"%s=%s",name,value);
5281ruby_unsetenv(
const char *name)
5283 ruby_setenv(name, 0);
5331 return env_aset(nm, val);
5347 get_env_ptr(name, nm);
5348 get_env_ptr(value, val);
5350 ruby_setenv(name, value);
5351 reset_by_modified_env(name);
5358 rb_encoding *enc = raw ? 0 : rb_locale_encoding();
5359 VALUE ary = rb_ary_new();
5363 char **env = GET_ENVIRON(environ);
5365 char *s = strchr(*env,
'=');
5367 const char *p = *env;
5370 rb_ary_push(ary, e);
5374 FREE_ENVIRON(environ);
5397 return env_keys(FALSE);
5408 env = GET_ENVIRON(environ);
5409 for (; *env ; ++env) {
5410 if (strchr(*env,
'=')) {
5414 FREE_ENVIRON(environ);
5439env_each_key(
VALUE ehash)
5445 keys = env_keys(FALSE);
5455 VALUE ary = rb_ary_new();
5459 char **env = GET_ENVIRON(environ);
5462 char *s = strchr(*env,
'=');
5464 rb_ary_push(ary, env_str_new2(s+1));
5468 FREE_ENVIRON(environ);
5490 return env_values();
5511env_each_value(
VALUE ehash)
5517 values = env_values();
5543env_each_pair(
VALUE ehash)
5549 VALUE ary = rb_ary_new();
5553 char **env = GET_ENVIRON(environ);
5556 char *s = strchr(*env,
'=');
5558 rb_ary_push(ary, env_str_new(*env, s-*env));
5559 rb_ary_push(ary, env_str_new2(s+1));
5563 FREE_ENVIRON(environ);
5567 if (rb_block_pair_yield_optimizable()) {
5604env_reject_bang(
VALUE ehash)
5611 keys = env_keys(FALSE);
5612 RBASIC_CLEAR_CLASS(keys);
5623 if (del == 0)
return Qnil;
5648env_delete_if(
VALUE ehash)
5651 env_reject_bang(ehash);
5678 result = rb_ary_new();
5679 for (i=0; i<argc; i++) {
5680 rb_ary_push(result, rb_f_getenv(
Qnil, argv[i]));
5705env_select(
VALUE ehash)
5712 result = rb_hash_new();
5713 keys = env_keys(FALSE);
5719 rb_hash_aset(result, key, val);
5764env_select_bang(
VALUE ehash)
5771 keys = env_keys(FALSE);
5772 RBASIC_CLEAR_CLASS(keys);
5783 if (del == 0)
return Qnil;
5806env_keep_if(
VALUE ehash)
5809 env_select_bang(ehash);
5829 VALUE key, value, result;
5832 return rb_hash_new();
5834 result = rb_hash_new_with_size(argc);
5836 for (i = 0; i < argc; i++) {
5838 value = rb_f_getenv(
Qnil, key);
5840 rb_hash_aset(result, key, value);
5852 keys = env_keys(TRUE);
5855 const char *nam = RSTRING_PTR(key);
5856 ruby_setenv(nam, 0);
5875 return rb_env_clear();
5907 char **env = GET_ENVIRON(environ);
5909 char *s = strchr(*env,
'=');
5911 if (env != environ) {
5919 rb_str_buf_append(str, i);
5923 FREE_ENVIRON(environ);
5944 VALUE ary = rb_ary_new();
5948 char **env = GET_ENVIRON(environ);
5950 char *s = strchr(*env,
'=');
5952 rb_ary_push(ary, rb_assoc_new(env_str_new(*env, s-*env),
5953 env_str_new2(s+1)));
5957 FREE_ENVIRON(environ);
5979env_size_with_lock(
void)
5985 char **env = GET_ENVIRON(environ);
5987 FREE_ENVIRON(environ);
6007 return INT2FIX(env_size_with_lock());
6027 char **env = GET_ENVIRON(environ);
6031 FREE_ENVIRON(environ);
6035 return RBOOL(empty);
6064 const char *s = env_name(key);
6065 return RBOOL(has_env_with_lock(s));
6091 const char *s = env_name(key);
6092 VALUE e = getenv_with_lock(s);
6095 return rb_assoc_new(key, e);
6124 char **env = GET_ENVIRON(environ);
6126 char *s = strchr(*env,
'=');
6128 long len = strlen(s);
6129 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6136 FREE_ENVIRON(environ);
6167 char **env = GET_ENVIRON(environ);
6170 const char *p = *env;
6171 char *s = strchr(p,
'=');
6173 long len = strlen(s);
6174 if (RSTRING_LEN(obj) ==
len && strncmp(s, RSTRING_PTR(obj),
len) == 0) {
6175 result = rb_assoc_new(
rb_str_new(p, s-p-1), obj);
6181 FREE_ENVIRON(environ);
6212 char **env = GET_ENVIRON(environ);
6214 char *s = strchr(*env,
'=');
6216 long len = strlen(s);
6217 if (RSTRING_LEN(value) ==
len && strncmp(s, RSTRING_PTR(value),
len) == 0) {
6218 str = env_str_new(*env, s-*env-1);
6224 FREE_ENVIRON(environ);
6234 VALUE hash = rb_hash_new();
6238 char **env = GET_ENVIRON(environ);
6240 char *s = strchr(*env,
'=');
6242 rb_hash_aset(hash, env_str_new(*env, s-*env),
6247 FREE_ENVIRON(environ);
6263 return env_to_hash();
6278 return env_to_hash();
6302 VALUE hash = env_to_hash();
6304 hash = rb_hash_to_h_block(hash);
6322 VALUE key, hash = env_to_hash();
6324 for (i = 0; i < argc; i++) {
6326 rb_hash_delete(hash, key);
6350 return rb_hash_delete_if(env_to_hash());
6353NORETURN(
static VALUE env_freeze(
VALUE self));
6362env_freeze(
VALUE self)
6391 char **env = GET_ENVIRON(environ);
6393 const char *p = *env;
6394 char *s = strchr(p,
'=');
6396 key = env_str_new(p, s-p);
6397 VALUE val = env_str_new2(getenv(RSTRING_PTR(key)));
6398 result = rb_assoc_new(key, val);
6401 FREE_ENVIRON(environ);
6430 return rb_hash_invert(env_to_hash());
6437 const char *keyptr, *eptr;
6445 if (elen != keylen)
continue;
6446 if (!ENVNMATCH(keyptr, eptr, elen))
continue;
6447 rb_ary_delete_at(keys, i);
6458 keylist_delete(keys, key);
6486 keys = env_keys(TRUE);
6487 if (env == hash)
return env;
6488 hash = to_hash(hash);
6489 rb_hash_foreach(hash, env_replace_i, keys);
6509 if (!
NIL_P(oldval)) {
6556 env_update_block_i : env_update_i;
6557 for (
int i = 0; i < argc; ++i) {
6558 VALUE hash = argv[i];
6559 if (env == hash)
continue;
6560 hash = to_hash(hash);
6561 rb_hash_foreach(hash, func, 0);
6581 rb_get_freeze_opt(1, &opt);
6585 rb_raise(
rb_eTypeError,
"Cannot clone ENV, use ENV.to_h to get a copy of ENV as a hash");
6599 rb_raise(
rb_eTypeError,
"Cannot dup ENV, use ENV.to_h to get a copy of ENV as a hash");
6610 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED,
7096 id_hash_iter_lev = rb_make_internal_id();
7358 origenviron = environ;
7428 ruby_register_rollback_func_for_ensure(hash_foreach_ensure, hash_foreach_ensure_rollback);
7430 HASH_ASSERT(
sizeof(ar_hint_t) * RHASH_AR_TABLE_MAX_SIZE ==
sizeof(
VALUE));
#define RUBY_ASSERT(expr)
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_FL_ANY_RAW(VALUE obj, VALUE flags)
This is an implementation detail of RB_FL_ANY().
@ 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 rb_str_new2
Old name of rb_str_new_cstr.
#define TYPE(_)
Old name of rb_type.
#define NEWOBJ_OF
Old name of RB_NEWOBJ_OF.
#define rb_str_buf_cat2
Old name of rb_usascii_str_new_cstr.
#define FL_EXIVAR
Old name of RUBY_FL_EXIVAR.
#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 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_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.
#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().
#define rb_check_frozen
Just another name of rb_check_frozen
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_block_proc(void)
Constructs a Proc object from implicitly passed components.
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.
#define rb_str_buf_cat
Just another name of rb_str_cat
st_index_t rb_str_hash(VALUE str)
Calculates a hash value of a string.
st_index_t rb_hash_start(st_index_t i)
Starts a series of hashing.
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().
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 SafeStringValue(v)
#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.