Re: DYNAMIC ADA TASK CREATION?

["avram" <avram79@tlen.pl>]

   Thanx, but i think that the loop is not efficient. I mean this is an
active waiting, so my main process use CPU without sense. I would like to
know if there is way to deallocation of a memory without active waiting.

avram

Uzytkownik "Craig Carey" <research@ijs.co.nz> napisal w wiadomosci
news:39l1fv8ig2hr2bpsf786ao6a9it649bfnj@4ax.com...
> On Wed, 18 Jun 2003 21:15:02 +0200, "avram" <avram79@tlen.pl> wrote:
> > Than[s] very much. I have one more question.
> >What about task memory deallocation. How to wait untill task ends?
>
> There was a solution posted in comp.lang.ada which is replicated:
>
>
> On 11 May 2003 17:35:18 +0200, in comp.lang.ada you Pascal Obry wrote:
> >[...] The delay could still not be enough. What I usually do
> >is loop until 'Terminated is true.
> ...
> >    for K in 1 .. 20_000 loop
> >       X := new A.Tt;    --  [Create a new task]
> >       N := N + 1;
> >       X.The_End;
> >
> >       loop
> >          exit when X'Terminated;
> >          delay 1.0E-30;
> >       end loop;
> >
> >       Free (X);
> >    end loop;
> >
>
> The memory recovery can be 0% efficient, or 100% efficient depending
> on how the test is done (at least, for the ObjectAda and GNAT
> compilers).
>
> Craig Carey
>