0 INFO-VAX	Tue, 25 Jan 2005	Volume 2005 : Issue 50      Contents:P Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsistenP Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsistenP Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsisten! ANAL/MEDIA/EXER on a modern disk? , Comparison of operating systems on wikipedia0 Re: Comparison of operating systems on wikipedia Re: DEC Keyboard Question 8 Re: disposition of largest private DEC collection in USA8 Re: disposition of largest private DEC collection in USA RE: es45 cluster with eva 9 Help configuring RAID with HP SmartArray 5300A controller = Re: Help configuring RAID with HP SmartArray 5300A controller  Re: HP to be SAPed again? 7 Re: New and Refreshed Advertising Colateral for OpenVMS 4 OpenVMS Locks NL EX Requested Granted in ALPHA MACRO PDFs for HP C docs PLUG: txt2pdf 8.0 O Re: Reject-Unbacktranslatable-IP v. "Received: from unknown.hostname (x.x.x.x)"  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: RFA string format  Re: VMS GALAXY and CPU's  F ----------------------------------------------------------------------  + Date: Tue, 25 Jan 2005 08:29:57 +0000 (UTC) < From: gartmann@non.immunbio.mpg.de.sens (Christoph Gartmann)Y Subject: Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsisten ) Message-ID: <ct5025$f1g$1@news.BelWue.DE>   W In article <5-Cdnfchyb9RemjcRVn-vg@inreach.com>, John Hixson <john@divinix.org> writes:  >Hello VMS users, I >   I am getting this error when attempting to install alot of software.  6 >I get this error on OpenVMS 7.3 on a alpha pws 600au: > B >%DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data  >inconsistency > D >This error shows up when I attempt to install oracle, fortran, and J >compaq's C compiler (cc065) using @sys$update:vmsinstal . Is there a way C >I can fix this? Can I modify a script? This is starting to really   >irritate me =).  N This sounds a bit strange. Could it be that you have some partial IF-structureM in your LOGIN.COM or SYLOGIN.COM? Or did you modify SYS$UPDATE:VMSINSTAL.COM?    Regards,    Christoph Gartmann    --  E  Max-Planck-Institut fuer      Phone   : +49-761-5108-464   Fax: -452   ImmunbiologieI  Postfach 1169                 Internet: gartmann@immunbio dot mpg dot de   D-79011  Freiburg, Germany 9                http://www.immunbio.mpg.de/home/menue.html    ------------------------------  # Date: Tue, 25 Jan 2005 13:28:01 GMT 3 From: hammond@not@peek.ssr.hp.com (Charlie Hammond) Y Subject: Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsisten 2 Message-ID: <BPrJd.6496$X94.2402@news.cpqcorp.net>  W In article <5-Cdnfchyb9RemjcRVn-vg@inreach.com>, John Hixson <john@divinix.org> writes:  >Hello VMS users, I >   I am getting this error when attempting to install alot of software.  6 >I get this error on OpenVMS 7.3 on a alpha pws 600au: > B >%DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data  >inconsistency > D >This error shows up when I attempt to install oracle, fortran, and J >compaq's C compiler (cc065) using @sys$update:vmsinstal . Is there a way C >I can fix this? Can I modify a script? This is starting to really   >irritate me =).  I An additional question -- have you by chance re-defined IF, THEN, ELSE or  ENDIF?  D More suggestions my be forthcoming if you can post an actual example of the erro.   --  J       Charlie Hammond -- Hewlett-Packard Company -- Ft Lauderdale  FL  USAF           (hammond@not@peek.ssr.hp.com -- remove "@not" when replying)J       All opinions expressed are my own and not necessarily my employer's.   ------------------------------  % Date: Tue, 25 Jan 2005 08:40:37 +0000 0 From: Chris Sharman <chris.sharman@sorry.nospam>Y Subject: Re: %DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data inconsisten 4 Message-ID: <ct50m4$o04$1$830fa17d@news.demon.co.uk>   Christoph Gartmann wrote: Y > In article <5-Cdnfchyb9RemjcRVn-vg@inreach.com>, John Hixson <john@divinix.org> writes:  >  >>Hello VMS users,I >>  I am getting this error when attempting to install alot of software.  7 >>I get this error on OpenVMS 7.3 on a alpha pws 600au:  >>C >>%DCL-E-INVIFNEST, invalid IF-THEN-ELSE nesting structure or data   >>inconsistency  >>E >>This error shows up when I attempt to install oracle, fortran, and  K >>compaq's C compiler (cc065) using @sys$update:vmsinstal . Is there a way  D >>I can fix this? Can I modify a script? This is starting to really  >>irritate me =).  > P > This sounds a bit strange. Could it be that you have some partial IF-structureO > in your LOGIN.COM or SYLOGIN.COM? Or did you modify SYS$UPDATE:VMSINSTAL.COM?    Agreed. Or SYCONFIG iirc.    Chris    ------------------------------    Date: 25 Jan 2005 10:33:12 -06004 From: kaplow_r@encompasserve.org.TRABoD (Bob Kaplow)* Subject: ANAL/MEDIA/EXER on a modern disk?3 Message-ID: <MCt612ABGEaQ@eisner.encompasserve.org>   + A long time ago in a galaxy far far away...   L We used to be able to test and exercise new disks (or destroy sensitive dataG from old disks) with the ANALYZE/MEDIA/EXERCISE command, or way back in K time, the BAD utility under RSX. Alas with modern "smart" devices, these no F longer function. If my disks were in an HSx array, I could run DILX to accomplish this purpose.  M But what do you do these days to beat up new or used disks when they are just I JBOD drives on some random SCSI controller? ANAL/DISK/READ only hits used H blocks, and doesn't do any writes. INIT/ERASE doesn't seem like what I'm looking for either.   1 	Bob Kaplow	NAR # 18L	TRA # "Impeach the TRA BoD" & 		>>> To reply, remove the TRABoD! <<<K Kaplow Klips & Baffle:	http://nira-rocketry.org/LeadingEdge/Phantom4000.pdf L     www.encompasserve.org/~kaplow_r/    www.nira-rocketry.org    www.nar.org  K "Congress shall make no law respecting an establishment of religion, except F to encourage attendance in Christian churches; or prohibiting the freeG exercise thereof, except to require prayer in schools; or abridging the K freedom of speech, except for those questioning the Bush administration; or J of the press, except that not owned by Rupert Murdoch; or the right of theK people peaceably to assemble, except those protesting pre-emptive wars; and L to petition the government for a redress of grievance, except those we don't" like." -former U.S. Sen. Gary Hart   ------------------------------  % Date: Tue, 25 Jan 2005 12:27:02 -0500 0 From: Peter Sjoberg <peters38@techwiz.spamno.ca>5 Subject: Comparison of operating systems on wikipedia > Message-ID: <pan.2005.01.25.17.26.57.130744@techwiz.spamno.ca>  X I'm missing one great OS on http://en.wikipedia.org/wiki/Comparison_of_operating_systems  is it anyone who like to add it?    O ----== Posted via Newsfeeds.Com - Unlimited-Uncensored-Secure Usenet News==---- S http://www.newsfeeds.com The #1 Newsgroup Service in the World! >100,000 Newsgroups E ---= East/West-Coast Server Farms - Total Privacy via Encryption =---    ------------------------------  % Date: Tue, 25 Jan 2005 13:01:07 -0500 # From: "John Smith" <a@nonymous.com> 9 Subject: Re: Comparison of operating systems on wikipedia , Message-ID: <Do-dnQQGnp3-FGvcRVn-qw@igs.net>   Peter Sjoberg wrote: > I'm missing one great OS on > > http://en.wikipedia.org/wiki/Comparison_of_operating_systems  I They don't list 'dead' operating systems  .... GCOS, Multics, OS390, MVS,  VMS, Tru64, HP-UX    ------------------------------  % Date: Tue, 25 Jan 2005 08:19:12 -0500 - From: "John E. Malmberg" <wb8tyw@qsl.network> " Subject: Re: DEC Keyboard Question1 Message-ID: <IdydnZx2MoDO2mvcRVn-sA@adelphia.com>    Ken Fairfield wrote:   >   D > I don't know specifically about the Outlook ES, but when I queriedC > Avocent's technical support that Fall, the answer I got back was,  > ; >     "While our switches do support mode 3 keyboard, it is : >      currently only in the 101/102 keyboard layout.  The/ >      additional keys would not pass through."  > B > I got similar negative responses from Adder, Linksys and Belkin.A > I didn't expect anything different from Belkin, but Adder had a 9 > nice little switch I would've liked to buy...too bad...   H A google search shows that there are several mode 3 keyboards available ( for x86 PC devices from several vendors.  A > The other piece of information I've gleaned from my research is @ > that essentially all of the switches put the physical keyboardD > into mode 2, then translate to/from mode 3 for the VMS connection.  E A google search which I do not have handy indicates that x86 PCs not  C only regularly use mode 3 for keyboards, support for the LK series  G appears to be present in many versions of Microsoft Windows.  The only  E version known not to support the LK4xx keyboards is the first retail  4 version of Microsoft NT 4.0.  The betas had support.  D Unfortunately I could not find a list of what versions of Microsoft ' Windows will support a NT 4.0 keyboard.   F It also appears from google that Linux will support an LKxxx keyboard.  F > Apparently Raritan does the translation with a per-system-connectionC > adapter (Alan, correct me if I'm wrong; I don't have any personal  > experience with Raritan).   H Google is indicating that such translation is not needed as the x86 PCs H operating systems already know about and use mode 3, but that conflicts 7 with what others who have studied this more than I did.   F It seems what is needed is a scan code map for the LK4xx keyboards so G that you can predict what key does what.  All I have found so far with  F google is a web page that shows them for a large number of keyboards,  but not the LK4xx keyboard.   C Based on the posting I found about Windows NT 4.0 specifically not  H working with an LK4xx keyboard, I am starting to wonder if that is what  the real issue was.   G I have not been able to find search terms to get any information about  ! this topic on the Microsoft site.   A > Rose does the translation in the switch if you get a model that ? > supports this: "ServeView +" / "ServeView Pro" do, as well as ( > their more expensive UltraView series. > @ > Christoph Gartmann has noted that even with the ServeView, you? > may need to (temporarily?) connect a/the keyboard directly to D > the Alpha system on reboot to get the full set of keys recognized.? > Again, I don't have personal experience with the ServeView... 3 > although I'm trying to find one I like on eBay...   G So far in my limited tests, Windows 98/2000 are quite happy with an LK  0 keyboard connected through the cheap Belkin KVM.  H The Reflections 4 version I have appears to be able have their keyboard G map reprogrammed to use the LK4xx keys, but do not have an easy way to  H do so, even though they have an LK4xx keyboard in their selection list, C by default they leave the key mapping as if you have a PC keyboard. H So it looks like I will have to see if there is a way to do the mapping . and just put those settings in their own file.  D On the other hand, Powerterm in Pathworks 32 running on Windows 	XP E automatically detected that the PC suddenly acquired (and with out a  G reboot), a LK4xx keyboard and immediately made the keys available.  No  E changes required.  That was not through a KVM, I just plugged in the  G keyboard to see what would happen.  The powerterm keyboard map display  E however did not admit to the extra keys, but that could be a setting  7 that I have not found yet, as I really have not looked.    -John  wb8tyw@qsl.network Personal Opinion Only    ------------------------------  % Date: Tue, 25 Jan 2005 12:12:05 +0100 0 From: Keith Cayemberg <keith.cayemberg@arcor.de>A Subject: Re: disposition of largest private DEC collection in USA @ Message-ID: <41f62986$0$820$9b4e6d93@newsread2.arcor-online.net>   John Smith wrote:  > patrick jankowiak wrote: >  >>Morten Reistad wrote:  >> >>, >>>In article <41F31CAE.6000803@swbell.net>,. >>>patrick jankowiak  <eccm@swbell.net> wrote: >>>  >>>  >>>>Bill Gunshannon wrote: >>>> >>>> >>>> >>>>D >>>>>I have wanted to start a computer museum here at the UniversityB >>>>>for a long time.  I figured if I could get commitments from aC >>>>>few corporations for operating funds I could probably convince A >>>>>the University to give me the necessary space.  But I really @ >>>>>don't know how to go about finding corporate sponsers.  :-(A >>>>>My idea is to have a real hands on facility where people can @ >>>>>come in and actually play with the equipment.  I would alsoA >>>>>make as much of it as I could available on the INTERNET with < >>>>>guest accounts.  But, I'm probably just dreaming again. >>>  >>> = >>>Corporate sponsors are just as shallow. We need to come up   >>>with a workable museum first. >>>  >>>  >>> E >>>>I wish we could do this. There's a hell of a datacenter here just C >>>>waiting to be unzipped. It's what we wanted.. (makes me want to G >>>> listen to "all we ever wanted" by Bauhaus) Man I am trying to keep F >>>>a good mindset but this step is getting me down. It has to be done >>>>though.  >>>>	 >>>>OPCOM  >>>  >>> A >>>A computer museum will need large amounts of space; as well as B >>>access to largish amounts of energy when someone decides to runF >>>the machines. Much can be mocked up for the standard visitor, usingD >>>emulators to show software on the correct terminals. But machines@ >>>must be kept intact. We also have the issue of documentation. >>> E >>>Such space fast becomes the major problem. It cannot be in or very H >>>near major cities, because land is too expensive there. And the scale/ >>>of this is big enough for a full theme park.  >>>  >>>So why not do this? >>> D >>>Make a theme park around technology development and preservation.B >>>Remember that the audience is a premium one for many locations.C >>>The nerds or wannabees that visit such places have above average B >>>income, are not very inclined to boozing and gambling, and tend* >>>to leave the facilities without damage. >>> C >>>It will have to be located somewhere outside the mainstream, and @ >>>must be the magnet for people itself. Just like Disney World. >>> 	 >>>-- mrr  >>>  >>>  >>1 >>Sweet.. Need $ and $.. That would be very nice, 3 >>have everything from pre-vacuum tube stuff on up. 5 >>A home for analog computers too, yeah.. I could see 4 >>it on 100 acres. Mostly indoors of course as geeks# >>don't like the hot weather much..  >>8 >>The place could become a location of pilgrimages where9 >>acolytes could chant in octal and wizards could perform 6 >>5-way merges on relational databases in an afternoon3 >>while across the park, boy electricians made huge 0 >>sparks fly by selecting the right capacitors.. >>7 >>Microphones could be placed on the HDA's of grumbling / >>RA81's and during this activity, connected to 8 >>amplified subwoofers under the spinning platter-shaped- >>floor in the next room - a "hard disk ride" - >>"Ride the RA-81 Platter like a dust speck!!  >>Watch out for the heads!!"+ >>Space mountain's got nothing on this one!  >>5 >>Rides wouln't be the real attraction though, just a 9 >>minor diversion. The interactive exhibits of all kinds, 5 >>that's the key. The real VAXclusters and the 11/780 8 >>with doors open to show off the cards. A LINUX Beowulf; >>cluster, paper tape, DECtape, 9-track tape, 8-track tape. 8 >>And the blinkenlights stuff in a room where the lights6 >>dim evey several minutes or so. When the lights dim,7 >>AM radios tuned to the music of each machine come on, 2 >>machines programmed to play music via the RFI. I3 >>know some remember doing that on pdp8's and other  >>stately machines.  >>9 >>On the other stuff, ever programmed an analog computer? 3 >>Talk about an experience. There's lots of classic 5 >>technology pieces out there, tons of test equipment 6 >>with real CRT's, and machines like plasma generators; >>from depostion processes, ever notice how you can measure 2 >>plasma density by measuring the attenuation of a, >>microwave beam through the plasma chamber? >>' >>The progress of everything high tech:  >>computers  >>RF >>audio 1 >>Germanium transistors (if anyone recalls those)  >>plain old electricity  >>tesla coil (very very large) >>open-frame dynamos >>what else? >>! >>Might cost what $100M to start?  >>; >>The only geek with enough $ to start something like that, 0 >>and enough daring to pull it off is Mr. Gates. >>0 >>It's wonderful and would probably make tons of$ >>moolah.. Who's going to call Bill? >  >  > L > You'd probably have more luck with Allen, Wozniak, and Ellison. Maybe even
 > Ross Perot.  >  > I If I remember correctly, Paul Allen used to (still?) run his own private  @ PDP-10, his favorite system. So he appears to have a history of 1 investing in computer (DEC) history preservation.    Cheers!    K.C.   ------------------------------  + Date: Tue, 25 Jan 2005 15:12:22 +0000 (UTC) = From: jlw@psulias.psu.edu (j.lance wilkinson, (814) 865-1818) A Subject: Re: disposition of largest private DEC collection in USA - Message-ID: <ct5nkm$tui$1@f04n12.cac.psu.edu>   A In all this discussion, has anybody considered giving this to the C Computer History Museum (www.computerhistory.org) in Mountain View,  California?   E I visited there in July 2004 while attending training for the systems C that are planned to replace our Tru64 systems (which were expected  3 some years ago to replace our OpenVMS systems ;-P).   C I was very impressed with the collection and the efforts to restore  stuff.    P +----"Never Underestimate the bandwidth of a station wagon full of mag tapes"--+B | J.Lance Wilkinson ("Lance")		InterNet:  Lance.Wilkinson@psu.edu < | Systems Design Specialist - Lead	AT&T:      (814) 865-18189 | Digital Library Technologies		FAX:       (814) 863-3560 2 | 3 Paterno Library				"I'd rather be dancing..." B | Penn State University		    A host is a host from coast to coast,K | University Park, PA 16802	    And no one will talk to a host that's close C | <postmaster@psulias.psu.edu>	    Unless the host that isn't close : | EMail Professional since 1978	    Is busy, hung or dead.P +---------"He's dead, Jim. I'll get his tricorder. You take his wallet."-------+9                 [apologies to DeForest Kelley, 1920-1999] 3 <A Href="http://perdita.lcs.psu.edu">home page</a>  J <a Href="http://perdita.lcs.psu.edu/junkdec.htm">junk mail declaration</a> --	/"\ 	\ /	ASCII RIBBON CAMPAIGN 	 X	AGAINST HTML MAIL  	/ \   ------------------------------  % Date: Tue, 25 Jan 2005 08:58:06 -0500 ' From: "Main, Kerry" <kerry.main@hp.com> " Subject: RE: es45 cluster with evaR Message-ID: <FD827B33AB0D9C4E92EACEEFEE2BA2FB53EC08@tayexc19.americas.cpqcorp.net>   > -----Original Message-----. > From: ugex [mailto:edgar_ulloa@yahoo.com]=20  > Sent: January 24, 2005 9:20 AM > To: Info-VAX@Mvb.Saic.Com   > Subject: es45 cluster with eva >=20
 > Hi Guys: >=20? > I want to assembly a cluster with es45 and ds25 under ovms=20  > 7.3-r1 but I > have an Eva storage. >=20F > Some one know any documentation about to how configure clusters with > eva..? >=20 >=20 > cheers =20 >=20 > Edgar  >=20   Edgar,  H Need to config EVA / controllers for the RAID type and number of storageB devices you want and then configure VMS Clustering. On each systemB console you will also need to use the a utility to config the boot devices for the vms servers.  
 Reference:H http://h71000.www7.hp.com/doc/732FINAL/6318/6318pro_contents_001.html#to c_chapter_7 A http://h71000.www7.hp.com/doc/732FINAL/6318/6318pro_contents.html E http://h71000.www7.hp.com/doc/os732_index.html (all online VMS V7.3-2  doc's)   Regards   
 Kerry Main Senior Consultant  HP Services Canada Voice: 613-592-4660  Fax: 613-591-4477  kerryDOTmainAThpDOTcom (remove the DOT's and AT)=20  $ "OpenVMS has always had integrity .. Now, Integrity has OpenVMS .."   ------------------------------    Date: 25 Jan 2005 06:33:18 -0800/ From: "ropegun1@yahoo.com" <ropegun1@yahoo.com> B Subject: Help configuring RAID with HP SmartArray 5300A controllerC Message-ID: <1106663598.252966.216370@z14g2000cwz.googlegroups.com>   	 Hello all F I am trying to figure out how to setup a RAID configuration on a DS20EC server with a 4 disk internal disk bank.  This is a new system with D nothing on it.  I am able to do a basic configuration using the ORCA utility from the console. F My question is to end up with a system disk and a user disk in OpenVMSE 7.3-2 what is the best approach.  I want to utilize the redundancy of C the array on the user disk and system disk.  Do I need to create on F array with all 4 physical disks from ORCA and then create logical userC and system disks after the OS install? I am reading about an ACU-XE E utility that supposedly allows a browser type configuration is this a F possibility? I am a rookie on DEC hardware configuration so any advice will be greatly appreciated. Thanks,  Heath Harber Special Metals Corportation  Huntington, Wv   ------------------------------  # Date: Tue, 25 Jan 2005 18:47:11 GMT 7 From: John Malmberg <malmberg@dskwld.zko.dec.compaq.hp> F Subject: Re: Help configuring RAID with HP SmartArray 5300A controller2 Message-ID: <PuwJd.6526$1n4.1298@news.cpqcorp.net>   ropegun1@yahoo.com wrote:  > Hello all H > I am trying to figure out how to setup a RAID configuration on a DS20EE > server with a 4 disk internal disk bank.  This is a new system with F > nothing on it.  I am able to do a basic configuration using the ORCA > utility from the console. H > My question is to end up with a system disk and a user disk in OpenVMSG > 7.3-2 what is the best approach.  I want to utilize the redundancy of E > the array on the user disk and system disk.  Do I need to create on H > array with all 4 physical disks from ORCA and then create logical user( > and system disks after the OS install?  H You must create the system disk first with ORCA or you will not be able  to install the OS on it.  D You can also create any other volumes at that time, or you can wait B until after you install the ACU-XE utility that you mention below.  H As to how you should best configure things, that really depends on what ' you are planing to do with your system.   H If you go for fault tolerance with the highest speed for writes, and be I simple to maintain, then creating a mirror with two entire disks for the  F system disk would be an option, with the other two entire disks for a 
 data disk.  G By keeping the physical disks assigned to the logical volumes that you  G intend on creating separate, you will create the fastest writable pair   of fault tolerant drives.   G Or you can put all four disks in to two mirror sets.  But simultaneous  5 writes to the same physical disk may be a bottleneck.   G If capacity is an issue, 4 disks allow you do use RAID 5 and divide it  C up into as many logical volumes as you want.  However simultaneous  , access to those volumes may be a bottleneck.  3 Or you can go with a 3 disk RAID 5 and a hot spare.   I Only you can predict what your fault tolerance and performance needs are.   C In general having more than one volume share a physical disk as in  2 partitioning schemes will not improve performance.  G For many applications on OpenVMS, you could just make one or two large  D volumes, and use concealed rooted logical names to make it a single I volume look like a number of volumes.  And unlike partitions, you do not  F have to preset the size of the area pointed to by those logical names.  B I use the concealed rooted logical names to make it look like eachE major application, or group of files have their own volume, and I use  the same ones for each system.  G That way I can have over 100 systems with different number of disks on  E them, yet I know that all of the user files can be found by the name  E user_root:, and application foo on foo_root:.  On some systems those  H files are all on the system disk, on others they are on their own disks  for performance reasons.  I This way when you add more disks, you can move things, and in most cases  > not even have to reinstall or reconfigure anything except the : SYLOGICALS.COM file to change where the logical disks are.   > I am reading about an ACU-XEG > utility that supposedly allows a browser type configuration is this a H > possibility? I am a rookie on DEC hardware configuration so any advice > will be greatly appreciated.  I If you have a simple configuration planned, I would recommend as long as  G you are in the ORCA utility to set it all up, and then get to know the   ACU-XE as you get comfortable.  ' Welcome and feel free to ask questions.    -John ! malmberg@dskwld.zko.dec.compaq.hp  Personal Opinion Only    ------------------------------    Date: 25 Jan 2005 05:43:28 -0800 From: bob@instantwhip.com " Subject: Re: HP to be SAPed again?C Message-ID: <1106660608.450238.202030@c13g2000cwb.googlegroups.com>   / realtime sounds like a perfect fit for OpenVMS!    ------------------------------  % Date: Tue, 25 Jan 2005 11:34:04 -0500 ( From: Bill Todd <billtodd@metrocast.net>@ Subject: Re: New and Refreshed Advertising Colateral for OpenVMS= Message-ID: <2bmdna8SQYNq6WvcRVn-pQ@metrocastcablevision.com>   
 AEF wrote:   ...      suppose HP does I > start promoting VMS. Do we then forget the Alphacide and let people buy C > it? Do we continue to warn them not to buy it? If hp *does* start E > promoting VMS, will cov readers cheer or just write negative things B > claiming it's just another trick by hp to be followed by anotherI > Alphacide-type event? Of course some will do one and some the other. If G > hp makes commitments won't they be blasted as lies by Bill and others  > in the group?   H The answer is simple, and I already provided it:  money talks, bullsh!t  walks.  G HP can talk until it's blue in the face and because we've heard it all  I before many of us won't believe a word of it unless it fits in with what  I their *actions* tell us.  There may be a few here who might be impressed  E if HP honchos just talked up VMS a bit (given how silent it has been  C about VMS since the merger), but probably more who are looking for   something of real substance.  G If HP starts spending *real money* both promoting VMS and bringing VMS  E up to currently-competitive levels of performance and features (file  E system and RMS come naturally to my own mind, but they're hardly the  D only areas in need of updating) - both of which would indicate some G real, not merely verbal, commitment to a future for the product rather  I than the intent to milk it as a cash cow only as long as the milk supply  H holds out and then send it to the glue factory - you'll most likely see E a dramatic change in attitude around here.  Conversely, failing such  L *evidence* of real long-term commitment, you'll see what you've been seeing.  8   How can any of this lead to something positive? Will a4 > change in leadership really satisfy the naysayers?  G No - but giving Carly the boot would be an appropriate first step, and  E then we could see how the new management looked and how receptive it   appeared to be.      Leadership hasB > changed at least twice now and still there is no fully-proactiveC > marketing of VMS. Will a new CEO really help? If the new CEO does I > appear helpful to VMS at first, will the naysayers shut up and wait and  > see?  E Again, your ignorance of history rears its head:  take a look at how  E positively Compaq's take-over was viewed here after Pfeiffer started  B making positive comments about Alpha and VMS and actually started D marketing them.  Even after Pfeiffer got ousted Curly was given the D benefit of the doubt, though that began to erode when he axed NT on C Alpha, continued to diminish a year later as the 'VMS renaissance'  E started grinding to a halt, and fell off a cliff after the Alphacide.    - bill   ------------------------------    Date: 25 Jan 2005 07:53:48 -0800) From: alanhathway@gmx.de (Allan Hathaway) = Subject: OpenVMS Locks NL EX Requested Granted in ALPHA MACRO = Message-ID: <77ad1693.0501250753.37f67d0a@posting.google.com>    Hello!  + Anyone out there, who knows something about  1) ALPHA MACRO Language  AND  2) LOCKS under OpenVMS?  D I have the following problem. I have a Macro programm. (Source - see later): Someone found it years ago, who knows where, for the VAX. F It needed a couple of twists to get it to work for the Alpha, which it does. @ The programm asks for the name of a file and then prints out all	 processes . in the cluster, which are accessing the file. 1 It produces the correct number of locks and PIDs. 1 We would like more information from the programm, B specifically, whether a process is just reading or has a lock on a record. = (We have an Artikel-file RMS INDEXED, with hundreds of people  accessing it.)D But the output in the columns RQ (Requested) and GR (Granted) do not seem to be correct. . They seem to be (almost) always NL (Null mode)B If I start with a test-file, sometimes I get to see EX (Exclusive)5 but not always and never often enough (in my opinion)    Anyone got any suggestions?    Thanks in advance    Allan Hathaway     Example of usage of programm $ r sperre2  Enter file name: dt:artikl.dta  D  143 locks on resource "RMS$k."...RAID-5__D01 ..." at node ALPHA3::(  File name is: D01:[UPEX.DTA]ARTIKL.DTA;  3       PID     NODE  LOCK ID  RQ GR  QUEUE   REMLKID 3     20320654 ALPHA2 04003EDE NL NL GRANTED 080021DA 3     2031C038 ALPHA2 360001C5 NL NL GRANTED 6E003DD1 3     2031E8AB ALPHA2 4D000F04 NL NL GRANTED 6C002D4A 3     2031D6E0 ALPHA2 10000BAD NL NL GRANTED 74002E31 3     2031AC37 ALPHA2 28002D46 NL NL GRANTED 3E0036ED 3     20664518 ALPHA3 0500421F NL NL GRANTED 0500421F 3     2031B859 ALPHA2 5300132F NL NL GRANTED 57001755  etc. etc.    & The Source of the programm SPERRE2.MAR9 	;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; 9 	;;;                                                  ;;; 9 	;;; IMPORTANT NOTE:                                  ;;; 9 	;;;                                                  ;;; 9 	;;;       - this program is non-digital              ;;; 9 	;;;       - this program has no copyright attached   ;;; 9 	;;;       - no support for this program              ;;; 9 	;;;       - no gurantee for this program             ;;; 9 	;;;       - no further development for this program  ;;; 9 	;;;       - have fun                                 ;;; 9 	;;;                                                  ;;; 9 	;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;   C 	.title	RMS_LOCK_LIST - List all RMS file locks on a specified file  ;  ; C ;	29.09.91  a.h.  subb2 entfernen da Dateien mit Version >=10 nicht  gehen 9 ;	14.09.94  a.h.  Versuch auf ALPHA zum Laufen zu bringen 3 ;	14.09.94  a.h.  Compilierung ohne nderung bringt # ;	14.09.94  a.h.          .word   0 8 ;	14.09.94  a.h.  %AMAC-E-DATINCODE, data in code stream ;	14.09.94  a.h.  dreimal und 4 ;	14.09.94  a.h.  	$cmexec_s       routin = enq_lock9 ;	14.09.94  a.h.  %AMAC-E-STORCODLAB, stored code labels  ) ;	14.09.94  a.h.  must be declared entry  , ;	14.09.94  a.h.  points in routine LOCKLIST  ;	14.09.94  a.h.  bzw. auch fr 5 ;	14.09.94  a.h.  	$cmexec_s       routin=exec_getlki  ;	14.09.94  a.h.  und 2 ;	14.09.94  a.h.  	$cmexec_s       routin=deq_lock ;	14.09.94  a.h.  sowie 7 ;	14.09.94  a.h.  	$cmexec_s       routin = exec_getlki  ;	14.09.94  a.h.  und  ;	14.09.94  a.h.  	main:: = ;	14.09.94  a.h.  %AMAC-E-GLOBENTRY, global entry point MAIN  " ;	14.09.94  a.h.  must be declared ;	14.09.94  a.h.  sowie  ;	14.09.94  a.h.  deq_lock: 5 ;	14.09.94  a.h.  %AMAC-I-UNRCHCODE, unreachable code  ;	14.09.94  a.h.  exec_getlki:5 ;	14.09.94  a.h.  %AMAC-I-UNRCHCODE, unreachable code  ;	14.09.94  a.h.   ;	14.09.94  a.h.   ;	14.09.94  a.h.   ;	14.09.94  a.h.   ;	14.09.94  a.h.   ;  ; C ; This program will list all RMS$ file locks for a specified file.   ThisE ; is usefull to display all processes that have a file open by RMS on  a 
 ; cluster. ; C ; The program requires CMEXEC priv since the RMS locks are taken at 	 executive @ ; mode and we must do the same.  In addition, read access to the	 specified  ; file is required.  ; F ; for more information on resources, locks, and how VMS does all this,E ; consult the system services reference manual, and the internals andu dataD ; structures book along with the VMS sources for the modules in RMS, thes0 ; lock manager and the distributed lock manager. ;ED ; To get the lock information, we must know how to build a resource ? ; name for a file like RMS does.  The current (VMS V4) RMS filec resource ; name looks like:> ;	"RMS$" + file id (3 words) + device lock name (from $GETDVI) ;oD ; We build this resource name by using a $QIO to get the file ID and usingiB ; $PARSE to get the device name which is then passed to $GETDVI to returnC ; the device lock name (see the system services reference manual). n OnceF ; the resource name is built, $ENQ a null mode lock on the resource inB ; executive mode.  Then, using the lock ID returned from the $ENQ, callF ; $GETLKI with the item LKI$_LOCKS which will return an entry for eachD ; lock taken on the resource.  $DEQ the lock just so it doesn't hang aroundD ; for nothing.  Finally, do some output formatting on the result and display  ; it.i ;f( ; order of operations is something like:E ;	- $PARSE and $SEARCH for the file to get device, DID and file name.t! ;	- $GETDVI to get the DEVLOCKNAM # ;	- $ASSIGN a channel to the devicei" ;	- $QIO access to get the file ID$ ;	- $ENQ a lock on the resource name9 ;	- $GETLKI on our lock ID for all locks on this resource  ;	- $DEQ the lock-0 ;	- parse and display the results of the $GETLKI ;    	.macro	check, ?l1		; another  	blbs	r0,l1			;  silly macro 	ret				;   to do status l1:					;    checkingj 	.endm   	.library	/sys$share:lib/-  ! 	.psect	$data$,	rd,wrt,noexe,longn  $ 	$fibdef				; FIB layout definitions 	$psldef				; PSL definitions- 	$lckdef				; lock definitions! 	$lkidef				; $GETLKI definitionsr! 	$syidef				; $GETSYI definitionsm  + file_name: .quad 0			; file name descriptora  9 fib_block: .blkb fib$k_length		; FIB for opening the fileh/ fib_descr: .long fib$k_length		; FIB descriptorH            .long fib_block  5 fil:	   .quad 0			; file name+type+version descriptort9 files_dev: .quad 0			; device name descriptor for $ASSIGNr 					; and $GETDVI  $ io_status: .blkq 1			; IOSB for $QIO  , fab_blk: $fab	fop=nam,-		; FAB for RMS$PARSE 	        nam=nam_blk  0 nam_blk: $nam	rsa=res_str,-		; NAM for RMS$PARSE 	        rss=nam$c_maxrss,-  	        esa=exp_str,- 	        ess=nam$c_maxrssd  2 exp_str: .blkb nam$c_maxrss		; exanded name string4 res_str: .blkb nam$c_maxrss		; resultant name string  ' chan:	.long	0			; channel to the device-  1 dviitmlst:				; $GETDVI item list to get the lockI! 	.word	16			; name for the deviced 	.word	dvi$_devlocknam 	.address devlck 	.long	0 	.long	0  1 syiitmlst:				; item list to return node name for- 	.word	15			; a given CSID 	.word	syi$_nodename 	.address	nodename 	.address	nodename_len 	.long	0  4 nodename_desc:				; string descriptor for node names- nodename_len:	.long	0		; filled in by $GETSYIg8 		.address nodename	; text of node name always goes here$ nodename:	.blkb	15		; in this buffer  % lkiitmlst:				; item list for $GETLKI 1 	.word	1500			; 1500 bytes won't be enough alwaysn& 	.word	lki$_locks		; get all the locks 	.address lock_list  	.address lock_len   	.word	44 	.word	lki$_lckcount		; get a count of all the locks 	.address total_locks  	.long	0   	.long	0  7 total_locks:				; total number of locks on the resourcen 	.long	03 lock_len:				; length of returned list and the sizel 	.long	0			; of each entry  ( lock_list:				; buffer for the lock list 	.blkb	1500y   lock_sb:				; LKSB bufferd 	.long	0			; statusa 	.long	0			; LKID-) 	.blkb	16			; VALUE BLOCK (not used here)s   lkidx:					; our LKIDi 	.long	0  ' fao_header:				; titles for the columns A 	.ascid	<10>\      PID     NODE  LOCK ID  RQ GR  QUEUE   REMLKID\d/ fao_control:				; control string for each entryc. 	.ascid	/    !XL !6<!AS!> !XL !AS !AS !AS !XL/   ;s ; two buffers (crudely done) ;e
 fao_buff1:F 	.ascid	/                                                                              /m
 fao_buff2:F 	.ascid	/                                                                         /   fao_h1:					; main headero6 	.ascid	\!/ !SL locks on resource "!AF" at node !AS::\ fao_h2:  	.ascid	\ File name is: !AS\  / resource:				; descriptor for the resource nameh/ 	.long	26			; length is always 26 for RMS locks + 	.address res_addr		; pointer to the stringa  # res_addr:				; resource name string ' 	.ascii	/RMS$/			; prefixed with "RMS$"a fid1:	.word	0			;  Three words fid2:	.word	0			;     of the fid3:	.word	0			;    file ID6 devlck:	.blkb	16			; and then the DVI$_DEVLOCKNAM from 					; $GETDVI ;e, ; queue names for where the locks are living ;s granted_queue:	.ascid	/GRANTED/e convert_queue:	.ascid	/CONVERT/  waiting_queue:	.ascid	/WAITING/n   ;rD ; table of mode values.  This table is based on the current (VMS V4) lock3 ; mode values and is indexed into by the lock mode.. ;  lock_mode_table: 	.ascii	/NL/		; (0) NULL modeN# 	.ascii	/CR/		; (1) Concurrent readc$ 	.ascii	/CW/		; (2) Concurrent write" 	.ascii	/PR/		; (3) protected read# 	.ascii	/PW/		; (4) protected writee 	.ascii	/EX/		; (5) exclusivec  = gr_mode_desc:			; string descriptor for the granted mode locki 	.long	2		; always 2 bytes longg3 	.long	0		; filled in with the correct mode addressb  3 rq_mode_desc:			; same for the requested mode lockst 	.long	2 	.long	0  . fn_desc:			; input file name string descriptor
 	.long	fn_leni 	.address fn_text  fn_text:	 	.blkb	80m fn_len = .-fn_Text  % fn_prompt:			; input file name prompts 	.ascid	/Enter file name: /d n! 	.psect	$code$,	rd,nowrt,exe,long    	.entry	locklist,0 ;e) ;	nderung am 14.9.94 - bis dahin war es y ;main:: " ;	jetzt wird es ersatzlos entfernt ;o   ;  ; determine the file namee ;  	pushal	fn_prompt  	pushal	fn_descI 	calls	#2,g^lib$get_inputh 	check   ;n) ; fill in the NAM block default file name  ;I 	movb	fn_desc,fab_blk+fab$b_dnsp! 	movl	fn_desc+4,fab_blk+fab$l_dnaK   ;&C ; do the $PARSE and then a $SEARCH to get the DID and expanded namew ;n@ 	$parse fab=fab_blk	; get DID of directory file & ready for the  	check			; $SEARCH  ; 	$search fab=fab_blk	; get the rest of the file informationo 	check  8 	movzbl	nam_blk+nam$b_ess, file_name	; get expanded name$ 	movl	nam_blk+nam$l_esa, file_name+4  B 	movzbl	nam_blk+nam$b_dev, files_dev	; get device name for $ASSIGN$ 	movl	nam_blk+nam$l_dev, files_dev+4   ;  ; get the device lock name ; 
 	$getdviw_s -  		itmlst=dviitmlst, -f 		devnam=files_dev 	check   ;e  ; assign a channel to the device ;  	$assign_s -) 		devnam=files_dev, -		; channel for QIO.r 		chan=chanp 	check   ;nE ; make a string descriptor of the file name, type and version for the- QIOaD ; IO$ACCESS.  do this by adding the sizes of the file name, type and versionmF ; to get the length and just grab the pointer to the name from the nam blockn? ; for the address.  This is safe because the file name type and  versionoF ; are stored in order and the file name pointer addresses the start of thew	 ; string.a ;i0 	addb3	nam_blk+nam$b_name,nam_blk+nam$b_type,fil 	addb2	nam_blk+nam$b_ver,fil ;	subb2	#1,fil 	movl	nam_blk+nam$l_name,fil+4   ;e ; move the DID to the FIB0 ;w, 	movl nam_blk+nam$w_did, fib_block+fib$w_did7         movw nam_blk+nam$w_did+4, fib_block+fib$w_did+4- ;-= ; Access the file to get the file ID and then get rid of the m% ; channel since we no longer need it.m ;i) 	$qiow_s chan=chan,-			; access the file,s2 	        func=#io$_access,-		; filling in the FID. 	        iosb=io_status,-  	        p1=fib_descr,-/	 		p2=#fili# 	check					; is R0 meaning success?s1 	blbs	io_status,5$			; also check the IOSB for OK.4 	$exit_s code=io_status			; IOSB has an error status  - 	$dassgn_s -				; don't need this any more...a 		chan=chan1 	check   ;mD ; grab the file ID and stuff it into the lock resource name (assumes thei ; format of the fib).x ;D 5$:R 	movl	fib_block+4,fid1 	movw	fib_block+8,fid3   ; < ; enq the lock from executive mode on our RMS resource name. ;i 	$cmexec_s	routin = enq_lock 	check* 	movl	lock_sb+4,lkidx			; save the lock ID   ;iC ; now call GETJPI from executive mode since we need information on o? ; an executive mode lock (the one that we use finished ENQing).w ;d 	$cmexec_s	routin=exec_getlkio 	check   ;aE ; DEQ the executive mode lock on our resource since we no longer needi it ;e 	$cmexec_s	routin=deq_lock 	check     ;lA ; since the resource mastering node for all the locks will be thec	 same, gettF ; the first one and call $GETSYI to retrieve the node name of the that node ;e+ 	moval	lock_list,r3			; points to lock listv
 	$getsyiw_s -m 		csidadr = lki$l_sysid(r3), - 		itmlst = syiitmlst   ;tB ; display a header line including the resource name, the number of locksV@ ; queued on the resource, and the system mastering the resource. ; . 	pushal	nodename_desc			; node name descriptor/ 	pushl	resource+4			; location of resource name ) 	pushl	resource			; size of resource name - 	pushl	total_locks			; total number of locks o/ 	pushal	fao_buff1			; buffer to hold the results 	pushl	#0				;" 	pushal	fao_h1				; control string ;o2 ;	17.9.94  calls #6,... durch calls #7,... ersetzt ;	alt:	calls	#6,g^sys$faos ;o 	calls	#7,g^sys$fao  ;  	check  , 	pushal	fao_buff1			; output string from FAO( 	calls	#1,g^lib$put_output		; display it  * 	pushal	file_name			; file name descriptor 	pushal	fao_buff1c 	pushal	fao_buff1o 	pushal	fao_h2. 	calls	#4,g^sys$fao			; create the second line 	check 	n- 	pushal	fao_buff1			; line with the file name ( 	calls	#1,g^lib$put_output		; display it  . 	pushal	fao_header			; display the header line 	calls	#1,g^lib$put_output  > 	divw3	lock_len+2,lock_len,r2		; determine the number of locks 						; in our table3 	moval	lock_mode_table,r6		; our list of mode names % 	clrl	r4				; index in the lock tablei   ;eC ; loop to skip down the list of locks and display information about  each ;b 10$:- 	addl3	r3,r4,r5			; add the base to the indexN  . 	$getsyiw_s -				; get the node that the owner4 		csidadr = lki$l_remsysid(r5),-	; of the lock is on 		itmlst = syiitmlst 	check   ; E ; determine which queue (granted, convert or waiting) the lock is in  < ; and put a pointer to the matching string descriptor in R0. ; 4 	moval	granted_queue,r0		; assume that it is grantedE 	cmpb	lki$b_queue(r5),#lki$c_granted	; is the lock on the granted ques 	beql	1119$				; yes, go ona  7 	moval	convert_queue,r0		; assume that it is convertingtB 	cmpb	lki$b_queue(r5),#lki$c_convert	; is it on the CONVERT queue? 	beql	1119$t  / 	moval	waiting_queue,r0		; must then be waitingI   1119$: ;eF ; determine the modes of the locks on the granted and request queues.  Use " ; our little table to do all this. ;d7 	movzbl	lki$b_grmode(r5),r1		; get the mode for grantedb) 	mull	#2,r1				; times 2 for 2 byte modes.= 	addl3	r6,r1,gr_mode_desc+4		; fill in the descriptor addresse  9 	movzbl	lki$b_rqmode(r5),r1		; get the mode for requestedn 	mull	#2,r1				; fix the offsete2 	addl3	r6,r1,rq_mode_desc+4		; fill in the address   ; 6 ; push the arguments for the FAO and output the string ;e* 	pushl	lki$l_remlkid(r5)		; remote lock ID# 	pushl	r0				; pointer to the queue % 	pushal	gr_mode_desc			; mode grantedn' 	pushal	rq_mode_desc			; mode requestedw& 	pushl	lki$l_lockid(r5)		; the lock ID, 	pushal	nodename_desc			; node of the locker) 	pushl	lki$l_pid(r5)			; PID of the ownera  	pushal	fao_buff2			; FAO buffer 	pushl	#0				;& 	pushal	fao_control			; control string& 	calls	#10,g^sys$fao			; and format it 	check  ! 	pushal	fao_buff2			; display the / 	calls	#1,g^lib$put_output		;  resultant string   / 	addw	lock_len+2,r4			; index to the next entryg  ! 	subw	#1,r2				; bump the countere  	bleq	999$				; if done, get out  	brw	10$				; if not, do another   999$:	$exit_s code=r0- ;-  ;	17.09.94 ret Befehl eingefgt  ;5 	ret ;  0 ; - ; call these next 3 routines with a CHEXEC...> ;u   ;: ; enq a lock in exeutive modev ; ) ;	nderung am 14.9.94 - bis dahin war es 8
 ;enq_lock:	 ;	.word	0a ;	jetzt wird es  ;.ENTRY ENQ_LOCK,0 ;  	.ENTRY ENQ_LOCK,0  " 	$enqw_s	lkmode = #lck$k_nlmode, - 		lksb = lock_sb, -l 		acmode = #psl$c_exec, -n 		resnam = resource, - 		flags = #lck$m_systemt 	ret   ;>  ; DEQ the lock in executive mode ; ) ;	nderung am 14.9.94 - bis dahin war es r
 ;deq_lock:	 ;	.word	0e ;	jetzt wird es  ;.ENTRY DEQ_LOCK,0 ;  	.ENTRY DEQ_LOCK,0   	$deq_s	lkid=lkidx 	ret   ;w, ; get the lock information in executive mode ;y) ;	nderung am 14.9.94 - bis dahin war es t
 ;exec_getlki:a	 ;	.word	0r ;	jetzt wird es  ;.ENTRY EXEC_GETLKI,0i ;n 	.ENTRY EXEC_GETLKI,0:   	$getlkiw_s	lkidadr=lkidx,-e 			itmlst=lkiitmlstw 	ret   	.end	locklist   ------------------------------    Date: 25 Jan 2005 04:43:34 -0800& From: "Galen" <gspamtackett@yahoo.com> Subject: PDFs for HP C docsaC Message-ID: <1106657014.241867.190440@f14g2000cwb.googlegroups.com>o  F Using Google and other search methods I haven't been able to find PDFsC for the VMS versions of the HP C language reference and users guidesG documents at hp.com, though it appears that the PDFs for Tru64 versions  might be available.   5 If anyone knows differently, please provide pointers.   F It seems a bit inconsistent to provide PDFs of so many large documentsA on the operating system itself, while not providing these layered 
 product PDFs.u   ------------------------------    Date: 25 Jan 2005 03:06:26 -0800 From: mail@sanface.com Subject: PLUG: txt2pdf 8.0B Message-ID: <1106649266.390552.39810@f14g2000cwb.googlegroups.com>  . We would like to announce txt2pdf 8.0 version.# http://www.sanface.com/txt2pdf.html E txt2pdf is shareware; it is a very flexible and powerful Perl5 scriptaB that converts text files to PDF format files, so you can use it in> every operating systems supported by Perl5, including OpenVMS.( Remember to read "txt2pdf on OpenVMS" at# http://www.sanface.com/openvms.html>; It's simple to design background like invoices, orders etc.e) Here nice examples made using txt2pdf PROs- http://www.sanface.com/pdf/Purchase_Order.pdfs) http://www.sanface.com/pdf/oldinvoice.pdfb$ http://www.sanface.com/pdf/hfmus.pdf) http://www.sanface.com/pdf/heraldbill.pdf @ If you prefer we also distribute executables for Windows, Linux,G Solaris, AIX, HP-UX, and Mac OS X. Inside the Windows version is Visuale txt2pdf, a VB GUI.   What's new in this versionG Support for Greek, Polish and Thai. (If you want different languages or 8 different fonts for the supported languages contact us).  4 Read Independent Liquor Group PDF Invoice Project at' http://www.sanface.com/ilg-project.htmlc   Test txt2pdf 8.0!'6 You can find it at http://www.sanface.com/txt2pdf.html   ------------------------------  + Date: Tue, 25 Jan 2005 09:15:54 -0600 (CST) * From: sms@antinode.org (Steven M. Schweda)X Subject: Re: Reject-Unbacktranslatable-IP v. "Received: from unknown.hostname (x.x.x.x)") Message-ID: <05012509155419@antinode.org>>  - From: jfmezei.spamnot@teksavvy.com (JF Mezei)r  % > >Reject-Unbacktranslatable-IP: TRUEt > 2 > >Received: from unknown.hostname (222.233.94.99)@ > >         by alp.antinode.org (V5.4-15, OpenVMS V7.3-1 Alpha); >  > Have you tried:t > J > $DEFINE/SYSTEM TCPIP$SMTP_RECV_DEBUG 1 and then look at the logs of the I > receiver to ensure that the receiver has properly seen your request to s > reject unbacktranslatables ?  H    After adjusting SYS$SYSTEM:TCPIP$SMTP_RECV_RUN.COM to retain more logF files (now a logical name, TCPIP$SMTP_RECV_RUN_LOG_PURGE_LIMIT) and toE re-version the things when getting close to version 32767 (apparently ) reached again some time ago), I observed:h  *       Reject-Unbacktranslatable-IP  : TRUE	 but also:,F       Empty Good-Clients list. Consider everybody a known good client. and:/       recv_serv: remote host = unknown.hostnamee*       recv_serv: client_known = CLIENTGOOD  E    Figuring that I had little to lose, I defined a short Good-ClientstG list, comprising the local (internal) network, 10.0.0.0/24.  This seemspA to have had the desired effect, as I now get OPCOM messages like:cE       TCPIP-W-SMTP_UNBKTRNSIP, client IP address 63.77.232.244 is noto%       backtranslatable to a host name  and:L       TCPIP-W-SMTP_CLNTINRBL, client IP address 80.14.15.42 matched RBL listF neither of which had been observed before.  (I always wondered why the( RBLs never seemed to cause a rejection.)  H    So, is this requirement somwhow obvious from the documentation (and IG just have an osmium-like density), or has anyone else suffered from theh& effects of an empty Good-Clients list?  H ------------------------------------------------------------------------  4    Steven M. Schweda               (+1) 651-699-98183    382 South Warwick Street        sms@antinode-orgb    Saint Paul  MN  55105-2547o   ------------------------------  % Date: Tue, 25 Jan 2005 10:28:09 +0000c- From: John Laird <nospam@laird-towers.org.uk>i Subject: Re: RFA string format8 Message-ID: <s47cv0p28hvqbvpo4j6v3vdrp1d86smnss@4ax.com>  K On Tue, 25 Jan 2005 00:25:49 +0000, John Laird <nospam@laird-towers.org.uk>- wrote:  K >On 24 Jan 2005 16:18:04 -0700, nothome@spammers.are.scum (Malcolm Dunnett)l >wrote:i >n; >>In article <qj0bv0516j594edp0otod1678a3b5u3cbk@4ax.com>, t5 >>    John Laird <nospam@laird-towers.org.uk> writes:n >> >>> M >>> Further to a related post, the 6 bytes represent, I believe, a little bitoO >>> more than just a byte offset.  I don't think the full 48 bits are therefore L >>> available for use.  (I'd not be surprised if the RVN isn't in there, for
 >>> example.)  >>> L >>    I don't understand why relative volume number would be part of the RMS@ >>RFA. Relative volume number is a construct at the ODS-2 level. >eL >A guess might be locking, but I'll admit I didn't really think that through! >to see how sensible it might be.+  H And about 5 minutes after posting that, I'd pretty much convinced myselfK that unless something prevents a single record from spanning volumes, it ishK probably not all that sensible at all.  No such foolproof something came toa mind..   -- e1 Welcome to the jungle.  Please observe our laws. t   Mail john rather than nospam...6   ------------------------------  % Date: Tue, 25 Jan 2005 06:10:13 -0500.' From: Dave Froble <davef@tsoft-inc.com>l Subject: Re: RFA string format( Message-ID: <41F62915.602@tsoft-inc.com>   JF Mezei wrote:I   > Question:c > G > For  database systems such as Oracle or RDB, how do they access theirKG > data inside their database files ?  Aren't those considered to be raw ! > data container files by RMS ?  / > J > Do these database applications make use of RFAs at all ? Or do they workL > only with raw byte offsets, or just relative block numbers inside a file ? >   N RFAs are used within an RMS file.  The databases don't use RMS, thus wouldn't 	 use RFAs.e  P I did a bit more playing around, this time with an indexed file.  It seems that I an RFA for a relative file and a RFA for an indexed file are two totally c< seperate things.  Wish there was some documentation on RFAs.   ------------------------------  % Date: Tue, 25 Jan 2005 06:12:37 -0500t' From: Dave Froble <davef@tsoft-inc.com>  Subject: Re: RFA string format* Message-ID: <41F629A5.90108@tsoft-inc.com>   Mark Buda wrote:  7 > "Dave Froble" <davef@tsoft-inc.com> wrote in message  ( > news:41F5A39D.3030607@tsoft-inc.com... > 6 >>Is there a definition of the RFA available anywhere? >> > M > If you really want it that badly, I will dig around and provide it for you.  >  > mark >  >  >   9 I'm curious.  If you can easily do so, then please do it.m   Dave   ------------------------------  % Date: Tue, 25 Jan 2005 14:41:27 +0100n) From: "Jan van der Weijde" <JanW@WRQ.com>. Subject: Re: RFA string format0 Message-ID: <10vcj8aa8vb513a@corp.supernews.com>  . <VAXman- @SendSpamHere.ORG> schreef in bericht* news:00A3E586.7E3DE4B6@SendSpamHere.ORG...G > In article <10va1c1m4m1ga94@corp.supernews.com>, "Jan van der Weijde"T <JanW@WRQ.com> writes:	 > >Hello,n > >=K > >    does anyone have experience with the way an OpenVMS RMS table Record 2 > >File Address (RFA) is represented as a string ?/ > >Internally it is a three byte integer value.u >y' > Three *WORD* (16 bit) integer values.D >t >P9 > >On the internet I only found the string representation6 RFA(0001,0000,0000)o$ > >(e.g. output of dump/rec <file>).5 > >Is this a format OpenVMS users are familiar with ?n >D* > Must be if that's how DUMP presented it. > * > What is it you are wanting/trying to do? >m > -- o> > http://www.ProvN.com  for the *best* OpenVMS system security? >                       solutions that others only claim to be.  > -- V. > Cyber-Terrorism (si'-ber tayr'-or-iz-em) n.:E >   The release of, the sale of, or the use of any Micro$oft software  product! > -- a2 > VAXman- A Bored Certified VMS Kernel Mode Hacker VAXman(at)TMESIS(dot)COM     Hi,t  H Of course, you are right! I use the next C-structure (part of rabdef.h):   ....     __union  {B         unsigned short int rab$w_rfa [3]; /* record's file address */         __struct  { $             unsigned int rab$l_rfa0;*             unsigned short int rab$w_rfa4;             } rab$r_rfa_fields;-         } rab$r_rfa_overlay;D     short int rabdef$$_fill_4;          /* (reserved - rms release 1 optimizes stores  */3 /*  to the rfa field to be a move quad, overwritingt */ /*  this reserved word)g */ ....  I I am extending the RMS interface (using C) our tools has (Verastream from F WRQ). So far we only support indexed sequential RMS files. I am addingG support for relative and sequential files. RFA access is in that case a  useful addition to the product.dB In certain cases it is easier for an end-user to refer to a recordF identifier as a single value (like ROWID in Oracle). So, besides threeL integers, I also wanted to add support for one string value, that internally) of course is processed as three integers.k   Thanks for the reaction.   Jan    ------------------------------  % Date: Tue, 25 Jan 2005 15:02:30 +0100t) From: "Jan van der Weijde" <JanW@WRQ.com>c Subject: Re: RFA string format0 Message-ID: <10vckfd7os3na0b@corp.supernews.com>  0 Are you sure RFA's are different per file type ?  5 In various HP documentation I read they are the same:CC "Random access by RFA is supported for all disk files. Whenever RMSfJ successfully accesses a record, an internal representation of the record'sL location is returned in the 6-byte RAB field RAB$W_RFA. When a program wantsI to retrieve the record using random access by RFA, RMS uses this internalr data to retrieve the record. "   Also manualeO http://h71000.www7.hp.com/DOC/731FINAL/DOCUMENTATION/PDF/OVMS_731_FILE_APP.PDF,n@ (table 2-1, page 2-2), does not mention diffrent RFA's per type.   Thanks,r Jant  6 "Dave Froble" <davef@tsoft-inc.com> schreef in bericht" news:41F62915.602@tsoft-inc.com... > JF Mezei wrote:u >i
 > > Question:r > >tI > > For  database systems such as Oracle or RDB, how do they access their4I > > data inside their database files ?  Aren't those considered to be rawu! > > data container files by RMS ?o > > L > > Do these database applications make use of RFAs at all ? Or do they workL > > only with raw byte offsets, or just relative block numbers inside a file ?o > >e >eF > RFAs are used within an RMS file.  The databases don't use RMS, thus wouldn't > use RFAs.s >mL > I did a bit more playing around, this time with an indexed file.  It seems thatJ > an RFA for a relative file and a RFA for an indexed file are two totally> > seperate things.  Wish there was some documentation on RFAs. >k   ------------------------------  % Date: Tue, 25 Jan 2005 15:06:04 +0100b) From: "Jan van der Weijde" <JanW@WRQ.com>e Subject: Re: RFA string format0 Message-ID: <10vckm2oujlp8e1@corp.supernews.com>   Hi,v  K I use the next C-structure (part of rabdef.h), where the RFA is returned inn# e.g. three unsigned short integers:  ....     __union  {E         unsigned short int rab$w_rfa [3]; /* record's file address */          __struct  {c$             unsigned int rab$l_rfa0;*             unsigned short int rab$w_rfa4;             } rab$r_rfa_fields;          } rab$r_rfa_overlay;D     short int rabdef$$_fill_4;          /* (reserved - rms release 1 optimizes stores  */J                                                    /*  to the rfa field to be a move quad, overwriting*/ J                                                    /*  this reserved word) */ ....   Jang  6 "Dave Froble" <davef@tsoft-inc.com> schreef in bericht& news:41F5A39D.3030607@tsoft-inc.com... > Bill Todd wrote: >e > > Dave Froble wrote: > >n > > ...n > >nH > >> As can be seen, the least significant word is in the first 2 bytes,8 > >> with the most significant word in the last 2 bytes. > >l > > I > > Unless the definition of what an RFA is has changed from the original.K > > design, there are no 'most significant' or 'least significant' parts to K > > it:  it is an opaque 6-byte value which RMS provides to the application K > > which the application can then return to RMS as a record identifier forcL > > the record in question (though in the case of indexed files only as longE > > as the original file has not been reorganized, and in the case of C > > sequential files only as long as the original file has not beenCK > > truncated to a location preceding that record and then repopulated pastnJ > > the previous record's location; with relative files, any record in the2 > > same single-record 'slot' qualifies as a hit). > > 
 > > - bill >tI > I've used RFA very infrequently.  I'd assumed that it was just a 48 bite unsigned$ > integer.  No real reason to do so. >i6 > Is there a definition of the RFA available anywhere? >    ------------------------------  # Date: Tue, 25 Jan 2005 14:32:50 GMT ; From: "Jeffrey H. Coffield" <jeffrey@digitalsynergyinc.com>l Subject: Re: RFA string format; Message-ID: <mMsJd.5725$8Z1.580@newssvr14.news.prodigy.com>k   Alan Frisbie wrote:  > Bill Todd wrote: > I >> Unless the definition of what an RFA is has changed from the original eH >> design, there are no 'most significant' or 'least significant' parts B >> to it:  it is an opaque 6-byte value which RMS provides to the H >> application which the application can then return to RMS as a record H >> identifier for the record in question (though in the case of indexed I >> files only as long as the original file has not been reorganized, and gI >> in the case of sequential files only as long as the original file has eC >> not been truncated to a location preceding that record and then tI >> repopulated past the previous record's location; with relative files,  C >> any record in the same single-record 'slot' qualifies as a hit).r >  > H > This applies to RMS-11, but I'm pretty sure it also applies to RMS-32.G > While the RFA is never actually defined anywhere (that I could find), # > it is fairly easy to deduce that:r > 6 >   RFA Word 1 = 1st word of VBN of bucket holding RRV+ >   RFA Word 2 = Record ID of RRV in bucketn6 >   RFA Word 3 = 2nd word of VBN of bucket holding RRV > @ > It is interesting to note that even using RFA access, RMS must? > still search through the relevant bucket sequentially to find  > the requested record.h >  > Alan > @ So how does an RFA still retrieve a record if the bucket splits?   ------------------------------  % Date: Tue, 25 Jan 2005 14:43:16 +0000a- From: John Laird <nospam@laird-towers.org.uk>t Subject: Re: RFA string format8 Message-ID: <dmmcv0hbspvfi2rr77hacljd0d67dn2nm0@4ax.com>  7 On Tue, 25 Jan 2005 14:32:50 GMT, "Jeffrey H. Coffield"a& <jeffrey@digitalsynergyinc.com> wrote:  A >So how does an RFA still retrieve a record if the bucket splits?t  2 See http://h71000.www7.hp.com/wizard/wiz_9668.html   -- t; Most Wanted?  Why not keep them when they're photographed?     Mail john rather than nospam...    ------------------------------  # Date: Tue, 25 Jan 2005 15:08:01 GMTa; From: "Jeffrey H. Coffield" <jeffrey@digitalsynergyinc.com>n Subject: Re: RFA string format< Message-ID: <lhtJd.5731$8Z1.1365@newssvr14.news.prodigy.com>   John Laird wrote:-9 > On Tue, 25 Jan 2005 14:32:50 GMT, "Jeffrey H. Coffield"O( > <jeffrey@digitalsynergyinc.com> wrote: >  > B >>So how does an RFA still retrieve a record if the bucket splits? >  > 4 > See http://h71000.www7.hp.com/wizard/wiz_9668.html >  Thanx, that makes sense.   ------------------------------  % Date: Tue, 25 Jan 2005 10:42:58 -0500r( From: Bill Todd <billtodd@metrocast.net> Subject: Re: RFA string format= Message-ID: <MKidneqoQYZg9WvcRVn-qw@metrocastcablevision.com>r   Malcolm Dunnett wrote:@ > In article <HoWdnaR3vOwJN2jcRVn-1A@metrocastcablevision.com>, 0 >     Bill Todd <billtodd@metrocast.net> writes: >  > J >>>   If we've all truly treated it as an opaque value then no applicationJ >>>programs need be changed in order to change the way RMS internally uses >>>the RFA.a >>I >>Save for the small matter of applications which are using the existing oI >>format and expect new versions of RMS to honor it as long as the files G >>involved haven't changed.r >> > L >     Well presumably you could redefine it in a fashion that was compatibleL > with existing files/RFAs. If you redefined the unused bits in the "offset"F > word to be "extended bits" added to the "block offset" longword thenD > the format would be identical for any file under 2TB ( where those" > bits are currently always zero).  G As long as they always *are* zero, that would be true.  I suspect that :D RMS-32 presents them as zero (just to be tidy if nothing else), but G whether it requires that they be zero on input or just ignores them is 0E the real question (if the latter, then no strictly upward-compatible 0A extension is possible using them unless one is prepared to break A> programs that used to work, untidy though they may have been).  J Assuming, of course, that the RRV ID size extension was never implemented.   ...3  G >>Then again, the mention of the RVN rang a faint bell.  It's possible RI >>that the 'extra' byte in the RFA was drafted because the interface had  $ >>forgotten to include it elsewhere  >  > E >    Sorry, I'm still confused - why does RMS care about the RVN when  > specifying a record location?   F It doesn't:  my point was that I seem to remember an 'available' byte B being stolen from an *unrelated* field in RMS-11 at some point to J include the RVN for which a more suitable location had never been created.  I But either I was groggy at the time I responded or my 19-year separation  H from All Things RMS has finally taken its toll:  whatever field the RVN G byte may (or may not) have been stolen from would clearly have been in ;- the FAB (or possible in an XAB), not the RAB.;   - bill   ------------------------------  % Date: Tue, 25 Jan 2005 11:03:19 -0500 ( From: Bill Todd <billtodd@metrocast.net> Subject: Re: RFA string format= Message-ID: <1vqdnbREzodf8GvcRVn-qQ@metrocastcablevision.com>    Dave Froble wrote: > Alan Frisbie wrote:g >  >> Bill Todd wrote:. >>J >>> Unless the definition of what an RFA is has changed from the original I >>> design, there are no 'most significant' or 'least significant' parts  C >>> to it:  it is an opaque 6-byte value which RMS provides to the  I >>> application which the application can then return to RMS as a record tI >>> identifier for the record in question (though in the case of indexed sJ >>> files only as long as the original file has not been reorganized, and J >>> in the case of sequential files only as long as the original file has D >>> not been truncated to a location preceding that record and then J >>> repopulated past the previous record's location; with relative files, D >>> any record in the same single-record 'slot' qualifies as a hit). >> >> >>I >> This applies to RMS-11, but I'm pretty sure it also applies to RMS-32.4H >> While the RFA is never actually defined anywhere (that I could find),$ >> it is fairly easy to deduce that: >>7 >>   RFA Word 1 = 1st word of VBN of bucket holding RRV4, >>   RFA Word 2 = Record ID of RRV in bucket7 >>   RFA Word 3 = 2nd word of VBN of bucket holding RRVu >>A >> It is interesting to note that even using RFA access, RMS musts@ >> still search through the relevant bucket sequentially to find >> the requested record. >> >> Alan  >> > H > That deduction doesn't seem to fit with the simple example I posted.  H > How RFAs are constructed for Indexed and variable length records very J > well could be different than for a relative file, where it just appears  > to be a record index.   F In an indexed file user data bucket, it's an associative ID (one-byte H incrementing counter) unique (when combined with the bucket's start VBN > address) for the life of the file (as long as the file is not G reorganized internally or copied using mechanisms that do not preserve " RFAs).  = Searching sequentially through a user data bucket just means iD sequentially scanning the headers of existing records in the bucket D until you find the matching ID or exhaust the inhabitants.  Save in D cases of very large buckets and very small records that nearly fill E them, this is not very CPU-intensive compared to the other overheads cG involved - especially if RMS bucket sizes are still limited to 31.5 KB  H (which is getting to be ridiculously small considering disk-performance > characteristics these days:  user data bucket sizes up to the G low-single-digit megabyte range would often be very worthwhile if they h: were supported, especially lacking any on-line background E reorganizations facilities - which for that matter wouldn't preserve DF RFAs anyway, hence would not be a *complete* substitute for the large  bucket sizes).   - bill     - bill   ------------------------------  % Date: Tue, 25 Jan 2005 16:13:56 +0000l- From: John Laird <nospam@laird-towers.org.uk>Q Subject: Re: RFA string format8 Message-ID: <flqcv01a5gk4l6sdap5bhltf63kvgis1nl@4ax.com>  F On Tue, 25 Jan 2005 10:42:58 -0500, Bill Todd <billtodd@metrocast.net> wrote:   >Malcolm Dunnett wrote:	 >>F >>    Sorry, I'm still confused - why does RMS care about the RVN when  >> specifying a record location? > G >It doesn't:  my point was that I seem to remember an 'available' byte iC >being stolen from an *unrelated* field in RMS-11 at some point to fK >include the RVN for which a more suitable location had never been created.f  G A FID has the RVN in a peculiar place, iirc.  The actual index into thebH header file is wrapped around it, low 2-bytes somewhere below and a highK byte above.  I had a small utility that broke the first time it encountereds) an indexf.sys with more than 64K entries.:  J [Thinks: this would seem to limit indexf entries to 16 million per volume,8 which doesn't ring a bell with any of INITs qualifiers.]   --  2 I have one nerve left and you're getting on it...    Mail john rather than nospam...d   ------------------------------  % Date: Tue, 25 Jan 2005 16:16:21 +0000n- From: John Laird <nospam@laird-towers.org.uk>s Subject: Re: RFA string format8 Message-ID: <j2scv0l2qn437dai109m9iaajvcio2qie3@4ax.com>  7 On Tue, 25 Jan 2005 15:08:01 GMT, "Jeffrey H. Coffield"m& <jeffrey@digitalsynergyinc.com> wrote:   >John Laird wrote:: >> On Tue, 25 Jan 2005 14:32:50 GMT, "Jeffrey H. Coffield") >> <jeffrey@digitalsynergyinc.com> wrote:: >>   >> gC >>>So how does an RFA still retrieve a record if the bucket splits?T >>   >> d5 >> See http://h71000.www7.hp.com/wizard/wiz_9668.htmle >> 	 >Thanx, that makes sense.   I I'd only picked up on the fact that, for indexed files, the RFA contained I not a byte offset (which might move) but an identifier within the bucket, L which presumably then features in an internal search, and couldn't see why aL bucket split would disturb this, on the basis that one could navigate to the9 new bucket, but a quick Google found a definitive answer.	   -- t; If everything's coming your way, you're in the wrong lane.     Mail john rather than nospam...c   ------------------------------  % Date: Tue, 25 Jan 2005 04:21:47 -0500.4 From: "Mark Buda" <buda@SPAMTripleBreakProducts.com>! Subject: Re: VMS GALAXY and CPU's.1 Message-ID: <ke2dnSC3TqWkjGvcRVn-gw@adelphia.com>   6 "John Brandon" <brandon@dalsemi.com> wrote in message + news:05012410052489@dscis6-0.dalsemi.com...rF > 1) Does anyone know if I can install and use the 4 additional CPU's?" >   Within the existing partition?  F You can install them, but they will not be usable... for below reason.  1 > 2) Will the GALAXY license disable the 4 CPU's?   M The GALAXY_SERVER image will do a check and see if there are more CPU's than 	M license units/100. If it notices more CPUs than allowed by license units, it  I disables the CPUs that are not licensed...  It does not pay attention to eL which CPUs it disables, it just starts stoppping them, so you might need to M adjust how many CPUs per instance.  NOTE, it will not shut down PRIMARY CPUs /: for each partition, as you always need one CPU to run VMS.  I > I would expect that the 4 CPU's would remain permanent to the assigned 	
 > instance% > and would not be a shared resource.I >eG > I have talked with HP - however I get the sales pitch routine and no 	 > definitive	 > answer.:   I hope this explains it.   mark   ------------------------------   End of INFO-VAX 2005.050 ************************