rubyx/lib/register/instruction.rb

199 lines
5.4 KiB
Ruby
Raw Normal View History

2014-05-03 21:18:04 +02:00
require_relative "code"
2014-08-22 16:40:09 +02:00
module Register
2014-05-03 14:13:44 +02:00
2014-08-22 17:00:23 +02:00
# The register machine model is close to current hardware and has following instruction classes
2014-05-03 14:13:44 +02:00
# - Memory
# - Stack
# - Logic
# - Math
# - Control/Compare
# - Move
# - Call
# Instruction derives from Code, for the assembly api
2014-05-03 21:18:04 +02:00
class Instruction < Virtual::Object
def initialize options
2014-05-05 14:59:29 +02:00
@attributes = options
2014-05-03 21:18:04 +02:00
end
attr_reader :attributes
2014-05-19 10:28:13 +02:00
def opcode
@attributes[:opcode]
end
2014-06-12 20:04:15 +02:00
#abstract, only should be called from derived
def to_s
atts = @attributes.dup
atts.delete(:opcode)
atts.delete(:update_status)
atts.delete(:condition_code) if atts[:condition_code] == :al
atts.empty? ? "" : ", #{atts}"
end
2014-06-14 09:59:25 +02:00
# returns an array of registers (RegisterReferences) that this instruction uses.
# ie for r1 = r2 + r3
# which in assembler is add r1 , r2 , r3
# it would return [r2,r3]
# for pushes the list may be longer, whereas for a jump empty
def uses
raise "abstract called for #{self.class}"
end
2014-06-14 09:59:25 +02:00
# returns an array of registers (RegisterReferences) that this instruction assigns to.
# ie for r1 = r2 + r3
# which in assembler is add r1 , r2 , r3
# it would return [r1]
# for most instruction this is one, but comparisons and jumps 0 , and pop's as long as 16
def assigns
raise "abstract called for #{self.class}"
end
def method_missing name , *args , &block
return super unless (args.length <= 1) or block_given?
set , attribute = name.to_s.split("set_")
if set == ""
@attributes[attribute.to_sym] = args[0] || 1
return self
else
return super
end
return @attributes[name.to_sym]
end
2014-05-02 07:02:25 +02:00
end
2014-05-03 14:13:44 +02:00
class StackInstruction < Instruction
2014-05-19 10:28:13 +02:00
def initialize first , options = {}
@first = first
super(options)
end
# when calling we place a dummy push/pop in the stream and calculate later what registers actually need saving
def set_registers regs
@first = regs.collect{ |r| r.symbol }
end
def is_push?
opcode == :push
end
def is_pop?
!is_push?
end
def uses
is_push? ? regs : []
end
def assigns
is_pop? ? regs : []
end
def regs
@first
end
2014-06-12 20:04:15 +02:00
def to_s
2014-06-12 20:40:25 +02:00
"#{opcode} [#{@first.collect {|f| f.to_asm}.join(',') }] #{super}"
2014-06-12 20:04:15 +02:00
end
2014-05-03 14:13:44 +02:00
end
class MemoryInstruction < Instruction
def initialize result , left , right = nil , options = {}
@result = result
@left = left
@right = right
super(options)
end
def uses
2014-06-14 10:12:53 +02:00
ret = [@left.register ]
ret << @right.register unless @right.nil?
ret
end
def assigns
2014-06-14 10:12:53 +02:00
[@result.register]
end
2014-05-03 14:13:44 +02:00
end
class LogicInstruction < Instruction
# result = left op right
#
# Logic instruction are your basic operator implementation. But unlike the (normal) code we write
# these Instructions must have "place" to write their results. Ie when you write 4 + 5 in ruby
# the result is sort of up in the air, but with Instructions the result must be assigned
2014-05-19 10:28:13 +02:00
def initialize result , left , right , options = {}
2014-05-18 11:18:57 +02:00
@result = result
@left = left
@right = right.is_a?(Fixnum) ? Virtual::IntegerConstant.new(right) : right
super(options)
end
attr_accessor :result , :left , :right
def uses
ret = []
2014-06-14 10:12:53 +02:00
ret << @left.register if @left and not @left.is_a? Constant
ret << @right.register if @right and not @right.is_a?(Constant)
ret
end
def assigns
2014-06-14 10:12:53 +02:00
[@result.register]
end
2014-06-17 14:25:33 +02:00
def to_s
2014-06-12 20:40:25 +02:00
"#{opcode} #{result.to_asm} , #{left.to_asm} , #{right.to_asm} #{super}"
2014-06-12 20:04:15 +02:00
end
2014-05-03 14:13:44 +02:00
end
class CompareInstruction < Instruction
2014-05-19 10:28:13 +02:00
def initialize left , right , options = {}
@left = left
@right = right.is_a?(Fixnum) ? IntegerConstant.new(right) : right
super(options)
end
def uses
2014-06-14 10:12:53 +02:00
ret = [@left.register ]
ret << @right.register unless @right.is_a? Constant
ret
end
def assigns
[]
end
2014-06-17 14:25:33 +02:00
def to_s
"#{opcode} #{@left.to_asm} , #{@right.to_asm} #{super}"
end
2014-05-03 14:13:44 +02:00
end
class MoveInstruction < Instruction
2014-05-19 10:28:13 +02:00
def initialize to , from , options = {}
2014-05-18 11:30:49 +02:00
@to = to
@from = from.is_a?(Fixnum) ? Virtual::IntegerConstant.new(from) : from
raise "move must have from set #{inspect}" unless from
super(options)
end
attr_accessor :to , :from
def uses
2014-06-14 10:12:53 +02:00
@from.is_a?(Constant) ? [] : [@from.register]
end
def assigns
2014-06-14 10:12:53 +02:00
[@to.register]
end
2014-06-12 20:04:15 +02:00
def to_s
2014-06-12 20:40:25 +02:00
"#{opcode} #{@to.to_asm} , #{@from.to_asm} #{super}"
2014-06-12 20:04:15 +02:00
end
2014-05-03 14:13:44 +02:00
end
class CallInstruction < Instruction
2014-05-19 10:28:13 +02:00
def initialize first , options = {}
@first = first
super(options)
opcode = @attributes[:opcode].to_s
if opcode.length == 3 and opcode[0] == "b"
@attributes[:condition_code] = opcode[1,2].to_sym
@attributes[:opcode] = :b
end
if opcode.length == 6 and opcode[0] == "c"
@attributes[:condition_code] = opcode[4,2].to_sym
@attributes[:opcode] = :call
end
end
def uses
if opcode == :call
2014-06-14 10:12:53 +02:00
@first.args.collect {|arg| arg.register }
else
[]
end
end
def assigns
if opcode == :call
2014-06-14 09:59:25 +02:00
[RegisterReference.new(RegisterMachine.instance.return_register)]
else
[]
end
end
2014-06-17 14:25:33 +02:00
def to_s
"#{opcode} #{@first.to_asm} #{super}"
end
2014-05-03 14:13:44 +02:00
end
2014-05-02 07:02:25 +02:00
end