Mill Computing, Inc. › Forums › The Mill › Architecture › How do widening arithmetic operators work with static scheduling? › Reply To: How do widening arithmetic operators work with static scheduling?
All operand widths of executing code are known at compile time; there are no dynamic-sized operands in the architecture.
Widening ops widen unconditionally, not just on overflow. The result is a normal operand of the widened width, and subsequent operations take as long as they would for anything of that width. Latency varies by target member; our test targets are specified to do a and 8-byte add in one cycle and a 16 byte add in two.