Steve,
here is some comment on SPKA (and IPK).
very useful for certain programs (URMs, exit, close to system) in CICS
since CICS/TS 1.1.
If a piece of storage that needs modification might be in CICS-key
storage and the code might run in user-key, the following sequence makes
a lot of sense.
From: Robert A. Rosenberg a...@rarpsl.com
To: ASSEMBLER-LIST@LISTSERV.UGA.EDU
Sent: Thursday, 29 December 2011 4:43 PM
Subject: Re: Idea for a possible enhancement to z architecture
At 17:40 + on 12/28/2011, Bill Fairchild wrote about Re: Idea for
a possible enhancement to z architecture:
On Thu, 29 Dec 2011 09:58:45 -0600, McKown, John wrote:
Is there a simple way in HLASM to determine if a byte
an be consider printable...
Is there a macro buried somewhere which has this
information in it?
Both SVC 51 (SNAP, SYSABND, SYSUDUMP) and IPCS do this.
Seems to me that D GRS does as
On Thu, 29 Dec 2011 07:48:42 +0100, Fred van der Windt wrote:
I know what code I want (a single MVI instruction) but need
to find the best (most readable and maintainable) way to
express it in HLASM.
Code a macro if readability is your goal and you do it often.
I previously suggested two ways
John,
The first paragraph of your post comes very close to a description of
a (table-driven) Translate and Test, TRT, instruction. Use one
instead of a hand-coded loop. It will be much faster and prettier.
John Gilmore, Ashland, MA 01721 - USA
[Consolidating several responses]
On 12/29/2011 6:57 AM, Peter Relson wrote:
responding both to assembler-list and ibm-main
BSG - Branch in Subspace Group
EREG- Extract stacked REGisters (32 bits)
EREGG - Extract stacked REGisters Grande (64-bits)
ESTA- Extract stacked STAte
Is there a simple way in HLASM to determine if a byte can be consider
printable, assuming the standard EBCDIC code page of CP-37 or IBM-1047? I
would guess that the simpliest way is to have a 256 byte table and use the byte
as an index. If the byte value is, for example, not zero (or the other
I've been coding up a UNIX program in HLASM. One thing that I'm
doing is chain chasing using pointers. The end of chain is
indicated by a pointer of binary zeros: A(0). The code basically
loops by doing an LT instruction of the next pointer, followed by a
JNZ. Works quite well. Now my mind is
-Original Message-
From: IBM Mainframe Assembler List
[mailto:ASSEMBLER-LIST@LISTSERV.UGA.EDU] On Behalf Of Jim Mulder
Sent: Thursday, December 29, 2011 2:30 PM
To: ASSEMBLER-LIST@LISTSERV.UGA.EDU
Subject: Re: Idea for a possible enhancement to z architecture
snip
There is some
The first paragraph of your post comes very close to a description of a
(table-driven) Translate and Test, TRT, instruction. Use one instead
of a hand-coded loop. It will be much faster and prettier.
Use TROO: TROO can scan the string, copy it to the destination buffer and stop
at
On 12/23/2011 8:42 AM, Steve Comstock wrote:
Sure, camel case. And the nice thing is the Assembler
will recognize variable names if you happen to forget
and not capitalize the first letter, since it is
case-insensitive.
I also like camel case. It looks much better than using underscores to
11 matches
Mail list logo
