On 2018-03-14, at 20:32:18, Robin Vowels wrote:
> From: "Charles Mills"
> Sent: Thursday, March 15, 2018 2:51 AM
>
>> 1. Is there a machine instruction that will find one string within
>> another? That given "Now is the time" and "is" would find the "is" and
>> return a pointer to it? A ma
From: "Charles Mills"
Sent: Thursday, March 15, 2018 2:51 AM
1. Is there a machine instruction that will find one string within
another? That given "Now is the time" and "is" would find the "is" and
return a pointer to it? A machine instruction analog of Rexx POS?
2. Searching the
Thanks @Jonathan.
Charles
-Original Message-
From: IBM Mainframe Assembler List [mailto:ASSEMBLER-LIST@LISTSERV.UGA.EDU]
On Behalf Of Jonathan Scott
Sent: Wednesday, March 14, 2018 9:56 AM
To: ASSEMBLER-LIST@LISTSERV.UGA.EDU
Subject: Re: Two string instruction questions
Ref: Your note
Assuming this is a program that gets called via JCL then it’s
trivial to call it from your own code.
As previously noted, you will likely need to set R1 to point to a valid PARM
construct (zero-length if no parameters).
If you’re
Hi Peter,
Partially right
In a VSAM file (KSDS only I think) you can request the Index to have
compressed keys
Only worth while if the keys were large (max length is 127 bytes)
The Index entry would be compared to the previous and both the beginning and
ending key bytes would be compared and
I think I read somewhere that is what keyed VSAM Index records are, aren't
they? A count of equal key bytes and then the remaining non-equal bytes,
followed by the RBA in the data component? Or is that a fib I was told?
Peter
-Original Message-
From: IBM Mainframe Assembler List [mail
That's interesting. Thanks!
I did think of what CUSE would be perfect for: what I know as "vertical
compression" but Google does not seem to know the term. Think of standard
run length compression as "horizontal." Picture something like that, but
where a code indicates "the next 'n' bytes of this
I would start off with the obvious.
As it is a JS program, it expects R1->Word->H'length',C'parm'.
What is in R1 when you call it?
On Wed, 14 Mar 2018 22:15:03 +0530 Jake Anderson
wrote:
:>I tried Calling but it fails with S0C4 reason 11, fails at the point of
:>calling ACFCMD macro
:>
:>
:>We
On 2018-03-14, at 09:51:22, Charles Mills wrote:
> 1. Is there a machine instruction that will find one string within
> another? That given "Now is the time" and "is" would find the "is" and
> return a pointer to it? A machine instruction analog of Rexx POS?
>
> 2. Searching the PoOp
Ref: Your note of 14 March 2018, 08:51:22 -0700
Charles Mills wrote:
> 1. Is there a machine instruction that will find one string within
> another? That given "Now is the time" and "is" would find the "is" and
> return a pointer to it? A machine instruction analog of Rexx POS?
I'm not a
On 14 March 2018 at 11:51, Charles Mills wrote:
> 1. Is there a machine instruction that will find one string within
> another? That given "Now is the time" and "is" would find the "is" and
> return a pointer to it? A machine instruction analog of Rexx POS?
I am almost certain that there is
I remember looking at CUSE and being very disappointed that it was not more of
general substring search instruction.
The following quote from POPS began my angst :
" Comparison is done left-to-right, byte by byte. The
compare operation ends when an inequality is found, the
'end-of-string' charac
I don't recall seeing "at same offset" in the PoOps. I'll double check and, if
appropriate, send an RCF.
--
Shmuel (Seymour J.) Metz
http://mason.gmu.edu/~smetz3
From: IBM Mainframe Assembler List on behalf
of Charles Mills
Sent: Wednesday, March 14,
According to John Ehrman's "Assembler Language Programming for IBM System zT
Servers Version 2.00," the CUSE instruction searches only for matches at the
same offset. In the case you describe, it would not find a match unless the
second string was "is" so that the word you are looking for is a
I tried Calling but it fails with S0C4 reason 11, fails at the point of
calling ACFCMD macro
We are building a inhouse product
On 14-Mar-2018 7:38 PM, "Lizette Koehler" wrote:
> Jake,
>
> Is that an interface to ACF2?
>
> If so, have you tried it yet? And if so, what did you see as a result?
I don't read it that way but I am less than certain of my interpretation.
Some CUSE examples in Appendix A would be nice, eh?
I tried Googling for that and got this which seems to support my
interpretation of CUSE:
http://ibmmainframes.com/about23525.html
It also shares my "well then, what IS CU
It appears if r0 also equals length of second operand, you should get desired
result.
Richard
-Original Message-
From: IBM Mainframe Assembler List [mailto:ASSEMBLER-LIST@LISTSERV.UGA.EDU] On
Behalf Of Seymour J Metz
Sent: Wednesday, March 14, 2018 12:22 PM
To: ASSEMBLER-LIST@LISTSERV.U
If your search string is less than 256 bytes then CUSE should work, if I am
reading th PoOps correctly. Set R0 to the length of the search string.
--
Shmuel (Seymour J.) Metz
http://mason.gmu.edu/~smetz3
From: IBM Mainframe Assembler List on behalf
of
1. Is there a machine instruction that will find one string within
another? That given "Now is the time" and "is" would find the "is" and
return a pointer to it? A machine instruction analog of Rexx POS?
2. Searching the PoOp for such an instruction led me to CUSE. It does
not seem tha
Jake,
Is that an interface to ACF2?
If so, have you tried it yet? And if so, what did you see as a result?
Or, have you gone to communities.ca.com (you need a site number to join for
free) and posted on the ACF2 community site?
Lizette
> -Original Message-
> From: IBM Mainframe Asse
Hi,
Is there anyone who has been successful in calling ACFBATCH via assembler ?
Regards
Jake
21 matches
Mail list logo
