| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136 | 
							- /*
 
-  *
 
-  * Copyright 2016, 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
 
-  * copyright notice, this list of conditions and the following disclaimer
 
-  * in the documentation and/or other materials provided with the
 
-  * distribution.
 
-  *     * Neither the name of Google Inc. nor the names of its
 
-  * contributors may be used to endorse or promote products derived from
 
-  * this software without specific prior written permission.
 
-  *
 
-  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 
-  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 
-  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 
-  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 
-  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 
-  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 
-  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 
-  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 
-  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 
-  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 
-  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-  *is % allowed in string
 
-  */
 
- #include <ctime>
 
- #include <memory>
 
- #include <string>
 
- #include <gflags/gflags.h>
 
- #include <grpc++/grpc++.h>
 
- #include <grpc/support/log.h>
 
- #include <grpc/support/port_platform.h>
 
- #include "src/cpp/thread_manager/thread_manager.h"
 
- #include "test/cpp/util/test_config.h"
 
- namespace grpc {
 
- class ThreadManagerTest final : public grpc::ThreadManager {
 
-  public:
 
-   ThreadManagerTest()
 
-       : ThreadManager(kMinPollers, kMaxPollers),
 
-         num_do_work_(0),
 
-         num_poll_for_work_(0),
 
-         num_work_found_(0) {}
 
-   grpc::ThreadManager::WorkStatus PollForWork(void **tag, bool *ok) override;
 
-   void DoWork(void *tag, bool ok) override;
 
-   void PerformTest();
 
-  private:
 
-   void SleepForMs(int sleep_time_ms);
 
-   static const int kMinPollers = 2;
 
-   static const int kMaxPollers = 10;
 
-   static const int kPollingTimeoutMsec = 10;
 
-   static const int kDoWorkDurationMsec = 1;
 
-   // PollForWork will return SHUTDOWN after these many number of invocations
 
-   static const int kMaxNumPollForWork = 50;
 
-   gpr_atm num_do_work_;        // Number of calls to DoWork
 
-   gpr_atm num_poll_for_work_;  // Number of calls to PollForWork
 
-   gpr_atm num_work_found_;     // Number of times WORK_FOUND was returned
 
- };
 
- void ThreadManagerTest::SleepForMs(int duration_ms) {
 
-   gpr_timespec sleep_time =
 
-       gpr_time_add(gpr_now(GPR_CLOCK_REALTIME),
 
-                    gpr_time_from_millis(duration_ms, GPR_TIMESPAN));
 
-   gpr_sleep_until(sleep_time);
 
- }
 
- grpc::ThreadManager::WorkStatus ThreadManagerTest::PollForWork(void **tag,
 
-                                                                bool *ok) {
 
-   int call_num = gpr_atm_no_barrier_fetch_add(&num_poll_for_work_, 1);
 
-   if (call_num >= kMaxNumPollForWork) {
 
-     Shutdown();
 
-     return SHUTDOWN;
 
-   }
 
-   // Simulate "polling for work" by sleeping for sometime
 
-   SleepForMs(kPollingTimeoutMsec);
 
-   *tag = nullptr;
 
-   *ok = true;
 
-   // Return timeout roughly 1 out of every 3 calls
 
-   if (call_num % 3 == 0) {
 
-     return TIMEOUT;
 
-   } else {
 
-     gpr_atm_no_barrier_fetch_add(&num_work_found_, 1);
 
-     return WORK_FOUND;
 
-   }
 
- }
 
- void ThreadManagerTest::DoWork(void *tag, bool ok) {
 
-   gpr_atm_no_barrier_fetch_add(&num_do_work_, 1);
 
-   SleepForMs(kDoWorkDurationMsec);  // Simulate doing work by sleeping
 
- }
 
- void ThreadManagerTest::PerformTest() {
 
-   // Initialize() starts the ThreadManager
 
-   Initialize();
 
-   // Wait for all the threads to gracefully terminate
 
-   Wait();
 
-   // The number of times DoWork() was called is equal to the number of times
 
-   // WORK_FOUND was returned
 
-   gpr_log(GPR_DEBUG, "DoWork() called %ld times",
 
-           gpr_atm_no_barrier_load(&num_do_work_));
 
-   GPR_ASSERT(gpr_atm_no_barrier_load(&num_do_work_) ==
 
-              gpr_atm_no_barrier_load(&num_work_found_));
 
- }
 
- }  // namespace grpc
 
- int main(int argc, char **argv) {
 
-   std::srand(std::time(NULL));
 
-   grpc::testing::InitTest(&argc, &argv, true);
 
-   grpc::ThreadManagerTest test_rpc_manager;
 
-   test_rpc_manager.PerformTest();
 
-   return 0;
 
- }
 
 
  |