[Opencxx-users] Re: [opencxx] Segfault at RedHat and problems w/ recent STL

[Grzegorz J. <ja...@he...>]

Vladimir,

Thanks for your feedback. Detailed comments below:

> Date: Sun, 6 Apr 2003 19:12:02 +0400
> From: Vladimir Roganov <var at skif.botik.ru>
> To: opencxx-users at lists.sourceforge.net
> Subject: [Opencxx-users] Segfault at RedHat and problems w/ recent STL
>
>
> Hello, All !
>
> Please find below some experience i got using opencxx:
>
> 1. At RadHat 7.3 w/ recent gcc v3.2.2 built process looks now fine,
>    but start of `occ' shows "Segmentation fault", exactly like
>    in message w/ subj: [opencxx] GC_register_dynamic_libraries
>    I don't investigate it, because it was eliminated together
>    with GC: occ build without GC works fine.

I do not know what the problem with RedHat is, I suspect that gcc-3.x and gc
do not go on together well. If you are really interested in running with gc
I suggest that you try to find minimal program that uses gc and fails with
gcc-3.x. You can also at the same time ask the question on gc mailing list.
We would welcome any further feedback on this.

>    In our practice, GC is not necessary for such programs,
>    because recent computers have enough memory to eat very large
>    program, and further code transformation takes much less.
>    I am not sure that used kind of GC makes opencxx more robust :-)

It surely depends how much code you want to process at once and how much
memory you really need.

> 2. I found that new STL (coming with gcc v3.2.2) is little more
>    complex than `occ' expect, namely in parsing some template
>    typedefs. Some dumb workaround leads to infinite loop in type
>    analyzing stage (many parser-alike progs has same property :-)

It seems to me that I have been fixing something similar in still
experimental templates branch.

>    Currently i have a version which works fine (skipping some code,
>    so it is very dirty hack). It is possible to investigate it
>    (may be too late, if new version parses new STL fine).
>    So, possibly this topic is not actual now.

What is your fix exactly?

> 3. I found that classwalker gives more attention for class/method
>    than non-OO code. So, automatic variables are not user-keyword
>    sensitive (if i understand it properly :-) Some additions make
>    it more care, and automatic variables are handling well.

If you have any code that can extend existing functionality we can talk
about incorporating it into occ.

> Currently we constructed first version of T++->(C++,TSS) converter using `occ'.
> T++ is a `superfunctional' language for supercomputers, and has
> seven additional keywords: tfun, tval, tptr, tout, twait, tdrop, tct.
>
> For instance, Fibonacci program looks like:
>
> #include <stdio.h>
>
> tfun int fib (int n) {
>   return n < 2  ?  n : fib(n-1)+fib(n-2);
> }
>
> tfun int main (int argc, char **argv) {
>   if (argc != 2) { printf("Usage: fib <n>\n"); return 1; }
>   int n = atoi(argv[1]);
>   printf("fib(%d) = %d\n", n, (int)fib(n));
>   return 0;
> }
>
> Running on multicomputer, it will do all recursions in parallel.

Wow, cool.

Best regards
Grzegorz


>
> It is just a reason why i like to be a permanent reader of this great list :-)
>
> --
> With best wishes,
> Vladimir
>
>
> -------------------------------------------------------
> This SF.net email is sponsored by: ValueWeb:
> Dedicated Hosting for just $79/mo with 500 GB of bandwidth!
> No other company gives more support or power for your dedicated server
> http://click.atdmt.com/AFF/go/sdnxxaff00300020aff/direct/01/
> _______________________________________________
> Opencxx-users mailing list
> Ope...@li...
> https://lists.sourceforge.net/lists/listinfo/opencxx-users


##################################################################
# Grzegorz Jakacki                       Huada Electronic Design #
# Senior Engineer, CAD Dept.              1 Gaojiayuan, Chaoyang #
# tel. +86-10-64365577 x2074               Beijing 100015, China #
# Copyright (C) 2002 Grzegorz Jakacki, HED. All Rights Reserved. #
##################################################################