forked from lebek/libamp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
amp.c
1146 lines (894 loc) · 30.7 KB
/
amp.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
/* Copyright (c) 2011 - Eric P. Mangold
* Copyright (c) 2011 - Peter Le Bek
*
* See LICENSE.txt for details.
*/
/***************************************************************
*
* Asynchrous Messaging Protocol - http://amp-protocol.net
*
***************************************************************
*
* See amp.h for Public Exported and Private Exported APIs.
*
* Public APIs are exported and usable from any linked client code
* and backward compatibility is guaranteed.
*
* Private APIs are exported and usable from any linked client code
* BUT backward compatibility is NOT guaranteed; these APIs could be
* changed or removed in the future.
*
* NOTE: Many of the functions here are documented in amp.h - reading
* the API docs for exported functions defined in this file will
* help in understanding their implementation.
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include "amp.h"
#include "amp_internal.h"
#include "dispatch.h"
void _debug_print_box(AMP_Box_T *box) {
unsigned char *buf = NULL;
struct binding *p;
int i;
bool first;
if (box == NULL)
return;
fprintf(stderr, "<AmpBox ");
first = true;
for (i = 0; i < box->size; i++)
{
p = box->buckets[i];
while (p)
{
if (!first) {
fprintf(stderr, ", ");
} else {
first = false;
}
fprintf(stderr, "%s: ", p->keyval->key);
buf = MALLOC(p->keyval->valueSize+1);
strncpy((char *)buf, (const char *)p->keyval->value, p->keyval->valueSize);
buf[p->keyval->valueSize] = '\x00';
fprintf(stderr, "%s", (unsigned char *)buf);
free(buf);
p = p->link;
}
}
fprintf(stderr, ">\n");
}
amp_error_t _amp_send_unhandled_command_error(AMP_Proto_T *proto, AMP_Request_T *req)
{
/* Fire off an _error box */
AMP_Box_T *box;
unsigned char *buf = NULL;
unsigned char *idx;
unsigned char *packet = NULL;
int packetSize;
amp_error_t ret = 0;
static char prefix[] = "Unhandled Command: '";
static char suffix[] = "'";
if ((box = amp_new_box()) == NULL)
return ENOMEM;
/* put _error key */
if ((ret = amp_put_bytes(box, _ERROR, req->ask_key->value,
req->ask_key->size)) != 0)
goto error;
/* put _error_code key */
if ((ret = amp_put_cstring(box, ERROR_CODE, AMP_ERROR_UNHANDLED)) != 0)
goto error;
/* put _error_description key */
int bufSize = sizeof(prefix) + req->command->size + sizeof(suffix) - 2;
if ((buf = MALLOC(bufSize)) == NULL)
{
ret = ENOMEM;
goto error;
}
idx = buf;
/* use sizeof(s)-1 instead of strlen() as cheap optimization */
memcpy(idx, prefix, sizeof(prefix)-1);
idx += sizeof(prefix)-1;
memcpy(idx, req->command->value, req->command->size);
idx += req->command->size;
memcpy(idx, suffix, sizeof(suffix)-1);
/* TODO - it might be handy to have an amp_put_bytes_no_copy() API
* to avoid the copying overhead in cases such as this where the
* box can happily take ownership of the malloc'd buffer */
if ((ret = amp_put_bytes(box, ERROR_DESCR, buf, bufSize)) != 0)
goto error;
/* buf has been copied in to the box now */
if ((ret = amp_serialize_box(box, &packet, &packetSize)) != 0)
goto error;
/* write handler has taken possession of buffer - don't free */
ret = proto->write(proto, packet, packetSize, proto->write_arg);
error:
amp_free_box(box);
free(buf);
return ret;
}
int _amp_new_request_from_box(AMP_Box_T *box, AMP_Request_T **request)
{
int ret, buf_size;
unsigned char *buf;
AMP_Request_T *r = NULL;
AMP_Chunk_T *cmd_name = NULL;
AMP_Chunk_T *ask_key = NULL; /* default if no _ask key given */
if ( (r = MALLOC(sizeof(*r))) == NULL)
return ENOMEM;
if ( (ret = amp_get_bytes(box, COMMAND, &buf, &buf_size)) != 0)
goto error;
if ( (cmd_name = amp_chunk_copy_buffer(buf, buf_size)) == NULL)
{
ret = ENOMEM;
goto error;
}
if (amp_has_key(box, ASK))
{
if ( (ret = amp_get_bytes(box, ASK, &buf, &buf_size)) != 0)
goto error;
if ( (ask_key = amp_chunk_copy_buffer(buf, buf_size)) == NULL)
{
ret = ENOMEM;
goto error;
}
}
r->command = cmd_name;
r->ask_key = ask_key;
r->args = box;
*request = r;
return 0;
error:
*request = NULL;
free(r);
amp_free_chunk(cmd_name);
amp_free_chunk(ask_key);
return ret;
}
int _amp_new_response_from_box(AMP_Box_T *box, AMP_Response_T **response)
{
int ret;
unsigned int key;
AMP_Response_T *r;
if ( (r = MALLOC(sizeof(*r))) == NULL)
{
ret = ENOMEM;
goto error;
}
if ( (ret = amp_get_uint(box, ANSWER, &key)) != 0)
goto error;
r->answer_key = key;
r->args = box;
*response = r;
return 0;
error:
*response = NULL;
free(r);
return ret;
}
int _amp_new_result_with_response(AMP_Response_T *response, AMP_Result_T **result)
{
AMP_Result_T *r;
if ( (r = MALLOC(sizeof(*r))) == NULL)
return ENOMEM;
r->reason = AMP_SUCCESS;
r->response = response;
r->error = NULL;
*result = r;
return 0;
}
int _amp_new_error_from_box(AMP_Box_T *box, AMP_Error_T **error)
{
int ret, key, buf_size;
unsigned char *buf;
AMP_Chunk_T *error_code = NULL;
AMP_Chunk_T *error_descr = NULL;
AMP_Error_T *e;
if ( (e = MALLOC(sizeof(*e))) == NULL)
return ENOMEM;
if ( (ret = amp_get_int(box, _ERROR, &key)) != 0)
goto error; /* error decoding _answer key */
if (amp_has_key(box, ERROR_CODE))
{
if ( (ret = amp_get_bytes(box, ERROR_CODE, &buf, &buf_size)) != 0)
goto error;
if ( (error_code = amp_chunk_copy_buffer(buf, buf_size)) == NULL)
{
ret = ENOMEM;
goto error;
}
}
if (amp_has_key(box, ERROR_DESCR))
{
if ( (ret = amp_get_bytes(box, ERROR_DESCR, &buf, &buf_size)) != 0)
goto error;
if ( (error_descr = amp_chunk_copy_buffer(buf, buf_size)) == NULL)
{
ret = ENOMEM;
goto error;
}
}
/* Free the box, we have what we need */
amp_free_box(box);
e->answer_key = key;
e->error_code = error_code;
e->error_descr = error_descr;
*error = e;
return 0;
error:
free(e);
amp_free_chunk(error_code);
amp_free_chunk(error_descr);
return ret;
}
int _amp_new_result_with_error(AMP_Error_T *error, AMP_Result_T **result)
{
AMP_Result_T *r;
if ( (r = MALLOC(sizeof(*r))) == NULL)
return ENOMEM;
r->reason = AMP_ERROR;
r->response = NULL;
r->error = error;
*result = r;
return 0;
}
int _amp_process_full_packet(AMP_Proto_T *proto, AMP_Box_T *box)
{
/* Dispatch the box that has been accumulated by the given AMP_Proto .
*
* Returns 0 on success or an AMP_* code on failure.
*
* TODO - do we check for insane boxes that have e.g.
* an _answer and an _error key? */
amp_error_t ret = 0;
if (amp_num_keys(box) == 0)
return AMP_BOX_EMPTY;
if (amp_has_key(box, COMMAND))
{
debug_print("Received %s box.\n", COMMAND);
AMP_Request_T *request;
if ( (ret = _amp_new_request_from_box(box, &request)) != 0)
return ret;
proto->box = NULL; /* forget the box that is now held by the
request object */
_AMP_Responder_p responder;
if ( (responder = _amp_get_responder(proto->responders,
request->command->value)) != NULL)
{
/* Fire off user-supplied responder */
(responder->func)(proto, request, responder->arg);
}
else
{
amp_log("No handler for command: %s", request->command->value);
/* send error to remote peer if _ask key present.
* (ret == 0 before this point) */
if (request->ask_key != NULL)
{
ret = _amp_send_unhandled_command_error(proto, request);
}
/* This free's the box too */
amp_free_request(request);
return ret;
}
}
else if (amp_has_key(box, ANSWER))
{
debug_print("Received %s box.\n", ANSWER);
AMP_Response_T *response;
if ( (ret = _amp_new_response_from_box(box, &response)) != 0)
return ret;
proto->box = NULL; /* forget the box that is now held by the newly
created response object */
_AMP_Callback_p cb;
if ((cb = _amp_pop_callback(proto->outstanding_requests,
response->answer_key)) != NULL) {
AMP_Result_T *result;
if ( (ret = _amp_new_result_with_response(response, &result)) != 0)
{
amp_free_response(response);
_amp_free_callback(cb);
return ret;
}
(cb->func)(proto, result, cb->arg);
_amp_free_callback(cb);
}
else
{
amp_log("Got unknown _answer key: %u", response->answer_key);
amp_free_response(response); /* free's the box too */
return 0;
}
}
else if (amp_has_key(box, _ERROR))
{
debug_print("Received %s box.\n", _ERROR);
AMP_Error_T *error;
if ( (ret = _amp_new_error_from_box(box, &error)) != 0)
return ret;
/* _amp_new_error_from_box was successful which means the box has
* been free'd - so forget it to avoid a potential double-free() */
proto->box = NULL;
_AMP_Callback_p cb;
if ((cb = _amp_pop_callback(proto->outstanding_requests,
error->answer_key)) != NULL) {
AMP_Result_T *result;
if ( (ret = _amp_new_result_with_error(error, &result)) != 0)
{
amp_free_error(error);
_amp_free_callback(cb);
return ret;
}
(cb->func)(proto, result, cb->arg);
_amp_free_callback(cb);
}
else
{
amp_log("Got unknown _error key: %u", error->answer_key);
amp_free_error(error);
return 0;
}
}
else
{
amp_log("Invalid protocol data: %s", amp_strerror(AMP_REQ_KEY_MISSING));
return AMP_REQ_KEY_MISSING;
}
return 0;
}
AMP_Proto_T *amp_new_proto(void)
{
AMP_Proto_T *proto;
AMP_Box_T *box = NULL;
_AMP_Callback_Map_p outstanding_requests = NULL;
_AMP_Responder_Map_p responders = NULL;
if ( (proto = MALLOC(sizeof(struct AMP_Proto))) == NULL)
return NULL;
proto->state = KEY_LEN_READ;
proto->error = 0;
if((box = amp_new_box()) == NULL)
goto error;
proto->last_ask_key = 0;
proto->key_len = -1;
proto->key_data_fetched = 0;
proto->val_len = -1;
proto->val_data_fetched = 0;
proto->dispatch_box = _amp_process_full_packet;
if ((outstanding_requests = _amp_new_callback_map()) == NULL)
goto error;
if((responders = _amp_new_responder_map()) == NULL)
goto error;
proto->box = box;
proto->outstanding_requests = outstanding_requests;
proto->responders = responders;
debug_print("New AMP_Proto at 0x%p\n", proto);
return proto;
error:
free(proto);
if (box)
amp_free_box(box);
if (outstanding_requests)
_amp_free_callback_map(outstanding_requests);
/* NOTE - uncomment this if new structures are allocated below
* the line above where `responders' is allocated
if (responders)
_amp_free_responder_map(responders);
*/
return NULL;
}
void amp_reset_proto(AMP_Proto_T *proto)
{
proto->state = KEY_LEN_READ;
proto->key_len = -1;
proto->key_data_fetched = 0;
proto->val_len = -1;
proto->val_data_fetched = 0;
/* TODO - more efficient to delete the key/values instead of freeing
* and allocating a new box ? */
amp_free_box(proto->box);
proto->box = amp_new_box();
proto->error = 0;
}
void amp_free_proto(AMP_Proto_T *proto)
{
/* XXX TODO Hmmm... what about freeing proto->box ?
* I guess lets do it for now... might need to support
* a method for the user to acquire ownership of
* an AMP_Box from the AMP_Proto
* */
amp_free_box(proto->box);
_amp_free_callback_map(proto->outstanding_requests);
_amp_free_responder_map(proto->responders);
free(proto);
debug_print("Free AMP_Proto at 0x%p\n", proto);
}
void amp_set_write_handler(AMP_Proto_T *proto, write_amp_data_func func,
void *write_arg)
{
proto->write = func;
proto->write_arg = write_arg;
}
int amp_parse_box(AMP_Proto_T *proto, AMP_Box_T *box, int *bytesConsumed,
unsigned char* buf, int len)
{
/* Guaranteed to have at least 1 byte in `buf' */
int idx = 0;
int bytes_remaining = 0;
int bytes_needed = 0;
while (idx < len) {
bytes_remaining = len - idx;
/* debug_print("state: %d\n", state); */
/* debug_print("bytes_remaining: %d\n", bytes_remaining); */
switch (proto->state) {
case KEY_LEN_READ:
if (proto->key_len == -1)
{
/* consume first byte of key length */
/* idx points to the first byte of the key length */
if ( *(buf+idx) != '\0')
{
/* The 1st byte of the key length must always be \x00 */
proto->error = AMP_BAD_KEY_SIZE;
idx++;
*bytesConsumed = idx;
return 0; /* fail */
}
/* Just marks that we've consumed the first
* NUL byte of the key length */
proto->key_len = 0;
idx++;
}
else
{
/* consume second byte of key length */
proto->key_len = *(buf+idx);
idx++;
if (proto->key_len == 0)
{
/* NUL-key signals the end of an AMP box */
/* Reset parser state so we can read more AMP packets.
*
* I /believe/ that the other variables, val_len,
* key_data_fetched and val_data_fetched should
* alreay have been reset as a result of the VAL_DATA_READ
* state that necessarily preceeded this state. */
proto->key_len = -1;
proto->state = KEY_LEN_READ; /* transition */
*bytesConsumed = idx;
return 1;
}
else
{
proto->state = KEY_DATA_READ; /* transition */
}
}
break;
case KEY_DATA_READ:
bytes_needed = proto->key_len - proto->key_data_fetched;
if (bytes_remaining < bytes_needed)
{
memcpy( &(proto->key_data[proto->key_data_fetched]),
buf+idx, bytes_remaining);
idx += bytes_remaining;
proto->key_data_fetched += bytes_remaining;
/* state stays the same */
}
else
{
memcpy( &(proto->key_data[proto->key_data_fetched]),
buf+idx, bytes_needed);
/* NULL-terminate key so that it can be used as a
* dumb C string */
proto->key_data[proto->key_data_fetched+bytes_needed] = '\x00';
idx += bytes_needed;
proto->key_data_fetched += bytes_needed;
proto->state = VAL_LEN_READ; /* transition */
}
break;
case VAL_LEN_READ:
if (proto->val_len == -1)
{
/* consume first byte of value length */
/* idx points to the first byte of the value length */
proto->val_len = *(buf+idx);
/* left shift it by one byte since this is the
* most-significant byte we just read */
proto->val_len = proto->val_len << 8;
idx++;
}
else
{
/* consume second byte of value length */
/* combine it with previously left-shifted byte
* using bitwise OR */
proto->val_len |= *(buf+idx);
idx++;
proto->state = VAL_DATA_READ; /* transition */
}
break;
case VAL_DATA_READ:
bytes_needed = proto->val_len - proto->val_data_fetched;
if (bytes_remaining < bytes_needed)
{
memcpy( &(proto->val_data[proto->val_data_fetched]),
buf+idx, bytes_remaining);
idx += bytes_remaining;
proto->val_data_fetched += bytes_remaining;
/* state stays the same */
}
else
{
memcpy( &(proto->val_data[proto->val_data_fetched]),
buf+idx, bytes_needed);
idx += bytes_needed;
proto->val_data_fetched += bytes_needed;
/* store the current key/value we've just finished
* reading in to the AMP_Box we're building */
proto->error = amp_put_bytes(box, proto->key_data,
proto->val_data,
proto->val_len);
if (proto->error) {
*bytesConsumed = idx;
return 0;
}
/* Reset parser state so we can read more key/values */
proto->key_len = -1;
proto->val_len = -1;
proto->key_data_fetched = 0;
proto->val_data_fetched = 0;
proto->state = KEY_LEN_READ; /* transition */
}
break;
default:
proto->error = AMP_INTERNAL_ERROR;
return 0;
break;
}
}
*bytesConsumed = idx;
return 0; /* proto->error not set, so this is a successful return -
it just means we never found the end of an AMP box */
}
int amp_parse_box_full(AMP_Proto_T *proto, AMP_Box_T *box, unsigned char* buf, int len)
{
int idx = 0;
int err;
short val_len;
short key_len;
while (1) {
//case KEY_LEN_READ:
if ( (len - idx) < 2) {
return -1;
}
if ( buf[idx] != '\0')
{
return -2;
}
key_len = buf[idx+1];
if (!key_len) {
// END of AMP packet.
return 0;
}
idx += 2;
//case KEY_DATA_READ:
if ( key_len > (len - idx) ) {
return -3;
}
memcpy( &(proto->key_data[0]), buf+idx, key_len );
proto->key_data[key_len] = '\x00';
idx += key_len;
err = amp_put_bytes(box, proto->key_data,
(const unsigned char *)"junk", 4);
if (err) {
return -77;
}
//case VAL_LEN_READ:
val_len = buf[idx];
/* left shift it by one octet since this is the
* most-significant byte we just read */
val_len = val_len << 8;
val_len |= buf[idx+1];
idx += 2;
//case VAL_DATA_READ:
if ( val_len > (len - idx) ) {
return -4;
}
memcpy( &(proto->val_data[0]), buf+idx, val_len );
idx += val_len;
err = amp_put_bytes(box, proto->key_data, proto->val_data, val_len);
if (err) {
return err;
}
}
}
/* TODO : implimit default total-message-size limit in AMP protocol parser loop.
Bail out with fatal error if we reach limit before parsing a full AMP box.
TODO : implement configurable limit support in API.
*/
int amp_consume_bytes(AMP_Proto_T *proto, unsigned char* buf, int len)
{
/* Guaranteed to have at least 1 byte in `buf' */
int idx = 0;
int bytesConsumed = 0;
int parseStatus;
if (proto->error)
{
/* refuse to do any more work if the protocol
* parser has previously encounted a fatal error. */
return AMP_PROTO_ERROR;
}
while (idx < len) {
parseStatus = amp_parse_box(proto, proto->box, &bytesConsumed,
buf+idx, len-idx);
idx += bytesConsumed;
if (parseStatus)
{
/* got a full box */
/* Dispatch it */
proto->error = proto->dispatch_box(proto, proto->box);
if (proto->error)
return proto->error;
/* Start parsing a new AMP box.
* The handler function has taken ownership of the box we
* just dispatched - so don't free it. */
proto->box = amp_new_box();
}
else
{
/* might be error, or might have parsed partial box */
if (proto->error)
return proto->error;
/* if no error it should mean that amp_parse_box()
* consumed all of the bytes remaining in buf, and
* we should fall out of the while-loop now */
}
}
return 0;
}
AMP_Chunk_T *amp_new_chunk(int size)
{
AMP_Chunk_T *c;
if ( (c = MALLOC(sizeof(*c) + size)) == NULL)
return NULL;
/* since AMP_Chunk._buffer_starts_here is defined as char
* we should have enough space for the chunk and an extra
* NULL byte at the end */
c->value = &c->_buffer_starts_here;
c->size = size;
*(c->value + size) = 0; /* NULL-terminate */
return c;
}
AMP_Chunk_T *amp_chunk_for_buffer(unsigned char *buf, int size)
{
AMP_Chunk_T *c;
if ( (c = amp_new_chunk(0)) == NULL)
return NULL;
c->value = buf;
c->size = size;
return c;
}
AMP_Chunk_T *amp_chunk_copy_buffer(unsigned char *buf, int size)
{
AMP_Chunk_T *c;
if ( (c = amp_new_chunk(size)) == NULL)
return NULL;
memcpy(c->value, buf, size);
return c;
}
void amp_free_chunk(AMP_Chunk_T *chunk)
{
free(chunk);
}
int amp_chunks_equal(AMP_Chunk_T *c1, AMP_Chunk_T *c2)
{
/* Return 1 if equal, otherwise 0 */
if (c1->size == c2->size && memcmp(c1->value, c2->value, c1->size) == 0)
return 1;
return 0;
}
/* XXX TODO TESTS */
void amp_free_request(AMP_Request_T *request)
{
amp_free_chunk(request->command);
/* May be NULL if no _ask key was given in the _command
* box as allowed by the protocol */
if (request->ask_key != NULL)
amp_free_chunk(request->ask_key);
/* May be manually free()ed and set to NULL
* by user code */
if (request->args != NULL)
amp_free_box(request->args);
free(request);
}
int _amp_new_result_with_cancel(AMP_Result_T **result)
{
AMP_Result_T *r;
if ( (r = MALLOC(sizeof(*r))) == NULL)
return ENOMEM;
r->reason = AMP_CANCEL;
r->response = NULL;
r->error = NULL;
*result = r;
return 0;
}
void amp_free_response(AMP_Response_T *response)
{
amp_free_box(response->args);
free(response);
}
/* XXX TODO TESTS */
void amp_free_error(AMP_Error_T *error)
{
if (error->error_code != NULL)
amp_free_chunk(error->error_code);
if (error->error_descr != NULL)
amp_free_chunk(error->error_descr);
free(error);
}
void amp_free_result(AMP_Result_T *result)
{
if (result->response != NULL)
amp_free_response(result->response);
if (result->error != NULL)
amp_free_error(result->error);
free(result);
}
int amp_next_ask_key(AMP_Proto_T *proto)
{
/* In the case that proto->last_ask_key == UINT_MAX it will wrap around
* on incrementation. Assume that UINT_MAX is large enough to prevent key
* collisions with outstanding requests. */
proto->last_ask_key++;
return proto->last_ask_key;
}
int _amp_do_write(AMP_Proto_T *proto, unsigned char *buf, int buf_size)
{
if (proto->write == NULL)
{
amp_log("AMP_Proto_T.write == NULL, missing call to amp_set_write_handler()?");
free(buf);
return 1;
}
return proto->write(proto, buf, buf_size, proto->write_arg);
}
static int _amp_call(AMP_Proto_T *proto, const char *command, AMP_Box_T *args,
amp_callback_func callback, void *callback_arg, unsigned int *ask_key_ret,
int requiresAnswer)
{
/* TODO mutates the passed in box by adding special _command and
* _ask (optional) keys. But user code might re-use the AMP_Box
* they passed us here to make future calls, possibly with different
* key/values.... so will the presence of the special keys
* in their box cause problems ever? */
int ret, ask_key = -1;
unsigned char *buf;
int buf_size;
_AMP_Callback_p cb = NULL;
if ( (ret = amp_put_cstring(args, COMMAND, command)) != 0)
goto error;
if (requiresAnswer)
{
if ((cb = _amp_new_callback(callback, callback_arg)) == NULL)
{
ret = ENOMEM;
goto error;
}
ask_key = amp_next_ask_key(proto);