Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 1 | /* |
| 2 | * |
Craig Tiller | 0605995 | 2015-02-18 08:34:56 -0800 | [diff] [blame] | 3 | * Copyright 2015, Google Inc. |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 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 | |
Nicolas "Pixel" Noble | 1ff52d5 | 2015-03-01 05:24:36 +0100 | [diff] [blame] | 34 | #ifndef GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H |
| 35 | #define GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 36 | |
| 37 | /* A channel filter defines how operations on a channel are implemented. |
| 38 | Channel filters are chained together to create full channels, and if those |
| 39 | chains are linear, then channel stacks provide a mechanism to minimize |
| 40 | allocations for that chain. |
| 41 | Call stacks are created by channel stacks and represent the per-call data |
| 42 | for that stack. */ |
| 43 | |
| 44 | #include <stddef.h> |
| 45 | |
| 46 | #include <grpc/grpc.h> |
| 47 | #include <grpc/support/log.h> |
Craig Tiller | 6e7c622 | 2015-02-20 15:31:21 -0800 | [diff] [blame] | 48 | #include "src/core/debug/trace.h" |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 49 | #include "src/core/transport/transport.h" |
| 50 | |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 51 | typedef struct grpc_channel_element grpc_channel_element; |
| 52 | typedef struct grpc_call_element grpc_call_element; |
| 53 | |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 54 | /* The direction of the call. |
| 55 | The values of the enums (1, -1) matter here - they are used to increment |
| 56 | or decrement a pointer to find the next element to call */ |
| 57 | typedef enum { GRPC_CALL_DOWN = 1, GRPC_CALL_UP = -1 } grpc_call_dir; |
| 58 | |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 59 | typedef enum { |
nnoble | 0c475f0 | 2014-12-05 15:37:39 -0800 | [diff] [blame] | 60 | /* send a goaway message to remote channels indicating that we are going |
| 61 | to disconnect in the future */ |
| 62 | GRPC_CHANNEL_GOAWAY, |
| 63 | /* disconnect any underlying transports */ |
| 64 | GRPC_CHANNEL_DISCONNECT, |
| 65 | /* transport received a new call */ |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 66 | GRPC_ACCEPT_CALL, |
nnoble | 0c475f0 | 2014-12-05 15:37:39 -0800 | [diff] [blame] | 67 | /* an underlying transport was closed */ |
| 68 | GRPC_TRANSPORT_CLOSED, |
| 69 | /* an underlying transport is about to be closed */ |
| 70 | GRPC_TRANSPORT_GOAWAY |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 71 | } grpc_channel_op_type; |
| 72 | |
| 73 | /* A single filterable operation to be performed on a channel */ |
| 74 | typedef struct { |
| 75 | /* The type of operation we're performing */ |
| 76 | grpc_channel_op_type type; |
| 77 | /* The directionality of this call - is it bubbling up the stack, or down? */ |
| 78 | grpc_call_dir dir; |
| 79 | |
| 80 | /* Argument data, matching up with grpc_channel_op_type names */ |
| 81 | union { |
| 82 | struct { |
| 83 | grpc_transport *transport; |
| 84 | const void *transport_server_data; |
| 85 | } accept_call; |
nnoble | 0c475f0 | 2014-12-05 15:37:39 -0800 | [diff] [blame] | 86 | struct { |
| 87 | grpc_status_code status; |
| 88 | gpr_slice message; |
| 89 | } goaway; |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 90 | } data; |
| 91 | } grpc_channel_op; |
| 92 | |
| 93 | /* Channel filters specify: |
| 94 | 1. the amount of memory needed in the channel & call (via the sizeof_XXX |
| 95 | members) |
| 96 | 2. functions to initialize and destroy channel & call data |
| 97 | (init_XXX, destroy_XXX) |
| 98 | 3. functions to implement call operations and channel operations (call_op, |
| 99 | channel_op) |
| 100 | 4. a name, which is useful when debugging |
| 101 | |
| 102 | Members are laid out in approximate frequency of use order. */ |
| 103 | typedef struct { |
| 104 | /* Called to eg. send/receive data on a call. |
| 105 | See grpc_call_next_op on how to call the next element in the stack */ |
Craig Tiller | 83f88d9 | 2015-04-21 16:02:05 -0700 | [diff] [blame] | 106 | void (*start_transport_op)(grpc_call_element *elem, grpc_transport_op *op); |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 107 | /* Called to handle channel level operations - e.g. new calls, or transport |
| 108 | closure. |
| 109 | See grpc_channel_next_op on how to call the next element in the stack */ |
ctiller | f962f52 | 2014-12-10 15:28:27 -0800 | [diff] [blame] | 110 | void (*channel_op)(grpc_channel_element *elem, |
| 111 | grpc_channel_element *from_elem, grpc_channel_op *op); |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 112 | |
| 113 | /* sizeof(per call data) */ |
| 114 | size_t sizeof_call_data; |
| 115 | /* Initialize per call data. |
| 116 | elem is initialized at the start of the call, and elem->call_data is what |
| 117 | needs initializing. |
| 118 | The filter does not need to do any chaining. |
| 119 | server_transport_data is an opaque pointer. If it is NULL, this call is |
| 120 | on a client; if it is non-NULL, then it points to memory owned by the |
| 121 | transport and is on the server. Most filters want to ignore this |
| 122 | argument.*/ |
| 123 | void (*init_call_elem)(grpc_call_element *elem, |
Craig Tiller | 3f2c221 | 2015-04-23 07:56:33 -0700 | [diff] [blame] | 124 | const void *server_transport_data, |
| 125 | grpc_transport_op *initial_op); |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 126 | /* Destroy per call data. |
| 127 | The filter does not need to do any chaining */ |
| 128 | void (*destroy_call_elem)(grpc_call_element *elem); |
| 129 | |
| 130 | /* sizeof(per channel data) */ |
| 131 | size_t sizeof_channel_data; |
| 132 | /* Initialize per-channel data. |
| 133 | elem is initialized at the start of the call, and elem->channel_data is |
| 134 | what needs initializing. |
| 135 | is_first, is_last designate this elements position in the stack, and are |
| 136 | useful for asserting correct configuration by upper layer code. |
| 137 | The filter does not need to do any chaining */ |
| 138 | void (*init_channel_elem)(grpc_channel_element *elem, |
| 139 | const grpc_channel_args *args, |
| 140 | grpc_mdctx *metadata_context, int is_first, |
| 141 | int is_last); |
| 142 | /* Destroy per channel data. |
| 143 | The filter does not need to do any chaining */ |
| 144 | void (*destroy_channel_elem)(grpc_channel_element *elem); |
| 145 | |
| 146 | /* The name of this filter */ |
| 147 | const char *name; |
| 148 | } grpc_channel_filter; |
| 149 | |
| 150 | /* A channel_element tracks its filter and the filter requested memory within |
| 151 | a channel allocation */ |
| 152 | struct grpc_channel_element { |
| 153 | const grpc_channel_filter *filter; |
| 154 | void *channel_data; |
| 155 | }; |
| 156 | |
| 157 | /* A call_element tracks its filter, the filter requested memory within |
| 158 | a channel allocation, and the filter requested memory within a call |
| 159 | allocation */ |
| 160 | struct grpc_call_element { |
| 161 | const grpc_channel_filter *filter; |
| 162 | void *channel_data; |
| 163 | void *call_data; |
| 164 | }; |
| 165 | |
| 166 | /* A channel stack tracks a set of related filters for one channel, and |
| 167 | guarantees they live within a single malloc() allocation */ |
| 168 | typedef struct { |
| 169 | size_t count; |
| 170 | /* Memory required for a call stack (computed at channel stack |
| 171 | initialization) */ |
| 172 | size_t call_stack_size; |
| 173 | } grpc_channel_stack; |
| 174 | |
| 175 | /* A call stack tracks a set of related filters for one call, and guarantees |
| 176 | they live within a single malloc() allocation */ |
Craig Tiller | 6e7c622 | 2015-02-20 15:31:21 -0800 | [diff] [blame] | 177 | typedef struct { size_t count; } grpc_call_stack; |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 178 | |
| 179 | /* Get a channel element given a channel stack and its index */ |
| 180 | grpc_channel_element *grpc_channel_stack_element(grpc_channel_stack *stack, |
| 181 | size_t i); |
| 182 | /* Get the last channel element in a channel stack */ |
| 183 | grpc_channel_element *grpc_channel_stack_last_element( |
| 184 | grpc_channel_stack *stack); |
| 185 | /* Get a call stack element given a call stack and an index */ |
| 186 | grpc_call_element *grpc_call_stack_element(grpc_call_stack *stack, size_t i); |
| 187 | |
| 188 | /* Determine memory required for a channel stack containing a set of filters */ |
| 189 | size_t grpc_channel_stack_size(const grpc_channel_filter **filters, |
| 190 | size_t filter_count); |
| 191 | /* Initialize a channel stack given some filters */ |
| 192 | void grpc_channel_stack_init(const grpc_channel_filter **filters, |
| 193 | size_t filter_count, const grpc_channel_args *args, |
| 194 | grpc_mdctx *metadata_context, |
| 195 | grpc_channel_stack *stack); |
| 196 | /* Destroy a channel stack */ |
| 197 | void grpc_channel_stack_destroy(grpc_channel_stack *stack); |
| 198 | |
| 199 | /* Initialize a call stack given a channel stack. transport_server_data is |
| 200 | expected to be NULL on a client, or an opaque transport owned pointer on the |
| 201 | server. */ |
| 202 | void grpc_call_stack_init(grpc_channel_stack *channel_stack, |
| 203 | const void *transport_server_data, |
Craig Tiller | 3f2c221 | 2015-04-23 07:56:33 -0700 | [diff] [blame] | 204 | grpc_transport_op *initial_op, |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 205 | grpc_call_stack *call_stack); |
| 206 | /* Destroy a call stack */ |
| 207 | void grpc_call_stack_destroy(grpc_call_stack *stack); |
| 208 | |
Craig Tiller | 83f88d9 | 2015-04-21 16:02:05 -0700 | [diff] [blame] | 209 | /* Call the next operation in a call stack */ |
| 210 | void grpc_call_next_op(grpc_call_element *elem, grpc_transport_op *op); |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 211 | /* Call the next operation (depending on call directionality) in a channel |
| 212 | stack */ |
| 213 | void grpc_channel_next_op(grpc_channel_element *elem, grpc_channel_op *op); |
| 214 | |
| 215 | /* Given the top element of a channel stack, get the channel stack itself */ |
| 216 | grpc_channel_stack *grpc_channel_stack_from_top_element( |
| 217 | grpc_channel_element *elem); |
| 218 | /* Given the top element of a call stack, get the call stack itself */ |
| 219 | grpc_call_stack *grpc_call_stack_from_top_element(grpc_call_element *elem); |
| 220 | |
| 221 | void grpc_call_log_op(char *file, int line, gpr_log_severity severity, |
Craig Tiller | 83f88d9 | 2015-04-21 16:02:05 -0700 | [diff] [blame] | 222 | grpc_call_element *elem, grpc_transport_op *op); |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 223 | |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 224 | void grpc_call_element_send_cancel(grpc_call_element *cur_elem); |
| 225 | |
Craig Tiller | faa8480 | 2015-03-01 21:56:38 -0800 | [diff] [blame] | 226 | extern int grpc_trace_channel; |
| 227 | |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 228 | #define GRPC_CALL_LOG_OP(sev, elem, op) \ |
Craig Tiller | faa8480 | 2015-03-01 21:56:38 -0800 | [diff] [blame] | 229 | if (grpc_trace_channel) grpc_call_log_op(sev, elem, op) |
Nicolas Noble | b7ebd3b | 2014-11-26 16:33:03 -0800 | [diff] [blame] | 230 | |
Craig Tiller | 87d5b19 | 2015-04-16 14:37:57 -0700 | [diff] [blame] | 231 | #endif /* GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H */ |