MVSFORUMS.com

bala · Posted: Tue Dec 13, 2005 12:25 am Post subject: Maximum Array size in PL/1

Hi,

My following PL/1 program abends with an error "AN OUT-OF-STORAGE ABEND HAS OCCURRED". When I try with 1271000(array limit), yes it is working. But, the same value in different program abends again.

bauer · Posted: Tue Dec 13, 2005 1:44 am Post subject:

Hi bala,

pls provide the exact error message, which version of PL/1 are you using ?

bauer

bala · Posted: Tue Dec 13, 2005 3:20 am Post subject:

I am using PL/I VER 2 REL 3 compiler.

I got the following Error message (from the log):

IBM912I 'ONCODE'=3920
AN OUT-OF-STORAGE ABEND HAS OCCURRED.
IN STATEMENT 100120 AT OFFSET +00010C IN PROCEDURE WITH ENTRY MAS

100120 1 0 ALLOCATE PROJ_ARR; (from the compiled pgm log of MAS)
Let me know if you need more details.

Thanks,
Bala

bauer · Posted: Tue Dec 13, 2005 3:44 am Post subject:

Try to uncrease the region size, see explanation of errormessage in manual sc26-4309-2.

bala · Posted: Tue Dec 13, 2005 6:02 am Post subject:

Yes, I have tried with Region = 0M (it takes max storage limit, hope I am right here) as well as Region = 2027M (2GB limit) also. I have got the same error. Any update do you like to give here??

(Thanks for your quick responses).
Bala

Crox · Beginner Joined: 29 May 2004 Posts: 52 Topics: 9

perhaps 24 bits mode instead of 31?

Crox · Beginner Joined: 29 May 2004 Posts: 52 Topics: 9

I mean does your current program address above or under the 16m line. I guess you need to address above. Is that perhaps not the case?

semigeezer · Posted: Tue Dec 13, 2005 5:29 pm Post subject:

The max amount of storage available is dependent on lots of things; system exits (IEFUSI, et al), storage fragmentation, etc. It sounds strange, but a request for 20MB of storage is a bit large. On TSO systems I've used, I rarely have ever been able to allocate more than 30MB total, and almost never in large contiguous blocks. I guess I'd wonder about the usefulness of a million element array anyway. There isn't much you can do with it without lots of searching and arrays tend to have pretty bad performance characteristics (order n-squared) so you might find that using a different algorithm for whatever you are trying to do. If you are planning on searching this thing or sorting it, a (preferably balanced) binary tree might be a good bet. Or if PL/I has the ability to use data spaces or 64bit addressing, and I don't know if it does, that would be a good option too. Anyway, search for IEFUSI. Kolusu put out a good post about this.