April 2010 - macruby-changes - lists.macosforge.org

[3907] MacRuby/trunk/lib/strscan.rb
by source_changes＠macosforge.org 05 Apr '10

05 Apr '10

Revision: 3907 http://trac.macosforge.org/projects/ruby/changeset/3907 Author: lsansonetti(a)apple.com Date: 2010-04-04 18:00:33 -0700 (Sun, 04 Apr 2010) Log Message: ----------- fixed _match method Modified Paths: -------------- MacRuby/trunk/lib/strscan.rb Modified: MacRuby/trunk/lib/strscan.rb =================================================================== --- MacRuby/trunk/lib/strscan.rb 2010-04-04 06:07:54 UTC (rev 3906) +++ MacRuby/trunk/lib/strscan.rb 2010-04-05 01:00:33 UTC (rev 3907) @@ -623,7 +623,7 @@ return nil if rest_size < 0 if headonly - headonly_pattern = Regexp.new('^' + pattern.to_s) + headonly_pattern = Regexp.new('^' + pattern.source, pattern.options) @match = headonly_pattern.match rest else @match = pattern.match rest

1 0

[3906] MacRuby/trunk
by source_changes＠macosforge.org 04 Apr '10

04 Apr '10

Revision: 3906 http://trac.macosforge.org/projects/ruby/changeset/3906 Author: lsansonetti(a)apple.com Date: 2010-04-03 23:07:54 -0700 (Sat, 03 Apr 2010) Log Message: ----------- fixed ZSUPER compilation inside blocks Modified Paths: -------------- MacRuby/trunk/compiler.cpp MacRuby/trunk/compiler.h Modified: MacRuby/trunk/compiler.cpp =================================================================== --- MacRuby/trunk/compiler.cpp 2010-04-04 04:11:15 UTC (rev 3905) +++ MacRuby/trunk/compiler.cpp 2010-04-04 06:07:54 UTC (rev 3906) @@ -61,6 +61,7 @@ current_block_chain = false; current_block_node = NULL; current_block_func = NULL; + current_non_block_func = NULL; current_opened_class = NULL; dynamic_class = false; current_module = false; @@ -3043,360 +3044,370 @@ BranchInst::Create(mergeBB, bb); } -Value * -RoxorCompiler::compile_node(NODE *node) +Function * +RoxorCompiler::compile_scope(NODE *node) { + rb_vm_arity_t arity = rb_vm_node_arity(node); + const int nargs = bb == NULL ? 0 : arity.real; + const bool has_dvars = block_declaration; + + // Get dynamic vars. + if (has_dvars && node->nd_tbl != NULL) { + const int args_count = (int)node->nd_tbl[0]; + const int lvar_count = (int)node->nd_tbl[args_count + 1]; + for (int i = 0; i < lvar_count; i++) { + ID id = node->nd_tbl[i + args_count + 2]; + if (lvars.find(id) != lvars.end()) { + std::vector<ID>::iterator iter = std::find(dvars.begin(), + dvars.end(), id); + if (iter == dvars.end()) { #if ROXOR_COMPILER_DEBUG - printf("%s:%ld ", fname, nd_line(node)); - for (int i = 0; i < level; i++) { - printf("..."); - } - printf("... %s\n", ruby_node_name(nd_type(node))); + printf("dvar %s\n", rb_id2name(id)); #endif - if (current_line != nd_line(node)) { - current_line = nd_line(node); - if (debug_mode) { - compile_debug_trap(); + dvars.push_back(id); + } + } } } - switch (nd_type(node)) { - case NODE_SCOPE: - { - rb_vm_arity_t arity = rb_vm_node_arity(node); - const int nargs = bb == NULL ? 0 : arity.real; - const bool has_dvars = block_declaration; + // Create function type. + std::vector<const Type *> types; + types.push_back(RubyObjTy); // self + types.push_back(PtrTy); // sel + if (has_dvars) { + types.push_back(RubyObjPtrPtrTy); // dvars array + types.push_back(PtrTy); // rb_vm_block_t of the currently running block + } + for (int i = 0; i < nargs; ++i) { + types.push_back(RubyObjTy); + } + FunctionType *ft = FunctionType::get(RubyObjTy, types, false); - // Get dynamic vars. - if (has_dvars && node->nd_tbl != NULL) { - const int args_count = (int)node->nd_tbl[0]; - const int lvar_count = (int)node->nd_tbl[args_count + 1]; - for (int i = 0; i < lvar_count; i++) { - ID id = node->nd_tbl[i + args_count + 2]; - if (lvars.find(id) != lvars.end()) { - std::vector<ID>::iterator iter = std::find(dvars.begin(), dvars.end(), id); - if (iter == dvars.end()) { -#if ROXOR_COMPILER_DEBUG - printf("dvar %s\n", rb_id2name(id)); -#endif - dvars.push_back(id); - } - } - } - } + std::string function_name; + if (ruby_aot_compile) { + function_name.append(RSTRING_PTR(ruby_aot_init_func)); + function_name.append("_ruby_scope"); + } + else { + function_name.append("__ruby_scope"); + } - // Create function type. - std::vector<const Type *> types; - types.push_back(RubyObjTy); // self - types.push_back(PtrTy); // sel - if (has_dvars) { - types.push_back(RubyObjPtrPtrTy); // dvars array - types.push_back(PtrTy); // rb_vm_block_t of the currently running block - } - for (int i = 0; i < nargs; ++i) { - types.push_back(RubyObjTy); - } - FunctionType *ft = FunctionType::get(RubyObjTy, types, false); + Function *f = Function::Create(ft, GlobalValue::ExternalLinkage, + function_name, module); - std::string function_name; - if (ruby_aot_compile) { - function_name.append(RSTRING_PTR(ruby_aot_init_func)); - function_name.append("_ruby_scope"); - } - else { - function_name.append("__ruby_scope"); - } + BasicBlock *old_rescue_invoke_bb = rescue_invoke_bb; + BasicBlock *old_rescue_rethrow_bb = rescue_rethrow_bb; + BasicBlock *old_entry_bb = entry_bb; + BasicBlock *old_bb = bb; + BasicBlock *new_rescue_invoke_bb = NULL; + BasicBlock *new_rescue_rethrow_bb = NULL; + rescue_invoke_bb = NULL; + rescue_rethrow_bb = NULL; + bb = BasicBlock::Create(context, "MainBlock", f); - Function *f = Function::Create(ft, GlobalValue::ExternalLinkage, - function_name, module); - - BasicBlock *old_rescue_invoke_bb = rescue_invoke_bb; - BasicBlock *old_rescue_rethrow_bb = rescue_rethrow_bb; - BasicBlock *old_entry_bb = entry_bb; - BasicBlock *old_bb = bb; - BasicBlock *new_rescue_invoke_bb = NULL; - BasicBlock *new_rescue_rethrow_bb = NULL; - rescue_invoke_bb = NULL; - rescue_rethrow_bb = NULL; - bb = BasicBlock::Create(context, "MainBlock", f); - - DISubprogram old_debug_subprogram = debug_subprogram; + DISubprogram old_debug_subprogram = debug_subprogram; #if 0 - // This is not the right way to emit subprogram DWARF entries, - // llc emits some assembly that doesn't compile because some - // symbols are duplicated. - debug_subprogram = debug_info->CreateSubprogram( - debug_compile_unit, f->getName(), f->getName(), - f->getName(), debug_compile_unit, nd_line(node), - DIType(), f->hasInternalLinkage(), true); - debug_info->InsertSubprogramStart(debug_subprogram, bb); + // This is not the right way to emit subprogram DWARF entries, + // llc emits some assembly that doesn't compile because some + // symbols are duplicated. + debug_subprogram = debug_info->CreateSubprogram( + debug_compile_unit, f->getName(), f->getName(), + f->getName(), debug_compile_unit, nd_line(node), + DIType(), f->hasInternalLinkage(), true); + debug_info->InsertSubprogramStart(debug_subprogram, bb); #endif - std::map<ID, Value *> old_lvars = lvars; - lvars.clear(); - Value *old_self = current_self; + std::map<ID, Value *> old_lvars = lvars; + lvars.clear(); + Value *old_self = current_self; - Function::arg_iterator arg; + Function::arg_iterator arg; - arg = f->arg_begin(); - Value *self = arg++; - self->setName("self"); - current_self = self; + arg = f->arg_begin(); + Value *self = arg++; + self->setName("self"); + current_self = self; - Value *sel = arg++; - sel->setName("sel"); + Value *sel = arg++; + sel->setName("sel"); - Value *old_running_block = running_block; - Value *old_current_var_uses = current_var_uses; - current_var_uses = NULL; + Value *old_running_block = running_block; + Value *old_current_var_uses = current_var_uses; + current_var_uses = NULL; - if (has_dvars) { - Value *dvars_arg = arg++; - dvars_arg->setName("dvars"); - running_block = arg++; - running_block->setName("running_block"); - } - else { - running_block = NULL; - } + if (has_dvars) { + Value *dvars_arg = arg++; + dvars_arg->setName("dvars"); + running_block = arg++; + running_block->setName("running_block"); + } + else { + running_block = NULL; + } - current_block_arg = NULL; - if (node->nd_tbl != NULL) { - bool has_vars_to_save = false; - int i, args_count = (int)node->nd_tbl[0]; - assert(args_count == nargs - || args_count == nargs + 1 /* optional block */ - || args_count == nargs - 1 /* unnamed param (|x,|) */); - for (i = 0; i < args_count; i++) { - ID id = node->nd_tbl[i + 1]; + current_block_arg = NULL; + if (node->nd_tbl != NULL) { + bool has_vars_to_save = false; + int i, args_count = (int)node->nd_tbl[0]; + assert(args_count == nargs + || args_count == nargs + 1 /* optional block */ + || args_count == nargs - 1 /* unnamed param (|x,|) */); + for (i = 0; i < args_count; i++) { + ID id = node->nd_tbl[i + 1]; #if ROXOR_COMPILER_DEBUG - printf("arg %s\n", rb_id2name(id)); + printf("arg %s\n", rb_id2name(id)); #endif - Value *val = NULL; - if (i < nargs) { - val = arg++; - val->setName(rb_id2name(id)); - } - else { - // Optional block. - if (currentBlockObjectFunc == NULL) { - // VALUE rb_vm_current_block_object(void); - currentBlockObjectFunc = cast<Function>( - module->getOrInsertFunction("rb_vm_current_block_object", - RubyObjTy, NULL)); - } - val = CallInst::Create(currentBlockObjectFunc, "", bb); - current_block_arg = val; - } - Value *slot = new AllocaInst(RubyObjTy, "", bb); - new StoreInst(val, slot, bb); - lvars[id] = slot; - has_vars_to_save = true; - } + Value *val = NULL; + if (i < nargs) { + val = arg++; + val->setName(rb_id2name(id)); + } + else { + // Optional block. + if (currentBlockObjectFunc == NULL) { + // VALUE rb_vm_current_block_object(void); + currentBlockObjectFunc = cast<Function>( + module->getOrInsertFunction( + "rb_vm_current_block_object", RubyObjTy, NULL)); + } + val = CallInst::Create(currentBlockObjectFunc, "", bb); + current_block_arg = val; + } + Value *slot = new AllocaInst(RubyObjTy, "", bb); + new StoreInst(val, slot, bb); + lvars[id] = slot; + has_vars_to_save = true; + } - // local vars must be created before the optional arguments - // because they can be used in them, for instance with def f(a=b=c=1) - if (compile_lvars(&node->nd_tbl[args_count + 1])) { - has_vars_to_save = true; - } + // Local vars must be created before the optional arguments + // because they can be used in them, for instance with def f(a=b=c=1). + if (compile_lvars(&node->nd_tbl[args_count + 1])) { + has_vars_to_save = true; + } - if (has_vars_to_save) { - current_var_uses = new AllocaInst(PtrTy, "", bb); - new StoreInst(compile_const_pointer(NULL), - current_var_uses, bb); + if (has_vars_to_save) { + current_var_uses = new AllocaInst(PtrTy, "", bb); + new StoreInst(compile_const_pointer(NULL), + current_var_uses, bb); - new_rescue_invoke_bb = BasicBlock::Create(context, - "rescue_save_vars", f); - new_rescue_rethrow_bb = BasicBlock::Create(context, - "rescue_save_vars.rethrow", f); - rescue_invoke_bb = new_rescue_invoke_bb; - rescue_rethrow_bb = new_rescue_rethrow_bb; - } + new_rescue_invoke_bb = BasicBlock::Create(context, + "rescue_save_vars", f); + new_rescue_rethrow_bb = BasicBlock::Create(context, + "rescue_save_vars.rethrow", f); + rescue_invoke_bb = new_rescue_invoke_bb; + rescue_rethrow_bb = new_rescue_rethrow_bb; + } - NODE *args_node = node->nd_args; - if (args_node != NULL) { - // compile multiple assignment arguments (def f((a, b, v))) - // (this must also be done after the creation of local variables) - NODE *rest_node = args_node->nd_next; - if (rest_node != NULL) { - NODE *right_req_node = rest_node->nd_next; - if (right_req_node != NULL) { - NODE *last_node = right_req_node->nd_next; - if (last_node != NULL) { - assert(nd_type(last_node) == NODE_AND); - // multiple assignment for the left-side required arguments - if (last_node->nd_1st != NULL) { - compile_node(last_node->nd_1st); - } - // multiple assignment for the right-side required arguments - if (last_node->nd_2nd != NULL) { - compile_node(last_node->nd_2nd); - } - } - } + NODE *args_node = node->nd_args; + if (args_node != NULL) { + // Compile multiple assignment arguments (def f((a, b, v))). + // This must also be done after the creation of local variables. + NODE *rest_node = args_node->nd_next; + if (rest_node != NULL) { + NODE *right_req_node = rest_node->nd_next; + if (right_req_node != NULL) { + NODE *last_node = right_req_node->nd_next; + if (last_node != NULL) { + assert(nd_type(last_node) == NODE_AND); + // Multiple assignment for the left-side required + // arguments. + if (last_node->nd_1st != NULL) { + compile_node(last_node->nd_1st); } - - // Compile optional arguments. - Function::ArgumentListType::iterator iter = f->arg_begin(); - ++iter; // skip self - ++iter; // skip sel - NODE *opt_node = args_node->nd_opt; - if (opt_node != NULL) { - int to_skip = args_node->nd_frml; - if (has_dvars) { - to_skip += 2; // dvars array and currently running block - } - for (i = 0; i < to_skip; i++) { - ++iter; // skip dvars and args required on the left-side - } - iter = compile_optional_arguments(iter, opt_node); + // Multiple assignment for the right-side required + // arguments. + if (last_node->nd_2nd != NULL) { + compile_node(last_node->nd_2nd); } } } + } - Value *val = NULL; - if (node->nd_body != NULL) { - entry_bb = BasicBlock::Create(context, "entry_point", f); - BranchInst::Create(entry_bb, bb); - bb = entry_bb; + // Compile optional arguments. + Function::ArgumentListType::iterator iter = f->arg_begin(); + ++iter; // skip self + ++iter; // skip sel + NODE *opt_node = args_node->nd_opt; + if (opt_node != NULL) { + int to_skip = args_node->nd_frml; + if (has_dvars) { + to_skip += 2; // dvars array and currently running block + } + for (i = 0; i < to_skip; i++) { + ++iter; // skip dvars and args required on the left-side + } + iter = compile_optional_arguments(iter, opt_node); + } + } + } - rb_vm_arity_t old_current_arity = current_arity; - current_arity = arity; + Value *val = NULL; + if (node->nd_body != NULL) { + entry_bb = BasicBlock::Create(context, "entry_point", f); + BranchInst::Create(entry_bb, bb); + bb = entry_bb; - DEBUG_LEVEL_INC(); - val = compile_node(node->nd_body); - DEBUG_LEVEL_DEC(); + rb_vm_arity_t old_current_arity = current_arity; + Function *old_current_non_block_func = current_non_block_func; + if (!block_declaration) { + current_non_block_func = f; + current_arity = arity; + } - current_arity = old_current_arity; + DEBUG_LEVEL_INC(); + val = compile_node(node->nd_body); + DEBUG_LEVEL_DEC(); + + current_non_block_func = old_current_non_block_func; + current_arity = old_current_arity; + } + if (val == NULL) { + val = nilVal; + } + + ReturnInst::Create(context, val, bb); + + // The rethrows after the save of variables must be real rethrows. + rescue_rethrow_bb = NULL; + rescue_invoke_bb = NULL; + + // Current_lvar_uses has 2 uses or more if it is really used. + // (there is always a StoreInst in which we assign it NULL) + if (current_var_uses != NULL && current_var_uses->hasNUsesOrMore(2)) { + // Searches all ReturnInst in the function we just created and add + // before a call to the function to save the local variables if + // necessary (we can't do this before finishing compiling the whole + // function because we can't be sure if the function contains a block + // or not before). + std::vector<ReturnInst *> to_fix; + for (Function::iterator block_it = f->begin(); + block_it != f->end(); + ++block_it) { + for (BasicBlock::iterator inst_it = block_it->begin(); + inst_it != block_it->end(); + ++inst_it) { + ReturnInst *inst = dyn_cast<ReturnInst>(inst_it); + if (inst != NULL) { + to_fix.push_back(inst); } - if (val == NULL) { - val = nilVal; - } + } + } + // We have to process the blocks in a second loop because + // we can't modify the blocks while iterating on them. + for (std::vector<ReturnInst *>::iterator inst_it = to_fix.begin(); + inst_it != to_fix.end(); + ++inst_it) { - ReturnInst::Create(context, val, bb); + ReturnInst *inst = *inst_it; + BasicBlock *startBB = inst->getParent(); + BasicBlock *mergeBB = startBB->splitBasicBlock(inst, "merge"); + // We do not want the BranchInst added by splitBasicBlock. + startBB->getInstList().pop_back(); + compile_keep_vars(startBB, mergeBB); + } - // the rethrows after the save of variables must be real rethrows - rescue_rethrow_bb = NULL; - rescue_invoke_bb = NULL; + if (new_rescue_invoke_bb->use_empty() + && new_rescue_rethrow_bb->use_empty()) { + new_rescue_invoke_bb->eraseFromParent(); + new_rescue_rethrow_bb->eraseFromParent(); + } + else { + if (new_rescue_invoke_bb->use_empty()) { + new_rescue_invoke_bb->eraseFromParent(); + } + else { + bb = new_rescue_invoke_bb; + compile_landing_pad_header(); + BranchInst::Create(new_rescue_rethrow_bb, bb); + } - // current_lvar_uses has 2 uses or more if it is really used - // (there is always a StoreInst in which we assign it NULL) - if (current_var_uses != NULL && current_var_uses->hasNUsesOrMore(2)) { - // searches all ReturnInst in the function we just created and add before - // a call to the function to save the local variables if necessary - // (we can't do this before finishing compiling the whole function - // because we can't be sure if the function contains a block or not before) - std::vector<ReturnInst *> to_fix; - for (Function::iterator block_it = f->begin(); - block_it != f->end(); - ++block_it) { - for (BasicBlock::iterator inst_it = block_it->begin(); - inst_it != block_it->end(); - ++inst_it) { - ReturnInst *inst = dyn_cast<ReturnInst>(inst_it); - if (inst != NULL) { - to_fix.push_back(inst); - } - } - } - // we have to process the blocks in a second loop because - // we can't modify the blocks while iterating on them - for (std::vector<ReturnInst *>::iterator inst_it = to_fix.begin(); - inst_it != to_fix.end(); - ++inst_it) { + bb = new_rescue_rethrow_bb; + BasicBlock *mergeBB = BasicBlock::Create(context, + "merge", f); + compile_keep_vars(bb, mergeBB); - ReturnInst *inst = *inst_it; - BasicBlock *startBB = inst->getParent(); - BasicBlock *mergeBB = startBB->splitBasicBlock(inst, "merge"); - // we do not want the BranchInst added by splitBasicBlock - startBB->getInstList().pop_back(); - compile_keep_vars(startBB, mergeBB); - } + bb = mergeBB; + compile_rethrow_exception(); + } + } + else if (current_var_uses != NULL) { + for (BasicBlock::use_iterator rescue_use_it = + new_rescue_invoke_bb->use_begin(); + rescue_use_it != new_rescue_invoke_bb->use_end(); + rescue_use_it = new_rescue_invoke_bb->use_begin()) { + InvokeInst* invoke = dyn_cast<InvokeInst>(rescue_use_it); + assert(invoke != NULL); - if (new_rescue_invoke_bb->use_empty() && new_rescue_rethrow_bb->use_empty()) { - new_rescue_invoke_bb->eraseFromParent(); - new_rescue_rethrow_bb->eraseFromParent(); - } - else { - if (new_rescue_invoke_bb->use_empty()) { - new_rescue_invoke_bb->eraseFromParent(); - } - else { - bb = new_rescue_invoke_bb; - compile_landing_pad_header(); - BranchInst::Create(new_rescue_rethrow_bb, bb); - } + // Transform the InvokeInst in CallInst. + std::vector<Value *> params; + for (InvokeInst::op_iterator op_it = invoke->op_begin()+3; + op_it != invoke->op_end(); ++op_it) { + params.push_back(op_it->get()); + } + CallInst *call_inst = CallInst::Create( + invoke->getOperand(0), + params.begin(), params.end(), + invoke->getNameStr(), + invoke); - bb = new_rescue_rethrow_bb; - BasicBlock *mergeBB = BasicBlock::Create(context, - "merge", f); - compile_keep_vars(bb, mergeBB); + invoke->replaceAllUsesWith(call_inst); + BasicBlock *normal_bb = dyn_cast<BasicBlock>(invoke->getOperand(1)); + assert(normal_bb != NULL); + BranchInst::Create(normal_bb, invoke); + invoke->eraseFromParent(); + } + new_rescue_invoke_bb->eraseFromParent(); - bb = mergeBB; - compile_rethrow_exception(); - } - } - else if (current_var_uses != NULL) { - for (BasicBlock::use_iterator rescue_use_it = new_rescue_invoke_bb->use_begin(); - rescue_use_it != new_rescue_invoke_bb->use_end(); - rescue_use_it = new_rescue_invoke_bb->use_begin()) { - InvokeInst* invoke = dyn_cast<InvokeInst>(rescue_use_it); - assert(invoke != NULL); + if (new_rescue_rethrow_bb->use_empty()) { + new_rescue_rethrow_bb->eraseFromParent(); + } + else { + bb = new_rescue_rethrow_bb; + compile_rethrow_exception(); + } + } - // transform the InvokeInst in CallInst - std::vector<Value *> params; - for (InvokeInst::op_iterator op_it = invoke->op_begin()+3; - op_it != invoke->op_end(); ++op_it) { - params.push_back(op_it->get()); - } - CallInst *call_inst = CallInst::Create( - invoke->getOperand(0), - params.begin(), params.end(), - invoke->getNameStr(), - invoke); + rescue_rethrow_bb = old_rescue_rethrow_bb; + rescue_invoke_bb = old_rescue_invoke_bb; - invoke->replaceAllUsesWith(call_inst); - BasicBlock *normal_bb = dyn_cast<BasicBlock>(invoke->getOperand(1)); - assert(normal_bb != NULL); - BranchInst::Create(normal_bb, invoke); - invoke->eraseFromParent(); - } - new_rescue_invoke_bb->eraseFromParent(); + bb = old_bb; + entry_bb = old_entry_bb; + lvars = old_lvars; + current_self = old_self; + current_var_uses = old_current_var_uses; + running_block = old_running_block; + debug_subprogram = old_debug_subprogram; - if (new_rescue_rethrow_bb->use_empty()) { - new_rescue_rethrow_bb->eraseFromParent(); - } - else { - bb = new_rescue_rethrow_bb; - compile_rethrow_exception(); - } - } + return f; +} - rescue_rethrow_bb = old_rescue_rethrow_bb; - rescue_invoke_bb = old_rescue_invoke_bb; +Value * +RoxorCompiler::compile_node(NODE *node) +{ +#if ROXOR_COMPILER_DEBUG + printf("%s:%ld ", fname, nd_line(node)); + for (int i = 0; i < level; i++) { + printf("..."); + } + printf("... %s\n", ruby_node_name(nd_type(node))); +#endif + if (current_line != nd_line(node)) { + current_line = nd_line(node); + if (debug_mode) { + compile_debug_trap(); + } + } - bb = old_bb; - entry_bb = old_entry_bb; - lvars = old_lvars; - current_self = old_self; - current_var_uses = old_current_var_uses; - running_block = old_running_block; - debug_subprogram = old_debug_subprogram; + switch (nd_type(node)) { + case NODE_SCOPE: + return cast<Value>(compile_scope(node)); - return cast<Value>(f); - } - break; - case NODE_DVAR: case NODE_LVAR: - { - assert(node->nd_vid > 0); + assert(node->nd_vid > 0); + return new LoadInst(compile_lvar_slot(node->nd_vid), "", bb); - return new LoadInst(compile_lvar_slot(node->nd_vid), "", bb); - } - break; - case NODE_GVAR: { assert(node->nd_vid > 0); @@ -3404,14 +3415,16 @@ if (gvarGetFunc == NULL) { // VALUE rb_gvar_get(struct global_entry *entry); - gvarGetFunc = cast<Function>(module->getOrInsertFunction("rb_gvar_get", RubyObjTy, PtrTy, NULL)); + gvarGetFunc = cast<Function>(module->getOrInsertFunction( + "rb_gvar_get", RubyObjTy, PtrTy, NULL)); } std::vector<Value *> params; params.push_back(compile_global_entry(node)); - return CallInst::Create(gvarGetFunc, params.begin(), params.end(), "", bb); + return CallInst::Create(gvarGetFunc, params.begin(), + params.end(), "", bb); } break; @@ -4127,12 +4140,10 @@ bool positive_arity = false; if (nd_type(node) == NODE_ZSUPER) { assert(args == NULL); - int arity = bb->getParent()->getArgumentList().size(); - arity -= 2; // skip self and sel - if (block_declaration) { - arity -= 2; // skip dvar and current_block - } - positive_arity = arity > 0; + assert(current_non_block_func != NULL); + positive_arity = + current_non_block_func->getArgumentList().size() + - 2 /* skip self and sel */ > 0; } else { NODE *n = args; @@ -4276,19 +4287,12 @@ int argc = 0; if (nd_type(node) == NODE_ZSUPER) { Function::ArgumentListType &fargs = - bb->getParent()->getArgumentList(); + current_non_block_func->getArgumentList(); const int fargs_arity = fargs.size() - 2; - const int arity = block_declaration - ? fargs_arity - 2 // skip dvars and current_block - : fargs_arity; - params.push_back(ConstantInt::get(Int32Ty, arity)); + params.push_back(ConstantInt::get(Int32Ty, fargs_arity)); Function::ArgumentListType::iterator iter = fargs.begin(); iter++; // skip self iter++; // skip sel - if (block_declaration) { - iter++; // skip dvars - iter++; // skip current_block - } const int rest_pos = current_arity.max == -1 ? (current_arity.left_req + (current_arity.real - current_arity.min - 1)) @@ -4302,7 +4306,20 @@ // We can't simply push the direct argument address // because if may have a default value. ID argid = rb_intern(iter->getName().data()); - Value *argslot = compile_lvar_slot(argid); + Value *argslot; + if (block_declaration) { + if (std::find(dvars.begin(), dvars.end(), argid) + == dvars.end()) { + // Dvar does not exist yet, so we create it + // on demand! + dvars.push_back(argid); + } + argslot = compile_dvar_slot(argid); + } + else { + argslot = compile_lvar_slot(argid); + } + params.push_back(new LoadInst(argslot, "", bb)); ++i; Modified: MacRuby/trunk/compiler.h =================================================================== --- MacRuby/trunk/compiler.h 2010-04-04 04:11:15 UTC (rev 3905) +++ MacRuby/trunk/compiler.h 2010-04-04 06:07:54 UTC (rev 3906) @@ -113,6 +113,7 @@ bool current_rescue; NODE *current_block_node; Function *current_block_func; + Function *current_non_block_func; GlobalVariable *current_opened_class; bool dynamic_class; bool current_module; @@ -254,6 +255,7 @@ return compile_const_pointer(ptr, PtrPtrTy); } + Function *compile_scope(NODE *node); Instruction *compile_protected_call(Value *imp, std::vector<Value *> &params); void compile_dispatch_arguments(NODE *args,

1 0

[3905] MacRuby/trunk/object.c
by source_changes＠macosforge.org 04 Apr '10

04 Apr '10

Revision: 3905 http://trac.macosforge.org/projects/ruby/changeset/3905 Author: lsansonetti(a)apple.com Date: 2010-04-03 21:11:15 -0700 (Sat, 03 Apr 2010) Log Message: ----------- c99 mode Modified Paths: -------------- MacRuby/trunk/object.c Modified: MacRuby/trunk/object.c =================================================================== --- MacRuby/trunk/object.c 2010-04-04 03:00:09 UTC (rev 3904) +++ MacRuby/trunk/object.c 2010-04-04 04:11:15 UTC (rev 3905) @@ -607,8 +607,7 @@ if (is_module) { VALUE ary = rb_attr_get(cl, idIncludedModules); if (ary != Qnil) { - int i, count; - for (i = 0, count = RARRAY_LEN(ary); i < count; i++) { + for (int i = 0, count = RARRAY_LEN(ary); i < count; i++) { VALUE imod = RARRAY_AT(ary, i); if (imod == c) { return Qtrue; @@ -2002,9 +2001,7 @@ static VALUE rb_mod_attr_reader(VALUE klass, SEL sel, int argc, VALUE *argv) { - int i; - - for (i=0; i<argc; i++) { + for (int i = 0; i < argc; i++) { rb_attr(klass, rb_to_id(argv[i]), Qtrue, Qfalse, Qtrue); } return Qnil; @@ -2032,9 +2029,7 @@ static VALUE rb_mod_attr_writer(VALUE klass, SEL sel, int argc, VALUE *argv) { - int i; - - for (i=0; i<argc; i++) { + for (int i = 0; i < argc; i++) { rb_attr(klass, rb_to_id(argv[i]), Qfalse, Qtrue, Qtrue); } return Qnil; @@ -2058,9 +2053,7 @@ static VALUE rb_mod_attr_accessor(VALUE klass, SEL sel, int argc, VALUE *argv) { - int i; - - for (i=0; i<argc; i++) { + for (int i = 0; i < argc; i++) { rb_attr(klass, rb_to_id(argv[i]), Qtrue, Qtrue, Qtrue); } return Qnil;

1 0

[3904] MacRuby/trunk/parse.y
by source_changes＠macosforge.org 04 Apr '10

04 Apr '10

Revision: 3904 http://trac.macosforge.org/projects/ruby/changeset/3904 Author: lsansonetti(a)apple.com Date: 2010-04-03 20:00:09 -0700 (Sat, 03 Apr 2010) Log Message: ----------- fixed ripper parsing Modified Paths: -------------- MacRuby/trunk/parse.y Modified: MacRuby/trunk/parse.y =================================================================== --- MacRuby/trunk/parse.y 2010-04-03 20:27:38 UTC (rev 3903) +++ MacRuby/trunk/parse.y 2010-04-04 03:00:09 UTC (rev 3904) @@ -9924,18 +9924,29 @@ Data_Get_Struct(self, struct parser_params, parser); rb_scan_args(argc, argv, "12", &src, &fname, &lineno); -#if 0 // TODO - if (rb_obj_respond_to(src, ripper_id_gets, 0)) { - parser->parser_lex_gets = ripper_lex_get_generic; + + UChar *chars = NULL; + long chars_len = 0; + bool need_free = false; + rb_str_get_uchars(src, &chars, &chars_len, &need_free); + + if (need_free) { + UChar *tmp = (UChar *)xmalloc(sizeof(UChar) * chars_len); + memcpy(tmp, chars, sizeof(UChar) * chars_len); + free(chars); + chars = tmp; } - else -#endif - { - StringValue(src); - parser->parser_lex_gets = lex_get_str; - } - GC_WB(&parser->parser_lex_input, src); + + struct lex_get_str_context *ctx = (struct lex_get_str_context *) + xmalloc(sizeof(struct lex_get_str_context)); + GC_WB(&ctx->str, src); + ctx->chars = chars; + ctx->chars_len = chars_len; + + parser->parser_lex_gets = lex_get_str; + GC_WB(&parser->parser_lex_input, ctx); parser->eofp = Qfalse; + if (NIL_P(fname)) { fname = STR_NEW2("(ripper)"); }

1 0

[3903] MacRuby/trunk/io.c
by source_changes＠macosforge.org 03 Apr '10

03 Apr '10

Revision: 3903 http://trac.macosforge.org/projects/ruby/changeset/3903 Author: lsansonetti(a)apple.com Date: 2010-04-03 13:27:38 -0700 (Sat, 03 Apr 2010) Log Message: ----------- fixed #sysseek definition Modified Paths: -------------- MacRuby/trunk/io.c Modified: MacRuby/trunk/io.c =================================================================== --- MacRuby/trunk/io.c 2010-04-02 00:53:53 UTC (rev 3902) +++ MacRuby/trunk/io.c 2010-04-03 20:27:38 UTC (rev 3903) @@ -4594,7 +4594,7 @@ rb_objc_define_method(rb_cIO, "isatty", rb_io_isatty, 0); rb_objc_define_method(rb_cIO, "tty?", rb_io_isatty, 0); rb_objc_define_method(rb_cIO, "binmode", rb_io_binmode_m, 0); - rb_objc_define_method(rb_cIO, "sysseek", rb_io_seek, -1); + rb_objc_define_method(rb_cIO, "sysseek", rb_io_seek_m, -1); rb_objc_define_method(rb_cIO, "ioctl", rb_io_ioctl, -1); rb_objc_define_method(rb_cIO, "fcntl", rb_io_fcntl, -1);

1 0

[3902] MacRuby/trunk/string.c
by source_changes＠macosforge.org 02 Apr '10

02 Apr '10

Revision: 3902 http://trac.macosforge.org/projects/ruby/changeset/3902 Author: lsansonetti(a)apple.com Date: 2010-04-01 17:53:53 -0700 (Thu, 01 Apr 2010) Log Message: ----------- implemented NSString version of some MRI primitives Modified Paths: -------------- MacRuby/trunk/string.c Modified: MacRuby/trunk/string.c =================================================================== --- MacRuby/trunk/string.c 2010-04-01 22:10:02 UTC (rev 3901) +++ MacRuby/trunk/string.c 2010-04-02 00:53:53 UTC (rev 3902) @@ -6003,7 +6003,8 @@ str_concat_string(RSTR(str), RSTR(substr)); } else { - abort(); // TODO + abort(); // TODO + } return str; } @@ -6117,7 +6118,10 @@ if (TYPE(str) == T_SYMBOL) { return rb_sym_to_s(str); } - abort(); // TODO + CFMutableStringRef copy + = CFStringCreateMutableCopy(NULL, 0, (CFStringRef)str); + CFMakeCollectable(copy); + return (VALUE)copy; } // Unicode characters hashing function, copied from CoreFoundation. @@ -6190,22 +6194,21 @@ } VALUE -rb_str_inspect(VALUE rcv) +rb_str_inspect(VALUE str) { - if (RSTR(rcv)) { - return rstr_inspect(rcv, 0); + if (!IS_RSTR(str)) { + str = (VALUE)str_need_string(str); } - // TODO - return rcv; + return rstr_inspect(str, 0); } VALUE rb_str_subseq(VALUE str, long beg, long len) { - if (IS_RSTR(str)) { - return rstr_substr(str, beg, len); + if (!IS_RSTR(str)) { + str = (VALUE)str_need_string(str); } - abort(); // TODO + return rstr_substr(str, beg, len); } VALUE @@ -6221,7 +6224,8 @@ rstr_splice(str, beg, len, val); } else { - abort(); // TODO + CFStringReplace((CFMutableStringRef)str, CFRangeMake(beg, len), + (CFStringRef)val); } } @@ -6232,7 +6236,7 @@ str_delete(RSTR(str), beg, len, false); } else { - abort(); // TODO + CFStringDelete((CFMutableStringRef)str, CFRangeMake(beg, len)); } }

1 0

[3901] MacRuby/trunk
by source_changes＠macosforge.org 01 Apr '10

01 Apr '10

Revision: 3901 http://trac.macosforge.org/projects/ruby/changeset/3901 Author: lsansonetti(a)apple.com Date: 2010-04-01 15:10:02 -0700 (Thu, 01 Apr 2010) Log Message: ----------- added xmalloc_ptrs() function and use it when it's necessary Modified Paths: -------------- MacRuby/trunk/array.c MacRuby/trunk/array.h MacRuby/trunk/compiler.cpp MacRuby/trunk/dispatcher.cpp MacRuby/trunk/gc.c MacRuby/trunk/include/ruby/defines.h MacRuby/trunk/vm.cpp MacRuby/trunk/vm.h Modified: MacRuby/trunk/array.c =================================================================== --- MacRuby/trunk/array.c 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/array.c 2010-04-01 22:10:02 UTC (rev 3901) @@ -45,11 +45,16 @@ if (rary->cap > 0) { newlen *= 2; } - VALUE *new_elements = xrealloc(rary->elements, - sizeof(VALUE) * newlen); - if (new_elements != rary->elements) { - GC_WB(&rary->elements, new_elements); + if (rary->elements == NULL) { + GC_WB(&rary->elements, xmalloc_ptrs(sizeof(VALUE) * newlen)); } + else { + VALUE *new_elements = xrealloc(rary->elements, + sizeof(VALUE) * newlen); + if (new_elements != rary->elements) { + GC_WB(&rary->elements, new_elements); + } + } rary->cap = newlen; } } Modified: MacRuby/trunk/array.h =================================================================== --- MacRuby/trunk/array.h 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/array.h 2010-04-01 22:10:02 UTC (rev 3901) @@ -1,5 +1,5 @@ /* - * MacRuby Hash. + * MacRuby Array. * * This file is covered by the Ruby license. See COPYING for more details. * Modified: MacRuby/trunk/compiler.cpp =================================================================== --- MacRuby/trunk/compiler.cpp 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/compiler.cpp 2010-04-01 22:10:02 UTC (rev 3901) @@ -6677,7 +6677,7 @@ va_list ar; va_start(ar, argc); - VALUE *data = (VALUE *)xmalloc(argc * sizeof(VALUE)); + VALUE *data = (VALUE *)xmalloc_ptrs(argc * sizeof(VALUE)); for (int i = 0; i < argc; ++i) { VALUE field = va_arg(ar, VALUE); GC_WB(&data[i], field); Modified: MacRuby/trunk/dispatcher.cpp =================================================================== --- MacRuby/trunk/dispatcher.cpp 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/dispatcher.cpp 2010-04-01 22:10:02 UTC (rev 3901) @@ -78,7 +78,7 @@ IMP pimp, const rb_vm_arity_t &arity, int argc, const VALUE *argv) { if ((arity.real != argc) || (arity.max == -1)) { - VALUE *new_argv = (VALUE *)xmalloc(sizeof(VALUE) * arity.real); + VALUE *new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * arity.real); __rb_vm_fix_args(argv, new_argv, arity, argc); argv = new_argv; argc = arity.real; @@ -123,7 +123,7 @@ int argc, const VALUE *argv) { if ((arity.real != argc) || (arity.max == -1)) { - VALUE *new_argv = (VALUE *)xmalloc(sizeof(VALUE) * arity.real); + VALUE *new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * arity.real); __rb_vm_fix_args(argv, new_argv, arity, argc); argv = new_argv; argc = arity.real; @@ -350,7 +350,7 @@ GET_VM()->set_method_missing_reason(call_status); - VALUE *new_argv = (VALUE *)xmalloc(sizeof(VALUE) * (argc + 1)); + VALUE *new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * (argc + 1)); char buf[100]; int n = snprintf(buf, sizeof buf, "%s", sel_getName(sel)); @@ -993,7 +993,7 @@ int count = RARRAY_LEN(ary); if (real_argc + count >= argv_size) { const size_t new_argv_size = real_argc + count + 100; - VALUE *new_argv = (VALUE *)xmalloc(sizeof(VALUE) + VALUE *new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * new_argv_size); memcpy(new_argv, argv, sizeof(VALUE) * argv_size); argv = new_argv; @@ -1007,7 +1007,7 @@ else { if (real_argc >= argv_size) { const size_t new_argv_size = real_argc + 100; - VALUE *new_argv = (VALUE *)xmalloc(sizeof(VALUE) + VALUE *new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * new_argv_size); memcpy(new_argv, argv, sizeof(VALUE) * argv_size); argv = new_argv; @@ -1513,7 +1513,7 @@ && (arity.min > 1 || (arity.min == 1 && arity.min != arity.max))) { // Expand the array. long ary_len = RARRAY_LEN(argv[0]); - new_argv = (VALUE *)xmalloc(sizeof(VALUE) * ary_len); + new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * ary_len); for (int i = 0; i < ary_len; i++) { new_argv[i] = RARRAY_AT(argv[0], i); } @@ -1533,7 +1533,7 @@ else { new_argc = argc; } - new_argv = (VALUE *)xmalloc(sizeof(VALUE) * new_argc); + new_argv = (VALUE *)xmalloc_ptrs(sizeof(VALUE) * new_argc); for (int i = 0; i < new_argc; i++) { new_argv[i] = i < argc ? argv[i] : Qnil; } Modified: MacRuby/trunk/gc.c =================================================================== --- MacRuby/trunk/gc.c 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/gc.c 2010-04-01 22:10:02 UTC (rev 3901) @@ -109,11 +109,9 @@ exit(1); } -void * -ruby_xmalloc(size_t size) +static inline void * +ruby_xmalloc_memory(size_t size, int type) { - void *mem; - if (size < 0) { rb_raise(rb_eNoMemError, "negative allocation size (or too big)"); } @@ -124,16 +122,32 @@ rb_objc_no_gc_error(); } - mem = auto_zone_allocate_object(__auto_zone, size, - AUTO_MEMORY_SCANNED, 0, 0); + void *mem = auto_zone_allocate_object(__auto_zone, size, type, 0, 0); if (mem == NULL) { rb_memerror(); } - return mem; } void * +ruby_xmalloc(size_t size) +{ + return ruby_xmalloc_memory(size, AUTO_MEMORY_SCANNED); +} + +void * +ruby_xmalloc_ptrs(size_t size) +{ + int type; +#if MAC_OS_X_VERSION_MAX_ALLOWED >= 1070 + type = AUTO_MEMORY_ALL_POINTERS; +#else + type = AUTO_MEMORY_SCANNED; +#endif + return ruby_xmalloc_memory(size, type); +} + +void * ruby_xmalloc2(size_t n, size_t size) { size_t len = size * n; @@ -146,20 +160,14 @@ void * ruby_xcalloc(size_t n, size_t size) { - void *mem; - - mem = ruby_xmalloc2(n, size); + void *mem = ruby_xmalloc2(n, size); memset(mem, 0, n * size); - return mem; } - void * ruby_xrealloc(void *ptr, size_t size) { - void *mem; - if (size < 0) { rb_raise(rb_eArgError, "negative re-allocation size"); } @@ -171,21 +179,18 @@ } #if MAC_OS_X_VERSION_MAX_ALLOWED < 1060 - { - size_t old_size = malloc_size(ptr); - if (old_size >= size) { - return ptr; - } - mem = ruby_xmalloc(size); - if (mem == NULL) { - rb_memerror(); - } - auto_zone_write_barrier_memmove(__auto_zone, mem, ptr, old_size); - xfree(ptr); + size_t old_size = malloc_size(ptr); + if (old_size >= size) { + return ptr; } + void *mem = ruby_xmalloc(size); + if (mem == NULL) { + rb_memerror(); + } + auto_zone_write_barrier_memmove(__auto_zone, mem, ptr, old_size); + xfree(ptr); #else - mem = malloc_zone_realloc(__auto_zone, ptr, size); - + void *mem = malloc_zone_realloc(__auto_zone, ptr, size); if (mem == NULL) { rb_memerror(); } @@ -213,7 +218,6 @@ } } - /* * call-seq: * GC.enable => true or false Modified: MacRuby/trunk/include/ruby/defines.h =================================================================== --- MacRuby/trunk/include/ruby/defines.h 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/include/ruby/defines.h 2010-04-01 22:10:02 UTC (rev 3901) @@ -50,6 +50,7 @@ #endif #define xmalloc ruby_xmalloc +#define xmalloc_ptrs ruby_xmalloc_ptrs #define xmalloc2 ruby_xmalloc2 #define xcalloc ruby_xcalloc #define xrealloc ruby_xrealloc @@ -57,6 +58,7 @@ #define xfree ruby_xfree void *xmalloc(size_t); +void *xmalloc_ptrs(size_t); void *xmalloc2(size_t,size_t); void *xcalloc(size_t,size_t); void *xrealloc(void*,size_t); Modified: MacRuby/trunk/vm.cpp =================================================================== --- MacRuby/trunk/vm.cpp 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/vm.cpp 2010-04-01 22:10:02 UTC (rev 3901) @@ -4660,7 +4660,7 @@ if (argc > 0) { t->argc = argc; - GC_WB(&t->argv, xmalloc(sizeof(VALUE) * argc)); + GC_WB(&t->argv, xmalloc_ptrs(sizeof(VALUE) * argc)); for (int i = 0; i < argc; i++) { GC_WB(&t->argv[i], argv[i]); } Modified: MacRuby/trunk/vm.h =================================================================== --- MacRuby/trunk/vm.h 2010-04-01 21:58:39 UTC (rev 3900) +++ MacRuby/trunk/vm.h 2010-04-01 22:10:02 UTC (rev 3901) @@ -329,11 +329,11 @@ rb_vm_regrow_robject_slots(struct RObject *obj, unsigned int new_num_slot) { unsigned int i; - VALUE *new_slots = (VALUE *)xmalloc(sizeof(VALUE) * (new_num_slot + 1)); - for (i = 0; i < obj->num_slots; i++) { - GC_WB(&new_slots[i], obj->slots[i]); + VALUE *new_slots = (VALUE *)xrealloc(obj->slots, + sizeof(VALUE) * (new_num_slot + 1)); + if (new_slots != obj->slots) { + GC_WB(&obj->slots, new_slots); } - GC_WB(&obj->slots, new_slots); for (i = obj->num_slots; i <= new_num_slot; i++) { obj->slots[i] = Qundef; } @@ -436,7 +436,7 @@ int num_slots = 10; obj = (struct RObject *)rb_objc_newobj(sizeof(struct RObject)); - GC_WB(&obj->slots, xmalloc(num_slots * sizeof(VALUE))); + GC_WB(&obj->slots, xmalloc_ptrs(num_slots * sizeof(VALUE))); OBJSETUP(obj, klass, T_OBJECT); @@ -447,7 +447,6 @@ for (i = 0; i < num_slots; i++) { ROBJECT(obj)->slots[i] = Qundef; } - return (VALUE)obj; }

1 0

[3900] MacRuby/trunk/sample-macruby/Scripts/notify_post.rb
by source_changes＠macosforge.org 01 Apr '10

01 Apr '10

Revision: 3900 http://trac.macosforge.org/projects/ruby/changeset/3900 Author: lsansonetti(a)apple.com Date: 2010-04-01 14:58:39 -0700 (Thu, 01 Apr 2010) Log Message: ----------- adding notify_post.rb sample Added Paths: ----------- MacRuby/trunk/sample-macruby/Scripts/notify_post.rb Added: MacRuby/trunk/sample-macruby/Scripts/notify_post.rb =================================================================== --- MacRuby/trunk/sample-macruby/Scripts/notify_post.rb (rev 0) +++ MacRuby/trunk/sample-macruby/Scripts/notify_post.rb 2010-04-01 21:58:39 UTC (rev 3900) @@ -0,0 +1,6 @@ +# This example sends a BSD notification using notify_post(3) for each +# given argument. + +load_bridge_support_file '/System/Library/BridgeSupport/libSystem.bridgesupport' + +ARGV.each { |x| notify_post(x) }

1 0