[Courgette] Optimize QSufSort to speed up courgette-gen.

courgette/third_party/qsufsort_unittest.cc

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "courgette/third_party/qsufsort.h"
 
 #include <algorithm>
 #include <cstring>
 #include <string>
 #include <vector>
@@ skipping 98 matching lines @@
 
   for (size_t idx = 0; idx < arraysize(test_cases); ++idx) {
     const auto& test_case = test_cases[idx];
     int new_size = static_cast<int>(::strlen(test_case.query_str));
     const unsigned char* new_buf =
         reinterpret_cast<const unsigned char*>(test_case.query_str);
 
     // Perform the search.
     int pos = 0;
     int match_len = courgette::qsuf::search(
-        &I[0], old_buf, old_size, new_buf, new_size, 0, old_size, &pos);
+        &I[0], old_buf, old_size, new_buf, new_size, &pos);
 
     // Check basic properties and match with expected values.
     EXPECT_GE(match_len, 0) << "test_case[" << idx << "]";
     EXPECT_LE(match_len, new_size) << "test_case[" << idx << "]";
     if (match_len > 0) {
       EXPECT_GE(pos, 0) << "test_case[" << idx << "]";
       EXPECT_LE(pos, old_size - match_len) << "test_case[" << idx << "]";
       EXPECT_EQ(0, ::memcmp(old_buf + pos, new_buf, match_len))
           << "test_case[" << idx << "]";
     }
     if (test_case.exp_pos >= 0) {
       EXPECT_EQ(test_case.exp_pos, pos) << "test_case[" << idx << "]";
     }
     EXPECT_EQ(test_case.exp_match_len, match_len) << "test_case[" << idx << "]";
   }
 }