Server-side workaround to handle overlapping modules.

src/processor/range_map.h

 // Copyright (c) 2006, Google Inc.
 // All rights reserved.
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 // notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
@@ skipping 42 matching lines @@
 class RangeMap {
  public:
   RangeMap() : enable_shrink_down_(false), map_() {}
 
   // |enable_shrink_down| tells whether overlapping ranges can be shrunk down.
   // If true, then adding a new range that overlaps with an existing one can
   // be a successful operation.  The range which ends at the higher address
   // will be shrunk down by moving its start position to a higher address so
   // that it does not overlap anymore.
   void SetEnableShrinkDown(bool enable_shrink_down);
+  bool IsShrinkDownEnabled() const;
 
   // Inserts a range into the map.  Returns false for a parameter error,
   // or if the location of the range would conflict with a range already
   // stored in the map.  If enable_shrink_down is true and there is an overlap
   // between the current range and some other range (already in the map),
   // shrink down the range which ends at a higher address.
   bool StoreRange(const AddressType &base, const AddressType &size,
                   const EntryType &entry);
 
   // Locates the range encompassing the supplied address.  If there is no such
@@ skipping 78 matching lines @@
 
   // Maps the high address of each range to a EntryType.
   AddressToRangeMap map_;
 };
 
 
 }  // namespace google_breakpad
 
 
 #endif  // PROCESSOR_RANGE_MAP_H__