Re: SysRexx, MPF exit and debugging
Not much to it is there? Thanks for the link. Brian -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
OK, but that's not the intended use case for TRSMAIN, is it? So why risk breakage for folks using it as intended? Seems like you want a slightly different tool. (Yes, I'm being a hardass here!) On Mon, Dec 11, 2017 at 6:58 PM, John McKownwrote: > On Mon, Dec 11, 2017 at 5:47 PM, zMan wrote: > > > Seems like a bad idea, since it will produce something that can't > > necessarily be unTERSEd on another box. > > > > My application is: z/OS -> Linux -> different z/OS . I can't go directly > from z/OS #1 to z/OS #2. > > > > > > > On Mon, Dec 11, 2017 at 1:45 PM, John McKown < > john.archie.mck...@gmail.com > > > > > wrote: > > > > > On Mon, Dec 11, 2017 at 12:28 PM, David Mingee > > > wrote: > > > > > > > You might consider using the MODE C command in FTP vs. > AMTERSE/UNTERSE > > > > utility. It will run much faster and save CPU time. > > > > > > > > > > Does that work with data sets which are RECFM=U which are stored on a > > > non-z/OS system (in my case - Linux). > > > > > > -- > > > I have a theory that it's impossible to prove anything, but I can't > prove > > > it. > > > > > > Maranatha! <>< > > > John McKown > > > > > > -- > > > For IBM-MAIN subscribe / signoff / archive access instructions, > > > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > > > > > > > > > > > -- > > zMan -- "I've got a mainframe and I'm not afraid to use it" > > > > -- > > For IBM-MAIN subscribe / signoff / archive access instructions, > > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > > > > > > -- > I have a theory that it's impossible to prove anything, but I can't prove > it. > > Maranatha! <>< > John McKown > > -- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > -- zMan -- "I've got a mainframe and I'm not afraid to use it" -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: NFS on Mainframe
Hi Allan BPXMTEXT does not support reason code qualifier 6E05 From Network File System Guide and Reference Version 2 Release 3 SC23-6883-30 6E Indicates NFS Client modules (that is, GFSC). 05 NFS reason codes See Table 74 on page 457. 0002 NFSERR_NOENT No such file or directory A component of a specified path name does not exist, or the path name is an empty string. Action: Ensure that the file or directory exists. Got my NFS client working and now off to NFS server before venturing in to NFS security and encryption. Component trace for mvsnfsc also worked like a charm, just need doco to interpret trace entries although errors are error code stands out. Thanks a lot. Kind Regards Munif -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Random number generation in a fixed range via utility program(s) only?
On Mon, 11 Dec 2017 22:08:03 +, Farley, Peter x23353 wrote: > >I do not see any "modulus" operation available in the SORT manual, so it >apparently isn't possible to post-process the IEBDG numbers with SORT to >convert each of the random numbers modulo the limit value. I suppose division >and truncation and subtraction may work, though I haven't figured out how yet. > Modulus has been considered an inferior way to generate random numbers within a given range because with many RNGs the low-order bits are less random than the high-order. For example for some congruential RNGs the low order n bits simply repeat with a cycle of 2**n. Better to multiply and take the integer part. Modern RNGs with cryptographic strength may not suffer this deficiency. The better suggestion was to generate random keys and sort. >The other hard problem is to guarantee that there is exactly one occurrence of >each number and that no numbers in the range are left out. > Longer random keys greatly reduce the probability of duplicates. How does performance of DFSORT vary with key length? (TANSTAAFL) -- gil -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Random number generation in a fixed range via utility program(s) only?
Don, that would actually be easy to do and will work well, thank you. Didn't occur to me at first but in hindsight it's quite obvious. Peter -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Grinsell, Don Sent: Monday, December 11, 2017 5:33 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: Random number generation in a fixed range via utility program(s) only? Can you generate two numbers? For every sequential number 1-8000 generate a random number to use as a sort key. Sort on the random key and the sequential numbers should get jumbled up just fine. Shouldn't really matter if the random numbers repeat. I can't say exactly how you would actually do that with just the utility programs. Regards. > -Original Message- > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] > On Behalf Of Farley, Peter x23353 > Sent: Monday, December 11, 2017 3:08 PM > To: IBM-MAIN@LISTSERV.UA.EDU > Subject: Random number generation in a fixed range via utility > program(s) only? > > Is it possible to do the following using only utility programs and > control statements? (z/OS Unix solutions also welcome) > > Task: Generate 8-digit zoned-decimal numbers from 1 to some limit (e.g., > 1 to 8000) in pseudo-random order with exactly one occurrence of each > number in the range in the final output, with no gaps (no numbers not > present at > all) and no repeats (no duplicate numbers). > > I know that IEBDG can generate random binary integers 4 bytes long, > which certainly SORT can then post-process to convert the random > binary values to zoned-decimal values, but it does not seem to be > possible to confine the generated random numbers to a specific range. > > I do not see any "modulus" operation available in the SORT manual, so > it apparently isn't possible to post-process the IEBDG numbers with > SORT to convert each of the random numbers modulo the limit value. I > suppose division and truncation and subtraction may work, though I > haven't figured out how yet. > > The other hard problem is to guarantee that there is exactly one > occurrence of each number and that no numbers in the range are left out. > > This task is trivially possible with a fairly simple Rexx program of > course, or with any other HLL programming or scripting language that > you may choose to use that has a RANDOM function of some kind, but it > does not seem to be possible using only "utility" programs and control > statements as far as I can tell. > > Does anyone else have better ideas? Are there z/OS Unix utility > programs that can do the job of which I am not aware? > > If I already have a file of sequentially-numbered records, is there a > way to "unsort" them into pseudo-random order? > > Peter -- This message and any attachments are intended only for the use of the addressee and may contain information that is privileged and confidential. If the reader of the message is not the intended recipient or an authorized representative of the intended recipient, you are hereby notified that any dissemination of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by e-mail and delete the message and any attachments from your system. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: List of MVS callable services
That looks like it. Oddly, the name/token service routines are not included. Thanks, Frank From: IBM Mainframe Discussion Liston behalf of Sri h Kolusu Sent: Monday, December 11, 2017 4:55 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: List of MVS callable services Frank, Check out the manual "MVS Programming: Callable Services for High-Level Languages" https://www-304.ibm.com/servers/resourcelink/svc00100.nsf/pages/zOSV2R3sa231377/$file/ieac100_v2r3.pdf Thanks, Kolusu From: Frank Swarbrick To: IBM-MAIN@LISTSERV.UA.EDU Date: 12/11/2017 04:00 PM Subject:List of MVS callable services Sent by:IBM Mainframe Discussion List Is there a link to a list of the services that MVS provides that can be invoked via a standard linkage call (and thus requiring no actual assembler coding)? Things like the name/token service routines, etc. I see them documented in the MVS Programming: Assembler Service Reference manuals, but they appear to be "mixed in" with macros and the like. I'd like a list of only the services that can be "called". -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
On Mon, Dec 11, 2017 at 5:47 PM, zManwrote: > Seems like a bad idea, since it will produce something that can't > necessarily be unTERSEd on another box. > My application is: z/OS -> Linux -> different z/OS . I can't go directly from z/OS #1 to z/OS #2. > > On Mon, Dec 11, 2017 at 1:45 PM, John McKown > > wrote: > > > On Mon, Dec 11, 2017 at 12:28 PM, David Mingee > > wrote: > > > > > You might consider using the MODE C command in FTP vs. AMTERSE/UNTERSE > > > utility. It will run much faster and save CPU time. > > > > > > > Does that work with data sets which are RECFM=U which are stored on a > > non-z/OS system (in my case - Linux). > > > > -- > > I have a theory that it's impossible to prove anything, but I can't prove > > it. > > > > Maranatha! <>< > > John McKown > > > > -- > > For IBM-MAIN subscribe / signoff / archive access instructions, > > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > > > > > > -- > zMan -- "I've got a mainframe and I'm not afraid to use it" > > -- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > -- I have a theory that it's impossible to prove anything, but I can't prove it. Maranatha! <>< John McKown -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: List of MVS callable services
On Mon, Dec 11, 2017 at 4:59 PM, Frank Swarbrick < frank.swarbr...@outlook.com> wrote: > Is there a link to a list of the services that MVS provides that can be > invoked via a standard linkage call (and thus requiring no actual assembler > coding)? Things like the name/token service routines, etc. I see them > documented in the MVS Programming: Assembler Service Reference manuals, but > they appear to be "mixed in" with macros and the like. I'd like a list of > only the services that can be "called". > > I assume by "MVS services", you mean BCP (Base Control Program) services. Common System Services: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.ieac100/toc.htm DFSMSdfp services: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.idas300/call.htm A couple of TCP/IP related manuals which document a CALL interface are: FTP Client services: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.ceea300/ceea30011.htm IP sockets: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.hala001/cobolipapi.htm For LE and other (non-COBOL) routines: Language Environment services: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.ceea300/ceea30011.htm UNIX Services: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.bpxb100/toc.htm C subroutine library: https://www.ibm.com/support/knowledgecenter/en/SSLTBW_2.1.0/com.ibm.zos.v2r1.bpxbd00/toc.htm (may require some work to duplicate the C header definitions in a non-C language) Fortran subroutine library: ??? PL/I subroutine library: ??? -- I have a theory that it's impossible to prove anything, but I can't prove it. Maranatha! <>< John McKown -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: List of MVS callable services
There are also the "Callable Services for High-Level Languages" in the book of that name. Charles -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Frank Swarbrick Sent: Monday, December 11, 2017 3:00 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: List of MVS callable services Is there a link to a list of the services that MVS provides that can be invoked via a standard linkage call (and thus requiring no actual assembler coding)? Things like the name/token service routines, etc. I see them documented in the MVS Programming: Assembler Service Reference manuals, but they appear to be "mixed in" with macros and the like. I'd like a list of only the services that can be "called". -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: List of MVS callable services
Frank, Check out the manual "MVS Programming: Callable Services for High-Level Languages" https://www-304.ibm.com/servers/resourcelink/svc00100.nsf/pages/zOSV2R3sa231377/$file/ieac100_v2r3.pdf Thanks, Kolusu From: Frank SwarbrickTo: IBM-MAIN@LISTSERV.UA.EDU Date: 12/11/2017 04:00 PM Subject:List of MVS callable services Sent by:IBM Mainframe Discussion List Is there a link to a list of the services that MVS provides that can be invoked via a standard linkage call (and thus requiring no actual assembler coding)? Things like the name/token service routines, etc. I see them documented in the MVS Programming: Assembler Service Reference manuals, but they appear to be "mixed in" with macros and the like. I'd like a list of only the services that can be "called". -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Random number generation in a fixed range via utility program(s) only?
I'm not sure if this qualifies as "utilities" or "scripting." You did invite submissions from the USS community. And, in that community, those concepts can get mixed. At any rate, here is my effort using USS od -d /dev/urandom 2>/dev/null | head -8000 | cut -d" " -f2- | sed "s/ *//g" | cut -c1-4 That gives me 8000 random 4 digit numbers. It doesn't quite hit the mark on two counts. First, I do get a lot of duplicates. And second, I get numbers up to . Solving either of those problems would definitely require shell scripting. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
Seems like a bad idea, since it will produce something that can't necessarily be unTERSEd on another box. On Mon, Dec 11, 2017 at 1:45 PM, John McKownwrote: > On Mon, Dec 11, 2017 at 12:28 PM, David Mingee > wrote: > > > You might consider using the MODE C command in FTP vs. AMTERSE/UNTERSE > > utility. It will run much faster and save CPU time. > > > > Does that work with data sets which are RECFM=U which are stored on a > non-z/OS system (in my case - Linux). > > -- > I have a theory that it's impossible to prove anything, but I can't prove > it. > > Maranatha! <>< > John McKown > > -- > For IBM-MAIN subscribe / signoff / archive access instructions, > send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN > -- zMan -- "I've got a mainframe and I'm not afraid to use it" -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: SOAP Calls
While Enterprise COBOL can be used to process XML messages (SOAP messages are a form of XML message), COBOL itself does not provide the underlying communication protocol (generally HTTP/HTTPS). I'm sure there are services out there that allow for this, but COBOL itself does not. From: IBM Mainframe Discussion Liston behalf of Dazzo, Matt <00a854d4f854-dmarc-requ...@listserv.ua.edu> Sent: Monday, December 11, 2017 9:06 AM To: IBM-MAIN@LISTSERV.UA.EDU Subject: SOAP Calls Our applications folks are asking if there is a way to do SOAP calls from cobol? Does Cobol V62 support SOAP from the cobol program or does the V62 cobol program have to use CICS web services for SOAP? Thanks Matt -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
List of MVS callable services
Is there a link to a list of the services that MVS provides that can be invoked via a standard linkage call (and thus requiring no actual assembler coding)? Things like the name/token service routines, etc. I see them documented in the MVS Programming: Assembler Service Reference manuals, but they appear to be "mixed in" with macros and the like. I'd like a list of only the services that can be "called". -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Random number generation in a fixed range via utility program(s) only?
>>>I do not see any "modulus" operation available in the SORT manual, so it apparently isn't possible to post-process the IEBDG numbers with SORT to convert each of the random numbers modulo the limit value. I suppose division and truncation and subtraction may work, though I haven't figured out how yet. Peter, DFSORT supports the MOD function along with other arithmetic functions. (ADD,SUB,DIV,MUL) The intermediate or final result of a MOD operation is an integer remainder with the same sign as the dividend. If an intermediate or final result of an arithmetic expression overflows 31 digits, the overflowing intermediate or final result will be truncated to 31 digits, intentionally or unintentionally. If an intermediate or final result of an arithmetic expression requires division or modulus by 0, the intermediate or final result will be set to 0, intentionally or unintentionally. Thanks, Kolusu From: "Farley, Peter x23353"To: IBM-MAIN@LISTSERV.UA.EDU Date: 12/11/2017 03:09 PM Subject:Random number generation in a fixed range via utility program(s) only? Sent by:IBM Mainframe Discussion List Is it possible to do the following using only utility programs and control statements? (z/OS Unix solutions also welcome) Task: Generate 8-digit zoned-decimal numbers from 1 to some limit (e.g., 1 to 8000) in pseudo-random order with exactly one occurrence of each number in the range in the final output, with no gaps (no numbers not present at all) and no repeats (no duplicate numbers). I know that IEBDG can generate random binary integers 4 bytes long, which certainly SORT can then post-process to convert the random binary values to zoned-decimal values, but it does not seem to be possible to confine the generated random numbers to a specific range. I do not see any "modulus" operation available in the SORT manual, so it apparently isn't possible to post-process the IEBDG numbers with SORT to convert each of the random numbers modulo the limit value. I suppose division and truncation and subtraction may work, though I haven't figured out how yet. The other hard problem is to guarantee that there is exactly one occurrence of each number and that no numbers in the range are left out. This task is trivially possible with a fairly simple Rexx program of course, or with any other HLL programming or scripting language that you may choose to use that has a RANDOM function of some kind, but it does not seem to be possible using only "utility" programs and control statements as far as I can tell. Does anyone else have better ideas? Are there z/OS Unix utility programs that can do the job of which I am not aware? If I already have a file of sequentially-numbered records, is there a way to "unsort" them into pseudo-random order? Peter -- This message and any attachments are intended only for the use of the addressee and may contain information that is privileged and confidential. If the reader of the message is not the intended recipient or an authorized representative of the intended recipient, you are hereby notified that any dissemination of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by e-mail and delete the message and any attachments from your system. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: Random number generation in a fixed range via utility program(s) only?
Can you generate two numbers? For every sequential number 1-8000 generate a random number to use as a sort key. Sort on the random key and the sequential numbers should get jumbled up just fine. Shouldn't really matter if the random numbers repeat. I can't say exactly how you would actually do that with just the utility programs. Regards. -- Donald Grinsell, Systems Programmer Enterprise Technology Services Bureau SITSD/Montana Department of Administration 406.444.2983 (D) "A clever person solves a problem. A wise person avoids it." ~ Albert Einstein > -Original Message- > From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On > Behalf Of Farley, Peter x23353 > Sent: Monday, December 11, 2017 3:08 PM > To: IBM-MAIN@LISTSERV.UA.EDU > Subject: Random number generation in a fixed range via utility program(s) > only? > > Is it possible to do the following using only utility programs and control > statements? (z/OS Unix solutions also welcome) > > Task: Generate 8-digit zoned-decimal numbers from 1 to some limit (e.g., > 1 to 8000) in pseudo-random order with exactly one occurrence of each number > in the range in the final output, with no gaps (no numbers not present at > all) and no repeats (no duplicate numbers). > > I know that IEBDG can generate random binary integers 4 bytes long, which > certainly SORT can then post-process to convert the random binary values to > zoned-decimal values, but it does not seem to be possible to confine the > generated random numbers to a specific range. > > I do not see any "modulus" operation available in the SORT manual, so it > apparently isn't possible to post-process the IEBDG numbers with SORT to > convert each of the random numbers modulo the limit value. I suppose > division and truncation and subtraction may work, though I haven't figured > out how yet. > > The other hard problem is to guarantee that there is exactly one occurrence > of each number and that no numbers in the range are left out. > > This task is trivially possible with a fairly simple Rexx program of course, > or with any other HLL programming or scripting language that you may choose > to use that has a RANDOM function of some kind, but it does not seem to be > possible using only "utility" programs and control statements as far as I can > tell. > > Does anyone else have better ideas? Are there z/OS Unix utility programs > that can do the job of which I am not aware? > > If I already have a file of sequentially-numbered records, is there a way to > "unsort" them into pseudo-random order? > > Peter > -- > > > This message and any attachments are intended only for the use of the > addressee and may contain information that is privileged and confidential. If > the reader of the message is not the intended recipient or an authorized > representative of the intended recipient, you are hereby notified that any > dissemination of this communication is strictly prohibited. If you have > received this communication in error, please notify us immediately by e-mail > and delete the message and any attachments from your system. > > -- > For IBM-MAIN subscribe / signoff / archive access instructions, send email to > lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Random number generation in a fixed range via utility program(s) only?
Is it possible to do the following using only utility programs and control statements? (z/OS Unix solutions also welcome) Task: Generate 8-digit zoned-decimal numbers from 1 to some limit (e.g., 1 to 8000) in pseudo-random order with exactly one occurrence of each number in the range in the final output, with no gaps (no numbers not present at all) and no repeats (no duplicate numbers). I know that IEBDG can generate random binary integers 4 bytes long, which certainly SORT can then post-process to convert the random binary values to zoned-decimal values, but it does not seem to be possible to confine the generated random numbers to a specific range. I do not see any "modulus" operation available in the SORT manual, so it apparently isn't possible to post-process the IEBDG numbers with SORT to convert each of the random numbers modulo the limit value. I suppose division and truncation and subtraction may work, though I haven't figured out how yet. The other hard problem is to guarantee that there is exactly one occurrence of each number and that no numbers in the range are left out. This task is trivially possible with a fairly simple Rexx program of course, or with any other HLL programming or scripting language that you may choose to use that has a RANDOM function of some kind, but it does not seem to be possible using only "utility" programs and control statements as far as I can tell. Does anyone else have better ideas? Are there z/OS Unix utility programs that can do the job of which I am not aware? If I already have a file of sequentially-numbered records, is there a way to "unsort" them into pseudo-random order? Peter -- This message and any attachments are intended only for the use of the addressee and may contain information that is privileged and confidential. If the reader of the message is not the intended recipient or an authorized representative of the intended recipient, you are hereby notified that any dissemination of this communication is strictly prohibited. If you have received this communication in error, please notify us immediately by e-mail and delete the message and any attachments from your system. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: RSU maintenance strategy - Need expert suggestions
Mark, > On Dec 9, 2017, at 12:32 PM, Mark Zeldenwrote: > > And then you just apply everything that turns up in MISSINGFIX for > FIXCAT(*) along with the RSU maintenance? > > Why install a 100% of missing maintenance specific to some hardware or > hardware > feature you don't have or for some function you aren't using or planning to > use > ahead of the time it has been fully tested via CST and shows up with an RSU > sourceid? > What's to gain? To me it just seems more likely you could install a PTF that > will end > up PE'd. > > Yes, RSU incorporates a "lot of PTFs that are not necessarily critical" - but > that's the > point of putting on general preventive maintenance. However, it also does > include critical maintenance as well - PE fixes, HIPERs and security / > integrity. > > I guess we'll have to agree to disagree on this one. > > Regards, I will go along with you on this one. Once in a while you will find a chain so long it makes you ill. A long time ago, I chased a chain that had 3500 (thats right) 3500 ptfs waiting to go on because of one fix. I think that is when my hair color started to turn gray. I can see chasing 3 or 4 PTF’s but 3500 was out off the park for me. To get to your other points, I do not lay back and wait, everyday I am working I look for the hipers and the security/Integrity fixes on IBMLINK. I like to be proactive in this area as one time we had an auditor that thought he would get one over on me. He sent an email to the VP and asked if we had this specific PTF on as he thought it was important. The VP passes it on down the line to me. I looked it up and it didn’t even pertain to our system, so I thought I would do him one better and found the PTF in question and told him in English that the PTF did NOT involve our system but this PTF did. I did a cut and paste into the email of the cover letter and the pre’s and Co’s and that PTF had been on the system for 6 months. I then said to him in the future please call or email me directly so we didn’t tie up management in issues that we could handle quicker and more completely via email/phone call as we were there to serve him. That stopped the ambush’s. A few weeks later I get an email and didn’t reply to him the same day but the next day I replied again that the fix was not for our system but this one was and again I told him it had been on for 7 months. He tried it once more and I told him the same story except this one had been on a year. I smelled something fishy, I dropped by his desk when he wasn’t there and asked his team mate what was going on with these requests and he told me that VP of Auditing had become friends with another auditor in another shop and the *other* auditor was trying for a promotion and that he had some MVS sysprog feeding him these PTF numbers. Ed -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
On Mon, Dec 11, 2017 at 12:28 PM, David Mingeewrote: > You might consider using the MODE C command in FTP vs. AMTERSE/UNTERSE > utility. It will run much faster and save CPU time. > Does that work with data sets which are RECFM=U which are stored on a non-z/OS system (in my case - Linux). -- I have a theory that it's impossible to prove anything, but I can't prove it. Maranatha! <>< John McKown -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
You might consider using the MODE C command in FTP vs. AMTERSE/UNTERSE utility. It will run much faster and save CPU time. -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Ed Jaffe Sent: Monday, December 11, 2017 1:16 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: TRSMAIN On 12/11/2017 9:51 AM, PINION, RICHARD W. wrote: > Is there a way to make TRSMAIN use hardware compression, PCIE hardware > compression? No. AMATERSE uses it's own compression. Sounds like a good SHARE requirement tho... -- Phoenix Software International Edward E. Jaffe 831 Parkview Drive North El Segundo, CA 90245 http://www.phoenixsoftware.com/ -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: TRSMAIN
On 12/11/2017 9:51 AM, PINION, RICHARD W. wrote: Is there a way to make TRSMAIN use hardware compression, PCIE hardware compression? No. AMATERSE uses it's own compression. Sounds like a good SHARE requirement tho... -- Phoenix Software International Edward E. Jaffe 831 Parkview Drive North El Segundo, CA 90245 http://www.phoenixsoftware.com/ -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
TRSMAIN
Is there a way to make TRSMAIN use hardware compression, PCIE hardware compression? FIRST TENNESSEE Confidentiality notice: This e-mail message, including any attachments, may contain legally privileged and/or confidential information. If you are not the intended recipient(s), or the employee or agent responsible for delivery of this message to the intended recipient(s), you are hereby notified that any dissemination, distribution, or copying of this e-mail message is strictly prohibited. If you have received this message in error, please immediately notify the sender and delete this e-mail message from your computer. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
SOAP Calls
Our applications folks are asking if there is a way to do SOAP calls from cobol? Does Cobol V62 support SOAP from the cobol program or does the V62 cobol program have to use CICS web services for SOAP? Thanks Matt -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
CMS style XMITMSG for Unix and other platforms
friends -- VM/CMS* has a wonderful utility driven by 'XMITMSG' (the command) and by APPLMSG (the macro). If you're a VMer, you know about it. If you're a VSE or MVS person, maybe not. It's good stuff. For (at least) the second time, I started putting together an XMITMSG work-alike for Unix (POSIX, including Linux). Anyone else interested in this? If so, please let me know. There are language libraries and message handlers in Unix land. I have yet to find one that works like XMITMSG and the APPLMSG macro with token replacement, enumerated messages, clear codes in the handling. Maybe there is such, in which case my little "xmitmsgx" project might reduce to simple interoperability glue code. If so, great! I WAS SHOCKED several years ago to learn that there is no equivalent function in z/OS. It's an incredibly elegant way to handle localization (national languages, regional dialects). This project should work on MVS too; it's simple code. If you have time and inclination to try this thing (and offer feedback ... or code), please holler. Thanks! -- R; <>< -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: SysRexx, MPF exit and debugging
On Sun, Dec 10, 2017 at 10:49 PM, Brian Westerman < brian_wester...@syzygyinc.com> wrote: > Where can I find a copy of the MPFNREXX to try this out? > I put it up here: https://github.com/JohnArchieMckown/miscutil/blob/master/MPFNREXX The original code was by Dana Mitchell, who gave it to me as an example of how to use System REXX for message automation. > > Brian > -- I have a theory that it's impossible to prove anything, but I can't prove it. Maranatha! <>< John McKown -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: NFS on Mainframe
TSO BPXMTEXT where is the reason code from the message. In the case below: "TSO BPXMTEXT 6E050002" -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of Munif Sadek Sent: Thursday, December 7, 2017 11:26 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: Re: NFS on Mainframe Apologies Listers Falls alarm..Message is documented in SC23-6883-30 as Parm invalid. Now I am in much better place with IP packets trace and following error messages BPXF162E ASYNCHRONOUS MOUNT FAILED FOR FILE SYSTEM NFS. BPXF135E RETURN CODE 0081, REASON CODE 6E050002. THE MOUNT FAILED FOR FILE SYSTEM NFS. Kind regards Munif. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN ::DISCLAIMER:: The contents of this e-mail and any attachment(s) are confidential and intended for the named recipient(s) only. E-mail transmission is not guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or may contain viruses in transmission. The e mail and its contents (with or without referred errors) shall therefore not attach any liability on the originator or HCL or its affiliates. Views or opinions, if any, presented in this email are solely those of the author and may not necessarily reflect the views or opinions of HCL or its affiliates. Any form of reproduction, dissemination, copying, disclosure, modification, distribution and / or publication of this message without the prior written consent of authorized representative of HCL is strictly prohibited. If you have received this email in error please delete it and notify the sender immediately. Before opening any email and/or attachments, please check them for viruses and other defects. ::DISCLAIMER:: The contents of this e-mail and any attachment(s) are confidential and intended for the named recipient(s) only. E-mail transmission is not guaranteed to be secure or error-free as information could be intercepted, corrupted, lost, destroyed, arrive late or incomplete, or may contain viruses in transmission. The e mail and its contents (with or without referred errors) shall therefore not attach any liability on the originator or HCL or its affiliates. Views or opinions, if any, presented in this email are solely those of the author and may not necessarily reflect the views or opinions of HCL or its affiliates. Any form of reproduction, dissemination, copying, disclosure, modification, distribution and / or publication of this message without the prior written consent of authorized representative of HCL is strictly prohibited. If you have received this email in error please delete it and notify the sender immediately. Before opening any email and/or attachments, please check them for viruses and other defects. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: RSU maintenance strategy - Need expert suggestions
We install RSU four times a year. It definitely does not require 1 FTE. I would estimate it takes us about 16-32 man hours per quarter covering both z/OS and DB2. Bart -Original Message- From: IBM Mainframe Discussion List [mailto:IBM-MAIN@LISTSERV.UA.EDU] On Behalf Of ANIL KUMAR Sent: Wednesday, December 06, 2017 11:56 PM To: IBM-MAIN@LISTSERV.UA.EDU Subject: RSU maintenance strategy - Need expert suggestions This email originated from outside of the organization. Hi All, I needed expert suggestions on following the RSU maintenance strategy for z/OS , associated ISV products , DB2 etc. Could you please let me know 1) How many times in a year do we need to apply the maintenance to z/os , ISV products , DB2 etc. 2) How to decide which ones to be applied. (latest RSU) 3) Whether the HIPERs included also be applied , even though we have not encountered the specific issues in out shop. So far in the account I was working for , it was not a strict rule to apply maintenance be it z/OS or DB2 or associated ISV product. Infact I do not remember any maintenance being applied to DB2 unless it was a major upgrade for which the pre-req was needed. Even for ISV's if they are running fine, then no action was taken. However for a different shop , we have been asked to come up with the best approach on whats needs to be done. If we keep updating the maintenance then 1 FTE job will be consumed for the work for a year. Hence needed some advise on what strategy is being used by different shops and what is the best practice. Please advise. If any documents etc are available please point me to them and I shall read. Sincerely hoping to get some advise. Thanks. -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN
Re: RSU maintenance strategy - Need expert suggestions
Our recommendations (for IBM products) are here: https://www-03.ibm.com/systems/resources/zOS_Preventive_Maintenance_Strategy.pdf ANIL KUMAR wrote: Hi All, I needed expert suggestions on following the RSU maintenance strategy for z/OS , associated ISV products , DB2 etc. Could you please let me know -- John Eells IBM Poughkeepsie ee...@us.ibm.com -- For IBM-MAIN subscribe / signoff / archive access instructions, send email to lists...@listserv.ua.edu with the message: INFO IBM-MAIN