diff options
| author |  Mark D. Roth <roth@google.com> | 2016-10-12 14:55:20 -0700 |
|---|---|---|
| committer | Mark D. Roth <roth@google.com> | 2016-10-12 14:55:20 -0700 |
| commit | 55f25b6c27b42b81ccb9bd9c7adf9a87cadd6da0 (patch) | |
| tree | 44762424e9fcbfec089e7bf4ebec4c84c3a5fe7e /src/core | |
| parent | 196387a934c7757ab2e60e03dd764b31fd6879ea (diff) | |
clang-format
Diffstat (limited to 'src/core')
| -rw-r--r-- | src/core/ext/client_config/client_channel.c | 5 | ||||
| -rw-r--r-- | src/core/lib/transport/hashtable.c | 5 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/core/ext/client_config/client_channel.c b/src/core/ext/client_config/client_channel.c index de0d42f474..fb3e17a7d9 100644 --- a/src/core/ext/client_config/client_channel.c +++ b/src/core/ext/client_config/client_channel.c @@ -680,9 +680,8 @@ static bool pick_subchannel(grpc_exec_ctx *exec_ctx, grpc_call_element *elem, const grpc_lb_policy_pick_args inputs = { calld->pollent, initial_metadata, initial_metadata_flags, &calld->lb_token_mdelem, gpr_inf_future(GPR_CLOCK_MONOTONIC)}; - const bool result = - grpc_lb_policy_pick(exec_ctx, lb_policy, &inputs, - connected_subchannel, NULL, on_ready); + const bool result = grpc_lb_policy_pick( + exec_ctx, lb_policy, &inputs, connected_subchannel, NULL, on_ready); GRPC_LB_POLICY_UNREF(exec_ctx, lb_policy, "pick_subchannel"); GPR_TIMER_END("pick_subchannel", 0); return result; diff --git a/src/core/lib/transport/hashtable.c b/src/core/lib/transport/hashtable.c index a1bae147cc..a016daa0ec 100644 --- a/src/core/lib/transport/hashtable.c +++ b/src/core/lib/transport/hashtable.c @@ -47,8 +47,9 @@ struct grpc_hash_table { // Helper function for insert and get operations that performs quadratic // probing (https://en.wikipedia.org/wiki/Quadratic_probing). -static size_t grpc_hash_table_find_index( - const grpc_hash_table* table, const grpc_mdstr* key, bool find_empty) { +static size_t grpc_hash_table_find_index(const grpc_hash_table* table, + const grpc_mdstr* key, + bool find_empty) { for (size_t i = 0; i < table->num_entries; ++i) { const size_t idx = (key->hash + i * i) % table->num_entries; if (table->entries[idx].key == NULL) |