On 2016-10-18, at 13:45, Tony Harminc wrote:
>
> There is also the long-known performance problem with TRT (and TR)
> that its definition requires that "Access exceptions are recognized
> only for those bytes in the second operand which are actually
> required. Access exceptions are not
On 18 October 2016 at 12:11, Martin Truebner wrote:
> I have no figures - but consider the following:
>
> TRT does a lockup for each and every char until terminating char is
> found or the maximum length is reached- the lockup is done against a
> table of 256 char.
>
> SRST
.
-Original Message-
From: IBM Mainframe Assembler List [mailto:ASSEMBLER-LIST@LISTSERV.UGA.EDU] On
Behalf Of Paul Gilmartin
Sent: Tuesday, October 18, 2016 11:30 AM
To: ASSEMBLER-LIST@LISTSERV.UGA.EDU
Subject: Re: SRST Performance (was: converting character to packed
On 2016-10-18, at 10:11, Martin
On 2016-10-18, at 10:11, Martin Truebner wrote:
>
> TRT does a lockup for each and every char until terminating char is
> found or the maximum length is reached- the lockup is done against a
> table of 256 char.
>
Caching helps a lot. How can the programmer insure that the table occupies
the