2000-05-01 05:42:38 -04:00
|
|
|
/**********************************************************************
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
hash.c -
|
|
|
|
|
|
|
|
$Author$
|
|
|
|
$Date$
|
|
|
|
created at: Mon Nov 22 18:51:18 JST 1993
|
|
|
|
|
2003-01-16 02:34:03 -05:00
|
|
|
Copyright (C) 1993-2003 Yukihiro Matsumoto
|
2000-05-01 05:42:38 -04:00
|
|
|
Copyright (C) 2000 Network Applied Communication Laboratory, Inc.
|
2000-05-09 00:53:16 -04:00
|
|
|
Copyright (C) 2000 Information-technology Promotion Agency, Japan
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2000-05-01 05:42:38 -04:00
|
|
|
**********************************************************************/
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
#include "ruby.h"
|
|
|
|
#include "st.h"
|
1999-08-13 01:45:20 -04:00
|
|
|
#include "util.h"
|
1999-01-19 23:59:39 -05:00
|
|
|
#include "rubysig.h"
|
2003-05-19 03:11:48 -04:00
|
|
|
#include "version.h"
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2002-10-17 12:13:44 -04:00
|
|
|
#ifdef __APPLE__
|
|
|
|
#include <crt_externs.h>
|
|
|
|
#endif
|
|
|
|
|
2000-01-31 22:12:21 -05:00
|
|
|
#define HASH_DELETED FL_USER1
|
2001-12-10 02:18:16 -05:00
|
|
|
#define HASH_PROC_DEFAULT FL_USER2
|
1998-01-16 07:19:22 -05:00
|
|
|
|
|
|
|
static void
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
|
|
|
{
|
2002-08-12 03:39:12 -04:00
|
|
|
if (!RHASH(hash)->tbl) rb_raise(rb_eTypeError, "uninitialized Hash");
|
2000-01-31 22:12:21 -05:00
|
|
|
if (OBJ_FROZEN(hash)) rb_error_frozen("hash");
|
1999-12-14 01:50:43 -05:00
|
|
|
if (!OBJ_TAINTED(hash) && rb_safe_level() >= 4)
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_raise(rb_eSecurityError, "Insecure: can't modify hash");
|
1998-01-16 07:19:22 -05:00
|
|
|
}
|
|
|
|
|
2000-02-17 02:11:22 -05:00
|
|
|
VALUE
|
|
|
|
rb_hash_freeze(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
return rb_obj_freeze(hash);
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE rb_cHash;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
static VALUE envtbl;
|
2003-05-26 04:22:33 -04:00
|
|
|
static ID id_hash, id_call, id_default;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_hash(obj)
|
|
|
|
VALUE obj;
|
|
|
|
{
|
2001-12-10 02:18:16 -05:00
|
|
|
return rb_funcall(obj, id_hash, 0);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
static VALUE
|
|
|
|
eql(args)
|
|
|
|
VALUE *args;
|
|
|
|
{
|
|
|
|
return (VALUE)rb_eql(args[0], args[1]);
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_any_cmp(a, b)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE a, b;
|
|
|
|
{
|
1999-11-10 23:08:26 -05:00
|
|
|
VALUE args[2];
|
2003-03-04 02:04:11 -05:00
|
|
|
|
|
|
|
if (a == b) return 0;
|
2000-12-25 01:29:27 -05:00
|
|
|
if (FIXNUM_P(a) && FIXNUM_P(b)) {
|
|
|
|
return a != b;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
2000-12-25 01:29:27 -05:00
|
|
|
if (TYPE(a) == T_STRING && RBASIC(a)->klass == rb_cString &&
|
|
|
|
TYPE(b) == T_STRING && RBASIC(b)->klass == rb_cString) {
|
|
|
|
return rb_str_cmp(a, b);
|
|
|
|
}
|
2003-03-04 02:04:11 -05:00
|
|
|
if (a == Qundef || b == Qundef) return -1;
|
2000-12-25 01:29:27 -05:00
|
|
|
if (SYMBOL_P(a) && SYMBOL_P(b)) {
|
|
|
|
return a != b;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1999-11-10 23:08:26 -05:00
|
|
|
args[0] = a;
|
|
|
|
args[1] = b;
|
|
|
|
return !rb_with_disable_interrupt(eql, (VALUE)args);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_any_hash(a)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE a;
|
|
|
|
{
|
2001-02-13 00:09:11 -05:00
|
|
|
VALUE hval;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
switch (TYPE(a)) {
|
|
|
|
case T_FIXNUM:
|
2000-12-25 01:29:27 -05:00
|
|
|
case T_SYMBOL:
|
2001-02-13 00:09:11 -05:00
|
|
|
return (int)a;
|
1998-01-16 07:13:05 -05:00
|
|
|
break;
|
|
|
|
|
|
|
|
case T_STRING:
|
2001-02-13 00:09:11 -05:00
|
|
|
return rb_str_hash(a);
|
1998-01-16 07:13:05 -05:00
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2001-12-10 02:18:16 -05:00
|
|
|
hval = rb_funcall(a, id_hash, 0);
|
2003-01-20 03:29:24 -05:00
|
|
|
if (!FIXNUM_P(hval)) {
|
2002-03-08 02:03:09 -05:00
|
|
|
hval = rb_funcall(hval, '%', 1, INT2FIX(536870923));
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
2001-02-13 00:09:11 -05:00
|
|
|
return (int)FIX2LONG(hval);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct st_hash_type objhash = {
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_any_cmp,
|
|
|
|
rb_any_hash,
|
1998-01-16 07:13:05 -05:00
|
|
|
};
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
struct rb_hash_foreach_arg {
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
enum st_retval (*func)();
|
2002-12-29 09:51:22 -05:00
|
|
|
VALUE arg;
|
1998-01-16 07:13:05 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach_iter(key, value, arg)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE key, value;
|
1999-01-19 23:59:39 -05:00
|
|
|
struct rb_hash_foreach_arg *arg;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
int status;
|
1999-01-19 23:59:39 -05:00
|
|
|
st_table *tbl = RHASH(arg->hash)->tbl;
|
|
|
|
struct st_table_entry **bins = tbl->bins;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
status = (*arg->func)(key, value, arg->arg);
|
1999-01-19 23:59:39 -05:00
|
|
|
if (RHASH(arg->hash)->tbl != tbl || RHASH(arg->hash)->tbl->bins != bins){
|
|
|
|
rb_raise(rb_eIndexError, "rehash occurred during iteration");
|
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
return status;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach_call(arg)
|
|
|
|
struct rb_hash_foreach_arg *arg;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(arg->hash)->tbl, rb_hash_foreach_iter, (st_data_t)arg);
|
1998-01-16 07:13:05 -05:00
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_foreach_ensure(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
RHASH(hash)->iter_lev--;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
if (RHASH(hash)->iter_lev == 0) {
|
1999-01-19 23:59:39 -05:00
|
|
|
if (FL_TEST(hash, HASH_DELETED)) {
|
2000-01-04 23:41:21 -05:00
|
|
|
st_cleanup_safe(RHASH(hash)->tbl, Qundef);
|
1999-01-19 23:59:39 -05:00
|
|
|
FL_UNSET(hash, HASH_DELETED);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
return 0;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach(hash, func, farg)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
enum st_retval (*func)();
|
2002-12-29 09:51:22 -05:00
|
|
|
VALUE farg;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
struct rb_hash_foreach_arg arg;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
RHASH(hash)->iter_lev++;
|
1998-01-16 07:13:05 -05:00
|
|
|
arg.hash = hash;
|
|
|
|
arg.func = func;
|
|
|
|
arg.arg = farg;
|
1999-01-19 23:59:39 -05:00
|
|
|
return rb_ensure(rb_hash_foreach_call, (VALUE)&arg, rb_hash_foreach_ensure, hash);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
* array.c (ary_alloc), dir.c (dir_s_alloc), eval.c (thgroup_s_alloc),
file.c (rb_stat_s_alloc), hash.c (hash_alloc), io.c (io_alloc),
object.c (rb_module_s_alloc, rb_class_allocate_instance),
re.c (match_alloc, rb_reg_s_alloc), string.c (str_alloc),
time.c (time_s_alloc), ext/digest/digest.c (rb_digest_base_alloc),
ext/tcltklib/tcltklib.c (ip_alloc),
ext/win32ole/win32ole.c (fole_s_allocate, fev_s_allocate)
: add prototype to get rid of VC++ warnings.
* ext/sdbm/init.c (fsdbm_alloc): allocator takes only one argument.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3197 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2002-12-21 13:02:01 -05:00
|
|
|
static VALUE hash_alloc _((VALUE));
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
2002-12-20 03:33:17 -05:00
|
|
|
hash_alloc(klass)
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE klass;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
NEWOBJ(hash, struct RHash);
|
1999-01-19 23:59:39 -05:00
|
|
|
OBJSETUP(hash, klass, T_HASH);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
hash->ifnone = Qnil;
|
1999-08-13 01:45:20 -04:00
|
|
|
hash->tbl = st_init_table(&objhash);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return (VALUE)hash;
|
|
|
|
}
|
|
|
|
|
2000-02-29 03:05:32 -05:00
|
|
|
VALUE
|
|
|
|
rb_hash_new()
|
|
|
|
{
|
2002-12-20 03:33:17 -05:00
|
|
|
return hash_alloc(rb_cHash);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2000-02-29 03:05:32 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_initialize(argc, argv, hash)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
2000-02-29 03:05:32 -05:00
|
|
|
VALUE ifnone;
|
|
|
|
|
|
|
|
rb_hash_modify(hash);
|
2001-12-10 02:18:16 -05:00
|
|
|
if (rb_block_given_p()) {
|
2002-01-28 03:44:45 -05:00
|
|
|
if (argc > 0) {
|
|
|
|
rb_raise(rb_eArgError, "wrong number of arguments");
|
2001-12-10 02:18:16 -05:00
|
|
|
}
|
2003-06-16 03:14:50 -04:00
|
|
|
RHASH(hash)->ifnone = rb_block_proc();
|
2001-12-10 02:18:16 -05:00
|
|
|
FL_SET(hash, HASH_PROC_DEFAULT);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
rb_scan_args(argc, argv, "01", &ifnone);
|
|
|
|
RHASH(hash)->ifnone = ifnone;
|
|
|
|
}
|
2000-02-29 03:05:32 -05:00
|
|
|
|
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_s_create(argc, argv, klass)
|
1998-01-16 07:13:05 -05:00
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE klass;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
int i;
|
|
|
|
|
2000-03-15 04:09:28 -05:00
|
|
|
if (argc == 1 && TYPE(argv[0]) == T_HASH) {
|
2002-12-20 03:33:17 -05:00
|
|
|
hash = hash_alloc(klass);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-10-03 03:19:19 -04:00
|
|
|
RHASH(hash)->ifnone = Qnil;
|
|
|
|
RHASH(hash)->tbl = st_copy(RHASH(argv[0])->tbl);
|
1999-08-13 01:45:20 -04:00
|
|
|
|
2001-10-03 03:19:19 -04:00
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
if (argc % 2 != 0) {
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_raise(rb_eArgError, "odd number args for Hash");
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2002-12-20 03:33:17 -05:00
|
|
|
hash = hash_alloc(klass);
|
1998-01-16 07:13:05 -05:00
|
|
|
for (i=0; i<argc; i+=2) {
|
2002-06-12 23:55:44 -04:00
|
|
|
rb_hash_aset(hash, argv[i], argv[i + 1]);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
2002-08-27 04:31:08 -04:00
|
|
|
to_hash(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
2002-08-27 04:31:08 -04:00
|
|
|
return rb_convert_type(hash, T_HASH, "Hash", "to_hash");
|
1998-01-16 07:19:22 -05:00
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_rehash_i(key, value, tbl)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE key, value;
|
|
|
|
st_table *tbl;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key != Qundef) st_insert(tbl, key, value);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_rehash(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
st_table *tbl;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2002-08-12 03:39:12 -04:00
|
|
|
rb_hash_modify(hash);
|
1998-01-16 07:19:22 -05:00
|
|
|
tbl = st_init_table_with_size(&objhash, RHASH(hash)->tbl->num_entries);
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, rb_hash_rehash_i, (st_data_t)tbl);
|
1998-01-16 07:19:22 -05:00
|
|
|
st_free_table(RHASH(hash)->tbl);
|
|
|
|
RHASH(hash)->tbl = tbl;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_aref(hash, key)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash, key;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE val;
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
if (!st_lookup(RHASH(hash)->tbl, key, &val)) {
|
2001-12-10 02:18:16 -05:00
|
|
|
return rb_funcall(hash, id_default, 1, key);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_fetch(argc, argv, hash)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
VALUE key, if_none;
|
|
|
|
VALUE val;
|
|
|
|
|
|
|
|
rb_scan_args(argc, argv, "11", &key, &if_none);
|
|
|
|
|
|
|
|
if (!st_lookup(RHASH(hash)->tbl, key, &val)) {
|
2000-05-24 00:34:26 -04:00
|
|
|
if (rb_block_given_p()) {
|
1999-01-19 23:59:39 -05:00
|
|
|
if (argc > 1) {
|
2002-06-12 23:55:44 -04:00
|
|
|
rb_raise(rb_eArgError, "wrong number of arguments");
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
2000-04-12 01:06:23 -04:00
|
|
|
return rb_yield(key);
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1999-10-13 02:44:42 -04:00
|
|
|
if (argc == 1) {
|
|
|
|
rb_raise(rb_eIndexError, "key not found");
|
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
return if_none;
|
|
|
|
}
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
2001-12-10 02:18:16 -05:00
|
|
|
rb_hash_default(argc, argv, hash)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE hash;
|
|
|
|
{
|
2001-12-10 02:18:16 -05:00
|
|
|
VALUE key;
|
|
|
|
|
|
|
|
rb_scan_args(argc, argv, "01", &key);
|
|
|
|
if (FL_TEST(hash, HASH_PROC_DEFAULT)) {
|
2003-05-26 04:22:33 -04:00
|
|
|
return rb_funcall(RHASH(hash)->ifnone, id_call, 2, hash, key);
|
2001-12-10 02:18:16 -05:00
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
return RHASH(hash)->ifnone;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
rb_hash_set_default(hash, ifnone)
|
|
|
|
VALUE hash, ifnone;
|
|
|
|
{
|
2000-12-18 04:46:21 -05:00
|
|
|
rb_hash_modify(hash);
|
1999-01-19 23:59:39 -05:00
|
|
|
RHASH(hash)->ifnone = ifnone;
|
2001-12-10 02:18:16 -05:00
|
|
|
FL_UNSET(hash, HASH_PROC_DEFAULT);
|
2002-01-11 04:18:54 -05:00
|
|
|
return ifnone;
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
|
2002-08-13 05:21:18 -04:00
|
|
|
static VALUE
|
|
|
|
rb_hash_default_proc(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
if (FL_TEST(hash, HASH_PROC_DEFAULT)) {
|
|
|
|
return RHASH(hash)->ifnone;
|
|
|
|
}
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
static int
|
|
|
|
index_i(key, value, args)
|
|
|
|
VALUE key, value;
|
|
|
|
VALUE *args;
|
|
|
|
{
|
|
|
|
if (rb_equal(value, args[0])) {
|
|
|
|
args[1] = key;
|
|
|
|
return ST_STOP;
|
|
|
|
}
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
rb_hash_index(hash, value)
|
|
|
|
VALUE hash, value;
|
|
|
|
{
|
|
|
|
VALUE args[2];
|
|
|
|
|
|
|
|
args[0] = value;
|
2001-07-31 02:24:45 -04:00
|
|
|
args[1] = Qnil;
|
1999-08-13 01:45:20 -04:00
|
|
|
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, index_i, (st_data_t)args);
|
1999-08-13 01:45:20 -04:00
|
|
|
|
|
|
|
return args[1];
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_indexes(argc, argv, hash)
|
1998-01-16 07:13:05 -05:00
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE indexes;
|
1998-01-16 07:13:05 -05:00
|
|
|
int i;
|
|
|
|
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_warn("Hash#%s is deprecated; use Hash#values_at",
|
2001-12-10 22:48:08 -05:00
|
|
|
rb_id2name(rb_frame_last_func()));
|
1999-01-19 23:59:39 -05:00
|
|
|
indexes = rb_ary_new2(argc);
|
1998-01-16 07:13:05 -05:00
|
|
|
for (i=0; i<argc; i++) {
|
1999-01-19 23:59:39 -05:00
|
|
|
RARRAY(indexes)->ptr[i] = rb_hash_aref(hash, argv[i]);
|
2001-01-15 02:01:00 -05:00
|
|
|
RARRAY(indexes)->len++;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
1998-01-16 07:19:22 -05:00
|
|
|
return indexes;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2001-07-24 05:07:33 -04:00
|
|
|
VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_delete(hash, key)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash, key;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE val;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash);
|
2000-03-23 03:37:35 -05:00
|
|
|
if (RHASH(hash)->iter_lev > 0) {
|
|
|
|
if (st_delete_safe(RHASH(hash)->tbl, &key, &val, Qundef)) {
|
|
|
|
FL_SET(hash, HASH_DELETED);
|
|
|
|
return val;
|
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1998-01-16 07:19:22 -05:00
|
|
|
else if (st_delete(RHASH(hash)->tbl, &key, &val))
|
1998-01-16 07:13:05 -05:00
|
|
|
return val;
|
2000-05-24 00:34:26 -04:00
|
|
|
if (rb_block_given_p()) {
|
1999-01-19 23:59:39 -05:00
|
|
|
return rb_yield(key);
|
|
|
|
}
|
2001-12-10 02:18:16 -05:00
|
|
|
return Qnil;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
struct shift_var {
|
|
|
|
int stop;
|
|
|
|
VALUE key;
|
|
|
|
VALUE val;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
shift_i(key, value, var)
|
|
|
|
VALUE key, value;
|
|
|
|
struct shift_var *var;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
if (var->stop) return ST_STOP;
|
|
|
|
var->stop = 1;
|
|
|
|
var->key = key;
|
|
|
|
var->val = value;
|
|
|
|
return ST_DELETE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_shift(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
struct shift_var var;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash);
|
1998-01-16 07:13:05 -05:00
|
|
|
var.stop = 0;
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, shift_i, (st_data_t)&var);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2002-08-13 05:21:18 -04:00
|
|
|
if (var.stop) {
|
|
|
|
return rb_assoc_new(var.key, var.val);
|
|
|
|
}
|
|
|
|
else if (FL_TEST(hash, HASH_PROC_DEFAULT)) {
|
2003-05-26 04:22:33 -04:00
|
|
|
return rb_funcall(RHASH(hash)->ifnone, id_call, 2, hash, Qnil);
|
2002-08-13 05:21:18 -04:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
return RHASH(hash)->ifnone;
|
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2002-12-29 09:51:22 -05:00
|
|
|
static enum st_retval
|
1998-01-16 07:13:05 -05:00
|
|
|
delete_if_i(key, value)
|
|
|
|
VALUE key, value;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
2003-05-20 02:29:23 -04:00
|
|
|
if (RTEST(rb_yield_values(2, key, value)))
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_DELETE;
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
2000-07-04 03:04:42 -04:00
|
|
|
VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_delete_if(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash);
|
|
|
|
rb_hash_foreach(hash, delete_if_i, 0);
|
2000-08-07 01:05:04 -04:00
|
|
|
return hash;
|
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2000-08-07 01:05:04 -04:00
|
|
|
VALUE
|
|
|
|
rb_hash_reject_bang(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
int n = RHASH(hash)->tbl->num_entries;
|
|
|
|
rb_hash_delete_if(hash);
|
|
|
|
if (n == RHASH(hash)->tbl->num_entries) return Qnil;
|
1999-01-19 23:59:39 -05:00
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2000-02-08 03:54:01 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_reject(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
2000-07-17 05:38:10 -04:00
|
|
|
return rb_hash_delete_if(rb_obj_dup(hash));
|
2000-02-08 03:54:01 -05:00
|
|
|
}
|
|
|
|
|
2002-12-29 09:51:22 -05:00
|
|
|
static enum st_retval
|
2001-12-10 22:48:08 -05:00
|
|
|
select_i(key, value, result)
|
2002-12-29 09:51:22 -05:00
|
|
|
VALUE key, value, result;
|
2001-12-10 22:48:08 -05:00
|
|
|
{
|
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
2003-05-20 02:29:23 -04:00
|
|
|
if (RTEST(rb_yield_values(2, key, value)))
|
|
|
|
rb_ary_push(result, rb_assoc_new(key, value));
|
2001-12-10 22:48:08 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_hash_values_at(argc, argv, hash)
|
2001-12-10 22:48:08 -05:00
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
VALUE result = rb_ary_new();
|
|
|
|
long i;
|
|
|
|
|
2003-05-04 12:03:24 -04:00
|
|
|
for (i=0; i<argc; i++) {
|
|
|
|
rb_ary_push(result, rb_hash_aref(hash, argv[i]));
|
2001-12-10 22:48:08 -05:00
|
|
|
}
|
2003-05-04 12:03:24 -04:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
|
|
|
rb_hash_select(argc, argv, hash)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
VALUE result;
|
|
|
|
long i;
|
|
|
|
|
|
|
|
if (!rb_block_given_p()) {
|
2003-05-06 02:51:31 -04:00
|
|
|
#if RUBY_VERSION_CODE < 181
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_warn("Hash#select(key..) is deprecated; use Hash#values_at");
|
2003-05-06 02:51:31 -04:00
|
|
|
#endif
|
2003-05-04 12:03:24 -04:00
|
|
|
return rb_hash_values_at(argc, argv, hash);
|
2001-12-10 22:48:08 -05:00
|
|
|
}
|
2003-05-04 12:03:24 -04:00
|
|
|
if (argc > 0) {
|
|
|
|
rb_raise(rb_eArgError, "wrong number arguments(%d for 0)", argc);
|
|
|
|
}
|
2003-05-06 02:51:31 -04:00
|
|
|
result = rb_ary_new();
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_hash_foreach(hash, select_i, result);
|
2001-12-10 22:48:08 -05:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static int
|
1999-08-13 01:45:20 -04:00
|
|
|
clear_i(key, value, dummy)
|
|
|
|
VALUE key, value, dummy;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
return ST_DELETE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_clear(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash);
|
1999-08-13 01:45:20 -04:00
|
|
|
st_foreach(RHASH(hash)->tbl, clear_i, 0);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_aset(hash, key, val)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash, key, val;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_modify(hash);
|
|
|
|
if (TYPE(key) != T_STRING || st_lookup(RHASH(hash)->tbl, key, 0)) {
|
|
|
|
st_insert(RHASH(hash)->tbl, key, val);
|
|
|
|
}
|
|
|
|
else {
|
1999-08-13 01:45:20 -04:00
|
|
|
st_add_direct(RHASH(hash)->tbl, rb_str_new4(key), val);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static int
|
|
|
|
replace_i(key, val, hash)
|
|
|
|
VALUE key, val, hash;
|
|
|
|
{
|
2001-06-01 05:38:30 -04:00
|
|
|
if (key != Qundef) {
|
|
|
|
rb_hash_aset(hash, key, val);
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
2002-12-10 01:23:44 -05:00
|
|
|
rb_hash_replace(hash, hash2)
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE hash, hash2;
|
|
|
|
{
|
|
|
|
hash2 = to_hash(hash2);
|
2002-09-28 00:21:31 -04:00
|
|
|
if (hash == hash2) return hash;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_clear(hash);
|
|
|
|
st_foreach(RHASH(hash2)->tbl, replace_i, hash);
|
2002-08-13 05:21:18 -04:00
|
|
|
RHASH(hash)->ifnone = RHASH(hash2)->ifnone;
|
|
|
|
if (FL_TEST(hash2, HASH_PROC_DEFAULT)) {
|
|
|
|
FL_SET(hash, HASH_PROC_DEFAULT);
|
|
|
|
}
|
2002-08-19 01:56:09 -04:00
|
|
|
else {
|
|
|
|
FL_UNSET(hash, HASH_PROC_DEFAULT);
|
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
|
|
|
|
return hash;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-12-07 04:25:55 -05:00
|
|
|
rb_hash_size(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
return INT2FIX(RHASH(hash)->tbl->num_entries);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_empty_p(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
if (RHASH(hash)->tbl->num_entries == 0)
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qtrue;
|
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2002-12-29 09:51:22 -05:00
|
|
|
static enum st_retval
|
1998-01-16 07:13:05 -05:00
|
|
|
each_value_i(key, value)
|
|
|
|
VALUE key, value;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_yield(value);
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_each_value(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach(hash, each_value_i, 0);
|
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2002-12-29 09:51:22 -05:00
|
|
|
static enum st_retval
|
1998-01-16 07:13:05 -05:00
|
|
|
each_key_i(key, value)
|
|
|
|
VALUE key, value;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_yield(key);
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_each_key(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach(hash, each_key_i, 0);
|
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2002-12-29 09:51:22 -05:00
|
|
|
static enum st_retval
|
1998-01-16 07:13:05 -05:00
|
|
|
each_pair_i(key, value)
|
|
|
|
VALUE key, value;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
2003-05-20 02:29:23 -04:00
|
|
|
rb_yield_values(2, key, value);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_each_pair(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_foreach(hash, each_pair_i, 0);
|
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
to_a_i(key, value, ary)
|
|
|
|
VALUE key, value, ary;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_ary_push(ary, rb_assoc_new(key, value));
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_to_a(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE ary;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
ary = rb_ary_new();
|
1998-01-16 07:19:22 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, to_a_i, ary);
|
2000-01-04 23:41:21 -05:00
|
|
|
if (OBJ_TAINTED(hash)) OBJ_TAINT(ary);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_sort(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
2000-09-04 04:24:09 -04:00
|
|
|
VALUE entries = rb_hash_to_a(hash);
|
|
|
|
rb_ary_sort_bang(entries);
|
|
|
|
return entries;
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static int
|
|
|
|
inspect_i(key, value, str)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE key, value, str;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE str2;
|
|
|
|
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:19:22 -05:00
|
|
|
if (RSTRING(str)->len > 1) {
|
2000-04-10 01:48:43 -04:00
|
|
|
rb_str_cat2(str, ", ");
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
str2 = rb_inspect(key);
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_append(str, str2);
|
2000-02-23 00:23:12 -05:00
|
|
|
OBJ_INFECT(str, str2);
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_cat2(str, "=>");
|
1998-01-16 07:13:05 -05:00
|
|
|
str2 = rb_inspect(value);
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_append(str, str2);
|
2000-02-23 00:23:12 -05:00
|
|
|
OBJ_INFECT(str, str2);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
inspect_hash(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE str;
|
|
|
|
|
2001-05-30 05:12:34 -04:00
|
|
|
str = rb_str_buf_new2("{");
|
1998-01-16 07:19:22 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, inspect_i, str);
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_cat2(str, "}");
|
2000-02-23 00:23:12 -05:00
|
|
|
OBJ_INFECT(str, hash);
|
2001-05-30 05:12:34 -04:00
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_inspect(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
2001-06-22 05:12:24 -04:00
|
|
|
if (RHASH(hash)->tbl == 0 || RHASH(hash)->tbl->num_entries == 0)
|
|
|
|
return rb_str_new2("{}");
|
1999-01-19 23:59:39 -05:00
|
|
|
if (rb_inspecting_p(hash)) return rb_str_new2("{...}");
|
|
|
|
return rb_protect_inspect(inspect_hash, hash, 0);
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
2000-01-04 23:41:21 -05:00
|
|
|
to_s_hash(hash)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE hash;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
return rb_ary_to_s(rb_hash_to_a(hash));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
rb_hash_to_s(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
if (rb_inspecting_p(hash)) return rb_str_new2("{...}");
|
2000-01-04 23:41:21 -05:00
|
|
|
return rb_protect_inspect(to_s_hash, hash, 0);
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
rb_hash_to_hash(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
return hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
keys_i(key, value, ary)
|
|
|
|
VALUE key, value, ary;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_ary_push(ary, key);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_keys(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE ary;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
ary = rb_ary_new();
|
1998-01-16 07:19:22 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, keys_i, ary);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
values_i(key, value, ary)
|
|
|
|
VALUE key, value, ary;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_ary_push(ary, value);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_values(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
VALUE ary;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
ary = rb_ary_new();
|
1998-01-16 07:19:22 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, values_i, ary);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_has_key(hash, key)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE key;
|
|
|
|
{
|
1998-01-16 07:19:22 -05:00
|
|
|
if (st_lookup(RHASH(hash)->tbl, key, 0)) {
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qtrue;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_search_value(key, value, data)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE key, value, *data;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
if (rb_equal(value, data[1])) {
|
1999-01-19 23:59:39 -05:00
|
|
|
data[0] = Qtrue;
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_STOP;
|
|
|
|
}
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_has_value(hash, val)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE val;
|
|
|
|
{
|
|
|
|
VALUE data[2];
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
data[0] = Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
data[1] = val;
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, rb_hash_search_value, (st_data_t)data);
|
1998-01-16 07:13:05 -05:00
|
|
|
return data[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
struct equal_data {
|
|
|
|
int result;
|
|
|
|
st_table *tbl;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
|
|
|
equal_i(key, val1, data)
|
|
|
|
VALUE key, val1;
|
|
|
|
struct equal_data *data;
|
|
|
|
{
|
|
|
|
VALUE val2;
|
|
|
|
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1998-01-16 07:13:05 -05:00
|
|
|
if (!st_lookup(data->tbl, key, &val2)) {
|
1999-01-19 23:59:39 -05:00
|
|
|
data->result = Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_STOP;
|
|
|
|
}
|
|
|
|
if (!rb_equal(val1, val2)) {
|
1999-01-19 23:59:39 -05:00
|
|
|
data->result = Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_STOP;
|
|
|
|
}
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_equal(hash1, hash2)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash1, hash2;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
|
|
|
struct equal_data data;
|
|
|
|
|
2001-08-23 02:02:15 -04:00
|
|
|
if (hash1 == hash2) return Qtrue;
|
2003-02-04 02:27:43 -05:00
|
|
|
if (TYPE(hash2) != T_HASH) {
|
|
|
|
if (!rb_respond_to(hash2, rb_intern("to_hash"))) {
|
|
|
|
return Qfalse;
|
|
|
|
}
|
|
|
|
return rb_equal(hash2, hash1);
|
|
|
|
}
|
1998-01-16 07:19:22 -05:00
|
|
|
if (RHASH(hash1)->tbl->num_entries != RHASH(hash2)->tbl->num_entries)
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qfalse;
|
2002-08-13 05:21:18 -04:00
|
|
|
if (!(rb_equal(RHASH(hash1)->ifnone, RHASH(hash2)->ifnone) &&
|
|
|
|
FL_TEST(hash1, HASH_PROC_DEFAULT) == FL_TEST(hash2, HASH_PROC_DEFAULT)))
|
2002-08-12 03:39:12 -04:00
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
data.tbl = RHASH(hash2)->tbl;
|
1999-01-19 23:59:39 -05:00
|
|
|
data.result = Qtrue;
|
* st.h, st.c: Introduce new conventional typedef's, st_data_t,
st_compare_func_t, st_hash_func_t and st_each_func_t.
* st.h, st.c: Do explicit function declarations and do not rely on
implicit declarations. On such platforms as IA64, int argument
values are NOT automatically promoted to long (64bit) values, so
explicit declarations are mandatory for those functions that
take long values or pointers. This fixes miniruby's coredump on
FreeBSD/IA64.
* class.c, eval.c, gc.c, hash.c, marshal.c, parse.y, variable.c:
Add proper casts to avoid warnings.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3303 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2003-01-06 10:55:43 -05:00
|
|
|
st_foreach(RHASH(hash1)->tbl, equal_i, (st_data_t)&data);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
return data.result;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_invert_i(key, value, hash)
|
1998-01-16 07:13:05 -05:00
|
|
|
VALUE key, value;
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_aset(hash, value, key);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_invert(hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE h = rb_hash_new();
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
st_foreach(RHASH(hash)->tbl, rb_hash_invert_i, h);
|
1998-01-16 07:13:05 -05:00
|
|
|
return h;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
static int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_update_i(key, value, hash)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE key, value;
|
|
|
|
VALUE hash;
|
|
|
|
{
|
2000-01-04 23:41:21 -05:00
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_aset(hash, key, value);
|
1998-01-16 07:19:22 -05:00
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
2002-01-25 03:22:11 -05:00
|
|
|
static int
|
|
|
|
rb_hash_update_block_i(key, value, hash)
|
|
|
|
VALUE key, value;
|
|
|
|
VALUE hash;
|
|
|
|
{
|
|
|
|
if (key == Qundef) return ST_CONTINUE;
|
|
|
|
if (rb_hash_has_key(hash, key)) {
|
2003-05-20 02:29:23 -04:00
|
|
|
value = rb_yield_values(3, key, rb_hash_aref(hash, key), value);
|
2002-01-25 03:22:11 -05:00
|
|
|
}
|
|
|
|
rb_hash_aset(hash, key, value);
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_hash_update(hash1, hash2)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE hash1, hash2;
|
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
hash2 = to_hash(hash2);
|
2002-01-25 03:22:11 -05:00
|
|
|
if (rb_block_given_p()) {
|
|
|
|
st_foreach(RHASH(hash2)->tbl, rb_hash_update_block_i, hash1);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
st_foreach(RHASH(hash2)->tbl, rb_hash_update_i, hash1);
|
|
|
|
}
|
1998-01-16 07:19:22 -05:00
|
|
|
return hash1;
|
|
|
|
}
|
|
|
|
|
2003-02-03 00:34:16 -05:00
|
|
|
static VALUE
|
|
|
|
rb_hash_merge(hash1, hash2)
|
|
|
|
VALUE hash1, hash2;
|
|
|
|
{
|
|
|
|
return rb_hash_update(rb_obj_dup(hash1), hash2);
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
static int path_tainted = -1;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
static char **origenviron;
|
* configure.in, defines.h, dir.c, dir.h, dln.c, error.c,
eval.c, file.c, hash.c, io.c, main.c, missing.c,
process.c, ruby.c, rubysig.h, signal.c, st.c, util.c, util.h,
bcc/Makefile.sub, win32/Makefile.sub, win32/win32.h,
ext/Win32API/Win32API.c, ext/socket/getaddrinfo.c,
ext/socket/getnameinfo.c, ext/socket/socket.c,
ext/tcltklib/stubs.c
: replace "NT" with "_WIN32", add DOSISH_DRIVE_LETTER
* wince/exe.mak : delete \r at the end of lines.
* wince/mswince-ruby17.def : delete rb_obj_become
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@3148 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
2002-12-14 22:18:08 -05:00
|
|
|
#ifdef _WIN32
|
2002-05-29 06:22:19 -04:00
|
|
|
#define GET_ENVIRON(e) (e = rb_w32_get_environ())
|
|
|
|
#define FREE_ENVIRON(e) rb_w32_free_environ(e)
|
2001-11-12 22:59:20 -05:00
|
|
|
static char **my_environ;
|
|
|
|
#undef environ
|
|
|
|
#define environ my_environ
|
2002-10-17 12:13:44 -04:00
|
|
|
#elif defined(__APPLE__)
|
|
|
|
#undef environ
|
|
|
|
#define environ (*_NSGetEnviron())
|
|
|
|
#define GET_ENVIRON(e) (e)
|
|
|
|
#define FREE_ENVIRON(e)
|
2001-11-12 22:59:20 -05:00
|
|
|
#else
|
1998-01-16 07:13:05 -05:00
|
|
|
extern char **environ;
|
2001-11-12 22:59:20 -05:00
|
|
|
#define GET_ENVIRON(e) (e)
|
|
|
|
#define FREE_ENVIRON(e)
|
1998-01-16 07:13:05 -05:00
|
|
|
#endif
|
|
|
|
|
2003-06-06 05:24:59 -04:00
|
|
|
static VALUE
|
|
|
|
env_str_new(ptr, len)
|
|
|
|
const char *ptr;
|
|
|
|
long len;
|
|
|
|
{
|
|
|
|
VALUE str = rb_tainted_str_new(ptr, len);
|
|
|
|
|
|
|
|
rb_obj_freeze(str);
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_str_new2(ptr)
|
|
|
|
const char *ptr;
|
|
|
|
{
|
2003-06-23 02:52:39 -04:00
|
|
|
if (!ptr) return Qnil;
|
2003-06-06 05:24:59 -04:00
|
|
|
return env_str_new(ptr, strlen(ptr));
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
|
|
|
env_delete(obj, name)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE obj, name;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-08-13 01:45:20 -04:00
|
|
|
char *nam, *val;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
rb_secure(4);
|
2002-08-27 04:31:08 -04:00
|
|
|
SafeStringValue(name);
|
2001-05-02 00:22:21 -04:00
|
|
|
nam = RSTRING(name)->ptr;
|
|
|
|
if (strlen(nam) != RSTRING(name)->len) {
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_raise(rb_eArgError, "bad environment variable name");
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
1999-08-13 01:45:20 -04:00
|
|
|
val = getenv(nam);
|
1998-01-16 07:13:05 -05:00
|
|
|
if (val) {
|
2003-06-06 05:24:59 -04:00
|
|
|
VALUE value = env_str_new2(val);
|
2000-01-04 23:41:21 -05:00
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
ruby_setenv(nam, 0);
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strcasecmp(nam, PATH_ENV) == 0) {
|
2002-06-10 21:27:48 -04:00
|
|
|
#else
|
2003-06-20 02:22:50 -04:00
|
|
|
if (strcmp(nam, PATH_ENV) == 0) {
|
2002-06-10 21:27:48 -04:00
|
|
|
#endif
|
1999-08-13 01:45:20 -04:00
|
|
|
path_tainted = 0;
|
|
|
|
}
|
2000-01-04 23:41:21 -05:00
|
|
|
return value;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:19:22 -05:00
|
|
|
static VALUE
|
2000-01-04 23:41:21 -05:00
|
|
|
env_delete_m(obj, name)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE obj, name;
|
|
|
|
{
|
2003-03-30 21:06:23 -05:00
|
|
|
VALUE val;
|
|
|
|
|
|
|
|
val = env_delete(obj, name);
|
|
|
|
if (NIL_P(val) && rb_block_given_p()) rb_yield(name);
|
1998-01-16 07:19:22 -05:00
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_f_getenv(obj, name)
|
1998-01-16 07:19:22 -05:00
|
|
|
VALUE obj, name;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char *nam, *env;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-05-02 00:22:21 -04:00
|
|
|
StringValue(name);
|
|
|
|
nam = RSTRING(name)->ptr;
|
|
|
|
if (strlen(nam) != RSTRING(name)->len) {
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_raise(rb_eArgError, "bad environment variable name");
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
env = getenv(nam);
|
1998-01-16 07:13:05 -05:00
|
|
|
if (env) {
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strcasecmp(nam, PATH_ENV) == 0 && !rb_env_path_tainted())
|
2002-06-10 21:27:48 -04:00
|
|
|
#else
|
2003-06-20 02:22:50 -04:00
|
|
|
if (strcmp(nam, PATH_ENV) == 0 && !rb_env_path_tainted())
|
2002-06-10 21:27:48 -04:00
|
|
|
#endif
|
2003-06-06 05:24:59 -04:00
|
|
|
{
|
|
|
|
VALUE str = rb_str_new2(env);
|
|
|
|
|
|
|
|
rb_obj_freeze(str);
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
return env_str_new2(env);
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
2000-04-12 01:06:23 -04:00
|
|
|
static VALUE
|
|
|
|
env_fetch(argc, argv)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
{
|
|
|
|
VALUE key, if_none;
|
|
|
|
char *nam, *env;
|
|
|
|
|
|
|
|
rb_scan_args(argc, argv, "11", &key, &if_none);
|
2001-05-02 00:22:21 -04:00
|
|
|
StringValue(key);
|
|
|
|
nam = RSTRING(key)->ptr;
|
|
|
|
if (strlen(nam) != RSTRING(key)->len) {
|
2000-04-12 01:06:23 -04:00
|
|
|
rb_raise(rb_eArgError, "bad environment variable name");
|
|
|
|
}
|
|
|
|
env = getenv(nam);
|
|
|
|
if (!env) {
|
2000-05-24 00:34:26 -04:00
|
|
|
if (rb_block_given_p()) {
|
2000-04-12 01:06:23 -04:00
|
|
|
if (argc > 1) {
|
2002-01-25 03:22:11 -05:00
|
|
|
rb_raise(rb_eArgError, "wrong number of arguments");
|
2000-04-12 01:06:23 -04:00
|
|
|
}
|
|
|
|
return rb_yield(key);
|
|
|
|
}
|
|
|
|
if (argc == 1) {
|
|
|
|
rb_raise(rb_eIndexError, "key not found");
|
|
|
|
}
|
|
|
|
return if_none;
|
|
|
|
}
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strcasecmp(nam, PATH_ENV) == 0 && !rb_env_path_tainted())
|
2002-06-10 21:27:48 -04:00
|
|
|
#else
|
2003-06-20 02:22:50 -04:00
|
|
|
if (strcmp(nam, PATH_ENV) == 0 && !rb_env_path_tainted())
|
2002-06-10 21:27:48 -04:00
|
|
|
#endif
|
2000-04-12 01:06:23 -04:00
|
|
|
return rb_str_new2(env);
|
2003-06-06 05:24:59 -04:00
|
|
|
return env_str_new2(env);
|
2000-04-12 01:06:23 -04:00
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static void
|
|
|
|
path_tainted_p(path)
|
|
|
|
char *path;
|
|
|
|
{
|
|
|
|
path_tainted = rb_path_check(path)?0:1;
|
1998-01-16 07:19:22 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_env_path_tainted()
|
1998-01-16 07:19:22 -05:00
|
|
|
{
|
|
|
|
if (path_tainted < 0) {
|
2003-06-20 02:22:50 -04:00
|
|
|
path_tainted_p(getenv(PATH_ENV));
|
1998-01-16 07:19:22 -05:00
|
|
|
}
|
|
|
|
return path_tainted;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static int
|
|
|
|
envix(nam)
|
2003-01-16 02:38:40 -05:00
|
|
|
const char *nam;
|
1999-01-19 23:59:39 -05:00
|
|
|
{
|
|
|
|
register int i, len = strlen(nam);
|
2001-11-12 22:59:20 -05:00
|
|
|
char **env;
|
1999-01-19 23:59:39 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
|
|
|
for (i = 0; env[i]; i++) {
|
1999-01-19 23:59:39 -05:00
|
|
|
if (
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
strncasecmp(env[i],nam,len) == 0
|
1999-01-19 23:59:39 -05:00
|
|
|
#else
|
2001-11-12 22:59:20 -05:00
|
|
|
memcmp(env[i],nam,len) == 0
|
1999-01-19 23:59:39 -05:00
|
|
|
#endif
|
2001-11-12 22:59:20 -05:00
|
|
|
&& env[i][len] == '=')
|
1999-01-19 23:59:39 -05:00
|
|
|
break; /* memcmp must come first to avoid */
|
|
|
|
} /* potential SEGV's */
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
void
|
|
|
|
ruby_setenv(name, value)
|
|
|
|
const char *name;
|
|
|
|
const char *value;
|
1999-01-19 23:59:39 -05:00
|
|
|
{
|
2003-06-20 02:22:50 -04:00
|
|
|
#if defined(_WIN32)
|
1999-01-19 23:59:39 -05:00
|
|
|
/* The sane way to deal with the environment.
|
|
|
|
* Has these advantages over putenv() & co.:
|
|
|
|
* * enables us to store a truly empty value in the
|
|
|
|
* environment (like in UNIX).
|
|
|
|
* * we don't have to deal with RTL globals, bugs and leaks.
|
|
|
|
* * Much faster.
|
|
|
|
* Why you may want to enable USE_WIN32_RTL_ENV:
|
|
|
|
* * environ[] and RTL functions will not reflect changes,
|
|
|
|
* which might be an issue if extensions want to access
|
|
|
|
* the env. via RTL. This cuts both ways, since RTL will
|
|
|
|
* not see changes made by extensions that call the Win32
|
|
|
|
* functions directly, either.
|
|
|
|
* GSAR 97-06-07
|
2001-11-14 13:41:46 -05:00
|
|
|
*
|
|
|
|
* REMARK: USE_WIN32_RTL_ENV is already obsoleted since we don't use
|
|
|
|
* RTL's environ global variable directly yet.
|
1999-01-19 23:59:39 -05:00
|
|
|
*/
|
|
|
|
SetEnvironmentVariable(name,value);
|
1999-08-13 01:45:20 -04:00
|
|
|
#elif defined __CYGWIN__
|
|
|
|
#undef setenv
|
|
|
|
#undef unsetenv
|
|
|
|
if (value)
|
|
|
|
setenv(name,value,1);
|
|
|
|
else
|
|
|
|
unsetenv(name);
|
1999-01-19 23:59:39 -05:00
|
|
|
#else /* WIN32 */
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
int i=envix(name); /* where does it go? */
|
1999-01-19 23:59:39 -05:00
|
|
|
|
|
|
|
if (environ == origenviron) { /* need we copy environment? */
|
|
|
|
int j;
|
|
|
|
int max;
|
|
|
|
char **tmpenv;
|
|
|
|
|
|
|
|
for (max = i; environ[max]; max++) ;
|
|
|
|
tmpenv = ALLOC_N(char*, max+2);
|
|
|
|
for (j=0; j<max; j++) /* copy environment */
|
|
|
|
tmpenv[j] = strdup(environ[j]);
|
|
|
|
tmpenv[max] = 0;
|
|
|
|
environ = tmpenv; /* tell exec where it is now */
|
|
|
|
}
|
|
|
|
if (!value) {
|
2001-06-12 01:31:47 -04:00
|
|
|
if (environ != origenviron) {
|
|
|
|
char **envp = origenviron;
|
|
|
|
while (*envp && *envp != environ[i]) envp++;
|
|
|
|
if (!*envp)
|
|
|
|
free(environ[i]);
|
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
while (environ[i]) {
|
|
|
|
environ[i] = environ[i+1];
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (!environ[i]) { /* does not exist yet */
|
|
|
|
REALLOC_N(environ, char*, i+2); /* just expand it a bit */
|
|
|
|
environ[i+1] = 0; /* make sure it's null terminated */
|
|
|
|
}
|
|
|
|
else {
|
2000-09-12 01:37:38 -04:00
|
|
|
if (environ[i] != origenviron[i])
|
|
|
|
free(environ[i]);
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
environ[i] = ALLOC_N(char, strlen(name) + strlen(value) + 2);
|
|
|
|
#ifndef MSDOS
|
|
|
|
sprintf(environ[i],"%s=%s",name,value); /* all that work just for this */
|
|
|
|
#else
|
|
|
|
/* MS-DOS requires environment variable names to be in uppercase */
|
|
|
|
/* [Tom Dinger, 27 August 1990: Well, it doesn't _require_ it, but
|
|
|
|
* some utilities and applications may break because they only look
|
|
|
|
* for upper case strings. (Fixed strupr() bug here.)]
|
|
|
|
*/
|
|
|
|
strcpy(environ[i],name); strupr(environ[i]);
|
|
|
|
sprintf(environ[i] + strlen(name),"=%s", value);
|
|
|
|
#endif /* MSDOS */
|
|
|
|
|
|
|
|
#endif /* WIN32 */
|
|
|
|
}
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
void
|
|
|
|
ruby_unsetenv(name)
|
|
|
|
const char *name;
|
|
|
|
{
|
|
|
|
ruby_setenv(name, 0);
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
2001-10-29 00:07:26 -05:00
|
|
|
env_aset(obj, nm, val)
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE obj, nm, val;
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char *name, *value;
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
if (rb_safe_level() >= 4) {
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_raise(rb_eSecurityError, "cannot change environment variable");
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
if (NIL_P(val)) {
|
|
|
|
env_delete(obj, nm);
|
1998-01-16 07:13:05 -05:00
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
2001-05-02 00:22:21 -04:00
|
|
|
StringValue(nm);
|
|
|
|
StringValue(val);
|
|
|
|
name = RSTRING(nm)->ptr;
|
|
|
|
value = RSTRING(val)->ptr;
|
|
|
|
if (strlen(name) != RSTRING(nm)->len)
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_raise(rb_eArgError, "bad environment variable name");
|
2001-05-02 00:22:21 -04:00
|
|
|
if (strlen(value) != RSTRING(val)->len)
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_raise(rb_eArgError, "bad environment variable value");
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
ruby_setenv(name, value);
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strcasecmp(name, PATH_ENV) == 0) {
|
|
|
|
#else
|
|
|
|
if (strcmp(name, PATH_ENV) == 0) {
|
|
|
|
#endif
|
1999-01-19 23:59:39 -05:00
|
|
|
if (OBJ_TAINTED(val)) {
|
1998-01-16 07:19:22 -05:00
|
|
|
/* already tainted, no check */
|
|
|
|
path_tainted = 1;
|
2001-10-29 00:07:26 -05:00
|
|
|
return val;
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
path_tainted_p(value);
|
1998-01-16 07:19:22 -05:00
|
|
|
}
|
|
|
|
}
|
2001-10-29 00:07:26 -05:00
|
|
|
return val;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_keys()
|
|
|
|
{
|
|
|
|
char **env;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE ary = rb_ary_new();
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
1999-01-19 23:59:39 -05:00
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_ary_push(ary, env_str_new(*env, s-*env));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_each_key(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char **env;
|
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_yield(env_str_new(*env, s-*env));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qnil;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_values()
|
|
|
|
{
|
|
|
|
char **env;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE ary = rb_ary_new();
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
1999-01-19 23:59:39 -05:00
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_ary_push(ary, env_str_new2(s+1));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_each_value(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char **env;
|
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_yield(env_str_new2(s+1));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qnil;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_each(hash)
|
|
|
|
VALUE hash;
|
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char **env;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_yield_values(2, env_str_new(*env, s-*env),
|
|
|
|
env_str_new2(s+1));
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
env++;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qnil;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
2000-08-07 01:05:04 -04:00
|
|
|
env_reject_bang()
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
volatile VALUE keys;
|
|
|
|
VALUE *ptr;
|
2002-08-21 11:47:54 -04:00
|
|
|
long len;
|
|
|
|
int del = 0;
|
1999-01-19 23:59:39 -05:00
|
|
|
|
|
|
|
rb_secure(4);
|
|
|
|
keys = env_keys();
|
|
|
|
ptr = RARRAY(keys)->ptr;
|
|
|
|
len = RARRAY(keys)->len;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
while (len--) {
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE val = rb_f_getenv(Qnil, *ptr);
|
1998-01-16 07:13:05 -05:00
|
|
|
if (!NIL_P(val)) {
|
2003-05-20 02:29:23 -04:00
|
|
|
if (RTEST(rb_yield_values(2, *ptr, val))) {
|
2003-03-30 21:06:23 -05:00
|
|
|
FL_UNSET(*ptr, FL_TAINT);
|
1998-01-16 07:13:05 -05:00
|
|
|
env_delete(Qnil, *ptr);
|
2000-08-07 01:05:04 -04:00
|
|
|
del++;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
ptr++;
|
|
|
|
}
|
2000-08-07 01:05:04 -04:00
|
|
|
if (del == 0) return Qnil;
|
|
|
|
return envtbl;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_delete_if()
|
|
|
|
{
|
|
|
|
env_reject_bang();
|
1998-01-16 07:13:05 -05:00
|
|
|
return envtbl;
|
|
|
|
}
|
|
|
|
|
2001-12-10 22:48:08 -05:00
|
|
|
static VALUE
|
2003-05-04 12:03:24 -04:00
|
|
|
env_values_at(argc, argv)
|
2001-12-10 22:48:08 -05:00
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
{
|
|
|
|
VALUE result = rb_ary_new();
|
|
|
|
long i;
|
|
|
|
|
2003-05-04 12:03:24 -04:00
|
|
|
for (i=0; i<argc; i++) {
|
|
|
|
rb_ary_push(result, rb_f_getenv(Qnil, argv[i]));
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
2001-12-10 22:48:08 -05:00
|
|
|
|
2003-05-04 12:03:24 -04:00
|
|
|
static VALUE
|
|
|
|
env_select(argc, argv)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
{
|
|
|
|
VALUE result;
|
|
|
|
long i;
|
|
|
|
char **env;
|
|
|
|
|
|
|
|
if (!rb_block_given_p()) {
|
|
|
|
rb_warn("ENV.select(index..) is deprecated; use ENV.values_at");
|
|
|
|
return env_values_at(argc, argv);
|
2001-12-10 22:48:08 -05:00
|
|
|
}
|
2003-05-04 12:03:24 -04:00
|
|
|
if (argc > 0) {
|
|
|
|
rb_raise(rb_eArgError, "wrong number arguments(%d for 0)", argc);
|
|
|
|
}
|
|
|
|
result = rb_ary_new();
|
|
|
|
env = GET_ENVIRON(environ);
|
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
VALUE k = env_str_new(*env, s-*env);
|
|
|
|
VALUE v = env_str_new2(s+1);
|
2003-05-20 02:29:23 -04:00
|
|
|
if (RTEST(rb_yield_values(2, k, v))) {
|
|
|
|
rb_ary_push(result, rb_assoc_new(k, v));
|
2003-05-04 12:03:24 -04:00
|
|
|
}
|
2001-12-10 22:48:08 -05:00
|
|
|
}
|
2003-05-04 12:03:24 -04:00
|
|
|
env++;
|
2001-12-10 22:48:08 -05:00
|
|
|
}
|
2003-05-04 12:03:24 -04:00
|
|
|
FREE_ENVIRON(environ);
|
|
|
|
|
2001-12-10 22:48:08 -05:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2003-01-07 02:36:40 -05:00
|
|
|
static VALUE
|
|
|
|
env_clear()
|
|
|
|
{
|
|
|
|
volatile VALUE keys;
|
|
|
|
VALUE *ptr;
|
|
|
|
long len;
|
|
|
|
|
|
|
|
rb_secure(4);
|
|
|
|
keys = env_keys();
|
|
|
|
ptr = RARRAY(keys)->ptr;
|
|
|
|
len = RARRAY(keys)->len;
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
VALUE val = rb_f_getenv(Qnil, *ptr);
|
|
|
|
if (!NIL_P(val)) {
|
|
|
|
env_delete(Qnil, *ptr);
|
|
|
|
}
|
|
|
|
ptr++;
|
|
|
|
}
|
|
|
|
return envtbl;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
|
|
|
env_to_s()
|
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
return rb_str_new2("ENV");
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
2000-12-05 04:36:54 -05:00
|
|
|
static VALUE
|
|
|
|
env_inspect()
|
|
|
|
{
|
|
|
|
char **env;
|
2001-05-30 05:12:34 -04:00
|
|
|
VALUE str = rb_str_buf_new2("{");
|
2000-12-05 04:36:54 -05:00
|
|
|
VALUE i;
|
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
2000-12-05 04:36:54 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
|
|
|
|
if (env != environ) {
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_cat2(str, ", ");
|
2000-12-05 04:36:54 -05:00
|
|
|
}
|
|
|
|
if (s) {
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_cat2(str, "\"");
|
|
|
|
rb_str_buf_cat(str, *env, s-*env);
|
|
|
|
rb_str_buf_cat2(str, "\"=>");
|
2000-12-05 04:36:54 -05:00
|
|
|
i = rb_inspect(rb_str_new2(s+1));
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_append(str, i);
|
2000-12-05 04:36:54 -05:00
|
|
|
}
|
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
2001-05-30 05:12:34 -04:00
|
|
|
rb_str_buf_cat2(str, "}");
|
2000-12-05 04:36:54 -05:00
|
|
|
OBJ_TAINT(str);
|
|
|
|
|
|
|
|
return str;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
|
|
|
env_to_a()
|
|
|
|
{
|
|
|
|
char **env;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE ary = rb_ary_new();
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
1999-01-19 23:59:39 -05:00
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_ary_push(ary, rb_assoc_new(env_str_new(*env, s-*env),
|
|
|
|
env_str_new2(s+1)));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
return ary;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_none()
|
|
|
|
{
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_size()
|
|
|
|
{
|
|
|
|
int i;
|
2001-11-12 22:59:20 -05:00
|
|
|
char **env;
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
|
|
|
for(i=0; env[i]; i++)
|
1998-01-16 07:13:05 -05:00
|
|
|
;
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
return INT2FIX(i);
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_empty_p()
|
|
|
|
{
|
2001-11-12 22:59:20 -05:00
|
|
|
char **env;
|
|
|
|
|
|
|
|
env = GET_ENVIRON(environ);
|
|
|
|
if (env[0] == 0) {
|
|
|
|
FREE_ENVIRON(environ);
|
|
|
|
return Qtrue;
|
|
|
|
}
|
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_has_key(env, key)
|
|
|
|
VALUE env, key;
|
|
|
|
{
|
2001-05-02 00:22:21 -04:00
|
|
|
char *s;
|
|
|
|
|
|
|
|
s = StringValuePtr(key);
|
|
|
|
if (strlen(s) != RSTRING(key)->len)
|
|
|
|
rb_raise(rb_eArgError, "bad environment variable name");
|
|
|
|
if (getenv(s)) return Qtrue;
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_has_value(dmy, value)
|
|
|
|
VALUE dmy, value;
|
|
|
|
{
|
|
|
|
char **env;
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
if (TYPE(value) != T_STRING) return Qfalse;
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1998-01-16 07:13:05 -05:00
|
|
|
while (*env) {
|
2003-06-23 04:41:07 -04:00
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s++) {
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strncasecmp(s, RSTRING(value)->ptr, strlen(s)) == 0) {
|
|
|
|
#else
|
2001-11-12 22:59:20 -05:00
|
|
|
if (strncmp(s, RSTRING(value)->ptr, strlen(s)) == 0) {
|
2003-06-20 02:22:50 -04:00
|
|
|
#endif
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qtrue;
|
2001-11-12 22:59:20 -05:00
|
|
|
}
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return Qfalse;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
|
1999-08-13 01:45:20 -04:00
|
|
|
static VALUE
|
|
|
|
env_index(dmy, value)
|
|
|
|
VALUE dmy, value;
|
|
|
|
{
|
|
|
|
char **env;
|
2001-11-12 22:59:20 -05:00
|
|
|
VALUE str;
|
1999-08-13 01:45:20 -04:00
|
|
|
|
2003-06-23 02:52:39 -04:00
|
|
|
StringValue(value);
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1999-08-13 01:45:20 -04:00
|
|
|
while (*env) {
|
2003-06-23 04:41:07 -04:00
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s++) {
|
2003-06-20 02:22:50 -04:00
|
|
|
#ifdef ENV_IGNORECASE
|
|
|
|
if (strncasecmp(s, RSTRING(value)->ptr, strlen(s)) == 0) {
|
|
|
|
#else
|
1999-08-13 01:45:20 -04:00
|
|
|
if (strncmp(s, RSTRING(value)->ptr, strlen(s)) == 0) {
|
2003-06-20 02:22:50 -04:00
|
|
|
#endif
|
2003-06-06 05:24:59 -04:00
|
|
|
str = env_str_new(*env, s-*env-1);
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
|
|
|
return str;
|
1999-08-13 01:45:20 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-08-13 01:45:20 -04:00
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
1998-01-16 07:13:05 -05:00
|
|
|
static VALUE
|
|
|
|
env_indexes(argc, argv)
|
|
|
|
int argc;
|
|
|
|
VALUE *argv;
|
|
|
|
{
|
|
|
|
int i;
|
1999-01-19 23:59:39 -05:00
|
|
|
VALUE indexes = rb_ary_new2(argc);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_warn("ENV.%s is deprecated; use ENV.values_at",
|
2001-12-10 22:48:08 -05:00
|
|
|
rb_id2name(rb_frame_last_func()));
|
1998-01-16 07:13:05 -05:00
|
|
|
for (i=0;i<argc;i++) {
|
2003-06-23 02:52:39 -04:00
|
|
|
VALUE tmp = rb_check_string_type(argv[i]);
|
|
|
|
if (NIL_P(tmp)) {
|
|
|
|
RARRAY(indexes)->ptr[i] = Qnil;
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
else {
|
2003-06-23 02:52:39 -04:00
|
|
|
RARRAY(indexes)->ptr[i] = env_str_new2(getenv(RSTRING(tmp)->ptr));
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|
|
|
|
RARRAY(indexes)->len = i+1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return indexes;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
static VALUE
|
2000-02-08 03:54:01 -05:00
|
|
|
env_to_hash()
|
1998-01-16 07:13:05 -05:00
|
|
|
{
|
1999-01-19 23:59:39 -05:00
|
|
|
char **env;
|
|
|
|
VALUE hash = rb_hash_new();
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2001-11-12 22:59:20 -05:00
|
|
|
env = GET_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
while (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
rb_hash_aset(hash, env_str_new(*env, s-*env),
|
|
|
|
env_str_new2(s+1));
|
1999-01-19 23:59:39 -05:00
|
|
|
}
|
|
|
|
env++;
|
|
|
|
}
|
2001-11-12 22:59:20 -05:00
|
|
|
FREE_ENVIRON(environ);
|
1999-01-19 23:59:39 -05:00
|
|
|
return hash;
|
|
|
|
}
|
1998-01-16 07:13:05 -05:00
|
|
|
|
2000-02-08 03:54:02 -05:00
|
|
|
static VALUE
|
|
|
|
env_reject()
|
|
|
|
{
|
|
|
|
return rb_hash_delete_if(env_to_hash());
|
|
|
|
}
|
|
|
|
|
2003-01-07 02:36:40 -05:00
|
|
|
static VALUE
|
|
|
|
env_shift()
|
|
|
|
{
|
|
|
|
char **env;
|
|
|
|
|
|
|
|
env = GET_ENVIRON(environ);
|
|
|
|
if (*env) {
|
|
|
|
char *s = strchr(*env, '=');
|
|
|
|
if (s) {
|
2003-06-06 05:24:59 -04:00
|
|
|
VALUE key = env_str_new(*env, s-*env);
|
|
|
|
VALUE val = env_str_new2(getenv(RSTRING(key)->ptr));
|
2003-01-07 02:36:40 -05:00
|
|
|
env_delete(Qnil, key);
|
|
|
|
return rb_assoc_new(key, val);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
FREE_ENVIRON(environ);
|
|
|
|
return Qnil;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_invert()
|
|
|
|
{
|
|
|
|
return rb_hash_invert(env_to_hash());
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
env_replace_i(key, val, keys)
|
|
|
|
VALUE key, val, keys;
|
|
|
|
{
|
|
|
|
if (key != Qundef) {
|
|
|
|
env_aset(Qnil, key, val);
|
|
|
|
if (rb_ary_includes(keys, key)) {
|
|
|
|
rb_ary_delete(keys, key);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_replace(env, hash)
|
|
|
|
VALUE env, hash;
|
|
|
|
{
|
|
|
|
volatile VALUE keys = env_keys();
|
|
|
|
VALUE *ptr;
|
|
|
|
long len;
|
|
|
|
|
|
|
|
if (env == hash) return env;
|
|
|
|
hash = to_hash(hash);
|
|
|
|
st_foreach(RHASH(hash)->tbl, env_replace_i, keys);
|
|
|
|
|
|
|
|
ptr = RARRAY(keys)->ptr;
|
|
|
|
len = RARRAY(keys)->len;
|
|
|
|
|
|
|
|
while (len--) {
|
|
|
|
env_delete(env, *ptr++);
|
|
|
|
}
|
|
|
|
return env;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
env_update_i(key, val)
|
|
|
|
VALUE key, val;
|
|
|
|
{
|
|
|
|
if (key != Qundef) {
|
|
|
|
if (rb_block_given_p()) {
|
2003-05-20 02:29:23 -04:00
|
|
|
val = rb_yield_values(3, key, rb_f_getenv(Qnil, key), val);
|
2003-01-07 02:36:40 -05:00
|
|
|
}
|
|
|
|
env_aset(Qnil, key, val);
|
|
|
|
}
|
|
|
|
return ST_CONTINUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static VALUE
|
|
|
|
env_update(env, hash)
|
|
|
|
VALUE env, hash;
|
|
|
|
{
|
|
|
|
if (env == hash) return env;
|
|
|
|
hash = to_hash(hash);
|
|
|
|
st_foreach(RHASH(hash)->tbl, env_update_i, 0);
|
|
|
|
return env;
|
|
|
|
}
|
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
void
|
|
|
|
Init_Hash()
|
|
|
|
{
|
2001-12-10 02:18:16 -05:00
|
|
|
id_hash = rb_intern("hash");
|
2003-05-26 04:22:33 -04:00
|
|
|
id_call = rb_intern("call");
|
2001-12-10 02:18:16 -05:00
|
|
|
id_default = rb_intern("default");
|
1998-01-16 07:13:05 -05:00
|
|
|
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_cHash = rb_define_class("Hash", rb_cObject);
|
|
|
|
|
|
|
|
rb_include_module(rb_cHash, rb_mEnumerable);
|
|
|
|
|
2002-12-20 03:33:17 -05:00
|
|
|
rb_define_alloc_func(rb_cHash, hash_alloc);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_singleton_method(rb_cHash, "[]", rb_hash_s_create, -1);
|
2000-02-29 03:05:32 -05:00
|
|
|
rb_define_method(rb_cHash,"initialize", rb_hash_initialize, -1);
|
2003-05-19 01:41:08 -04:00
|
|
|
rb_define_method(rb_cHash,"initialize_copy", rb_hash_replace, 1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"rehash", rb_hash_rehash, 0);
|
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"to_hash", rb_hash_to_hash, 0);
|
|
|
|
rb_define_method(rb_cHash,"to_a", rb_hash_to_a, 0);
|
|
|
|
rb_define_method(rb_cHash,"to_s", rb_hash_to_s, 0);
|
|
|
|
rb_define_method(rb_cHash,"inspect", rb_hash_inspect, 0);
|
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"==", rb_hash_equal, 1);
|
|
|
|
rb_define_method(rb_cHash,"[]", rb_hash_aref, 1);
|
|
|
|
rb_define_method(rb_cHash,"fetch", rb_hash_fetch, -1);
|
|
|
|
rb_define_method(rb_cHash,"[]=", rb_hash_aset, 2);
|
|
|
|
rb_define_method(rb_cHash,"store", rb_hash_aset, 2);
|
2001-12-10 02:18:16 -05:00
|
|
|
rb_define_method(rb_cHash,"default", rb_hash_default, -1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"default=", rb_hash_set_default, 1);
|
2002-08-13 05:21:18 -04:00
|
|
|
rb_define_method(rb_cHash,"default_proc", rb_hash_default_proc, 0);
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_define_method(rb_cHash,"index", rb_hash_index, 1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"indexes", rb_hash_indexes, -1);
|
|
|
|
rb_define_method(rb_cHash,"indices", rb_hash_indexes, -1);
|
1999-12-07 04:25:55 -05:00
|
|
|
rb_define_method(rb_cHash,"size", rb_hash_size, 0);
|
|
|
|
rb_define_method(rb_cHash,"length", rb_hash_size, 0);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"empty?", rb_hash_empty_p, 0);
|
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"each", rb_hash_each_pair, 0);
|
|
|
|
rb_define_method(rb_cHash,"each_value", rb_hash_each_value, 0);
|
|
|
|
rb_define_method(rb_cHash,"each_key", rb_hash_each_key, 0);
|
|
|
|
rb_define_method(rb_cHash,"each_pair", rb_hash_each_pair, 0);
|
|
|
|
rb_define_method(rb_cHash,"sort", rb_hash_sort, 0);
|
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"keys", rb_hash_keys, 0);
|
|
|
|
rb_define_method(rb_cHash,"values", rb_hash_values, 0);
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_define_method(rb_cHash,"values_at", rb_hash_values_at, -1);
|
1999-01-19 23:59:39 -05:00
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"shift", rb_hash_shift, 0);
|
|
|
|
rb_define_method(rb_cHash,"delete", rb_hash_delete, 1);
|
|
|
|
rb_define_method(rb_cHash,"delete_if", rb_hash_delete_if, 0);
|
2001-12-10 22:48:08 -05:00
|
|
|
rb_define_method(rb_cHash,"select", rb_hash_select, -1);
|
2000-02-08 03:54:01 -05:00
|
|
|
rb_define_method(rb_cHash,"reject", rb_hash_reject, 0);
|
2000-08-07 01:05:04 -04:00
|
|
|
rb_define_method(rb_cHash,"reject!", rb_hash_reject_bang, 0);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"clear", rb_hash_clear, 0);
|
|
|
|
rb_define_method(rb_cHash,"invert", rb_hash_invert, 0);
|
|
|
|
rb_define_method(rb_cHash,"update", rb_hash_update, 1);
|
2002-12-10 01:23:44 -05:00
|
|
|
rb_define_method(rb_cHash,"replace", rb_hash_replace, 1);
|
2003-02-03 00:34:16 -05:00
|
|
|
rb_define_method(rb_cHash,"merge!", rb_hash_update, 1);
|
|
|
|
rb_define_method(rb_cHash,"merge", rb_hash_merge, 1);
|
1999-01-19 23:59:39 -05:00
|
|
|
|
|
|
|
rb_define_method(rb_cHash,"include?", rb_hash_has_key, 1);
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_define_method(rb_cHash,"member?", rb_hash_has_key, 1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_method(rb_cHash,"has_key?", rb_hash_has_key, 1);
|
|
|
|
rb_define_method(rb_cHash,"has_value?", rb_hash_has_value, 1);
|
|
|
|
rb_define_method(rb_cHash,"key?", rb_hash_has_key, 1);
|
|
|
|
rb_define_method(rb_cHash,"value?", rb_hash_has_value, 1);
|
|
|
|
|
|
|
|
#ifndef __MACOS__ /* environment variables nothing on MacOS. */
|
|
|
|
origenviron = environ;
|
|
|
|
envtbl = rb_obj_alloc(rb_cObject);
|
|
|
|
rb_extend_object(envtbl, rb_mEnumerable);
|
|
|
|
|
|
|
|
rb_define_singleton_method(envtbl,"[]", rb_f_getenv, 1);
|
2000-04-12 01:06:23 -04:00
|
|
|
rb_define_singleton_method(envtbl,"fetch", env_fetch, -1);
|
2001-10-29 00:07:26 -05:00
|
|
|
rb_define_singleton_method(envtbl,"[]=", env_aset, 2);
|
|
|
|
rb_define_singleton_method(envtbl,"store", env_aset, 2);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"each", env_each, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"each_pair", env_each, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"each_key", env_each_key, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"each_value", env_each_value, 0);
|
2000-01-04 23:41:21 -05:00
|
|
|
rb_define_singleton_method(envtbl,"delete", env_delete_m, 1);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"delete_if", env_delete_if, 0);
|
2003-01-07 02:36:40 -05:00
|
|
|
rb_define_singleton_method(envtbl,"clear", env_clear, 0);
|
2000-02-08 03:54:01 -05:00
|
|
|
rb_define_singleton_method(envtbl,"reject", env_reject, 0);
|
2000-08-07 01:05:04 -04:00
|
|
|
rb_define_singleton_method(envtbl,"reject!", env_reject_bang, 0);
|
2001-12-10 22:48:08 -05:00
|
|
|
rb_define_singleton_method(envtbl,"select", env_select, -1);
|
2003-01-07 02:36:40 -05:00
|
|
|
rb_define_singleton_method(envtbl,"shift", env_shift, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"invert", env_invert, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"replace", env_replace, 1);
|
|
|
|
rb_define_singleton_method(envtbl,"update", env_update, 1);
|
2000-12-05 04:36:54 -05:00
|
|
|
rb_define_singleton_method(envtbl,"inspect", env_inspect, 0);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"rehash", env_none, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"to_a", env_to_a, 0);
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_define_singleton_method(envtbl,"index", env_index, 1);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"indexes", env_indexes, -1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_singleton_method(envtbl,"indices", env_indexes, -1);
|
1999-12-07 04:25:55 -05:00
|
|
|
rb_define_singleton_method(envtbl,"size", env_size, 0);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"length", env_size, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"empty?", env_empty_p, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"keys", env_keys, 0);
|
|
|
|
rb_define_singleton_method(envtbl,"values", env_values, 0);
|
2003-05-04 12:03:24 -04:00
|
|
|
rb_define_singleton_method(envtbl,"values_at", env_values_at, -1);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"include?", env_has_key, 1);
|
1999-08-13 01:45:20 -04:00
|
|
|
rb_define_singleton_method(envtbl,"member?", env_has_key, 1);
|
1998-01-16 07:13:05 -05:00
|
|
|
rb_define_singleton_method(envtbl,"has_key?", env_has_key, 1);
|
|
|
|
rb_define_singleton_method(envtbl,"has_value?", env_has_value, 1);
|
|
|
|
rb_define_singleton_method(envtbl,"key?", env_has_key, 1);
|
|
|
|
rb_define_singleton_method(envtbl,"value?", env_has_value, 1);
|
1999-01-19 23:59:39 -05:00
|
|
|
rb_define_singleton_method(envtbl,"to_hash", env_to_hash, 0);
|
1998-01-16 07:13:05 -05:00
|
|
|
|
|
|
|
rb_define_global_const("ENV", envtbl);
|
1999-01-19 23:59:39 -05:00
|
|
|
#else /* __MACOS__ */
|
|
|
|
envtbl = rb_hash_s_new(0, NULL, rb_cHash);
|
|
|
|
rb_define_global_const("ENV", envtbl);
|
|
|
|
#endif /* ifndef __MACOS__ environment variables nothing on MacOS. */
|
1998-01-16 07:13:05 -05:00
|
|
|
}
|