Migrate WebRequestRedirectByRegExAction to use RE2 and roll RE2 to revision 97:401ab4168e8e

third_party/re2/util/sparse_array.h

 // Copyright 2006 The RE2 Authors.  All Rights Reserved.
 // Use of this source code is governed by a BSD-style
 // license that can be found in the LICENSE file.
 
 // DESCRIPTION
 // 
 // SparseArray<T>(m) is a map from integers in [0, m) to T values.
 // It requires (sizeof(T)+sizeof(int))*m memory, but it provides
 // fast iteration through the elements in the array and fast clearing
 // of the array.  The array has a concept of certain elements being
@@ skipping 206 matching lines @@
 
   // In debug mode, verify that some invariant properties of the class
   // are being maintained. This is called at the end of the constructor
   // and at the beginning and end of all public non-const member functions.
   inline void DebugCheckInvariants() const;
 
   int size_;
   int max_size_;
   int* sparse_to_dense_;
   vector<IndexValue> dense_;
+  bool valgrind_;
 
   DISALLOW_EVIL_CONSTRUCTORS(SparseArray);
 };
 
 template<typename Value>
 SparseArray<Value>::SparseArray()
-    : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_() {}
+    : size_(0), max_size_(0), sparse_to_dense_(NULL), dense_(), valgrind_(RunningOnValgrind()) {}
 
 // IndexValue pairs: exposed in SparseArray::iterator.
 template<typename Value>
 class SparseArray<Value>::IndexValue {
   friend class SparseArray;
  public:
   typedef int first_type;
   typedef Value second_type;
 
   IndexValue() {}
@@ skipping 21 matching lines @@
 // Change the maximum size of the array.
 // Invalidates all iterators.
 template<typename Value>
 void SparseArray<Value>::resize(int new_max_size) {
   DebugCheckInvariants();
   if (new_max_size > max_size_) {
     int* a = new int[new_max_size];
     if (sparse_to_dense_) {
       memmove(a, sparse_to_dense_, max_size_*sizeof a[0]);
       // Don't need to zero the memory but appease Valgrind.
-      if (RunningOnValgrind()) {
+      if (valgrind_) {
         for (int i = max_size_; i < new_max_size; i++)
           a[i] = 0xababababU;
       }
       delete[] sparse_to_dense_;
     }
     sparse_to_dense_ = a;
 
     dense_.resize(new_max_size);
   }
   max_size_ = new_max_size;
@@ skipping 124 matching lines @@
   DCHECK(!has_index(i));
   DCHECK_LT(size_, max_size_);
   sparse_to_dense_[i] = size_;
   dense_[size_].index_ = i;
   size_++;
 }
 
 template<typename Value> SparseArray<Value>::SparseArray(int max_size) {
   max_size_ = max_size;
   sparse_to_dense_ = new int[max_size];
+  valgrind_ = RunningOnValgrind();
   dense_.resize(max_size);
   // Don't need to zero the new memory, but appease Valgrind.
-  if (RunningOnValgrind()) {
+  if (valgrind_) {
     for (int i = 0; i < max_size; i++) {
       sparse_to_dense_[i] = 0xababababU;
       dense_[i].index_ = 0xababababU;
     }
   }
   size_ = 0;
   DebugCheckInvariants();
 }
 
 template<typename Value> SparseArray<Value>::~SparseArray() {
   DebugCheckInvariants();
   delete[] sparse_to_dense_;
 }
 
 template<typename Value> void SparseArray<Value>::DebugCheckInvariants() const {
   DCHECK_LE(0, size_);
   DCHECK_LE(size_, max_size_);
   DCHECK(size_ == 0 || sparse_to_dense_ != NULL);
 }
 
 // Comparison function for sorting.
 template<typename Value> bool SparseArray<Value>::less(const IndexValue& a,
                                                        const IndexValue& b) {
   return a.index_ < b.index_;
 }
 
 }  // namespace re2
 
 #endif  // RE2_UTIL_SPARSE_ARRAY_H__