Posted: Sat May 01, 2010 7:20 am Post subject: Replace ICETOOL logic with DFSORT
In our shop, the management wanted to convert all the ICETOOL logic to a Normal SORT (PGM=SORT) logic or any equivalent generic SORT. The requirement is as follows,
We have 2 files, Current file is called File-A and Previous file is File-B. Now we wanted to compare File A&B and prepare 3 different files (New records, Deleted Records and Changed records). The Record length is 900 and both the file layout are same.
Could you pls. see the 2 response. I have run the same job which you have given, and the SPOOL messages. Pls. help me to fix this issue. Thanks in advance.
ICE143I 0 BLOCKSET COPY TECHNIQUE SELECTED
ICE250I 0 VISIT http://www.ibm.com/storage/dfsort FOR DFSORT PAPERS, EXAMPLES AN
ICE000I 1 - CONTROL STATEMENTS FOR 5694-A01, Z/OS DFSORT V1R5 - 11:38 ON MON MAY
SORT FIELDS=COPY
END
ICE201I F RECORD TYPE IS F - DATA STARTS IN POSITION 1
ICE751I 0 C5-K90013 C6-K90013 C7-K90000 C8-K42135 E9-K90013 C9-BASE E5-K35433
ICE193I 0 ICEAM1 ENVIRONMENT IN EFFECT - ICEAM1 INSTALLATION MODULE SELECTED
ICE088I 0 SORTCOND.PS010 . , INPUT LRECL = 80, BLKSIZE = 80, TYPE = FB
ICE093I 0 MAIN STORAGE = (MAX,6291456,6278238)
ICE156I 0 MAIN STORAGE ABOVE 16MB = (6211910,6211910)
ICE127I 0 OPTIONS: OVFLO=RC0 ,PAD=RC0 ,TRUNC=RC0 ,SPANINC=RC16,VLSCMP=N,SZERO=Y,
ICE128I 0 OPTIONS: SIZE=6291456,MAXLIM=1048576,MINLIM=450560,EQUALS=N,LIST=Y,ERE
ICE129I 0 OPTIONS: VIO=N,RESDNT=ALL ,SMF=NO ,WRKSEC=Y,OUTSEC=Y,VERIFY=N,CHALT=
ICE130I 0 OPTIONS: RESALL=4096,RESINV=0,SVC=109 ,CHECK=Y,WRKREL=Y,OUTREL=Y,CKPT=
ICE131I 0 OPTIONS: TMAXLIM=6291456,ARESALL=0,ARESINV=0,OVERRGN=65536,CINV=Y,CFW=
ICE132I 0 OPTIONS: VLSHRT=N,ZDPRINT=Y,IEXIT=N,TEXIT=N,LISTX=N,EFS=NONE ,EXITC
ICE133I 0 OPTIONS: HIPRMAX=OPTIMAL,DSPSIZE=MAX ,ODMAXBF=0,SOLRF=Y,VLLONG=N,VSAMI
ICE235I 0 OPTIONS: NULLOUT=RC0
ICE084I 0 EXCP ACCESS METHOD USED FOR SORTOUT
ICE084I 0 BSAM ACCESS METHOD USED FOR SORTIN
ICE751I 1 EF-K10929 F0-K30362 E8-K90013
ICE090I 0 OUTPUT LRECL = 92, BLKSIZE = 27968, TYPE = FB
ICE171I 0 SORTOUT LRECL OF 92 IS DIFFERENT FROM SORTIN(NN) LRECL OF 80 - RC=0
ICE055I 0 INSERT 0, DELETE 0
ICE054I 0 RECORDS - IN: 1, OUT: 1
ICE052I 0 END OF DFSORT
Joined: 02 Dec 2002 Posts: 1618 Topics: 31 Location: San Jose
Posted: Mon May 03, 2010 11:43 am Post subject:
Quote:
The purpose of this CR may be in future, the client wanted migrate this entire mainframe platform.
What does this mean? Do you mean you might want to migrate to another sort product on z/OS, or to a platform other than z/OS, or what? If your purpose is to migrate from DFSORT, then you should get help with the migration from the target product or system, not from the DFSORT Team. _________________ Frank Yaeger - DFSORT Development Team (IBM)
Specialties: JOINKEYS, FINDREP, WHEN=GROUP, ICETOOL, Symbols, Migration
DFSORT is on the Web at:
www.ibm.com/storage/dfsort
Thanks. Pls. ignore that NOTE which I have stated earlier because today morning we had a call with the client and they wanted to maintain this SYSTEM with their FOLKS due to budget. Also, they can only support if the legacy should contain with simple SORT instead of with any ICETOOL.
The purpose of the CR is to reduce any complicated SORT logic to simplified SORT step. ICETOOL is the one of the major components that we need to convert. Pls. do NOT take other way around, since you & Kolusu are doing tremendously helping us. I don
Joined: 02 Dec 2002 Posts: 1618 Topics: 31 Location: San Jose
Posted: Mon May 03, 2010 1:09 pm Post subject:
Sorry. I don't understand why ICETOOL code would be considered more complex than Sort code in all cases. This just doesn't make any sense. ICETOOL has been a part of DFSORT since 1991 - ICETOOL is fully documented with the doc available online so I don't see what budget has to do with it.
It is true that DFSORT JOINKEYS code can be simpler than ICETOOL SPLICE/SELECT code, but in many other instances ICETOOL code is, in fact, simpler than Sort code.
If you want to replace ICETOOL with SORT for whatever reason, be our guest, but Kolusu and I really don't consider helping with that effort a good use of our time. We've provided many, many examples of Sort jobs here, including JOINKEYS, and the documentation is fully available, so if you really need to do this, I suggest you start reading up on it.
Anyway, if we do it for you, how will that make the jobs more supportable by you or your client? _________________ Frank Yaeger - DFSORT Development Team (IBM)
Specialties: JOINKEYS, FINDREP, WHEN=GROUP, ICETOOL, Symbols, Migration
DFSORT is on the Web at:
www.ibm.com/storage/dfsort
I completely agree and What ever you are suggesting that is 100% true and sensible. But i'm NOT the deciding person to continue with ICETOOL, since i already told them in today's call that the advantages of the ICETOOL and fwded your docs to my management. So far i didn
Joined: 26 Nov 2002 Posts: 12378 Topics: 75 Location: San Jose
Posted: Mon May 03, 2010 2:57 pm Post subject:
hisavitha wrote:
Well, quick question - Is it possible that we can convert the above ICETOOL scenario into a normal(multiple) SORT steps. If NOT, I _________________ Kolusu
www.linkedin.com/in/kolusu
Is it possible that we can convert the above ICETOOL scenario into a normal(multiple) SORT steps.
Quick answer. It may or may not be possible - depending on just how hard you want to work to force the replacements into SORT statements. . .
Suggest you immediately document the functionality of each of the 100 ICETOOL processes. Once you have completely documented these, you and/or your group needs to assess if each is a candidate for a multi-step sort solution or would be better done with a real program.
Keep in mind that you or your client will have to maintain/support/enhance these replacement processes you you need to completely understand everything they currently do as well as the replacement "code". _________________ All the best,
di
Last edited by papadi on Tue May 04, 2010 6:30 pm; edited 1 time in total
Joined: 26 Nov 2002 Posts: 12378 Topics: 75 Location: San Jose
Posted: Tue May 04, 2010 4:30 pm Post subject:
hisavitha wrote:
Any other alternate way to find NODUPS records. (Simplified SORT Step)
SELECT FROM(IN) TO(TDIFF) ON(1,5,CH) NODUPS
Hisavitha,
The following DFSORT JCL will give you the desired results. You basically add 8 byte value of '1' at the end of every record and then sum that value. Any duplicate record will have a total of more than 1 and using an omit cond we eliminate those records.
Joined: 02 Dec 2002 Posts: 1618 Topics: 31 Location: San Jose
Posted: Tue May 04, 2010 5:08 pm Post subject:
Savitha,
Note that the ICETOOL method will work for any input LRECL whereas the DFSORT method requires you to know the LRECL so you can add the counter at the end (that is, the control statements will be different for different LRECLs).
Try showing your PHBs this ICETOOL statement:
Code:
SELECT FROM(IN) TO(TDIFF) ON(1,5,CH) NODUPS
and these DFSORT statements:
Code:
INREC BUILD=(1,5,7C'0',C'1')
SORT FIELDS=(1,5,CH,A)
SUM FIELDS=(6,8,ZD)
OUTFIL BUILD=(1,5),OMIT=(6,8,ZD,GT,1)
and explain about not having to know the LRECL with ICETOOL vs having to know the LRECL with DFSORT and ask them which method is "simpler". If they say the DFSORT method, question their sanity. _________________ Frank Yaeger - DFSORT Development Team (IBM)
Specialties: JOINKEYS, FINDREP, WHEN=GROUP, ICETOOL, Symbols, Migration
DFSORT is on the Web at:
www.ibm.com/storage/dfsort
You cannot post new topics in this forum You cannot reply to topics in this forum You cannot edit your posts in this forum You cannot delete your posts in this forum You cannot vote in polls in this forum