Lines Matching full:based

60 In _register-based approach_, operands are explicitly encoded in the operation, which results in
71 This example demonstrates a fundamental difference between two approaches. Stack-based approach
73 can be represented with a single byte, while register-based `add reg_dst, reg_src1, reg_src2` may
76 At the same time, to execute a stack-based addition we need to run 3 instructions compared to
77 just a single register-based instruction. Since the interpreter has an extra work to do to read
79 more _dispatch overhead_. Which means that the stack-based bytecode is slower by nature.
81 According to our experiment, uncompressed register-based bytecode can be reduced by ~26%
82 if substituted by a stack-based analogue. At the same time, performance becomes 10%-40% worse
87 **Panda uses register-based instruction set architecture**.
95 ~20% compared to pure register-based bytecode.
112 some "stack-based'ness" into an otherwise register-based instruction set in attempt to make the
157 to the stack-based approach. Of course, if virtual registers have large numbers that do no fit
177 (acc-reg-reg, acc-reg, acc-imm) and integer-based jumps, but not for floating-point arithmetic