blob: 785be8925ba20dc3b566291a347029a877b44b86 [file] [log] [blame]
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -08001/*
2 *
Craig Tiller06059952015-02-18 08:34:56 -08003 * Copyright 2015, Google Inc.
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -08004 * 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" Noble1ff52d52015-03-01 05:24:36 +010034#ifndef GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H
35#define GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080036
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 Tiller6e7c6222015-02-20 15:31:21 -080048#include "src/core/debug/trace.h"
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080049#include "src/core/transport/transport.h"
50
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080051typedef struct grpc_channel_element grpc_channel_element;
52typedef struct grpc_call_element grpc_call_element;
53
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080054/* Channel filters specify:
55 1. the amount of memory needed in the channel & call (via the sizeof_XXX
56 members)
57 2. functions to initialize and destroy channel & call data
58 (init_XXX, destroy_XXX)
59 3. functions to implement call operations and channel operations (call_op,
60 channel_op)
61 4. a name, which is useful when debugging
62
63 Members are laid out in approximate frequency of use order. */
64typedef struct {
65 /* Called to eg. send/receive data on a call.
66 See grpc_call_next_op on how to call the next element in the stack */
Craig Tiller3f475422015-06-25 10:43:05 -070067 void (*start_transport_stream_op)(grpc_call_element *elem,
Craig Tiller079a11b2015-06-30 10:07:15 -070068 grpc_transport_stream_op *op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080069 /* Called to handle channel level operations - e.g. new calls, or transport
70 closure.
71 See grpc_channel_next_op on how to call the next element in the stack */
Craig Tiller3f475422015-06-25 10:43:05 -070072 void (*start_transport_op)(grpc_channel_element *elem, grpc_transport_op *op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080073
74 /* sizeof(per call data) */
75 size_t sizeof_call_data;
76 /* Initialize per call data.
77 elem is initialized at the start of the call, and elem->call_data is what
78 needs initializing.
79 The filter does not need to do any chaining.
80 server_transport_data is an opaque pointer. If it is NULL, this call is
81 on a client; if it is non-NULL, then it points to memory owned by the
82 transport and is on the server. Most filters want to ignore this
83 argument.*/
84 void (*init_call_elem)(grpc_call_element *elem,
Craig Tiller3f2c2212015-04-23 07:56:33 -070085 const void *server_transport_data,
Craig Tillerb7959a02015-06-25 08:50:54 -070086 grpc_transport_stream_op *initial_op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -080087 /* Destroy per call data.
88 The filter does not need to do any chaining */
89 void (*destroy_call_elem)(grpc_call_element *elem);
90
91 /* sizeof(per channel data) */
92 size_t sizeof_channel_data;
93 /* Initialize per-channel data.
94 elem is initialized at the start of the call, and elem->channel_data is
95 what needs initializing.
96 is_first, is_last designate this elements position in the stack, and are
97 useful for asserting correct configuration by upper layer code.
98 The filter does not need to do any chaining */
Craig Tiller079a11b2015-06-30 10:07:15 -070099 void (*init_channel_elem)(grpc_channel_element *elem, grpc_channel *master,
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800100 const grpc_channel_args *args,
101 grpc_mdctx *metadata_context, int is_first,
102 int is_last);
103 /* Destroy per channel data.
104 The filter does not need to do any chaining */
105 void (*destroy_channel_elem)(grpc_channel_element *elem);
106
107 /* The name of this filter */
108 const char *name;
109} grpc_channel_filter;
110
111/* A channel_element tracks its filter and the filter requested memory within
112 a channel allocation */
113struct grpc_channel_element {
114 const grpc_channel_filter *filter;
115 void *channel_data;
116};
117
118/* A call_element tracks its filter, the filter requested memory within
119 a channel allocation, and the filter requested memory within a call
120 allocation */
121struct grpc_call_element {
122 const grpc_channel_filter *filter;
123 void *channel_data;
124 void *call_data;
125};
126
127/* A channel stack tracks a set of related filters for one channel, and
128 guarantees they live within a single malloc() allocation */
129typedef struct {
130 size_t count;
131 /* Memory required for a call stack (computed at channel stack
132 initialization) */
133 size_t call_stack_size;
134} grpc_channel_stack;
135
136/* A call stack tracks a set of related filters for one call, and guarantees
137 they live within a single malloc() allocation */
Craig Tiller6e7c6222015-02-20 15:31:21 -0800138typedef struct { size_t count; } grpc_call_stack;
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800139
140/* Get a channel element given a channel stack and its index */
141grpc_channel_element *grpc_channel_stack_element(grpc_channel_stack *stack,
142 size_t i);
143/* Get the last channel element in a channel stack */
144grpc_channel_element *grpc_channel_stack_last_element(
145 grpc_channel_stack *stack);
146/* Get a call stack element given a call stack and an index */
147grpc_call_element *grpc_call_stack_element(grpc_call_stack *stack, size_t i);
148
149/* Determine memory required for a channel stack containing a set of filters */
150size_t grpc_channel_stack_size(const grpc_channel_filter **filters,
151 size_t filter_count);
152/* Initialize a channel stack given some filters */
153void grpc_channel_stack_init(const grpc_channel_filter **filters,
Craig Tiller079a11b2015-06-30 10:07:15 -0700154 size_t filter_count, grpc_channel *master,
155 const grpc_channel_args *args,
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800156 grpc_mdctx *metadata_context,
157 grpc_channel_stack *stack);
158/* Destroy a channel stack */
159void grpc_channel_stack_destroy(grpc_channel_stack *stack);
160
161/* Initialize a call stack given a channel stack. transport_server_data is
162 expected to be NULL on a client, or an opaque transport owned pointer on the
163 server. */
164void grpc_call_stack_init(grpc_channel_stack *channel_stack,
165 const void *transport_server_data,
Craig Tillerb7959a02015-06-25 08:50:54 -0700166 grpc_transport_stream_op *initial_op,
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800167 grpc_call_stack *call_stack);
168/* Destroy a call stack */
169void grpc_call_stack_destroy(grpc_call_stack *stack);
170
Craig Tiller83f88d92015-04-21 16:02:05 -0700171/* Call the next operation in a call stack */
Craig Tillerb7959a02015-06-25 08:50:54 -0700172void grpc_call_next_op(grpc_call_element *elem, grpc_transport_stream_op *op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800173/* Call the next operation (depending on call directionality) in a channel
174 stack */
Craig Tiller3f475422015-06-25 10:43:05 -0700175void grpc_channel_next_op(grpc_channel_element *elem, grpc_transport_op *op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800176
177/* Given the top element of a channel stack, get the channel stack itself */
178grpc_channel_stack *grpc_channel_stack_from_top_element(
179 grpc_channel_element *elem);
180/* Given the top element of a call stack, get the call stack itself */
181grpc_call_stack *grpc_call_stack_from_top_element(grpc_call_element *elem);
182
183void grpc_call_log_op(char *file, int line, gpr_log_severity severity,
Craig Tillerb7959a02015-06-25 08:50:54 -0700184 grpc_call_element *elem, grpc_transport_stream_op *op);
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800185
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800186void grpc_call_element_send_cancel(grpc_call_element *cur_elem);
187
Craig Tillerfaa84802015-03-01 21:56:38 -0800188extern int grpc_trace_channel;
189
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800190#define GRPC_CALL_LOG_OP(sev, elem, op) \
Craig Tillerfaa84802015-03-01 21:56:38 -0800191 if (grpc_trace_channel) grpc_call_log_op(sev, elem, op)
Nicolas Nobleb7ebd3b2014-11-26 16:33:03 -0800192
Craig Tiller87d5b192015-04-16 14:37:57 -0700193#endif /* GRPC_INTERNAL_CORE_CHANNEL_CHANNEL_STACK_H */