Article View: comp.lang.asm370
Article #327L/LTR vs ICM
From: grout john robert
Date: Tue, 18 Aug 1992 17:45
Date: Tue, 18 Aug 1992 17:45
22 lines
1419 bytes
1419 bytes
This is posted for Robert Bernecky (rbe@yrloc.ipsa.reuter.com), who wrote the following: a. In any of the S/370s I have used (any of them up to the 3084), ICM timed slower than L/LTR, EVEN WHEN there was no other instruction between the L and the LTR. This is similar to MCVL/CLCL vs MVC/CLC loops (when you didn't need the overlap case, which we often did in APL), where the page or so of code to setup the MVC/CLC loop and the final/first EX Rx,doclc usually ran about TWICE as fast as the single MCVL/CLCL instruction. It made a RISC convert outa me, it did, it did... b. I suspect that if you could schedule the L/LTR properly by moving the L earlier (or the LTR later) in the instruction stream, they would run even faster than ICM. c. ICM can't be indexed, which makes it even lousier than L/LTR. I would have preferred LC (Load Character) and IB (Insert Bits). See B5500 book. Sigh.
Technical Details
Message-ID:
<Bt6xB7.5Kw@news.cso.uiuc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!uxa.cso.uiuc.edu!j-groutShow Full Headers
Complete Article Headers
Newsgroups: comp.lang.asm370 Path: arc1-ca.pugleaf.net!sparky!uunet!cs.utexas.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!uxa.cso.uiuc.edu!j-grout From: j-grout@uxa.cso.uiuc.edu (grout john robert) Subject: L/LTR vs ICM Message-ID: <Bt6xB7.5Kw@news.cso.uiuc.edu> Sender: usenet@news.cso.uiuc.edu (Net Noise owner) Reply-To: rbe@yrloc.ipsa.reuter.com Organization: University of Illinois at Urbana Date: Tue, 18 Aug 1992 17:45:06 GMT Keywords: ICM L LTR Lines: 22