rubyx/lib/risc/builtin/integer.rb

184 lines
6.3 KiB
Ruby
Raw Normal View History

module Risc
module Builtin
2018-08-14 10:23:19 +02:00
# integer related kernel functions
# all these functions (return the function they implement) assume interger input
# Also the returned integer object has to be passed in to avoid having to allocate it.
2018-08-14 10:23:19 +02:00
#
# This means the methods will have to be renamed at some point and wrapped
module Integer
module ClassMethods
include CompileHelper
2015-08-07 15:46:55 +02:00
# div by 4, ie shift right by 2
2018-08-14 10:23:19 +02:00
# Mostly created for testing at this point, as it is short
# return new int with result
2018-04-19 09:00:55 +02:00
def div4(context)
compiler = compiler_for(:Integer,:div4 ,{})
builder = compiler.builder(compiler.source)
integer_tmp = builder.allocate_int
builder.build do
integer_self! << message[:receiver]
integer_self.reduce_int
integer_1! << 2
integer_self.op :>> , integer_1
integer_tmp[Parfait::Integer.integer_index] << integer_self
message[:return_value] << integer_tmp
2018-08-08 11:02:24 +02:00
end
compiler.add_mom( Mom::ReturnSequence.new)
return compiler
2015-08-05 17:49:37 +02:00
end
2018-08-14 10:23:19 +02:00
# implemented by the comparison
2018-04-19 21:57:31 +02:00
def >( context )
comparison( :> )
2018-04-19 21:57:31 +02:00
end
2018-08-14 10:23:19 +02:00
# implemented by the comparison
def <( context )
comparison( :< )
2018-04-19 21:57:31 +02:00
end
2018-08-14 10:23:19 +02:00
# implemented by the comparison
2018-04-24 18:45:58 +02:00
def <=( context )
comparison( :<= )
end
2018-08-14 10:23:19 +02:00
# implemented by the comparison
2018-04-24 18:45:58 +02:00
def >=( context )
comparison( :>= )
end
2018-08-14 10:23:19 +02:00
# all (four) comparison operation are quite similar and implemented here
# - reduce the ints (assume int as input)
# - subtract the fixnums
# - check for minus ( < and > )
# - also check for zero (<= and >=)
# - load true or false object into return, depending on check
# - return
def comparison( operator )
compiler = compiler_for(:Integer, operator ,{other: :Integer })
builder = compiler.builder(compiler.source)
builder.build do
integer! << message[:receiver]
integer.reduce_int
integer_reg! << message[:arguments]
integer_reg << integer_reg[Parfait::NamedList.type_length + 0] #"other" is at index 0
integer_reg.reduce_int
swap_names(:integer , :integer_reg) if(operator.to_s.start_with?('<') )
integer.op :- , integer_reg
if_minus false_label
if_zero( false_label ) if operator.to_s.length == 1
object! << Parfait.object_space.true_object
branch merge_label
add_code false_label
object << Parfait.object_space.false_object
add_code merge_label
message[:return_value] << object
2018-04-24 18:45:58 +02:00
end
compiler.add_mom( Mom::ReturnSequence.new)
return compiler
end
2018-08-14 10:23:19 +02:00
# not implemented, would need a itos and that needs "new" (wip)
def putint(context)
compiler = compiler_for(:Integer,:putint ,{})
2018-04-01 14:17:16 +02:00
compiler.add_mom( Mom::ReturnSequence.new)
return compiler
2015-08-05 17:49:37 +02:00
end
2018-08-14 10:23:19 +02:00
# implemented all known binary operators that map straight to machine codes
# this function (similar to comparison):
# - unpacks the intergers to fixnum
# - applies the operator (at a risc level)
# - gets a new integer and stores the result
# - returns the new int
def operator_method( op_sym )
compiler = compiler_for(:Integer, op_sym ,{other: :Integer })
builder = compiler.builder(compiler.source)
integer_tmp = builder.allocate_int
2018-08-08 14:49:47 +02:00
builder.build do
integer! << message[:receiver]
2018-08-08 14:49:47 +02:00
integer.reduce_int
integer_reg! << message[:arguments]
integer_reg << integer_reg[Parfait::NamedList.type_length + 0] #"other" is at index 0
2018-08-08 14:49:47 +02:00
integer_reg.reduce_int
integer.op op_sym , integer_reg
integer_tmp[Parfait::Integer.integer_index] << integer
message[:return_value] << integer_tmp
2018-08-08 14:49:47 +02:00
end
compiler.add_mom( Mom::ReturnSequence.new)
return compiler
end
# as the name suggests, this devides the integer (self) by ten
#
# This version is lifted from some arm assembler tricks and is _much_
# faster than the general div versions. I think it was about three
# times less instructions. Useful for itos
#
# In fact it is possible to generate specific div function for any given
# integer and some are even more faster (as eg div4).
def div10( context )
s = "div_10 "
compiler = compiler_for(:Integer,:div10 ,{})
builder = compiler.builder(compiler.source)
integer_tmp = builder.allocate_int
builder.build do
integer_self! << message[:receiver]
integer_self.reduce_int
integer_1! << integer_self
integer_reg! << integer_self
integer_const! << 1
integer_1.op :>> , integer_const
integer_const << 2
integer_reg.op :>> , integer_const
integer_reg.op :+ , integer_1
integer_const << 4
integer_1 << integer_reg
integer_reg.op :>> , integer_1
integer_reg.op :+ , integer_1
integer_const << 8
integer_1 << integer_reg
integer_1.op :>> , integer_const
integer_reg.op :+ , integer_1
integer_const << 16
integer_1 << integer_reg
integer_1.op :>> , integer_const
integer_reg.op :+ , integer_1
integer_const << 3
integer_reg.op :>> , integer_const
integer_const << 10
integer_1 << integer_reg
integer_1.op :* , integer_const
integer_self.op :- , integer_1
integer_1 << integer_self
integer_const << 6
integer_1.op :+ , integer_const
integer_const << 4
integer_1.op :>> , integer_const
integer_reg.op :+ , integer_1
integer_tmp[Parfait::Integer.integer_index] << integer_reg
message[:return_value] << integer_tmp
end
2018-04-01 13:01:17 +02:00
compiler.add_mom( Mom::ReturnSequence.new)
return compiler
end
end
extend ClassMethods
end
end
end