commit | 4a6e708ed62d1b075029e9e0d0b0077a8f1cf746 | [log] [tgz] |
---|---|---|
author | jimblandy@gmail.com <jimblandy@gmail.com@4c0a9323-5329-0410-9bdc-e9ce6186880e> | Thu Jul 30 17:36:23 2009 +0000 |
committer | jimblandy@gmail.com <jimblandy@gmail.com@4c0a9323-5329-0410-9bdc-e9ce6186880e> | Thu Jul 30 17:36:23 2009 +0000 |
tree | 1dadf475f08100756a133c70652c557c47953108 | |
parent | 7a5e320f84a6f894d0d05a26978cc290cdd4e6f7 [diff] |
Linux dumper: Use a sorted array of addresses in computing function and line sizes. Replace the sorted lists of files and functions with an array of boundary addresses. This replaces CompareAddress with the default comparison, and SortByAddress and NextAddress with the stock STL sort and upper_bound algorithms, losing ~50 lines of code. a=jimblandy r=nealsid git-svn-id: http://google-breakpad.googlecode.com/svn/trunk@367 4c0a9323-5329-0410-9bdc-e9ce6186880e