mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
62261ccb47
value is ignored. * class.c (rb_singleton_class_clone): should copy class constant table as well. * class.c (rb_include_module): sometimes cache was mistakenly left uncleared - based on the patch by K.Kosako. * ruby.h: all Check_SafeStr()'s are replaced by SafeStr() to ensure 'to_str' be always effective. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@1288 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
694 lines
13 KiB
C
694 lines
13 KiB
C
/**********************************************************************
|
|
|
|
class.c -
|
|
|
|
$Author$
|
|
$Date$
|
|
created at: Tue Aug 10 15:05:44 JST 1993
|
|
|
|
Copyright (C) 1993-2001 Yukihiro Matsumoto
|
|
|
|
**********************************************************************/
|
|
|
|
#include "ruby.h"
|
|
#include "rubysig.h"
|
|
#include "node.h"
|
|
#include "st.h"
|
|
#include <ctype.h>
|
|
|
|
extern st_table *rb_class_tbl;
|
|
|
|
VALUE
|
|
rb_class_new(super)
|
|
VALUE super;
|
|
{
|
|
NEWOBJ(klass, struct RClass);
|
|
OBJSETUP(klass, rb_cClass, T_CLASS);
|
|
|
|
klass->super = super;
|
|
klass->iv_tbl = 0;
|
|
klass->m_tbl = 0; /* safe GC */
|
|
klass->m_tbl = st_init_numtable();
|
|
|
|
return (VALUE)klass;
|
|
}
|
|
|
|
VALUE
|
|
rb_singleton_class_new(super)
|
|
VALUE super;
|
|
{
|
|
VALUE klass = rb_class_new(super);
|
|
|
|
FL_SET(klass, FL_SINGLETON);
|
|
return klass;
|
|
}
|
|
|
|
static int
|
|
clone_method(mid, body, tbl)
|
|
ID mid;
|
|
NODE *body;
|
|
st_table *tbl;
|
|
{
|
|
st_insert(tbl, mid, NEW_METHOD(body->nd_body, body->nd_noex));
|
|
return ST_CONTINUE;
|
|
}
|
|
|
|
VALUE
|
|
rb_singleton_class_clone(klass)
|
|
VALUE klass;
|
|
{
|
|
if (!FL_TEST(klass, FL_SINGLETON))
|
|
return klass;
|
|
else {
|
|
/* copy singleton(unnamed) class */
|
|
NEWOBJ(clone, struct RClass);
|
|
CLONESETUP(clone, klass);
|
|
|
|
clone->super = RCLASS(klass)->super;
|
|
clone->iv_tbl = 0;
|
|
clone->m_tbl = 0;
|
|
if (RCLASS(klass)->iv_tbl) {
|
|
clone->iv_tbl = st_copy(RCLASS(klass)->iv_tbl);
|
|
}
|
|
clone->m_tbl = st_init_numtable();
|
|
st_foreach(RCLASS(klass)->m_tbl, clone_method, clone->m_tbl);
|
|
FL_SET(clone, FL_SINGLETON);
|
|
return (VALUE)clone;
|
|
}
|
|
}
|
|
|
|
void
|
|
rb_singleton_class_attached(klass, obj)
|
|
VALUE klass, obj;
|
|
{
|
|
if (FL_TEST(klass, FL_SINGLETON))
|
|
rb_iv_set(klass, "__attached__", obj);
|
|
}
|
|
|
|
VALUE
|
|
rb_define_class_id(id, super)
|
|
ID id;
|
|
VALUE super;
|
|
{
|
|
VALUE klass;
|
|
|
|
if (!super) super = rb_cObject;
|
|
klass = rb_class_new(super);
|
|
rb_name_class(klass, id);
|
|
/* make metaclass */
|
|
RBASIC(klass)->klass = rb_singleton_class_new(RBASIC(super)->klass);
|
|
rb_singleton_class_attached(RBASIC(klass)->klass, klass);
|
|
rb_funcall(super, rb_intern("inherited"), 1, klass);
|
|
|
|
return klass;
|
|
}
|
|
|
|
VALUE
|
|
rb_define_class(name, super)
|
|
const char *name;
|
|
VALUE super;
|
|
{
|
|
VALUE klass;
|
|
ID id;
|
|
|
|
id = rb_intern(name);
|
|
klass = rb_define_class_id(id, super);
|
|
|
|
st_add_direct(rb_class_tbl, id, klass);
|
|
|
|
return klass;
|
|
}
|
|
|
|
VALUE
|
|
rb_define_class_under(outer, name, super)
|
|
VALUE outer;
|
|
const char *name;
|
|
VALUE super;
|
|
{
|
|
VALUE klass;
|
|
ID id;
|
|
|
|
id = rb_intern(name);
|
|
klass = rb_define_class_id(id, super);
|
|
rb_const_set(outer, id, klass);
|
|
rb_set_class_path(klass, outer, name);
|
|
|
|
return klass;
|
|
}
|
|
|
|
VALUE
|
|
rb_module_new()
|
|
{
|
|
NEWOBJ(mdl, struct RClass);
|
|
OBJSETUP(mdl, rb_cModule, T_MODULE);
|
|
|
|
mdl->super = 0;
|
|
mdl->iv_tbl = 0;
|
|
mdl->m_tbl = 0;
|
|
mdl->m_tbl = st_init_numtable();
|
|
|
|
return (VALUE)mdl;
|
|
}
|
|
|
|
VALUE
|
|
rb_define_module_id(id)
|
|
ID id;
|
|
{
|
|
VALUE mdl;
|
|
|
|
mdl = rb_module_new();
|
|
rb_name_class(mdl, id);
|
|
|
|
return mdl;
|
|
}
|
|
|
|
VALUE
|
|
rb_define_module(name)
|
|
const char *name;
|
|
{
|
|
VALUE module;
|
|
ID id;
|
|
|
|
id = rb_intern(name);
|
|
module = rb_define_module_id(id);
|
|
st_add_direct(rb_class_tbl, id, module);
|
|
|
|
return module;
|
|
}
|
|
|
|
VALUE
|
|
rb_define_module_under(outer, name)
|
|
VALUE outer;
|
|
const char *name;
|
|
{
|
|
VALUE module;
|
|
ID id;
|
|
|
|
id = rb_intern(name);
|
|
module = rb_define_module_id(id);
|
|
rb_const_set(outer, id, module);
|
|
rb_set_class_path(module, outer, name);
|
|
|
|
return module;
|
|
}
|
|
|
|
static VALUE
|
|
include_class_new(module, super)
|
|
VALUE module, super;
|
|
{
|
|
NEWOBJ(klass, struct RClass);
|
|
OBJSETUP(klass, rb_cClass, T_ICLASS);
|
|
|
|
if (!RCLASS(module)->iv_tbl) {
|
|
RCLASS(module)->iv_tbl = st_init_numtable();
|
|
}
|
|
klass->iv_tbl = RCLASS(module)->iv_tbl;
|
|
klass->m_tbl = RCLASS(module)->m_tbl;
|
|
klass->super = super;
|
|
if (TYPE(module) == T_ICLASS) {
|
|
RBASIC(klass)->klass = RBASIC(module)->klass;
|
|
}
|
|
else {
|
|
RBASIC(klass)->klass = module;
|
|
}
|
|
|
|
return (VALUE)klass;
|
|
}
|
|
|
|
void
|
|
rb_include_module(klass, module)
|
|
VALUE klass, module;
|
|
{
|
|
VALUE p;
|
|
int changed = 0;
|
|
|
|
if (NIL_P(module)) return;
|
|
if (klass == module) return;
|
|
|
|
switch (TYPE(module)) {
|
|
case T_MODULE:
|
|
case T_CLASS:
|
|
case T_ICLASS:
|
|
break;
|
|
default:
|
|
Check_Type(module, T_MODULE);
|
|
}
|
|
|
|
while (module) {
|
|
/* ignore if the module included already in superclasses */
|
|
for (p = RCLASS(klass)->super; p; p = RCLASS(p)->super) {
|
|
if (BUILTIN_TYPE(p) == T_ICLASS &&
|
|
RCLASS(p)->m_tbl == RCLASS(module)->m_tbl) {
|
|
if (RCLASS(module)->super) {
|
|
rb_include_module(p, RCLASS(module)->super);
|
|
}
|
|
if (changed) rb_clear_cache();
|
|
return;
|
|
}
|
|
}
|
|
rb_frozen_class_p(klass);
|
|
RCLASS(klass)->super = include_class_new(module, RCLASS(klass)->super);
|
|
klass = RCLASS(klass)->super;
|
|
module = RCLASS(module)->super;
|
|
changed = 1;
|
|
}
|
|
if (changed) rb_clear_cache();
|
|
}
|
|
|
|
VALUE
|
|
rb_mod_included_modules(mod)
|
|
VALUE mod;
|
|
{
|
|
VALUE ary = rb_ary_new();
|
|
VALUE p;
|
|
|
|
for (p = RCLASS(mod)->super; p; p = RCLASS(p)->super) {
|
|
if (BUILTIN_TYPE(p) == T_ICLASS) {
|
|
rb_ary_push(ary, RBASIC(p)->klass);
|
|
}
|
|
}
|
|
return ary;
|
|
}
|
|
|
|
VALUE
|
|
rb_mod_ancestors(mod)
|
|
VALUE mod;
|
|
{
|
|
VALUE ary = rb_ary_new();
|
|
VALUE p;
|
|
|
|
for (p = mod; p; p = RCLASS(p)->super) {
|
|
if (FL_TEST(p, FL_SINGLETON))
|
|
continue;
|
|
if (BUILTIN_TYPE(p) == T_ICLASS) {
|
|
rb_ary_push(ary, RBASIC(p)->klass);
|
|
}
|
|
else {
|
|
rb_ary_push(ary, p);
|
|
}
|
|
}
|
|
return ary;
|
|
}
|
|
|
|
static int
|
|
ins_methods_i(key, body, ary)
|
|
ID key;
|
|
NODE *body;
|
|
VALUE ary;
|
|
{
|
|
if ((body->nd_noex&(NOEX_PRIVATE|NOEX_PROTECTED)) == 0) {
|
|
VALUE name = rb_str_new2(rb_id2name(key));
|
|
|
|
if (!rb_ary_includes(ary, name)) {
|
|
if (!body->nd_body) {
|
|
rb_ary_push(ary, Qnil);
|
|
}
|
|
rb_ary_push(ary, name);
|
|
}
|
|
}
|
|
else if (body->nd_body && nd_type(body->nd_body) == NODE_ZSUPER) {
|
|
rb_ary_push(ary, Qnil);
|
|
rb_ary_push(ary, rb_str_new2(rb_id2name(key)));
|
|
}
|
|
return ST_CONTINUE;
|
|
}
|
|
|
|
static int
|
|
ins_methods_prot_i(key, body, ary)
|
|
ID key;
|
|
NODE *body;
|
|
VALUE ary;
|
|
{
|
|
if (!body->nd_body) {
|
|
rb_ary_push(ary, Qnil);
|
|
rb_ary_push(ary, rb_str_new2(rb_id2name(key)));
|
|
}
|
|
else if (body->nd_noex & NOEX_PROTECTED) {
|
|
VALUE name = rb_str_new2(rb_id2name(key));
|
|
|
|
if (!rb_ary_includes(ary, name)) {
|
|
rb_ary_push(ary, name);
|
|
}
|
|
}
|
|
else if (nd_type(body->nd_body) == NODE_ZSUPER) {
|
|
rb_ary_push(ary, Qnil);
|
|
rb_ary_push(ary, rb_str_new2(rb_id2name(key)));
|
|
}
|
|
return ST_CONTINUE;
|
|
}
|
|
|
|
static int
|
|
ins_methods_priv_i(key, body, ary)
|
|
ID key;
|
|
NODE *body;
|
|
VALUE ary;
|
|
{
|
|
if (!body->nd_body) {
|
|
rb_ary_push(ary, Qnil);
|
|
rb_ary_push(ary, rb_str_new2(rb_id2name(key)));
|
|
}
|
|
else if (body->nd_noex & NOEX_PRIVATE) {
|
|
VALUE name = rb_str_new2(rb_id2name(key));
|
|
|
|
if (!rb_ary_includes(ary, name)) {
|
|
rb_ary_push(ary, name);
|
|
}
|
|
}
|
|
else if (nd_type(body->nd_body) == NODE_ZSUPER) {
|
|
rb_ary_push(ary, Qnil);
|
|
rb_ary_push(ary, rb_str_new2(rb_id2name(key)));
|
|
}
|
|
return ST_CONTINUE;
|
|
}
|
|
|
|
static VALUE
|
|
method_list(mod, option, func)
|
|
VALUE mod;
|
|
int option;
|
|
int (*func)();
|
|
{
|
|
VALUE ary;
|
|
VALUE klass;
|
|
VALUE *p, *q, *pend;
|
|
|
|
ary = rb_ary_new();
|
|
for (klass = mod; klass; klass = RCLASS(klass)->super) {
|
|
st_foreach(RCLASS(klass)->m_tbl, func, ary);
|
|
if (!option) break;
|
|
}
|
|
p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
|
|
while (p < pend) {
|
|
if (*p == Qnil) {
|
|
p+=2;
|
|
continue;
|
|
}
|
|
*q++ = *p++;
|
|
}
|
|
RARRAY(ary)->len = q - RARRAY(ary)->ptr;
|
|
return ary;
|
|
}
|
|
|
|
VALUE
|
|
rb_class_instance_methods(argc, argv, mod)
|
|
int argc;
|
|
VALUE *argv;
|
|
VALUE mod;
|
|
{
|
|
VALUE option;
|
|
|
|
rb_scan_args(argc, argv, "01", &option);
|
|
return method_list(mod, RTEST(option), ins_methods_i);
|
|
}
|
|
|
|
VALUE
|
|
rb_class_protected_instance_methods(argc, argv, mod)
|
|
int argc;
|
|
VALUE *argv;
|
|
VALUE mod;
|
|
{
|
|
VALUE option;
|
|
|
|
rb_scan_args(argc, argv, "01", &option);
|
|
return method_list(mod, RTEST(option), ins_methods_prot_i);
|
|
}
|
|
|
|
VALUE
|
|
rb_class_private_instance_methods(argc, argv, mod)
|
|
int argc;
|
|
VALUE *argv;
|
|
VALUE mod;
|
|
{
|
|
VALUE option;
|
|
|
|
rb_scan_args(argc, argv, "01", &option);
|
|
return method_list(mod, RTEST(option), ins_methods_priv_i);
|
|
}
|
|
|
|
VALUE
|
|
rb_obj_singleton_methods(obj)
|
|
VALUE obj;
|
|
{
|
|
VALUE ary;
|
|
VALUE klass;
|
|
VALUE *p, *q, *pend;
|
|
|
|
ary = rb_ary_new();
|
|
klass = CLASS_OF(obj);
|
|
while (klass && FL_TEST(klass, FL_SINGLETON)) {
|
|
st_foreach(RCLASS(klass)->m_tbl, ins_methods_i, ary);
|
|
klass = RCLASS(klass)->super;
|
|
}
|
|
p = q = RARRAY(ary)->ptr; pend = p + RARRAY(ary)->len;
|
|
while (p < pend) {
|
|
if (*p == Qnil) {
|
|
p+=2;
|
|
continue;
|
|
}
|
|
*q++ = *p++;
|
|
}
|
|
RARRAY(ary)->len = q - RARRAY(ary)->ptr;
|
|
|
|
return ary;
|
|
}
|
|
|
|
void
|
|
rb_define_method_id(klass, name, func, argc)
|
|
VALUE klass;
|
|
ID name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_add_method(klass, name, NEW_CFUNC(func,argc), NOEX_PUBLIC|NOEX_CFUNC);
|
|
}
|
|
|
|
void
|
|
rb_define_method(klass, name, func, argc)
|
|
VALUE klass;
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
ID id = rb_intern(name);
|
|
|
|
rb_add_method(klass, id, NEW_CFUNC(func, argc),
|
|
((name[0] == 'i' && id == rb_intern("initialize"))?
|
|
NOEX_PRIVATE:NOEX_PUBLIC)|NOEX_CFUNC);
|
|
}
|
|
|
|
void
|
|
rb_define_protected_method(klass, name, func, argc)
|
|
VALUE klass;
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_add_method(klass, rb_intern(name), NEW_CFUNC(func, argc),
|
|
NOEX_PROTECTED|NOEX_CFUNC);
|
|
}
|
|
|
|
void
|
|
rb_define_private_method(klass, name, func, argc)
|
|
VALUE klass;
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_add_method(klass, rb_intern(name), NEW_CFUNC(func, argc),
|
|
NOEX_PRIVATE|NOEX_CFUNC);
|
|
}
|
|
|
|
void
|
|
rb_undef_method(klass, name)
|
|
VALUE klass;
|
|
const char *name;
|
|
{
|
|
rb_add_method(klass, rb_intern(name), 0, NOEX_UNDEF);
|
|
}
|
|
|
|
#define SPECIAL_SINGLETON(x,c) if (obj == (x)) {\
|
|
if (!FL_TEST(c, FL_SINGLETON)) {\
|
|
c = rb_singleton_class_new(c);\
|
|
rb_singleton_class_attached(c,obj);\
|
|
}\
|
|
return c;\
|
|
}
|
|
|
|
VALUE
|
|
rb_singleton_class(obj)
|
|
VALUE obj;
|
|
{
|
|
VALUE klass;
|
|
|
|
if (FIXNUM_P(obj) || SYMBOL_P(obj)) {
|
|
rb_raise(rb_eTypeError, "can't define singleton");
|
|
}
|
|
if (rb_special_const_p(obj)) {
|
|
SPECIAL_SINGLETON(Qnil, rb_cNilClass);
|
|
SPECIAL_SINGLETON(Qfalse, rb_cFalseClass);
|
|
SPECIAL_SINGLETON(Qtrue, rb_cTrueClass);
|
|
rb_bug("unknown immediate %d", obj);
|
|
}
|
|
|
|
DEFER_INTS;
|
|
if (FL_TEST(RBASIC(obj)->klass, FL_SINGLETON)) {
|
|
klass = RBASIC(obj)->klass;
|
|
}
|
|
else {
|
|
klass = rb_singleton_class_new(RBASIC(obj)->klass);
|
|
RBASIC(obj)->klass = klass;
|
|
rb_singleton_class_attached(klass, obj);
|
|
}
|
|
if (OBJ_TAINTED(obj)) {
|
|
OBJ_TAINT(klass);
|
|
}
|
|
else {
|
|
FL_UNSET(klass, FL_TAINT);
|
|
}
|
|
if (OBJ_FROZEN(obj)) OBJ_FREEZE(klass);
|
|
ALLOW_INTS;
|
|
|
|
return klass;
|
|
}
|
|
|
|
void
|
|
rb_define_singleton_method(obj, name, func, argc)
|
|
VALUE obj;
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_define_method(rb_singleton_class(obj), name, func, argc);
|
|
}
|
|
|
|
void
|
|
rb_define_module_function(module, name, func, argc)
|
|
VALUE module;
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_define_private_method(module, name, func, argc);
|
|
rb_define_singleton_method(module, name, func, argc);
|
|
}
|
|
|
|
void
|
|
rb_define_global_function(name, func, argc)
|
|
const char *name;
|
|
VALUE (*func)();
|
|
int argc;
|
|
{
|
|
rb_define_module_function(rb_mKernel, name, func, argc);
|
|
}
|
|
|
|
void
|
|
rb_define_alias(klass, name1, name2)
|
|
VALUE klass;
|
|
const char *name1, *name2;
|
|
{
|
|
rb_alias(klass, rb_intern(name1), rb_intern(name2));
|
|
}
|
|
|
|
void
|
|
rb_define_attr(klass, name, read, write)
|
|
VALUE klass;
|
|
const char *name;
|
|
int read, write;
|
|
{
|
|
rb_attr(klass, rb_intern(name), read, write, Qfalse);
|
|
}
|
|
|
|
#ifdef HAVE_STDARG_PROTOTYPES
|
|
#include <stdarg.h>
|
|
#define va_init_list(a,b) va_start(a,b)
|
|
#else
|
|
#include <varargs.h>
|
|
#define va_init_list(a,b) va_start(a)
|
|
#endif
|
|
|
|
int
|
|
#ifdef HAVE_STDARG_PROTOTYPES
|
|
rb_scan_args(int argc, VALUE *argv, const char *fmt, ...)
|
|
#else
|
|
rb_scan_args(argc, argv, fmt, va_alist)
|
|
int argc;
|
|
VALUE *argv;
|
|
const char *fmt;
|
|
va_dcl
|
|
#endif
|
|
{
|
|
int n, i = 0;
|
|
const char *p = fmt;
|
|
VALUE *var;
|
|
va_list vargs;
|
|
|
|
va_init_list(vargs, fmt);
|
|
|
|
if (*p == '*') goto rest_arg;
|
|
|
|
if (ISDIGIT(*p)) {
|
|
n = *p - '0';
|
|
if (n > argc)
|
|
rb_raise(rb_eArgError, "wrong # of arguments (%d for %d)", argc, n);
|
|
for (i=0; i<n; i++) {
|
|
var = va_arg(vargs, VALUE*);
|
|
if (var) *var = argv[i];
|
|
}
|
|
p++;
|
|
}
|
|
else {
|
|
goto error;
|
|
}
|
|
|
|
if (ISDIGIT(*p)) {
|
|
n = i + *p - '0';
|
|
for (; i<n; i++) {
|
|
var = va_arg(vargs, VALUE*);
|
|
if (argc > i) {
|
|
if (var) *var = argv[i];
|
|
}
|
|
else {
|
|
if (var) *var = Qnil;
|
|
}
|
|
}
|
|
p++;
|
|
}
|
|
|
|
if(*p == '*') {
|
|
rest_arg:
|
|
var = va_arg(vargs, VALUE*);
|
|
if (argc > i) {
|
|
if (var) *var = rb_ary_new4(argc-i, argv+i);
|
|
i = argc;
|
|
}
|
|
else {
|
|
if (var) *var = rb_ary_new();
|
|
}
|
|
p++;
|
|
}
|
|
|
|
if (*p == '&') {
|
|
var = va_arg(vargs, VALUE*);
|
|
if (rb_block_given_p()) {
|
|
*var = rb_f_lambda();
|
|
}
|
|
else {
|
|
*var = Qnil;
|
|
}
|
|
p++;
|
|
}
|
|
va_end(vargs);
|
|
|
|
if (*p != '\0') {
|
|
goto error;
|
|
}
|
|
|
|
if (argc > i) {
|
|
rb_raise(rb_eArgError, "wrong # of arguments(%d for %d)", argc, i);
|
|
}
|
|
|
|
return argc;
|
|
|
|
error:
|
|
rb_fatal("bad scan arg format: %s", fmt);
|
|
return 0;
|
|
}
|