1 //
2 //
3 // Copyright 2016 gRPC authors.
4 //
5 // Licensed under the Apache License, Version 2.0 (the "License");
6 // you may not use this file except in compliance with the License.
7 // You may obtain a copy of the License at
8 //
9 //     http://www.apache.org/licenses/LICENSE-2.0
10 //
11 // Unless required by applicable law or agreed to in writing, software
12 // distributed under the License is distributed on an "AS IS" BASIS,
13 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 // See the License for the specific language governing permissions and
15 // limitations under the License.
16 //
17 //
18 
19 #include <grpc/support/port_platform.h>
20 
21 #include "src/core/lib/iomgr/combiner.h"
22 
23 #include <assert.h>
24 #include <inttypes.h>
25 #include <string.h>
26 
27 #include <grpc/support/alloc.h>
28 #include <grpc/support/log.h>
29 
30 #include "src/core/lib/gprpp/crash.h"
31 #include "src/core/lib/gprpp/mpscq.h"
32 #include "src/core/lib/iomgr/executor.h"
33 #include "src/core/lib/iomgr/iomgr_internal.h"
34 
35 grpc_core::DebugOnlyTraceFlag grpc_combiner_trace(false, "combiner");
36 
37 #define GRPC_COMBINER_TRACE(fn)          \
38   do {                                   \
39     if (grpc_combiner_trace.enabled()) { \
40       fn;                                \
41     }                                    \
42   } while (0)
43 
44 #define STATE_UNORPHANED 1
45 #define STATE_ELEM_COUNT_LOW_BIT 2
46 
47 static void combiner_exec(grpc_core::Combiner* lock, grpc_closure* closure,
48                           grpc_error_handle error);
49 static void combiner_finally_exec(grpc_core::Combiner* lock,
50                                   grpc_closure* closure,
51                                   grpc_error_handle error);
52 
53 static void offload(void* arg, grpc_error_handle error);
54 
grpc_combiner_create(void)55 grpc_core::Combiner* grpc_combiner_create(void) {
56   grpc_core::Combiner* lock = new grpc_core::Combiner();
57   gpr_ref_init(&lock->refs, 1);
58   gpr_atm_no_barrier_store(&lock->state, STATE_UNORPHANED);
59   grpc_closure_list_init(&lock->final_list);
60   GRPC_CLOSURE_INIT(&lock->offload, offload, lock, nullptr);
61   GRPC_COMBINER_TRACE(gpr_log(GPR_INFO, "C:%p create", lock));
62   return lock;
63 }
64 
really_destroy(grpc_core::Combiner * lock)65 static void really_destroy(grpc_core::Combiner* lock) {
66   GRPC_COMBINER_TRACE(gpr_log(GPR_INFO, "C:%p really_destroy", lock));
67   GPR_ASSERT(gpr_atm_no_barrier_load(&lock->state) == 0);
68   delete lock;
69 }
70 
start_destroy(grpc_core::Combiner * lock)71 static void start_destroy(grpc_core::Combiner* lock) {
72   gpr_atm old_state = gpr_atm_full_fetch_add(&lock->state, -STATE_UNORPHANED);
73   GRPC_COMBINER_TRACE(gpr_log(
74       GPR_INFO, "C:%p really_destroy old_state=%" PRIdPTR, lock, old_state));
75   if (old_state == 1) {
76     really_destroy(lock);
77   }
78 }
79 
80 #ifndef NDEBUG
81 #define GRPC_COMBINER_DEBUG_SPAM(op, delta)                                \
82   if (grpc_combiner_trace.enabled()) {                                     \
83     gpr_log(file, line, GPR_LOG_SEVERITY_DEBUG,                            \
84             "C:%p %s %" PRIdPTR " --> %" PRIdPTR " %s", lock, (op),        \
85             gpr_atm_no_barrier_load(&lock->refs.count),                    \
86             gpr_atm_no_barrier_load(&lock->refs.count) + (delta), reason); \
87   }
88 #else
89 #define GRPC_COMBINER_DEBUG_SPAM(op, delta)
90 #endif
91 
grpc_combiner_unref(grpc_core::Combiner * lock GRPC_COMBINER_DEBUG_ARGS)92 void grpc_combiner_unref(grpc_core::Combiner* lock GRPC_COMBINER_DEBUG_ARGS) {
93   GRPC_COMBINER_DEBUG_SPAM("UNREF", -1);
94   if (gpr_unref(&lock->refs)) {
95     start_destroy(lock);
96   }
97 }
98 
grpc_combiner_ref(grpc_core::Combiner * lock GRPC_COMBINER_DEBUG_ARGS)99 grpc_core::Combiner* grpc_combiner_ref(
100     grpc_core::Combiner* lock GRPC_COMBINER_DEBUG_ARGS) {
101   GRPC_COMBINER_DEBUG_SPAM("  REF", 1);
102   gpr_ref(&lock->refs);
103   return lock;
104 }
105 
push_last_on_exec_ctx(grpc_core::Combiner * lock)106 static void push_last_on_exec_ctx(grpc_core::Combiner* lock) {
107   lock->next_combiner_on_this_exec_ctx = nullptr;
108   if (grpc_core::ExecCtx::Get()->combiner_data()->active_combiner == nullptr) {
109     grpc_core::ExecCtx::Get()->combiner_data()->active_combiner =
110         grpc_core::ExecCtx::Get()->combiner_data()->last_combiner = lock;
111   } else {
112     grpc_core::ExecCtx::Get()
113         ->combiner_data()
114         ->last_combiner->next_combiner_on_this_exec_ctx = lock;
115     grpc_core::ExecCtx::Get()->combiner_data()->last_combiner = lock;
116   }
117 }
118 
push_first_on_exec_ctx(grpc_core::Combiner * lock)119 static void push_first_on_exec_ctx(grpc_core::Combiner* lock) {
120   lock->next_combiner_on_this_exec_ctx =
121       grpc_core::ExecCtx::Get()->combiner_data()->active_combiner;
122   grpc_core::ExecCtx::Get()->combiner_data()->active_combiner = lock;
123   if (lock->next_combiner_on_this_exec_ctx == nullptr) {
124     grpc_core::ExecCtx::Get()->combiner_data()->last_combiner = lock;
125   }
126 }
127 
combiner_exec(grpc_core::Combiner * lock,grpc_closure * cl,grpc_error_handle error)128 static void combiner_exec(grpc_core::Combiner* lock, grpc_closure* cl,
129                           grpc_error_handle error) {
130   gpr_atm last = gpr_atm_full_fetch_add(&lock->state, STATE_ELEM_COUNT_LOW_BIT);
131   GRPC_COMBINER_TRACE(gpr_log(GPR_INFO,
132                               "C:%p grpc_combiner_execute c=%p last=%" PRIdPTR,
133                               lock, cl, last));
134   if (last == 1) {
135     gpr_atm_no_barrier_store(
136         &lock->initiating_exec_ctx_or_null,
137         reinterpret_cast<gpr_atm>(grpc_core::ExecCtx::Get()));
138     // first element on this list: add it to the list of combiner locks
139     // executing within this exec_ctx
140     push_last_on_exec_ctx(lock);
141   } else {
142     // there may be a race with setting here: if that happens, we may delay
143     // offload for one or two actions, and that's fine
144     gpr_atm initiator =
145         gpr_atm_no_barrier_load(&lock->initiating_exec_ctx_or_null);
146     if (initiator != 0 &&
147         initiator != reinterpret_cast<gpr_atm>(grpc_core::ExecCtx::Get())) {
148       gpr_atm_no_barrier_store(&lock->initiating_exec_ctx_or_null, 0);
149     }
150   }
151   GPR_ASSERT(last & STATE_UNORPHANED);  // ensure lock has not been destroyed
152   assert(cl->cb);
153   cl->error_data.error = grpc_core::internal::StatusAllocHeapPtr(error);
154   lock->queue.Push(cl->next_data.mpscq_node.get());
155 }
156 
move_next()157 static void move_next() {
158   grpc_core::ExecCtx::Get()->combiner_data()->active_combiner =
159       grpc_core::ExecCtx::Get()
160           ->combiner_data()
161           ->active_combiner->next_combiner_on_this_exec_ctx;
162   if (grpc_core::ExecCtx::Get()->combiner_data()->active_combiner == nullptr) {
163     grpc_core::ExecCtx::Get()->combiner_data()->last_combiner = nullptr;
164   }
165 }
166 
offload(void * arg,grpc_error_handle)167 static void offload(void* arg, grpc_error_handle /*error*/) {
168   grpc_core::Combiner* lock = static_cast<grpc_core::Combiner*>(arg);
169   push_last_on_exec_ctx(lock);
170 }
171 
queue_offload(grpc_core::Combiner * lock)172 static void queue_offload(grpc_core::Combiner* lock) {
173   move_next();
174   GRPC_COMBINER_TRACE(gpr_log(GPR_INFO, "C:%p queue_offload", lock));
175   grpc_core::Executor::Run(&lock->offload, absl::OkStatus());
176 }
177 
grpc_combiner_continue_exec_ctx()178 bool grpc_combiner_continue_exec_ctx() {
179   grpc_core::Combiner* lock =
180       grpc_core::ExecCtx::Get()->combiner_data()->active_combiner;
181   if (lock == nullptr) {
182     return false;
183   }
184 
185   bool contended =
186       gpr_atm_no_barrier_load(&lock->initiating_exec_ctx_or_null) == 0;
187 
188   GRPC_COMBINER_TRACE(gpr_log(GPR_INFO,
189                               "C:%p grpc_combiner_continue_exec_ctx "
190                               "contended=%d "
191                               "exec_ctx_ready_to_finish=%d "
192                               "time_to_execute_final_list=%d",
193                               lock, contended,
194                               grpc_core::ExecCtx::Get()->IsReadyToFinish(),
195                               lock->time_to_execute_final_list));
196 
197   // offload only if all the following conditions are true:
198   // 1. the combiner is contended and has more than one closure to execute
199   // 2. the current execution context needs to finish as soon as possible
200   // 3. the current thread is not a worker for any background poller
201   // 4. the DEFAULT executor is threaded
202   if (contended && grpc_core::ExecCtx::Get()->IsReadyToFinish() &&
203       !grpc_iomgr_platform_is_any_background_poller_thread() &&
204       grpc_core::Executor::IsThreadedDefault()) {
205     // this execution context wants to move on: schedule remaining work to be
206     // picked up on the executor
207     queue_offload(lock);
208     return true;
209   }
210 
211   if (!lock->time_to_execute_final_list ||
212       // peek to see if something new has shown up, and execute that with
213       // priority
214       (gpr_atm_acq_load(&lock->state) >> 1) > 1) {
215     grpc_core::MultiProducerSingleConsumerQueue::Node* n = lock->queue.Pop();
216     GRPC_COMBINER_TRACE(
217         gpr_log(GPR_INFO, "C:%p maybe_finish_one n=%p", lock, n));
218     if (n == nullptr) {
219       // queue is in an inconsistent state: use this as a cue that we should
220       // go off and do something else for a while (and come back later)
221       queue_offload(lock);
222       return true;
223     }
224     grpc_closure* cl = reinterpret_cast<grpc_closure*>(n);
225 #ifndef NDEBUG
226     cl->scheduled = false;
227 #endif
228     grpc_error_handle cl_err =
229         grpc_core::internal::StatusMoveFromHeapPtr(cl->error_data.error);
230     cl->error_data.error = 0;
231     cl->cb(cl->cb_arg, std::move(cl_err));
232   } else {
233     grpc_closure* c = lock->final_list.head;
234     GPR_ASSERT(c != nullptr);
235     grpc_closure_list_init(&lock->final_list);
236     int loops = 0;
237     while (c != nullptr) {
238       GRPC_COMBINER_TRACE(
239           gpr_log(GPR_INFO, "C:%p execute_final[%d] c=%p", lock, loops, c));
240       grpc_closure* next = c->next_data.next;
241 #ifndef NDEBUG
242       c->scheduled = false;
243 #endif
244       grpc_error_handle error =
245           grpc_core::internal::StatusMoveFromHeapPtr(c->error_data.error);
246       c->error_data.error = 0;
247       c->cb(c->cb_arg, std::move(error));
248       c = next;
249     }
250   }
251 
252   move_next();
253   lock->time_to_execute_final_list = false;
254   gpr_atm old_state =
255       gpr_atm_full_fetch_add(&lock->state, -STATE_ELEM_COUNT_LOW_BIT);
256   GRPC_COMBINER_TRACE(
257       gpr_log(GPR_INFO, "C:%p finish old_state=%" PRIdPTR, lock, old_state));
258 // Define a macro to ease readability of the following switch statement.
259 #define OLD_STATE_WAS(orphaned, elem_count) \
260   (((orphaned) ? 0 : STATE_UNORPHANED) |    \
261    ((elem_count)*STATE_ELEM_COUNT_LOW_BIT))
262   // Depending on what the previous state was, we need to perform different
263   // actions.
264   switch (old_state) {
265     default:
266       // we have multiple queued work items: just continue executing them
267       break;
268     case OLD_STATE_WAS(false, 2):
269     case OLD_STATE_WAS(true, 2):
270       // we're down to one queued item: if it's the final list we should do that
271       if (!grpc_closure_list_empty(lock->final_list)) {
272         lock->time_to_execute_final_list = true;
273       }
274       break;
275     case OLD_STATE_WAS(false, 1):
276       // had one count, one unorphaned --> unlocked unorphaned
277       return true;
278     case OLD_STATE_WAS(true, 1):
279       // and one count, one orphaned --> unlocked and orphaned
280       really_destroy(lock);
281       return true;
282     case OLD_STATE_WAS(false, 0):
283     case OLD_STATE_WAS(true, 0):
284       // these values are illegal - representing an already unlocked or
285       // deleted lock
286       GPR_UNREACHABLE_CODE(return true);
287   }
288   push_first_on_exec_ctx(lock);
289   return true;
290 }
291 
292 static void enqueue_finally(void* closure, grpc_error_handle error);
293 
combiner_finally_exec(grpc_core::Combiner * lock,grpc_closure * closure,grpc_error_handle error)294 static void combiner_finally_exec(grpc_core::Combiner* lock,
295                                   grpc_closure* closure,
296                                   grpc_error_handle error) {
297   GPR_ASSERT(lock != nullptr);
298   GRPC_COMBINER_TRACE(gpr_log(
299       GPR_INFO, "C:%p grpc_combiner_execute_finally c=%p; ac=%p", lock, closure,
300       grpc_core::ExecCtx::Get()->combiner_data()->active_combiner));
301   if (grpc_core::ExecCtx::Get()->combiner_data()->active_combiner != lock) {
302     // Using error_data.scratch to store the combiner so that it can be accessed
303     // in enqueue_finally.
304     closure->error_data.scratch = reinterpret_cast<uintptr_t>(lock);
305     lock->Run(GRPC_CLOSURE_CREATE(enqueue_finally, closure, nullptr), error);
306     return;
307   }
308 
309   if (grpc_closure_list_empty(lock->final_list)) {
310     gpr_atm_full_fetch_add(&lock->state, STATE_ELEM_COUNT_LOW_BIT);
311   }
312   grpc_closure_list_append(&lock->final_list, closure, error);
313 }
314 
enqueue_finally(void * closure,grpc_error_handle error)315 static void enqueue_finally(void* closure, grpc_error_handle error) {
316   grpc_closure* cl = static_cast<grpc_closure*>(closure);
317   grpc_core::Combiner* lock =
318       reinterpret_cast<grpc_core::Combiner*>(cl->error_data.scratch);
319   cl->error_data.scratch = 0;
320   combiner_finally_exec(lock, cl, error);
321 }
322 
323 namespace grpc_core {
Run(grpc_closure * closure,grpc_error_handle error)324 void Combiner::Run(grpc_closure* closure, grpc_error_handle error) {
325   combiner_exec(this, closure, error);
326 }
327 
FinallyRun(grpc_closure * closure,grpc_error_handle error)328 void Combiner::FinallyRun(grpc_closure* closure, grpc_error_handle error) {
329   combiner_finally_exec(this, closure, error);
330 }
331 }  // namespace grpc_core
332