From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news2.google.com!news1.google.com!news.glorb.com!feeder.erje.net!de-l.enfer-du-nord.net!gegeweb.org!aioe.org!not-for-mail
From: Dennis Hoppe <dennis.hoppe@hoppinet.de>
Newsgroups: comp.lang.ada
Subject: Re: Error: "could not understand bounds information on packed array"
Date: Fri, 29 May 2009 03:13:09 +0200
Organization: Aioe.org NNTP Server
Message-ID: <gvncrh$n52$3@aioe.org>
References: <gvnbq7$m43$1@aioe.org>
NNTP-Posting-Host: HnPZBZ7DCuaTFargMPB8CQ.user.aioe.org
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Complaints-To: abuse@aioe.org
X-Notice: Filtered by postfilter v. 0.7.9
Cancel-Lock: sha1:/vQfGKD9hvrBgjO4WYh82Sgnxf8=
User-Agent: Postbox 1.0b12 (Macintosh/2009051120)
Xref: g2news2.google.com comp.lang.ada:6096
Date: 2009-05-29T03:13:09+02:00
List-Id: <comp.lang.ada>

Some additional information:



I should add, that the recursive procedure will be called from another 
recursive procedure, too. I commented the calls to "my_procedure" (see 
the previous post) out and still getting memory access problems:

Program received signal EXC_BAD_ACCESS, Could not access memory.
Reason: KERN_PROTECTION_FAILURE at address: 0x00007fff5f3ffb60
0x000000010005154d in grete.darxplorer.recursive_call 
(differentials_graph=Cannot access memory at address 0x7fff5f3ffea8
) at toolbox-grete.adb:16
16		procedure Recursive_Call (Value : in out Object;
(gdb) backtrace
#0  0x000000010005154d in recursive_call (value=Cannot access memory at 
address 0x7fff5f3ffea8
) at my_package.adb:16

Recursive_Call is the outer procedure, that calls "my_procedure". 
Recursive_Call is recursive, too.

The so called "Object" is in fact a directed graph, which gets in each 
recursion new vertices and edges. The graph originates from Ada Booch95.

The problem seems to not rest upon the bit-operations mentioned before.