[fuchsia] Make profile processing resilient to bogus overlaps from dladdr.

runtime/vm/profiler_service.h

 // Copyright (c) 2015, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef RUNTIME_VM_PROFILER_SERVICE_H_
 #define RUNTIME_VM_PROFILER_SERVICE_H_
 
 #include "vm/allocation.h"
 #include "vm/code_observers.h"
 #include "vm/globals.h"
@@ skipping 153 matching lines @@
               const Code& code);
 
   Kind kind() const { return kind_; }
 
   uword start() const { return start_; }
   void set_start(uword start) { start_ = start; }
 
   uword end() const { return end_; }
   void set_end(uword end) { end_ = end; }
 
-  void AdjustExtent(uword start, uword end);
+  void ExpandLower(uword start);
+  void ExpandUpper(uword end);
+  void TruncateLower(uword start);
+  void TruncateUpper(uword end);
 
   bool Contains(uword pc) const { return (pc >= start_) && (pc < end_); }
 
   bool Overlaps(const ProfileCode* other) const;
 
   int64_t compile_timestamp() const { return compile_timestamp_; }
   void set_compile_timestamp(int64_t timestamp) {
     compile_timestamp_ = timestamp;
   }
 
@@ skipping 47 matching lines @@
   char* name_;
   int64_t compile_timestamp_;
   ProfileFunction* function_;
   intptr_t code_table_index_;
   ZoneGrowableArray<ProfileCodeAddress> address_ticks_;
 
   friend class ProfileBuilder;
 };
 
 
+class ProfileCodeTable : public ZoneAllocated {
+ public:
+  ProfileCodeTable() : table_(8) {}
+
+  intptr_t length() const { return table_.length(); }
+
+  ProfileCode* At(intptr_t index) const {
+    ASSERT(index >= 0);
+    ASSERT(index < length());
+    return table_[index];
+  }
+
+  // Find the table index to the ProfileCode containing pc.
+  // Returns < 0 if not found.
+  intptr_t FindCodeIndexForPC(uword pc) const;
+
+  ProfileCode* FindCodeForPC(uword pc) const {
+    intptr_t index = FindCodeIndexForPC(pc);
+    if (index < 0) {
+      return NULL;
+    }
+    return At(index);
+  }
+
+  // Insert |new_code| into the table. Returns the table index where |new_code|
+  // was inserted. Will merge with an overlapping ProfileCode if one is present.
+  intptr_t InsertCode(ProfileCode* new_code);
+
+ private:
+  void FindNeighbors(uword pc,
+                     intptr_t* lo,
+                     intptr_t* hi,
+                     ProfileCode** lo_code,
+                     ProfileCode** hi_code) const;
+
+  void VerifyOrder();
+  void VerifyOverlap();
+
+  ZoneGrowableArray<ProfileCode*> table_;
+};
+
+
 // Stack traces are organized in a trie. This holds information about one node
 // in the trie. A node in a tree represents a stack frame and a path in the tree
 // represents a stack trace. Each unique stack trace appears in the tree once
 // and each node has a count indicating how many times this has been observed.
 // The index can be used to look up a |ProfileFunction| or |ProfileCode|.
 // A node can have zero or more children. Depending on the kind of trie the
 // children are callers or callees of the current node.
 class ProfileTrieNode : public ZoneAllocated {
  public:
   explicit ProfileTrieNode(intptr_t index);
@@ skipping 202 matching lines @@
                             JSONStream* stream,
                             Profile::TagOrder tag_order,
                             intptr_t extra_tags,
                             SampleFilter* filter,
                             bool as_timline);
 };
 
 }  // namespace dart
 
 #endif  // RUNTIME_VM_PROFILER_SERVICE_H_