Newer
Older
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
; extensions. Whitespace NOT
; allowed in between.
ptoken = 1*ptokenchar
ptokenchar = "!" | "#" | "$" | "%" | "&" | "'" | "("
| ")" | "*" | "+" | "-" | "." | "/" | DIGIT
| ":" | "<" | "=" | ">" | "?" | "@" | ALPHA
| "[" | "]" | "^" | "_" | "`" | "{" | "|"
| "}" | "~"
media-type = type-name "/" subtype-name
quoted-mt = <"> media-type <">
relation-types = relation-type
| <"> relation-type *( 1*SP relation-type ) <">
relation-type = reg-rel-type | ext-rel-type
reg-rel-type = LOALPHA *( LOALPHA | DIGIT | "." | "-" )
ext-rel-type = URI
and from <https://tools.ietf.org/html/rfc5987>
parmname = 1*attr-char
attr-char = ALPHA / DIGIT
/ "!" / "#" / "$" / "&" / "+" / "-" / "."
/ "^" / "_" / "`" / "|" / "~"
*/
const char *h2_proxy_link_reverse_map(request_rec *r,
proxy_dir_conf *conf,
const char *real_backend_uri,
const char *proxy_server_uri,
const char *s)
{
link_ctx ctx;
if (r->proxyreq != PROXYREQ_REVERSE) {
return s;
}
memset(&ctx, 0, sizeof(ctx));
ctx.r = r;
ctx.pool = r->pool;
ctx.conf = conf;
ctx.real_backend_uri = real_backend_uri;
ctx.rbu_len = (int)strlen(ctx.real_backend_uri);
ctx.p_server_uri = proxy_server_uri;
ctx.psu_len = (int)strlen(ctx.p_server_uri);
ctx.s = s;
ctx.slen = (int)strlen(s);
while (read_link(&ctx)) {
while (skip_param(&ctx)) {
/* nop */
}
map_link(&ctx);
if (!read_sep(&ctx)) {
break;
}
}
ap_log_rerror(APLOG_MARK, APLOG_TRACE2, 0, r,
"link_reverse_map %s --> %s", s, ctx.s);
return ctx.s;
}
/*******************************************************************************
* FIFO queue
******************************************************************************/
struct h2_proxy_fifo {
void **elems;
int nelems;
int set;
int head;
int count;
int aborted;
apr_thread_mutex_t *lock;
apr_thread_cond_t *not_empty;
apr_thread_cond_t *not_full;
};
static int nth_index(h2_proxy_fifo *fifo, int n)
{
return (fifo->head + n) % fifo->nelems;
}
static apr_status_t fifo_destroy(void *data)
{
h2_proxy_fifo *fifo = data;
apr_thread_cond_destroy(fifo->not_empty);
apr_thread_cond_destroy(fifo->not_full);
apr_thread_mutex_destroy(fifo->lock);
return APR_SUCCESS;
}
static int index_of(h2_proxy_fifo *fifo, void *elem)
{
int i;
for (i = 0; i < fifo->count; ++i) {
if (elem == fifo->elems[nth_index(fifo, i)]) {
return i;
}
}
return -1;
}
static apr_status_t create_int(h2_proxy_fifo **pfifo, apr_pool_t *pool,
int capacity, int as_set)
{
apr_status_t rv;
h2_proxy_fifo *fifo;
fifo = apr_pcalloc(pool, sizeof(*fifo));
if (fifo == NULL) {
return APR_ENOMEM;
}
rv = apr_thread_mutex_create(&fifo->lock,
APR_THREAD_MUTEX_UNNESTED, pool);
if (rv != APR_SUCCESS) {
return rv;
}
rv = apr_thread_cond_create(&fifo->not_empty, pool);
if (rv != APR_SUCCESS) {
return rv;
}
rv = apr_thread_cond_create(&fifo->not_full, pool);
if (rv != APR_SUCCESS) {
return rv;
}
fifo->elems = apr_pcalloc(pool, capacity * sizeof(void*));
if (fifo->elems == NULL) {
return APR_ENOMEM;
}
fifo->nelems = capacity;
fifo->set = as_set;
*pfifo = fifo;
apr_pool_cleanup_register(pool, fifo, fifo_destroy, apr_pool_cleanup_null);
return APR_SUCCESS;
}
apr_status_t h2_proxy_fifo_create(h2_proxy_fifo **pfifo, apr_pool_t *pool, int capacity)
{
return create_int(pfifo, pool, capacity, 0);
}
apr_status_t h2_proxy_fifo_set_create(h2_proxy_fifo **pfifo, apr_pool_t *pool, int capacity)
{
return create_int(pfifo, pool, capacity, 1);
}
apr_status_t h2_proxy_fifo_term(h2_proxy_fifo *fifo)
{
apr_status_t rv;
if ((rv = apr_thread_mutex_lock(fifo->lock)) == APR_SUCCESS) {
fifo->aborted = 1;
apr_thread_mutex_unlock(fifo->lock);
}
return rv;
}
apr_status_t h2_proxy_fifo_interrupt(h2_proxy_fifo *fifo)
{
apr_status_t rv;
if ((rv = apr_thread_mutex_lock(fifo->lock)) == APR_SUCCESS) {
apr_thread_cond_broadcast(fifo->not_empty);
apr_thread_cond_broadcast(fifo->not_full);
apr_thread_mutex_unlock(fifo->lock);
}
return rv;
}
int h2_proxy_fifo_count(h2_proxy_fifo *fifo)
{
return fifo->count;
}
int h2_proxy_fifo_capacity(h2_proxy_fifo *fifo)
{
return fifo->nelems;
}
static apr_status_t check_not_empty(h2_proxy_fifo *fifo, int block)
{
if (fifo->count == 0) {
if (!block) {
return APR_EAGAIN;
}
while (fifo->count == 0) {
if (fifo->aborted) {
return APR_EOF;
}
apr_thread_cond_wait(fifo->not_empty, fifo->lock);
}
}
return APR_SUCCESS;
}
static apr_status_t fifo_push(h2_proxy_fifo *fifo, void *elem, int block)
{
apr_status_t rv;
if (fifo->aborted) {
return APR_EOF;
}
if ((rv = apr_thread_mutex_lock(fifo->lock)) == APR_SUCCESS) {
if (fifo->set && index_of(fifo, elem) >= 0) {
/* set mode, elem already member */
apr_thread_mutex_unlock(fifo->lock);
return APR_EEXIST;
}
else if (fifo->count == fifo->nelems) {
if (block) {
while (fifo->count == fifo->nelems) {
if (fifo->aborted) {
apr_thread_mutex_unlock(fifo->lock);
return APR_EOF;
}
apr_thread_cond_wait(fifo->not_full, fifo->lock);
}
}
else {
apr_thread_mutex_unlock(fifo->lock);
return APR_EAGAIN;
}
}
ap_assert(fifo->count < fifo->nelems);
fifo->elems[nth_index(fifo, fifo->count)] = elem;
++fifo->count;
if (fifo->count == 1) {
apr_thread_cond_broadcast(fifo->not_empty);
}
apr_thread_mutex_unlock(fifo->lock);
}
return rv;
}
apr_status_t h2_proxy_fifo_push(h2_proxy_fifo *fifo, void *elem)
{
return fifo_push(fifo, elem, 1);
}
apr_status_t h2_proxy_fifo_try_push(h2_proxy_fifo *fifo, void *elem)
{
return fifo_push(fifo, elem, 0);
}
static void *pull_head(h2_proxy_fifo *fifo)
{
void *elem;
ap_assert(fifo->count > 0);
elem = fifo->elems[fifo->head];
--fifo->count;
if (fifo->count > 0) {
fifo->head = nth_index(fifo, 1);
if (fifo->count+1 == fifo->nelems) {
apr_thread_cond_broadcast(fifo->not_full);
}
}
return elem;
}
static apr_status_t fifo_pull(h2_proxy_fifo *fifo, void **pelem, int block)
{
apr_status_t rv;
if (fifo->aborted) {
return APR_EOF;
}
if ((rv = apr_thread_mutex_lock(fifo->lock)) == APR_SUCCESS) {
if ((rv = check_not_empty(fifo, block)) != APR_SUCCESS) {
apr_thread_mutex_unlock(fifo->lock);
*pelem = NULL;
return rv;
}
ap_assert(fifo->count > 0);
*pelem = pull_head(fifo);
apr_thread_mutex_unlock(fifo->lock);
}
return rv;
}
apr_status_t h2_proxy_fifo_pull(h2_proxy_fifo *fifo, void **pelem)
{
return fifo_pull(fifo, pelem, 1);
}
apr_status_t h2_proxy_fifo_try_pull(h2_proxy_fifo *fifo, void **pelem)
{
return fifo_pull(fifo, pelem, 0);
}
apr_status_t h2_proxy_fifo_remove(h2_proxy_fifo *fifo, void *elem)
{
apr_status_t rv;
if (fifo->aborted) {
return APR_EOF;
}
if ((rv = apr_thread_mutex_lock(fifo->lock)) == APR_SUCCESS) {
int i, rc;
void *e;
rc = 0;
for (i = 0; i < fifo->count; ++i) {
e = fifo->elems[nth_index(fifo, i)];
if (e == elem) {
++rc;
}
else if (rc) {
fifo->elems[nth_index(fifo, i-rc)] = e;
}
}
if (rc) {
fifo->count -= rc;
if (fifo->count + rc == fifo->nelems) {
apr_thread_cond_broadcast(fifo->not_full);
}
rv = APR_SUCCESS;
}
else {
rv = APR_EAGAIN;
}
apr_thread_mutex_unlock(fifo->lock);
}
return rv;
}