forked from memcached/memcached
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproxy_request.c
1260 lines (1112 loc) · 38.4 KB
/
proxy_request.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* -*- Mode: C; tab-width: 4; c-basic-offset: 4; indent-tabs-mode: nil -*- */
#include "proxy.h"
#define PARSER_MAXLEN USHRT_MAX-1
// Find the starting offsets of each token; ignoring length.
// This creates a fast small (<= cacheline) index into the request,
// where we later scan or directly feed data into API's.
static int _process_tokenize(mcp_parser_t *pr, const size_t max) {
const char *s = pr->request;
int len = pr->endlen;
// since multigets can be huge, we can't purely judge reqlen against this
// limit, but we also can't index past it since the tokens are shorts.
if (len > PARSER_MAXLEN) {
len = PARSER_MAXLEN;
}
const char *end = s + len;
int curtoken = 0;
int state = 0;
while (s != end) {
switch (state) {
case 0:
// scanning for first non-space to find a token.
if (*s != ' ') {
pr->tokens[curtoken] = s - pr->request;
if (++curtoken == max) {
s++;
state = 2;
break;
}
state = 1;
}
s++;
break;
case 1:
// advance over a token
if (*s != ' ') {
s++;
} else {
state = 0;
}
break;
case 2:
// hit max tokens before end of the line.
// keep advancing so we can place endcap token.
if (*s == ' ') {
goto endloop;
}
s++;
break;
}
}
endloop:
// endcap token so we can quickly find the length of any token by looking
// at the next one.
pr->tokens[curtoken] = s - pr->request;
pr->ntokens = curtoken;
P_DEBUG("%s: cur_tokens: %d\n", __func__, curtoken);
return 0;
}
static int _process_token_len(mcp_parser_t *pr, size_t token) {
const char *s = pr->request + pr->tokens[token];
const char *e = pr->request + pr->tokens[token+1];
// start of next token is after any space delimiters, so back those out.
while (*(e-1) == ' ') {
e--;
}
return e - s;
}
static int _process_request_key(mcp_parser_t *pr) {
pr->klen = _process_token_len(pr, pr->keytoken);
// advance the parser in case of multikey.
pr->parsed = pr->tokens[pr->keytoken] + pr->klen + 1;
if (pr->request[pr->parsed-1] == ' ') {
P_DEBUG("%s: request_key found extra space\n", __func__);
pr->has_space = true;
} else {
pr->has_space = false;
}
return 0;
}
// Just for ascii multiget: search for next "key" beyond where we stopped
// tokenizing before.
// Returns the offset for the next key.
size_t _process_request_next_key(mcp_parser_t *pr) {
const char *cur = pr->request + pr->parsed;
int remain = pr->endlen - pr->parsed;
// chew off any leading whitespace.
while (remain) {
if (*cur == ' ') {
remain--;
cur++;
pr->parsed++;
} else {
break;
}
}
const char *s = memchr(cur, ' ', remain);
if (s != NULL) {
pr->klen = s - cur;
pr->parsed += s - cur;
} else {
pr->klen = remain;
pr->parsed += remain;
}
return cur - pr->request;
}
// for fast testing of existence of meta flags.
// meta has all flags as final tokens
static int _process_request_metaflags(mcp_parser_t *pr, int token) {
if (pr->ntokens <= token) {
pr->t.meta.flags = 0; // no flags found.
return 0;
}
const char *cur = pr->request + pr->tokens[token];
const char *end = pr->request + pr->endlen;
// We blindly convert flags into bits, since the range of possible
// flags is deliberately < 64.
int state = 0;
while (cur != end) {
switch (state) {
case 0:
if (*cur == ' ') {
cur++;
} else {
if (*cur < 65 || *cur > 122) {
return -1;
}
P_DEBUG("%s: setting meta flag: %d\n", __func__, *cur - 65);
pr->t.meta.flags |= (uint64_t)1 << (*cur - 65);
state = 1;
}
break;
case 1:
if (*cur != ' ') {
cur++;
} else {
state = 0;
}
break;
}
}
// not too great hack for noreply detection: this can be flattened out
// once a few other contexts are fixed and we detect the noreply from the
// coroutine start instead.
if (pr->t.meta.flags & ((uint64_t)1 << 48)) {
pr->noreply = true;
}
return 0;
}
// All meta commands are of form: "cm key f l a g S100"
static int _process_request_meta(mcp_parser_t *pr) {
_process_tokenize(pr, PARSER_MAX_TOKENS);
if (pr->ntokens < 2) {
P_DEBUG("%s: not enough tokens for meta command: %d\n", __func__, pr->ntokens);
return -1;
}
pr->keytoken = 1;
_process_request_key(pr);
// pass the first flag token.
return _process_request_metaflags(pr, 2);
}
// ms <key> <datalen> <flags>*\r\n
static int _process_request_mset(mcp_parser_t *pr) {
_process_tokenize(pr, PARSER_MAX_TOKENS);
if (pr->ntokens < 3) {
P_DEBUG("%s: not enough tokens for meta set command: %d\n", __func__, pr->ntokens);
return -1;
}
pr->keytoken = 1;
_process_request_key(pr);
const char *cur = pr->request + pr->tokens[2];
errno = 0;
char *n = NULL;
int vlen = strtol(cur, &n, 10);
if ((errno == ERANGE) || (cur == n)) {
return -1;
}
if (vlen < 0 || vlen > (INT_MAX - 2)) {
return -1;
}
vlen += 2;
pr->vlen = vlen;
// pass the first flag token
return _process_request_metaflags(pr, 3);
}
// gat[s] <exptime> <key>*\r\n
static int _process_request_gat(mcp_parser_t *pr) {
_process_tokenize(pr, 3);
if (pr->ntokens < 3) {
P_DEBUG("%s: not enough tokens for GAT: %d\n", __func__, pr->ntokens);
return -1;
}
pr->keytoken = 2;
_process_request_key(pr);
return 0;
}
#define NOREPLYSTR "noreply"
#define NOREPLYLEN sizeof(NOREPLYSTR)-1
// given a tokenized parser for a normal ASCII command, checks for noreply
// mode.
static int _process_request_noreply(mcp_parser_t *pr) {
if (pr->tokens[pr->ntokens] - pr->tokens[pr->ntokens-1] >= NOREPLYLEN
&& strncmp(NOREPLYSTR, pr->request + pr->tokens[pr->ntokens-1], NOREPLYLEN) == 0) {
pr->noreply = true;
}
return 0;
}
// we need t find the bytes supplied immediately so we can read the request
// from the client properly.
// set <key> <flags> <exptime> <bytes> [noreply]\r\n
static int _process_request_storage(mcp_parser_t *pr, size_t max) {
_process_tokenize(pr, max);
if (pr->ntokens < 5) {
P_DEBUG("%s: not enough tokens to storage command: %d\n", __func__, pr->ntokens);
return -1;
}
pr->keytoken = 1;
_process_request_key(pr);
errno = 0;
char *n = NULL;
const char *cur = pr->request + pr->tokens[4];
int vlen = strtol(cur, &n, 10);
if ((errno == ERANGE) || (cur == n)) {
return -1;
}
if (vlen < 0 || vlen > (INT_MAX - 2)) {
return -1;
}
vlen += 2;
pr->vlen = vlen;
return _process_request_noreply(pr);
}
// common request with key: <cmd> <key> <args>
static int _process_request_simple(mcp_parser_t *pr, const int min, const int max) {
_process_tokenize(pr, max);
if (pr->ntokens < min) {
P_DEBUG("%s: not enough tokens for simple request: %d\n", __func__, pr->ntokens);
return -1;
}
pr->keytoken = 1; // second token is usually the key... stupid GAT.
_process_request_key(pr);
return _process_request_noreply(pr);
}
// TODO: return code ENUM with error types.
// FIXME: the mcp_parser_t bits have ended up being more fragile than I hoped.
// careful zero'ing is required. revisit?
// I think this mostly refers to recursive work (maybe just multiget?)
// Is a parser object run throgh process_request() twice, ever?
int process_request(mcp_parser_t *pr, const char *command, size_t cmdlen) {
// we want to "parse in place" as much as possible, which allows us to
// forward an unmodified request without having to rebuild it.
const char *cm = command;
size_t cl = 0;
// min command length is 2, plus the "\r\n"
if (cmdlen < 4) {
return -1;
}
// Commands can end with bare '\n's. Depressingly I intended to be strict
// with a \r\n requirement but never did this and need backcompat.
// In this case we _know_ \n is at cmdlen because we can't enter this
// function otherwise.
if (cm[cmdlen-2] == '\r') {
pr->endlen = cmdlen - 2;
} else {
pr->endlen = cmdlen - 1;
}
const char *s = memchr(command, ' ', pr->endlen);
if (s != NULL) {
cl = s - command;
} else {
cl = pr->endlen;
}
pr->keytoken = 0;
pr->has_space = false;
pr->parsed = cl;
pr->request = command;
pr->reqlen = cmdlen;
int token_max = PARSER_MAX_TOKENS;
int cmd = -1;
int type = CMD_TYPE_GENERIC;
int ret = 0;
switch (cl) {
case 0:
case 1:
// falls through with cmd as -1. should error.
break;
case 2:
if (cm[0] == 'm') {
type = CMD_TYPE_META;
switch (cm[1]) {
case 'g':
cmd = CMD_MG;
ret = _process_request_meta(pr);
break;
case 's':
cmd = CMD_MS;
ret = _process_request_mset(pr);
break;
case 'd':
cmd = CMD_MD;
ret = _process_request_meta(pr);
break;
case 'n':
// TODO: do we route/handle NOP's at all?
// they should simply reflect to the client.
cmd = CMD_MN;
break;
case 'a':
cmd = CMD_MA;
ret = _process_request_meta(pr);
break;
case 'e':
cmd = CMD_ME;
// TODO: not much special processing here; binary keys
ret = _process_request_meta(pr);
break;
}
}
break;
case 3:
if (cm[0] == 'g') {
if (cm[1] == 'e' && cm[2] == 't') {
cmd = CMD_GET;
type = CMD_TYPE_GET;
token_max = 2; // don't chew through multigets.
ret = _process_request_simple(pr, 2, 2);
}
if (cm[1] == 'a' && cm[2] == 't') {
type = CMD_TYPE_GET;
cmd = CMD_GAT;
token_max = 2; // don't chew through multigets.
ret = _process_request_gat(pr);
}
} else if (cm[0] == 's' && cm[1] == 'e' && cm[2] == 't') {
cmd = CMD_SET;
ret = _process_request_storage(pr, token_max);
} else if (cm[0] == 'a' && cm[1] == 'd' && cm[2] == 'd') {
cmd = CMD_ADD;
ret = _process_request_storage(pr, token_max);
} else if (cm[0] == 'c' && cm[1] == 'a' && cm[2] == 's') {
cmd = CMD_CAS;
ret = _process_request_storage(pr, token_max);
}
break;
case 4:
if (strncmp(cm, "gets", 4) == 0) {
cmd = CMD_GETS;
type = CMD_TYPE_GET;
token_max = 2; // don't chew through multigets.
ret = _process_request_simple(pr, 2, 2);
} else if (strncmp(cm, "incr", 4) == 0) {
cmd = CMD_INCR;
ret = _process_request_simple(pr, 3, 4);
} else if (strncmp(cm, "decr", 4) == 0) {
cmd = CMD_DECR;
ret = _process_request_simple(pr, 3, 4);
} else if (strncmp(cm, "gats", 4) == 0) {
cmd = CMD_GATS;
type = CMD_TYPE_GET;
ret = _process_request_gat(pr);
} else if (strncmp(cm, "quit", 4) == 0) {
cmd = CMD_QUIT;
}
break;
case 5:
if (strncmp(cm, "touch", 5) == 0) {
cmd = CMD_TOUCH;
ret = _process_request_simple(pr, 3, 4);
} else if (strncmp(cm, "stats", 5) == 0) {
cmd = CMD_STATS;
// Don't process a key; fetch via arguments.
_process_tokenize(pr, token_max);
} else if (strncmp(cm, "watch", 5) == 0) {
cmd = CMD_WATCH;
_process_tokenize(pr, token_max);
}
break;
case 6:
if (strncmp(cm, "delete", 6) == 0) {
cmd = CMD_DELETE;
ret = _process_request_simple(pr, 2, 4);
} else if (strncmp(cm, "append", 6) == 0) {
cmd = CMD_APPEND;
ret = _process_request_storage(pr, token_max);
}
break;
case 7:
if (strncmp(cm, "replace", 7) == 0) {
cmd = CMD_REPLACE;
ret = _process_request_storage(pr, token_max);
} else if (strncmp(cm, "prepend", 7) == 0) {
cmd = CMD_PREPEND;
ret = _process_request_storage(pr, token_max);
} else if (strncmp(cm, "version", 7) == 0) {
cmd = CMD_VERSION;
_process_tokenize(pr, token_max);
}
break;
}
// TODO: log more specific error code.
if (cmd == -1 || ret != 0) {
return -1;
}
pr->command = cmd;
pr->cmd_type = type;
return 0;
}
// FIXME (v2): any reason to pass in command/cmdlen separately?
mcp_request_t *mcp_new_request(lua_State *L, mcp_parser_t *pr, const char *command, size_t cmdlen) {
mcp_request_t *rq = lua_newuserdatauv(L, sizeof(mcp_request_t) + MCP_REQUEST_MAXLEN, 0);
// TODO (v2): memset only the non-data part? as the rest gets memcpy'd
// over.
memset(rq, 0, sizeof(mcp_request_t));
memcpy(&rq->pr, pr, sizeof(*pr));
memcpy(rq->request, command, cmdlen);
rq->pr.request = rq->request;
rq->pr.reqlen = cmdlen;
luaL_getmetatable(L, "mcp.request");
lua_setmetatable(L, -2);
// at this point we should know if we have to bounce through _nread to
// get item data or not.
return rq;
}
// fill a preallocated request object.
void mcp_set_request(mcp_parser_t *pr, mcp_request_t *rq, const char *command, size_t cmdlen) {
memset(rq, 0, sizeof(mcp_request_t));
memcpy(&rq->pr, pr, sizeof(*pr));
memcpy(rq->request, command, cmdlen);
rq->pr.request = rq->request;
rq->pr.reqlen = cmdlen;
}
// Replaces a token inside a request and re-parses.
// Note that this has some optimization opportunities. Delaying until
// required.
// We should not guarantee order when updating meta flags, which would allow
// blanking tokens and appending new ones.
// TODO (v2): much of the length is the key, avoid copying it.
int mcp_request_render(mcp_request_t *rq, int idx, const char flag, const char *tok, size_t len) {
char temp[MCP_REQUEST_MAXLEN+1];
char *p = temp;
mcp_parser_t *pr = &rq->pr;
if (pr->reqlen + len + 2 > MCP_REQUEST_MAXLEN) {
return -1;
}
// Cannot add/append tokens yet.
if (idx >= pr->ntokens) {
return -1;
}
memcpy(p, pr->request, pr->tokens[idx]);
p += pr->tokens[idx];
if (flag) {
*p = flag;
p++;
}
if (tok) {
memcpy(p, tok, len);
p += len;
}
// Add a space and copy more tokens if there were more.
if (idx+1 < pr->ntokens) {
if (flag || len != 0) {
// Only pre-space if not deleting the token.
*p = ' ';
p++;
}
memcpy(p, &pr->request[pr->tokens[idx+1]], pr->tokens[pr->ntokens] - pr->tokens[idx+1]);
p += pr->tokens[pr->ntokens] - pr->tokens[idx+1];
} else {
// If we removed something from the end we might've left some spaces.
while (*(p-1) == ' ') {
p--;
}
}
memcpy(p, "\r\n\0", 3);
p += 2;
memcpy(rq->request, temp, p - temp);
// Hold the vlen/vbuf and restore after re-parsing. Since we can only edit
// the command line, not the value here, we would otherwise allow sending
// arbitrary memory over the network if someone modifies a SET.
void *vbuf = pr->vbuf;
int vlen = pr->vlen;
memset(pr, 0, sizeof(mcp_parser_t)); // TODO: required?
int ret = process_request(pr, rq->request, p - temp);
if (ret != 0) {
return ret;
}
pr->vbuf = vbuf;
pr->vlen = vlen;
return 0;
}
int mcp_request_append(mcp_request_t *rq, const char flag, const char *tok, size_t len) {
mcp_parser_t *pr = &rq->pr;
const char *start = pr->request;
char *p = (char *)pr->request + pr->reqlen - 2; // start at the \r
assert(*p == '\r');
if (pr->reqlen + len + 2 > MCP_REQUEST_MAXLEN) {
return -1;
}
*p = ' ';
p++;
if (flag) {
*p = flag;
p++;
}
if (tok) {
memcpy(p, tok, len);
p += len;
}
memcpy(p, "\r\n\0", 3);
p += 2;
// See note on mcp_request_render()
void *vbuf = pr->vbuf;
int vlen = pr->vlen;
memset(pr, 0, sizeof(mcp_parser_t)); // TODO: required?
int ret = process_request(pr, rq->request, p - start);
if (ret != 0) {
return ret;
}
pr->vbuf = vbuf;
pr->vlen = vlen;
return 0;
}
void mcp_request_attach(mcp_request_t *rq, io_pending_proxy_t *p) {
mcp_parser_t *pr = &rq->pr;
char *r = (char *) pr->request;
size_t len = pr->reqlen;
// The stringified request. This is also referencing into the coroutine
// stack, which should be safe from gc.
p->iov[0].iov_base = r;
p->iov[0].iov_len = len;
p->iovcnt = 1;
p->iovbytes = len;
if (pr->vlen != 0) {
p->iov[1].iov_base = pr->vbuf;
p->iov[1].iov_len = pr->vlen;
p->iovcnt = 2;
p->iovbytes += pr->vlen;
}
}
// second argument is optional, for building set requests.
// TODO: append the \r\n for the VAL?
int mcplib_request(lua_State *L) {
LIBEVENT_THREAD *t = PROXY_GET_THR(L);
size_t len = 0;
size_t vlen = 0;
mcp_parser_t pr = {0};
const char *cmd = luaL_checklstring(L, 1, &len);
const char *val = NULL;
int type = lua_type(L, 2);
if (type == LUA_TSTRING) {
val = luaL_optlstring(L, 2, NULL, &vlen);
if (vlen < 2 || memcmp(val+vlen-2, "\r\n", 2) != 0) {
proxy_lua_error(L, "value passed to mcp.request must end with \\r\\n");
}
} else if (type == LUA_TUSERDATA) {
// vlen for requests and responses include the "\r\n" already.
mcp_resp_t *r = luaL_testudata(L, 2, "mcp.response");
if (r != NULL) {
if (r->resp.value) {
val = r->resp.value;
vlen = r->resp.vlen_read; // paranoia, so we can't overread into memory.
}
} else {
mcp_request_t *rq = luaL_testudata(L, 2, "mcp.request");
if (rq->pr.vbuf) {
val = rq->pr.vbuf;
vlen = rq->pr.vlen;
}
}
}
if (len > MCP_REQUEST_MAXLEN) {
proxy_lua_error(L, "request length too long");
return 0;
}
// FIXME (v2): if we inline the userdata we can avoid memcpy'ing the parser
// structure from the stack? but causes some code duplication.
if (process_request(&pr, cmd, len) != 0) {
proxy_lua_error(L, "failed to parse request");
return 0;
}
mcp_request_t *rq = mcp_new_request(L, &pr, cmd, len);
if (val != NULL) {
rq->pr.vlen = vlen;
rq->pr.vbuf = malloc(vlen);
if (rq->pr.vbuf == NULL) {
// Note: without *c we can't tick the appropriate counter.
// However, in practice raw malloc's are nearly never going to
// fail.
// TODO(v2): we can stack values into the request objects or use
// the slabber memory, so this isn't necessary anyway.
proxy_lua_error(L, "failed to allocate value memory for request object");
}
memcpy(rq->pr.vbuf, val, vlen);
// Note: Not enforcing the memory limit here is deliberate:
// - if we're over the memory limit, it'll get caught very soon after
// this, but we won't be causing some lua to bail mid-flight, which is
// more graceful to the end user.
pthread_mutex_lock(&t->proxy_limit_lock);
t->proxy_buffer_memory_used += rq->pr.vlen;
pthread_mutex_unlock(&t->proxy_limit_lock);
}
// rq is now created, parsed, and on the stack.
return 1;
}
int mcplib_request_key(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, -1, "mcp.request");
lua_pushlstring(L, MCP_PARSER_KEY(rq->pr), rq->pr.klen);
return 1;
}
// NOTE: I've mixed up const/non-const strings in the request. During parsing
// we want it to be const, but after that's done the request is no longer
// const. It might be better to just remove the const higher up the chain, but
// I'd rather not. So for now these functions will be dumping the const to
// modify the string.
int mcplib_request_ltrimkey(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, -2, "mcp.request");
int totrim = luaL_checkinteger(L, -1);
char *key = (char *) MCP_PARSER_KEY(rq->pr);
if (totrim > rq->pr.klen) {
proxy_lua_error(L, "ltrimkey cannot zero out key");
return 0;
} else {
memset(key, ' ', totrim);
rq->pr.klen -= totrim;
rq->pr.tokens[rq->pr.keytoken] += totrim;
}
return 1;
}
int mcplib_request_rtrimkey(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, -2, "mcp.request");
int totrim = luaL_checkinteger(L, -1);
char *key = (char *) MCP_PARSER_KEY(rq->pr);
if (totrim > rq->pr.klen) {
proxy_lua_error(L, "rtrimkey cannot zero out key");
return 0;
} else {
memset(key + (rq->pr.klen - totrim), ' ', totrim);
rq->pr.klen -= totrim;
// don't need to change the key token.
}
return 1;
}
// Virtual table operations on the request.
int mcplib_request_token(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
int argc = lua_gettop(L);
if (argc == 1) {
lua_pushnil(L);
return 1;
}
int token = luaL_checkinteger(L, 2);
if (token < 1 || token > rq->pr.ntokens) {
// maybe an error?
lua_pushnil(L);
return 1;
}
size_t vlen = 0;
if (argc > 2) {
// overwriting a token.
size_t newlen = 0;
const char *newtok = lua_tolstring(L, 3, &newlen);
if (mcp_request_render(rq, token-1, 0, newtok, newlen) != 0) {
proxy_lua_error(L, "token(): request malformed after edit");
return 0;
}
return 0;
} else {
// fetching a token.
const char *start = rq->pr.request + rq->pr.tokens[token-1];
vlen = _process_token_len(&rq->pr, token-1);
P_DEBUG("%s: pushing token of len: %lu\n", __func__, vlen);
lua_pushlstring(L, start, vlen);
return 1;
}
return 0;
}
// Fetch only.
int mcplib_request_token_int(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
int argc = lua_gettop(L);
if (argc == 1) {
lua_pushnil(L);
return 1;
}
int x = luaL_checkinteger(L, 2);
if (x < 1 || x > rq->pr.ntokens) {
// maybe an error?
lua_pushnil(L);
return 1;
}
size_t vlen = 0;
// fetching a token.
const char *s = rq->pr.request + rq->pr.tokens[x-1];
vlen = _process_token_len(&rq->pr, x-1);
// do a funny dance to safely strtol the token.
// TODO: use tokenizer based tokto when merged.
char temp[22];
int tocopy = vlen > 22 ? 21 : vlen;
memcpy(temp, s, tocopy);
temp[vlen] = '\0';
int64_t token = 0;
if (safe_strtoll(temp, &token)) {
lua_pushinteger(L, token);
} else {
lua_pushnil(L);
}
return 1;
}
int mcplib_request_ntokens(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
lua_pushinteger(L, rq->pr.ntokens);
return 1;
}
int mcplib_request_command(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, -1, "mcp.request");
lua_pushinteger(L, rq->pr.command);
return 1;
}
int mcplib_request_has_flag(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
size_t len = 0;
const char *flagstr = luaL_checklstring(L, 2, &len);
if (len != 1) {
proxy_lua_error(L, "has_flag(): meta flag must be a single character");
return 0;
}
if (flagstr[0] < 65 || flagstr[0] > 122) {
proxy_lua_error(L, "has_flag(): invalid flag, must be A-Z,a-z");
return 0;
}
uint64_t flagbit = (uint64_t)1 << (flagstr[0] - 65);
if (rq->pr.t.meta.flags & flagbit) {
lua_pushboolean(L, 1);
} else {
lua_pushboolean(L, 0);
}
return 1;
}
// req:flag_token("F") -> (bool, nil|token)
// req:flag_token("O", "Onewopauqe") -> (bool, oldtoken)
int mcplib_request_flag_token(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
size_t len = 0;
const char *flagstr = luaL_checklstring(L, 2, &len);
bool replace = false;
if (len != 1) {
proxy_lua_error(L, "has_flag(): meta flag must be a single character");
return 0;
}
if (flagstr[0] < 65 || flagstr[0] > 122) {
proxy_lua_error(L, "has_flag(): invalid flag, must be A-Z,a-z");
return 0;
}
if (lua_isstring(L, 3)) {
// overwriting a flag/token with the third argument.
replace = true;
}
uint64_t flagbit = (uint64_t)1 << (flagstr[0] - 65);
int ret = 1;
if (rq->pr.t.meta.flags & flagbit) {
// The flag definitely exists, but sadly we need to scan for the
// actual flag to see if it has a token.
lua_pushboolean(L, 1);
for (int x = rq->pr.keytoken+1; x < rq->pr.ntokens; x++) {
const char *s = rq->pr.request + rq->pr.tokens[x];
if (s[0] == flagstr[0]) {
size_t vlen = _process_token_len(&rq->pr, x);
if (vlen > 1) {
// strip the flag off the token and return.
lua_pushlstring(L, s+1, vlen-1);
ret = 2;
}
// Have something to replace the flag/token with.
if (replace) {
size_t newlen = 0;
const char *newtok = lua_tolstring(L, 3, &newlen);
if (mcp_request_render(rq, x, 0, newtok, newlen) != 0) {
proxy_lua_error(L, "token(): request malformed after edit");
return 0;
}
}
break;
}
}
} else {
lua_pushboolean(L, 0);
}
return ret;
}
// returns bool, int
// bool results if flag exists or not
// if int conversion fails, int is nil
int mcplib_request_flag_token_int(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
size_t len = 0;
const char *flagstr = luaL_checklstring(L, 2, &len);
if (len != 1) {
proxy_lua_error(L, "has_flag(): meta flag must be a single character");
return 0;
}
if (flagstr[0] < 65 || flagstr[0] > 122) {
proxy_lua_error(L, "has_flag(): invalid flag, must be A-Z,a-z");
return 0;
}
uint64_t flagbit = (uint64_t)1 << (flagstr[0] - 65);
int ret = 1;
if (rq->pr.t.meta.flags & flagbit) {
lua_pushboolean(L, 1);
for (int x = rq->pr.keytoken+1; x < rq->pr.ntokens; x++) {
const char *s = rq->pr.request + rq->pr.tokens[x];
if (s[0] == flagstr[0]) {
size_t vlen = _process_token_len(&rq->pr, x);
if (vlen > 1) {
// do a funny dance to safely strtol the token.
// TODO: use tokenizer based tokto when merged.
char temp[22];
int tocopy = vlen > 22 ? 21 : vlen-1;
memcpy(temp, s+1, tocopy);
temp[vlen-1] = '\0';
int64_t token = 0;
if (safe_strtoll(temp, &token)) {
lua_pushinteger(L, token);
} else {
lua_pushnil(L);
}
ret = 2;
}
break;
}
}
} else {
lua_pushboolean(L, 0);
}
return ret;
}
// these functions take token as string or number
// if number, internally convert it to avoid creating garbage
static inline char _mcp_request_get_arg_flag(lua_State *L, int idx) {
size_t len = 0;
const char *flagstr = luaL_checklstring(L, idx, &len);
if (len != 1) {
proxy_lua_error(L, "request: meta flag must be a single character");
return 0;
}
if (flagstr[0] < 65 || flagstr[0] > 122) {
proxy_lua_error(L, "request: invalid flag, must be A-Z,a-z");
return 0;
}
return flagstr[0];
}
// *tostring must be large enough to hold a 64bit number as a string.
static inline const char * _mcp_request_check_flag_token(lua_State *L, int idx, char *tostring, size_t *tlen) {
const char *token = NULL;
*tlen = 0;
if (lua_isstring(L, idx)) {
token = lua_tolstring(L, idx, tlen);
} else if (lua_isnumber(L, idx)) {
int isnum = 0;
lua_Integer n = lua_tointegerx(L, idx, &isnum);
if (isnum) {
char *end = itoa_64(n, tostring);
token = tostring;
*tlen = end - tostring;
} else {
proxy_lua_error(L, "request: invalid flag argument");
return NULL;
}
} else if (lua_isnoneornil(L, idx)) {
// no token, just add the flag.
} else {
proxy_lua_error(L, "request: invalid flag argument");
return NULL;
}
return token;
}
// req:flag_add("F", token) -> (bool)
// if token is "example", appends "Fexample" to request
int mcplib_request_flag_add(lua_State *L) {
mcp_request_t *rq = luaL_checkudata(L, 1, "mcp.request");
char flag = _mcp_request_get_arg_flag(L, 2);
char tostring[30];
uint64_t flagbit = (uint64_t)1 << (flag - 65);
if (rq->pr.t.meta.flags & flagbit) {
// fail, flag already exists.
lua_pushboolean(L, 0);
return 1;
}