Line data    Source code

       1             : /*
       2             :  *
       3             :  * Copyright 2015, Google Inc.
       4             :  * All rights reserved.
       5             :  *
       6             :  * Redistribution and use in source and binary forms, with or without
       7             :  * modification, are permitted provided that the following conditions are
       8             :  * met:
       9             :  *
      10             :  *     * Redistributions of source code must retain the above copyright
      11             :  * notice, this list of conditions and the following disclaimer.
      12             :  *     * Redistributions in binary form must reproduce the above
      13             :  * copyright notice, this list of conditions and the following disclaimer
      14             :  * in the documentation and/or other materials provided with the
      15             :  * distribution.
      16             :  *     * Neither the name of Google Inc. nor the names of its
      17             :  * contributors may be used to endorse or promote products derived from
      18             :  * this software without specific prior written permission.
      19             :  *
      20             :  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
      21             :  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
      22             :  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
      23             :  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
      24             :  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
      25             :  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
      26             :  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
      27             :  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
      28             :  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
      29             :  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
      30             :  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
      31             :  *
      32             :  */
      33             : 
      34             : #include "src/core/iomgr/workqueue.h"
      35             : 
      36             : #include <grpc/grpc.h>
      37             : #include <grpc/support/log.h>
      38             : 
      39             : #include "test/core/util/test_config.h"
      40             : 
      41             : static grpc_pollset g_pollset;
      42             : 
      43           1 : static void must_succeed(grpc_exec_ctx *exec_ctx, void *p, int success) {
      44           1 :   GPR_ASSERT(success == 1);
      45           1 :   gpr_mu_lock(GRPC_POLLSET_MU(&g_pollset));
      46           1 :   *(int *)p = 1;
      47           1 :   grpc_pollset_kick(&g_pollset, NULL);
      48           1 :   gpr_mu_unlock(GRPC_POLLSET_MU(&g_pollset));
      49           1 : }
      50             : 
      51           1 : static void test_add_closure(void) {
      52             :   grpc_closure c;
      53           1 :   int done = 0;
      54           1 :   grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT;
      55           1 :   grpc_workqueue *wq = grpc_workqueue_create(&exec_ctx);
      56           1 :   gpr_timespec deadline = GRPC_TIMEOUT_SECONDS_TO_DEADLINE(5);
      57             :   grpc_pollset_worker worker;
      58           1 :   grpc_closure_init(&c, must_succeed, &done);
      59             : 
      60           1 :   grpc_workqueue_push(wq, &c, 1);
      61           1 :   grpc_workqueue_add_to_pollset(&exec_ctx, wq, &g_pollset);
      62             : 
      63           1 :   gpr_mu_lock(GRPC_POLLSET_MU(&g_pollset));
      64           1 :   GPR_ASSERT(!done);
      65           1 :   grpc_pollset_work(&exec_ctx, &g_pollset, &worker,
      66             :                     gpr_now(deadline.clock_type), deadline);
      67           1 :   gpr_mu_unlock(GRPC_POLLSET_MU(&g_pollset));
      68           1 :   grpc_exec_ctx_finish(&exec_ctx);
      69           1 :   GPR_ASSERT(done);
      70             : 
      71           1 :   GRPC_WORKQUEUE_UNREF(&exec_ctx, wq, "destroy");
      72           1 :   grpc_exec_ctx_finish(&exec_ctx);
      73           1 : }
      74             : 
      75           1 : static void destroy_pollset(grpc_exec_ctx *exec_ctx, void *p, int success) {
      76           1 :   grpc_pollset_destroy(p);
      77           1 : }
      78             : 
      79           1 : int main(int argc, char **argv) {
      80             :   grpc_closure destroyed;
      81           1 :   grpc_exec_ctx exec_ctx = GRPC_EXEC_CTX_INIT;
      82           1 :   grpc_test_init(argc, argv);
      83           1 :   grpc_init();
      84           1 :   grpc_pollset_init(&g_pollset);
      85             : 
      86           1 :   test_add_closure();
      87             : 
      88           1 :   grpc_closure_init(&destroyed, destroy_pollset, &g_pollset);
      89           1 :   grpc_pollset_shutdown(&exec_ctx, &g_pollset, &destroyed);
      90           1 :   grpc_exec_ctx_finish(&exec_ctx);
      91           1 :   grpc_shutdown();
      92           1 :   return 0;
      93             : }