Sujet : Re: Cost of handling misaligned access
De : robfi680 (at) *nospam* gmail.com (Robert Finch)
Groupes : comp.archDate : 21. Feb 2025, 02:26:57
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vp8kp3$334fu$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
User-Agent : Mozilla Thunderbird
Admittedly part of why I have such mixed feelings on full
compare-and-branch:
Pro: It can offer a performance advantage (in terms of per-clock);
Con: Branch is now beholden to the latency of a Subtract.
Con: it can't compare to a constant
Con: it can't compare floating point
compare to constant, and floating point compares are supported in Q+ so the cons are gone
constant compare is supported with the constant postfix. Because bits are available in the instruction there is also a precision field. One can compare bytes and branch for instance.
Q+ supports all kinds of compares including those generating bit vectors and SETxx, ZSETxx type compares. That is maybe its drawback, supporting too many things.