From: Maarten B. <sou...@ds...> - 2013-11-09 19:16:37
|
Hi all, Although the regression test page seems to indicate differently SDCC is in pretty bad shape. I can not build it due to errors in the tlcs90 assembler or crt library. With tlcs90 disabled I get warnings about automake-1.11 not present while I have automake-1.13 installed. During regression testing bug-2222.c SIGSEGV's due to a NULL-pointer dereference and all Z80 derivatives generate Non-fatal Compiler Internal Problems. Please run regression tests before committing your modifications and watch the outcome. Maarten |
From: Raphael N. <rn...@we...> - 2013-11-09 20:17:09
|
Hi Maarten, Am 09.11.2013 20:17 schrieb "Maarten Brock" <sou...@ds...>: ... > With tlcs90 disabled I get warnings about automake-1.11 > not present while I have automake-1.13 installed. ... I think the requirement for the exact Automake version 1.11 stems from the included GCC components, which makes it hard for us to change/remove the requirement. If I find the time, I will try to verify that it's not the PIC ports that cause this --- they DO use automake as well ... Have a nice weekend despite the problems, Raphael |
From: Philipp K. K. <pk...@sp...> - 2013-11-10 10:40:47
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 09.11.2013 20:16, schrieb Maarten Brock: > Hi all, > > Although the regression test page seems to indicate differently > SDCC is in pretty bad shape. I can not build it due to errors in > the tlcs90 assembler or crt library. I intend to look at this, but unfortunately haven't found any time for sdcc recently. > With tlcs90 disabled I get warnings about automake-1.11 not present > while I have automake-1.13 installed. During regression testing > bug-2222.c SIGSEGV's due to a NULL-pointer dereference Hmm, I don't know about these. > and all Z80 derivatives generate Non-fatal Compiler Internal > Problems. AFAIK, the underlying problems have been there for some time, and are not Z80-specific. Apparently, live-range analysis sometimes thinks that there are variables that do not have a definition, or that there are variables that are not alive at their definition. Since this makes no sense, I introduced a warning for this; however, the code which checks for it is inside separateLiveRanges(), which currently is called for the Z80-derivatives, HC08-derivatives and the STM8 only. AFAIK, the number of warnings emitted in the regression test suite has not increased since I introduced the warning. Philipp -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.15 (GNU/Linux) Comment: Using GnuPG with Icedove - http://www.enigmail.net/ iEYEARECAAYFAlJ/XNkACgkQbtUV+xsoLpo/JwCg8BVRZi1vtoeMN9B7mj2Iod+3 SGIAniSXw74NpRRHoq06Ku+L7/u0a8I/ =6v0r -----END PGP SIGNATURE----- |
From: Maarten B. <sou...@ds...> - 2013-11-14 23:16:22
|
And then I forgot to mention stm8 failing regression test bug3521024.c with *** Error in `../../bin/sdcc': free(): invalid next size (normal): 0x0000000002a1cf20 *** [...] Caught signal 6: SIGABRT Maarten > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Am 09.11.2013 20:16, schrieb Maarten Brock: >> Hi all, >> >> Although the regression test page seems to indicate differently >> SDCC is in pretty bad shape. I can not build it due to errors in >> the tlcs90 assembler or crt library. > > I intend to look at this, but unfortunately haven't found any time for > sdcc recently. > >> With tlcs90 disabled I get warnings about automake-1.11 not present >> while I have automake-1.13 installed. During regression testing >> bug-2222.c SIGSEGV's due to a NULL-pointer dereference > > Hmm, I don't know about these. > >> and all Z80 derivatives generate Non-fatal Compiler Internal >> Problems. > > AFAIK, the underlying problems have been there for some time, and are > not Z80-specific. > Apparently, live-range analysis sometimes thinks that there are > variables that do not have a definition, or that there are variables > that are not alive at their definition. Since this makes no sense, I > introduced a warning for this; however, the code which checks for it > is inside separateLiveRanges(), which currently is called for the > Z80-derivatives, HC08-derivatives and the STM8 only. AFAIK, the number > of warnings emitted in the regression test suite has not increased > since I introduced the warning. > > Philipp > > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v1.4.15 (GNU/Linux) > Comment: Using GnuPG with Icedove - http://www.enigmail.net/ > > iEYEARECAAYFAlJ/XNkACgkQbtUV+xsoLpo/JwCg8BVRZi1vtoeMN9B7mj2Iod+3 > SGIAniSXw74NpRRHoq06Ku+L7/u0a8I/ > =6v0r > -----END PGP SIGNATURE----- > > ------------------------------------------------------------------------------ > November Webinars for C, C++, Fortran Developers > Accelerate application performance with scalable programming models. > Explore > techniques for threading, error checking, porting, and tuning. Get the > most > from the latest Intel processors and coprocessors. See abstracts and > register > http://pubads.g.doubleclick.net/gampad/clk?id=60136231&iu=/4140/ostg.clktrk > _______________________________________________ > sdcc-devel mailing list > sdc...@li... > https://lists.sourceforge.net/lists/listinfo/sdcc-devel > |
From: Philipp K. K. <pk...@sp...> - 2013-11-22 11:12:09
|
Am 15.11.2013 00:16, schrieb Maarten Brock: > And then I forgot to mention stm8 failing regression test bug3521024.c with > *** Error in `../../bin/sdcc': free(): invalid next size (normal): > 0x0000000002a1cf20 *** > [...] > Caught signal 6: SIGABRT > > Maarten Now that I can reproduce the issue, I had a closer look at it. This most likely is a bug in libstdc++. The bug was introduced at the end of september 2013 in an attempt to improve performance for sorting (see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=58437), and affects libstdc++ 4.7.4 and 4.8.2. The bug has been fixed by the libstdc++ maintainers, and libstdc++ 4.7.4, 4.8.3 and 4.9.0 should work again (see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=58800). Philipp |
From: Philipp K. K. <pk...@sp...> - 2013-11-15 17:41:10
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 15.11.2013 00:16, schrieb Maarten Brock: > And then I forgot to mention stm8 failing regression test > bug3521024.c with *** Error in `../../bin/sdcc': free(): invalid > next size (normal): 0x0000000002a1cf20 *** [...] Caught signal 6: > SIGABRT > > Maarten How can I reproduce this issue? I do not see this test failing in the current snapshots on any system¹. The test works for me on my Linux 64-bit system. Neither in the .out file for the test, not the console output (even with .SILENT commented out) did I notice any problem. Philipp ¹ All the snapshot regression tests seem to pass except for the NetBSD system being too slow to complete them and the problems on 64-bit Windows, which are AFAIK not caused by sdcc. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.15 (GNU/Linux) Comment: Using GnuPG with Icedove - http://www.enigmail.net/ iEYEARECAAYFAlKGXKYACgkQbtUV+xsoLpp57wCfeazzhnTr2lQicIVfPWpGjGkO mEoAoLv9JA2TIijZxKMOhTYkz3HItq4D =m2uP -----END PGP SIGNATURE----- |
From: Maarten B. <sou...@ds...> - 2013-11-16 14:58:02
|
Hi Philipp, Are you checking the regression test outputs on the snapshot page? You won't find it there as they do not run any stm8 tests. But if you just run make in the regression test dir locally I assume you will see it promptly. At least it does on my x64 Ubuntu virtual machine with 2GB RAM + 2GB swap. See below for full error output. Maarten *** Error in `../../bin/sdcc': free(): invalid next size (normal): 0x0000000002a1cf20 *** ======= Backtrace: ========= /lib/x86_64-linux-gnu/libc.so.6(+0x80996)[0x2b007f86e996] ../../bin/sdcc[0x5ee36d] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ../../bin/sdcc[0x5ede95] ======= Memory map: ======== 00400000-006c2000 r-xp 00000000 08:01 1092965 /home/maarten/sdcc-pure/bin/sdcc 008c1000-008c2000 r--p 002c1000 08:01 1092965 /home/maarten/sdcc-pure/bin/sdcc 008c2000-0090f000 rw-p 002c2000 08:01 1092965 /home/maarten/sdcc-pure/bin/sdcc 0090f000-00921000 rw-p 00000000 00:00 0 02650000-02b39000 rw-p 00000000 00:00 0 [heap] 2b007f0af000-2b007f0d2000 r-xp 00000000 08:01 1183920 /lib/x86_64-linux-gnu/ld-2.17.so 2b007f0d2000-2b007f0d6000 rw-p 00000000 00:00 0 2b007f0eb000-2b007f0f0000 rw-p 00000000 00:00 0 2b007f2d1000-2b007f2d2000 r--p 00022000 08:01 1183920 /lib/x86_64-linux-gnu/ld-2.17.so 2b007f2d2000-2b007f2d4000 rw-p 00023000 08:01 1183920 /lib/x86_64-linux-gnu/ld-2.17.so 2b007f2d4000-2b007f3ba000 r-xp 00000000 08:01 141735 /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18 2b007f3ba000-2b007f5b9000 ---p 000e6000 08:01 141735 /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18 2b007f5b9000-2b007f5c1000 r--p 000e5000 08:01 141735 /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18 2b007f5c1000-2b007f5c3000 rw-p 000ed000 08:01 141735 /usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18 2b007f5c3000-2b007f5d8000 rw-p 00000000 00:00 0 2b007f5d8000-2b007f5ed000 r-xp 00000000 08:01 1183969 /lib/x86_64-linux-gnu/libgcc_s.so.1 2b007f5ed000-2b007f7ec000 ---p 00015000 08:01 1183969 /lib/x86_64-linux-gnu/libgcc_s.so.1 2b007f7ec000-2b007f7ed000 r--p 00014000 08:01 1183969 /lib/x86_64-linux-gnu/libgcc_s.so.1 2b007f7ed000-2b007f7ee000 rw-p 00015000 08:01 1183969 /lib/x86_64-linux-gnu/libgcc_s.so.1 2b007f7ee000-2b007f9ab000 r-xp 00000000 08:01 1183944 /lib/x86_64-linux-gnu/libc-2.17.so 2b007f9ab000-2b007fbab000 ---p 001bd000 08:01 1183944 /lib/x86_64-linux-gnu/libc-2.17.so 2b007fbab000-2b007fbaf000 r--p 001bd000 08:01 1183944 /lib/x86_64-linux-gnu/libc-2.17.so 2b007fbaf000-2b007fbb1000 rw-p 001c1000 08:01 1183944 /lib/x86_64-linux-gnu/libc-2.17.so 2b007fbb1000-2b007fbb6000 rw-p 00000000 00:00 0 2b007fbb6000-2b007fcb9000 r-xp 00000000 08:01 1183995 /lib/x86_64-linux-gnu/libm-2.17.so 2b007fcb9000-2b007feb8000 ---p 00103000 08:01 1183995 /lib/x86_64-linux-gnu/libm-2.17.so 2b007feb8000-2b007feb9000 r--p 00102000 08:01 1183995 /lib/x86_64-linux-gnu/libm-2.17.so 2b007feb9000-2b007feba000 rw-p 00103000 08:01 1183995 /lib/x86_64-linux-gnu/libm-2.17.so 7fff06f11000-7fff06f33000 rw-p 00000000 00:00 0 [stack] 7fff06ffe000-7fff07000000 r-xp 00000000 00:00 0 [vdso] ffffffffff600000-ffffffffff601000 r-xp 00000000 00:00 0 [vsyscall] Caught signal 6: SIGABRT make[3]: *** [gen/stm8/bug3521024/bug3521024.rel] Error 1 make[2]: *** [results/stm8/bug3521024.out] Error 2 make[1]: *** [test-port] Error 2 |
From: Philipp K. K. <pk...@sp...> - 2013-11-16 19:40:39
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 16.11.2013 15:57, schrieb Maarten Brock: > Hi Philipp, > > Are you checking the regression test outputs on the snapshot page? > You won't find it there as they do not run any stm8 tests. But if > you just run make in the regression test dir locally I assume you > will see it promptly. At least it does on my x64 Ubuntu virtual > machine with 2GB RAM + 2GB swap. See below for full error output. > > Maarten > I checked both locally on two machines (both Debian GNU/Linux x86-64) and on the snapshot page. The snapshot page has been including stm8 regression test results since I enabled it more than three months ago. Philipp -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.15 (GNU/Linux) Comment: Using GnuPG with Icedove - http://www.enigmail.net/ iEYEARECAAYFAlKHyikACgkQbtUV+xsoLpprkACg7FqPGCyqoKgo+5dugUTuMwZb +8cAnj1zrIx87RC1boNmsgp+dBmnBcMg =dfL0 -----END PGP SIGNATURE----- |
From: Maarten B. <sou...@ds...> - 2013-11-16 23:32:41
|
Hi again, > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Am 16.11.2013 15:57, schrieb Maarten Brock: >> Hi Philipp, >> >> Are you checking the regression test outputs on the snapshot page? >> You won't find it there as they do not run any stm8 tests. But if >> you just run make in the regression test dir locally I assume you >> will see it promptly. At least it does on my x64 Ubuntu virtual >> machine with 2GB RAM + 2GB swap. See below for full error output. >> >> Maarten >> > > I checked both locally on two machines (both Debian GNU/Linux x86-64) > and on the snapshot page. The snapshot page has been including stm8 > regression test results since I enabled it more than three months ago. > > Philipp I guess I mixed up the stm8 and the tlcs90 when checking the online regression test results. The stm8 is certainly tested on a daily basis. However I still have this failure. Is there anything I can do to nail this? I don't usually debug under linux and with MSVC I get loads and loads of failing debug assertions about an invalid operator< from sort called in tree_dec_ralloc_forget (line 850). Maarten |
From: Philipp K. K. <pk...@sp...> - 2013-11-20 22:17:38
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 17.11.2013 00:32, schrieb Maarten Brock: > > I guess I mixed up the stm8 and the tlcs90 when checking the > online regression test results. The stm8 is certainly tested on a > daily basis. > > However I still have this failure. Is there anything I can do to > nail this? I don't usually debug under linux and with MSVC I get > loads and loads of failing debug assertions about an invalid > operator< from sort called in tree_dec_ralloc_forget (line 850). > > Maarten You might want to try gdb or valgrind. Philipp -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.15 (GNU/Linux) Comment: Using GnuPG with Icedove - http://www.enigmail.net/ iEYEARECAAYFAlKNNPYACgkQbtUV+xsoLppNLQCg6foOm+9Tn1FcQDv8U09Aogmo GaMAoMYriseDdSvle08WJvkWfJBZKURW =FNWL -----END PGP SIGNATURE----- |
From: Maarten B. <sou...@ds...> - 2013-11-20 22:34:03
|
Hi Philipp, > You might want to try gdb or valgrind. Here's what I get: maarten@ubuntu64:~/sdcc-pure/support/regression/gen/stm8/bug3521024$ gdb --args ~/sdcc-pure/bin/sdcc -c -mstm8 bug3521024.c -I ~/sdcc-pure/device/include -I ../../../fwk/include GNU gdb (GDB) 7.6.1-ubuntu Copyright (C) 2013 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html> This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law. Type "show copying" and "show warranty" for details. This GDB was configured as "x86_64-linux-gnu". For bug reporting instructions, please see: <http://www.gnu.org/software/gdb/bugs/>... Reading symbols from /home/maarten/sdcc-pure/bin/sdcc...done. (gdb) run Starting program: /home/maarten/sdcc-pure/bin/sdcc -c -mstm8 bug3521024.c -I /home/maarten/sdcc-pure/device/include -I ../../../fwk/include Traceback (most recent call last): File "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", line 59, in <module> from libstdcxx.v6.printers import register_libstdcxx_printers ImportError: No module named 'libstdcxx' Traceback (most recent call last): File "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", line 59, in <module> from libstdcxx.v6.printers import register_libstdcxx_printers ImportError: No module named 'libstdcxx' Program received signal SIGSEGV, Segmentation fault. std::__detail::_List_node_base::_M_unhook (this=this@entry=0x0) at ../../../../../src/libstdc++-v3/src/c++98/list.cc:139 139 ../../../../../src/libstdc++-v3/src/c++98/list.cc: No such file or directory. (gdb) quit But I'm not sure if and how this will help. If I were to give you direct access to my virtual machine, do you think that could be helpful? Maarten |
From: Philipp K. K. <pk...@sp...> - 2013-11-22 07:20:31
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Am 20.11.2013 23:33, schrieb Maarten Brock: > Hi Philipp, > >> You might want to try gdb or valgrind. > > Here's what I get: > > maarten@ubuntu64:~/sdcc-pure/support/regression/gen/stm8/bug3521024$ > gdb --args ~/sdcc-pure/bin/sdcc -c -mstm8 bug3521024.c -I > ~/sdcc-pure/device/include -I ../../../fwk/include GNU gdb (GDB) > 7.6.1-ubuntu Copyright (C) 2013 Free Software Foundation, Inc. > License GPLv3+: GNU GPL version 3 or later > <http://gnu.org/licenses/gpl.html> This is free software: you are > free to change and redistribute it. There is NO WARRANTY, to the > extent permitted by law. Type "show copying" and "show warranty" > for details. This GDB was configured as "x86_64-linux-gnu". For bug > reporting instructions, please see: > <http://www.gnu.org/software/gdb/bugs/>... Reading symbols from > /home/maarten/sdcc-pure/bin/sdcc...done. (gdb) run Starting > program: /home/maarten/sdcc-pure/bin/sdcc -c -mstm8 bug3521024.c -I > /home/maarten/sdcc-pure/device/include -I ../../../fwk/include > Traceback (most recent call last): File > "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", > > line 59, in <module> > from libstdcxx.v6.printers import register_libstdcxx_printers > ImportError: No module named 'libstdcxx' Traceback (most recent > call last): File > "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", > > line 59, in <module> > from libstdcxx.v6.printers import register_libstdcxx_printers > ImportError: No module named 'libstdcxx' > > Program received signal SIGSEGV, Segmentation fault. > std::__detail::_List_node_base::_M_unhook (this=this@entry=0x0) at > ../../../../../src/libstdc++-v3/src/c++98/list.cc:139 139 > ../../../../../src/libstdc++-v3/src/c++98/list.cc: No such file or > directory. (gdb) quit > > > But I'm not sure if and how this will help. How does the backtrace from gdb look like (type backtrace before you type quit). You might also want to look around a bit using the frame and print commands. I also had a look at this on my system using valgrind. While I found an issue that I want to fix, it seems unrelated to yours. > > If I were to give you direct access to my virtual machine, do you > think that could be helpful? It might, but let's have a look at the backtrace first. Philipp -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.15 (GNU/Linux) Comment: Using GnuPG with Icedove - http://www.enigmail.net/ iEYEARECAAYFAlKPBHsACgkQbtUV+xsoLpo0QACff7zXYa0rjKsjjxF82fVEgfww vvQAoI8KKba/jCq6K1xNpYUn/y4Cajed =CsSV -----END PGP SIGNATURE----- |
From: Philipp K. K. <pk...@sp...> - 2013-11-22 09:06:16
|
Am 16.11.2013 20:40, schrieb Philipp Klaus Krause: > Am 16.11.2013 15:57, schrieb Maarten Brock: >> Hi Philipp, > >> Are you checking the regression test outputs on the snapshot page? >> You won't find it there as they do not run any stm8 tests. But if >> you just run make in the regression test dir locally I assume you >> will see it promptly. At least it does on my x64 Ubuntu virtual >> machine with 2GB RAM + 2GB swap. See below for full error output. > >> Maarten > > > I checked both locally on two machines (both Debian GNU/Linux x86-64) > and on the snapshot page. The snapshot page has been including stm8 > regression test results since I enabled it more than three months ago. > > Philipp I did a clean checkout of sdcc, and upgraded some libraries and gcc on my machines. Now I see the issue on one of them (on the Debian testing one; the Debian unstable machine, which has even newer libraries and gcc passes the tests). Philipp |
From: Maarten B. <sou...@ds...> - 2013-11-22 10:45:34
|
Hi again, > I did a clean checkout of sdcc, and upgraded some libraries and gcc on > my machines. Now I see the issue on one of them (on the Debian testing > one; the Debian unstable machine, which has even newer libraries and gcc > passes the tests). > > Philipp Thanks for confirming. I guess you can now try to track it locally. But since you asked for it I'll just attach the backtrace below anyway. Maarten (gdb) run Starting program: /home/maarten/sdcc-pure/bin/sdcc -c -mstm8 bug3521024.c -I /home/maarten/sdcc-pure/device/include -I ../../../fwk/include Traceback (most recent call last): File "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", line 59, in <module> from libstdcxx.v6.printers import register_libstdcxx_printers ImportError: No module named 'libstdcxx' Traceback (most recent call last): File "/usr/lib/debug/usr/lib/x86_64-linux-gnu/libstdc++.so.6.0.18-gdb.py", line 59, in <module> from libstdcxx.v6.printers import register_libstdcxx_printers ImportError: No module named 'libstdcxx' Program received signal SIGSEGV, Segmentation fault. std::__detail::_List_node_base::_M_unhook (this=this@entry=0x0) at ../../../../../src/libstdc++-v3/src/c++98/list.cc:139 139 ../../../../../src/libstdc++-v3/src/c++98/list.cc: No such file or directory. (gdb) backtrace #0 std::__detail::_List_node_base::_M_unhook (this=this@entry=0x0) at ../../../../../src/libstdc++-v3/src/c++98/list.cc:139 #1 0x00000000005ee337 in _M_erase (this=<optimized out>, __position=...) at /usr/include/c++/4.8/bits/stl_list.h:1570 #2 erase (this=<optimized out>, __position=...) at /usr/include/c++/4.8/bits/list.tcc:112 #3 drop_worst_assignments<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (i=7, G=..., assignment_optimal=0x7fffffff388f, ac=..., I=..., alist=...) at ./../SDCCralloc.hpp:708 #4 tree_dec_ralloc_introduce<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (assignment_optimal=0x7fffffff388f, ac=..., I=..., G=..., t=602, T=...) at ./../SDCCralloc.hpp:772 #5 tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=64, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:997 #6 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=91, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #7 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=63, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #8 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=92, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #9 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=62, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #10 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=93, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #11 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=61, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #12 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=94, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #13 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=145, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #14 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=60, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #15 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=95, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #16 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=59, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #17 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=96, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #18 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=58, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #19 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=97, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #20 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=57, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #21 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=56, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #22 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=98, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #23 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=55, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #24 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=99, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #25 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=54, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #26 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=100, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #27 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=53, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #28 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=101, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #29 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=52, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #30 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=102, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #31 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=51, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #32 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=103, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #33 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=50, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #34 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=104, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #35 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=49, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #36 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=105, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #37 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=48, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #38 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=106, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #39 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=47, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #40 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=107, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #41 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=46, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #42 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=108, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #43 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=45, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #44 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=109, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #45 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=44, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #46 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=110, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #47 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=43, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #48 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=111, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #49 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=42, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #50 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=112, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #51 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=41, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #52 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=113, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #53 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=144, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #54 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=40, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #55 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=114, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #56 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=39, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #57 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=115, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #58 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=38, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #59 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=116, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #60 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=37, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #61 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=117, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #62 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=143, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #63 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=36, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #64 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=118, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #65 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=35, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #66 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=119, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #67 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=34, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #68 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=120, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #69 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=33, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #70 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=121, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #71 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=32, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #72 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=122, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #73 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=31, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #74 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=123, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #75 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=30, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #76 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=124, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #77 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=29, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #78 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=125, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #79 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=28, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #80 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=126, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #81 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=27, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #82 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=127, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #83 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=26, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #84 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=128, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #85 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=25, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #86 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=129, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #87 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=24, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #88 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=130, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #89 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=23, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #90 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=22, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #91 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=131, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #92 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=142, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #93 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=72, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #94 0x00000000005ed9a9 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=11, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:1006 #95 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=71, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #96 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_d---Type <return> to continue, or q <return> to quit--- ec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=83, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #97 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=12, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #98 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=82, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #99 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=13, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #100 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=81, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #101 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=14, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #102 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=80, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #103 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=15, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #104 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=139, G=..., I=..., ac=..., ---Type <return> to continue, or q <return> to quit--- assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #105 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=79, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #106 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=16, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #107 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=78, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #108 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=17, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #109 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=77, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #110 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=18, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #111 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=76, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #112 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=19, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #113 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_---Type <return> to continue, or q <return> to quit--- dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=75, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #114 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=20, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #115 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=74, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #116 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=21, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #117 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=140, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #118 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=t@entry=141, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #119 0x00000000005ede85 in tree_dec_ralloc_nodes<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_matrix<boost::undirectedS, con_node> > (T=..., t=<optimized out>, G=..., I=..., ac=..., assignment_optimal=assignment_optimal@entry=0x7fffffff388f) at ./../SDCCralloc.hpp:996 #120 0x00000000005f2e2c in tree_dec_ralloc<boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, tree_dec_node>, boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, cfg_node>, boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS, con_node> > (I=..., G=..., T=...) at ralloc2.cc:485 #121 stm8_ralloc2_cc (ebbi=ebbi@entry=0xb82690) at ralloc2.cc:560 #122 0x00000000005ecb82 in stm8_assignRegisters (ebbi=0xb82690) at ralloc.c:457 #123 0x0000000000423e3d in eBBlockFromiCode (ic=0x0) at SDCCopt.c:2364 #124 0x00000000004389d0 in createFunction (name=0xa0f7c0, body=0xa2e0f0) at SDCCast.c:7012 ---Type <return> to continue, or q <return> to quit--- #125 0x000000000040e7a6 in yyparse () at SDCC.y:202 #126 0x0000000000409ee4 in main (argc=<optimized out>, argv=<optimized out>, envp=<optimized out>) at SDCCmain.c:2537 (gdb) |