API tools faq
paste
Advertisement
Guest User

Torsten B Christiansen

a guest
Jan 31st, 2008
31
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.60 KB | None | 0 0
raw download clone embed print report
  1. #0 0x000000000040c92c in trie_compare_first::operator() (this=0x7ffffecc4150, l=@0x2aaaaeaaf000, r=@0x7ffffecc40f0) at ../src/sorting/trie.h:55
  2. #1 0x0000000000417704 in std::__unguarded_partition<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, trie, trie_compare_first> (__first=@0x7ffffecc4250, __last=@0x7ffffecc4240, __pivot= {state = ns_max, Id = 0, ParentId = 0, i = 0, branch_pos = 0, branch = {4294967469, 140737468191216, 47058545271640}, cp1 = {140737468191584, 7192944, 7193024}, cp2 = {4274803201, 7193024, 47058545190145}}, __comp={<No data fields>}) at usr/include/c++/4.1.3/bits/stl_algo.h:2199
  3. #2 0x000000000041a655 in std::__introsort_loop<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, long long, trie_compare_first> (__first=@0x7ffffecc4420, __last=@0x7ffffecc4410, __depth_limit=31, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2679
  4. #3 0x000000000041a693 in std::__introsort_loop<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, long long, trie_compare_first> (__first=@0x7ffffecc45d0, __last=@0x7ffffecc45c0, __depth_limit=32, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2680
  5. #4 0x000000000041a693 in std::__introsort_loop<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, long long, trie_compare_first> (__first=@0x7ffffecc4780, __last=@0x7ffffecc4770, __depth_limit=33, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2680
  6. #5 0x000000000041a693 in std::__introsort_loop<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, long long, trie_compare_first> (__first=@0x7ffffecc4930, __last=@0x7ffffecc4920, __depth_limit=34, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2680
  7. #6 0x000000000041a693 in std::__introsort_loop<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, long long, trie_compare_first> (__first=@0x7ffffecc49a0, __last=@0x7ffffecc4990, __depth_limit=35, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2680
  8. #7 0x000000000041acb2 in std::sort<stxxl::TwoToOneDimArrayRowAdaptor<stxxl::typed_block<2097152u, trie, 0u, void>, trie, 21845u, long long>, trie_compare_first> (__first=@0x7ffffecc4ba0, __last=@0x7ffffecc4b90, __comp={<No data fields>}) at /usr/include/c++/4.1.3/bits/stl_algo.h:2749
  9. #8 0x0000000000438917 in stxxl::sort_local::create_runs<stxxl::typed_block<2097152u, trie, 0u, void>, stxxl::simple_vector<stxxl::sort_local::trigger_entry<stxxl::BID<2097152u>, trie> >, __gnu_cxx::__normal_iterator<stxxl::BID<2097152u>*, std::vector<stxxl::BID<2097152u>, std::allocator<stxxl::BID<2097152u> > > >, trie_compare_first> (it={_M_current = 0x62028a0}, runs=0x755980, nruns=3, _m=32, cmp={<No data fields>}) at /opt/Stxxl/include/stxxl/bits/algo/sort.h:252
  10. #9 0x000000000044f2f4 in stxxl::sort_local::sort_blocks<stxxl::typed_block<2097152u, trie, 0u, void>, stxxl::RC, __gnu_cxx::__normal_iterator<stxxl::BID<2097152u>*, std::vector<stxxl::BID<2097152u>, std::allocator<stxxl::BID<2097152u> > > >, trie_compare_first> (input_bids={_M_current = 0x62025c0}, _n=46, _m=32, cmp={<No data fields>}) at /opt/Stxxl/include/stxxl/bits/algo/sort.h:698
  11. #10 0x0000000000451c21 in stxxl::sort<stxxl::vector_iterator<trie, stxxl::RC, unsigned long long, long long, 2097152u, stxxl::lru_pager<8u>, 4u>, trie_compare_first> (first=@0x7ffffecc58d0, last=@0x7ffffecc58c0, cmp={<No data fields>}, M=67108864) at /opt/Stxxl/include/stxxl/bits/algo/sort.h:1087
  12. #11 0x0000000000409ebe in construct (zas=3) at ../src/sorting/stringsort.cpp:337
  13. #12 0x000000000040b38d in reduce_and_construct (it=3) at ../src/sorting/stringsort.cpp:222
  14. #13 0x000000000040b358 in reduce_and_construct (it=2) at ../src/sorting/stringsort.cpp:217
  15. #14 0x000000000040b358 in reduce_and_construct (it=1) at ../src/sorting/stringsort.cpp:217
  16. #15 0x000000000040b4dd in stringsort (data=@0x7ffffecc62e0, desc=@0x7ffffecc62d0, validfile=@0x7ffffecc62c0, outputfile=@0x7ffffecc62b0) at ./src/sorting/stringsort.cpp:107
  17. #16 0x00000000004895c9 in main (argc=1, argv=0x7ffffecc63f8) at ../src/main.cpp:16
  18.  
  19. (gdb) p l
  20. $1 = (const trie &) @0x2aaaaeaaf000: <error reading variable>
  21. (gdb) p r
  22. $2 = (const trie &) @0x7ffffecc40f0: {state = ns_max, Id = 0, ParentId = 0, i = 0, branch_pos = 0, branch = {4294967469, 140737468191216,
  23. 47058545271640}, cp1 = {140737468191584, 7192944, 7193024}, cp2 = {4274803201, 7193024, 47058545190145}}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!