Add support for GCM subtypes to desktop Instance ID implementation

google_apis/gcm/engine/gcm_request_test_base.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 <cmath>
 
 #include "google_apis/gcm/engine/gcm_request_test_base.h"
 #include "net/url_request/url_fetcher_delegate.h"
 
 namespace {
@@ skipping 58 matching lines @@
   fetcher->set_response_code(status_code);
   fetcher->SetResponseString(response_body);
 }
 
 void GCMRequestTestBase::CompleteFetch() {
   net::TestURLFetcher* fetcher = url_fetcher_factory_.GetFetcherByID(0);
   ASSERT_TRUE(fetcher);
   fetcher->delegate()->OnURLFetchComplete(fetcher);
 }
 
+void GCMRequestTestBase::VerifyFetcherUploadData(
+    std::map<std::string, std::string>* expected_pairs) {
+  net::TestURLFetcher* fetcher = url_fetcher_factory_.GetFetcherByID(0);
+  ASSERT_TRUE(fetcher);
+
+  // Verify data was formatted properly.
+  std::string upload_data = fetcher->upload_data();
+  base::StringTokenizer data_tokenizer(upload_data, "&=");
+  while (data_tokenizer.GetNext()) {
+    auto iter = expected_pairs->find(data_tokenizer.token());
+    ASSERT_TRUE(iter != expected_pairs->end()) << data_tokenizer.token();
+    ASSERT_TRUE(data_tokenizer.GetNext()) << data_tokenizer.token();
+    ASSERT_EQ(iter->second, data_tokenizer.token());
+    // Ensure that none of the keys appears twice.
+    expected_pairs->erase(iter);
+  }
+
+  ASSERT_EQ(0UL, expected_pairs->size());
+}
+
 void GCMRequestTestBase::FastForwardToTriggerNextRetry() {
   // Here we compute the maximum delay time by skipping the jitter fluctuation
   // that only affects in the negative way.
   int next_retry_delay_ms = kDefaultBackoffPolicy.initial_delay_ms;
   next_retry_delay_ms *=
       pow(kDefaultBackoffPolicy.multiply_factor, retry_count_);
   task_runner_->FastForwardBy(
       base::TimeDelta::FromMilliseconds(next_retry_delay_ms));
 }
 
 }  // namespace gcm