monotone-devel
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Monotone-devel] segmentation fault in changesetify


From: Martin Kihlgren
Subject: Re: [Monotone-devel] segmentation fault in changesetify
Date: Sun, 3 Apr 2005 21:16:29 +0200
User-agent: Mutt/1.5.6+20040907i

Certainly!

Here comes some of your answers:
------------8<-------------
[0:address@hidden ~]$monotone --full-version
monotone 0.17 (base revision: 337d62e5cbd50c36e2f2c2bda489a98de3a8aeb7)
Running on: Linux 2.6.10-cko3 #8 Thu Feb 24 23:44:25 CET 2005 i686
Changes since base revision:
unknown

  Generated from data cached in the distribution;
  further changes may have been made.

  Generated from data cached in the distribution;
  further changes may have been made.
[0:address@hidden ~]$ldd $(which monotone)
                libpopt.so.0 => /lib/libpopt.so.0 (0xb7fd7000)
        libdl.so.2 => /lib/tls/libdl.so.2 (0xb7fd3000)
        libboost_regex-gcc-mt-1_32.so.1.32.0 => 
/usr/lib/libboost_regex-gcc-mt-1_32.so.1.32.0 (0xb7f59000)
        libboost_date_time-gcc-mt-1_32.so.1.32.0 => 
/usr/lib/libboost_date_time-gcc-mt-1_32.so.1.32.0 (0xb7f46000)
        libboost_filesystem-gcc-mt-1_32.so.1.32.0 => 
/usr/lib/libboost_filesystem-gcc-mt-1_32.so.1.32.0 (0xb7f35000)
        libstdc++.so.5 => /usr/lib/libstdc++.so.5 (0xb7e7b000)
        libm.so.6 => /lib/tls/libm.so.6 (0xb7e59000)
        libgcc_s.so.1 => /lib/libgcc_s.so.1 (0xb7e4f000)
        libc.so.6 => /lib/tls/libc.so.6 (0xb7d1b000)
        libpthread.so.0 => /lib/tls/libpthread.so.0 (0xb7d0c000)
        /lib/ld-linux.so.2 => /lib/ld-linux.so.2 (0xb7fea000)
        librt.so.1 => /lib/tls/librt.so.1 (0xb7d06000)
[0:address@hidden ~]$uname -a
Linux scylla 2.6.10-cko3 #8 Thu Feb 24 23:44:25 CET 2005 i686 GNU/Linux
[0:address@hidden ~]$cat /etc/debian_version
3.1
[0:address@hidden ~]$
------------8<-------------

As to the rest: 
- I downloaded the .deb from
  http://www.venge.net/monotone/monotone_0.17-1_i386.deb
- I have put the original (0.14) database at
  http://troja.ath.cx/~zond/files/monotone.db-pre-change
- I have put the new (the one I have dumped, loaded etc - that the "db
  changesetify" failed on) database at
  http://troja.ath.cx/~zond/files/monotone.db
- Here is the first few pages from the backtrace (I couldnt figure out
  how to get it into a file...)
-----------------8<-------------
[0:address@hidden ~]$gdb monotone
GNU gdb 6.3-debian
Copyright 2004 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you are
welcome to change it and/or distribute copies of it under certain conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB.  Type "show warranty" for details.
This GDB was configured as "i386-linux"...(no debugging symbols found)
Using host libthread_db library "/lib/tls/libthread_db.so.1".

(gdb) r --db doc/monotone.db db changesetify
Starting program: /usr/bin/monotone --db doc/monotone.db db changesetify
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
[Thread debugging using libthread_db enabled]
[New Thread -1211082560 (LWP 22760)]
(no debugging symbols found)
(no debugging symbols found)
(no debugging symbols found)
monotone: rebuilding revision graph from manifest certs
enter passphrase for key ID address@hidden:
monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 0]
monotone: scanning for nodes with 3+ parents
monotone: rebuilding 197 nodes
monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 1]
monotone: verifying new revisions (this may take a while)
monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 22]
Program received signal SIGSEGV, Segmentation fault.
[Switching to Thread -1211082560 (LWP 22760)]
0xb7eda782 in std::num_put<char, std::ostreambuf_iterator<char, 
std::char_traits<char> > >::_M_convert_int<unsigned long long> ()
   from /usr/lib/libstdc++.so.5
(gdb) bt
#0  0xb7eda782 in std::num_put<char, std::ostreambuf_iterator<char, 
std::char_traits<char> > >::_M_convert_int<unsigned long long> ()
   from /usr/lib/libstdc++.so.5
#1  0xb7ed9f0a in std::num_put<char, std::ostreambuf_iterator<char, 
std::char_traits<char> > >::do_put () from /usr/lib/libstdc++.so.5
#2  0xb7ef010e in std::ostream::operator<< () from /usr/lib/libstdc++.so.5
#3  0x08307980 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#4  0x083071f1 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#5  0x08304e25 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#6  0x082f3e5f in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#7  0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#8  0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#9  0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#10 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#11 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#12 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> 
>---Type <return> to continue, or q <return> to quit---
, std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#13 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#14 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#15 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#16 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#17 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#18 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#19 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#20 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#21 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#22 0x082f5dd2 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
#23 0x082f6210 in std::_Rb_tree<std::string, std::pair<std::string const, 
unsigned int>, std::_Select1st<std::pair<std::string const, unsigned int> >, 
std::less<std::string>, std::allocator<std::pair<std::string const, unsigned 
int> > >::_M_create_node ()
---Type <return> to continue, or q <return> to quit---
-----------------8<-------------

I hope this helps!

regards,
//Martin Kihlgren

On Sun, Apr 03, 2005 at 04:15:00AM -0700, Nathaniel Smith wrote:
> On Sun, Apr 03, 2005 at 11:47:52AM +0200, Martin Kihlgren wrote:
> > 
> > Hello everyone, I have a small problem with "db changesetify".. it
> > gives segmentation fault.
> > 
> > I had monotone 0.14, and upgraded to 0.17 - following the
> > README.changesets-file.
> > 
> > The output from "db changesetify" is:
> > -----------8<-----------
> > address@hidden:~$ monotone --db doc/monotone.db db changesetify
> > monotone: rebuilding revision graph from manifest certs
> > enter passphrase for key ID address@hidden:
> > monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 0]
> > monotone: scanning for nodes with 3+ parents
> > monotone: rebuilding 197 nodes
> > monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 1]
> > monotone: verifying new revisions (this may take a while)
> > monotone: [certs in: 988] [certs out: 0] [nodes: 197] [revs out: 22] 
> > Segmentation fault
> > address@hidden:~$
> > -----------8<-----------
> 
> _What_?  Whoa.  Umm.
> 
> Can we get:
>   - output of 'monotone --full-version'
>   - output of 'ldd monotone' (if on unix)
>   - what system are you running on?
>   - built yourself, downloaded, ...?
>   - is it possible to make the database available to developers?  this
>     would be very helpful, though I know it isn't always possible.
>   - a backtrace, if you can get it?  ('gdb monotone', 'r --db
>     doc/monotone.db db changesetify', 'bt')
> 
> -- Nathaniel
> 
> -- 
> "The problem...is that sets have a very limited range of
> activities -- they can't carry pianos, for example, nor drink
> beer."

-- 
###################################################################
:maggotbox: /mag'*t-boks/ n. See {Macintrash}.  This is even
   more derogatory.
                                -- The Jargon File --
###################################################################

Attachment: signature.asc
Description: Digital signature


reply via email to

[Prev in Thread] Current Thread [Next in Thread]