forked from bloomberg/comdb2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathqueue.c
2083 lines (1788 loc) · 67.5 KB
/
queue.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 2015 Bloomberg Finance L.P.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
/*
* Ondisk queue data structure with support for variable length items
* and multiple consumers.
*
* We use a single berkdb ondisk queue. Items that are too large for the
* record size (which is the pagesize - 32) are fragmented into multiple
* records.
*
* An alternatives would be the the queue records reference randomly
* distributed data records in supporting btree, but that method may end
* up with the btree having high contention if the records are consumed
* as soon as they are added.
*
* The queue can legally contain records in which the genid is zero. These
* are dummy records which get inserted with the intention that they will be
* consumed using a DB->get(DB_CONSUME) operation, which is the only way to
* guarantee that the queue head is advanced (SR #14652). I refer to these
* dummy records as "goose" records since their purpose is to make sure
* the queue head moves forwards.
*/
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <strings.h>
#include <stddef.h>
#include <pthread.h>
#include <epochlib.h>
#include <plbitlib.h>
#include <bb_stdint.h>
#include <sys/types.h>
#include <netinet/in.h>
#include <inttypes.h>
#include "endian_core.h"
#include "bdb_cursor.h"
#include "bdb_int.h"
#include "locks.h"
#include "locks_wrap.h"
#include "bdb_queue.h"
#include "bdb_queuedb.h"
#include "logmsg.h"
/* See also Oracle support request #6353586.992. It seems that non
* transactional reads against a queue (at least, the way I was doing them) is
* prone to deadlock. By making my cursor transactional I seem to get around
* this.
* Update: a patch was received and applied to our berkeley db build, so this
* hack can now be disabled. */
#define TXN_READ_HACK() 0
/*
* Endian-friendly accessor functions for bdb-queue
*/
/*
enum
{
QUEUE_HDR_LEN = 2 + 2 + 8 + 4 + 4 + 4 + 4 + 4
};
BB_COMPILE_TIME_ASSERT(bdb_queue_header_size, sizeof(struct bdb_queue_header) ==
QUEUE_HDR_LEN);
*/
const uint8_t *queue_hdr_get(struct bdb_queue_header *p_queue_hdr,
const uint8_t *p_buf, const uint8_t *p_buf_end)
{
if (p_buf_end < p_buf || QUEUE_HDR_LEN > (p_buf_end - p_buf))
return NULL;
p_buf = buf_get(&(p_queue_hdr->fragment_no),
sizeof(p_queue_hdr->fragment_no), p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->num_fragments),
sizeof(p_queue_hdr->num_fragments), p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->genid[0]), sizeof(p_queue_hdr->genid[0]),
p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->genid[1]), sizeof(p_queue_hdr->genid[1]),
p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->total_sz), sizeof(p_queue_hdr->total_sz),
p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->fragment_sz),
sizeof(p_queue_hdr->fragment_sz), p_buf, p_buf_end);
p_buf =
buf_no_net_get(&(p_queue_hdr->consumer_mask),
sizeof(p_queue_hdr->consumer_mask), p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_hdr->crc32), sizeof(p_queue_hdr->crc32), p_buf,
p_buf_end);
p_buf = buf_get(&(p_queue_hdr->reserved), sizeof(p_queue_hdr->reserved),
p_buf, p_buf_end);
return p_buf;
}
uint8_t *queue_hdr_put(const struct bdb_queue_header *p_queue_hdr,
uint8_t *p_buf, const uint8_t *p_buf_end)
{
if (p_buf_end < p_buf || QUEUE_HDR_LEN > (p_buf_end - p_buf))
return NULL;
p_buf = buf_put(&(p_queue_hdr->fragment_no),
sizeof(p_queue_hdr->fragment_no), p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->num_fragments),
sizeof(p_queue_hdr->num_fragments), p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->genid[0]), sizeof(p_queue_hdr->genid[0]),
p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->genid[1]), sizeof(p_queue_hdr->genid[1]),
p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->total_sz), sizeof(p_queue_hdr->total_sz),
p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->fragment_sz),
sizeof(p_queue_hdr->fragment_sz), p_buf, p_buf_end);
p_buf =
buf_no_net_put(&(p_queue_hdr->consumer_mask),
sizeof(p_queue_hdr->consumer_mask), p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_hdr->crc32), sizeof(p_queue_hdr->crc32), p_buf,
p_buf_end);
p_buf = buf_put(&(p_queue_hdr->reserved), sizeof(p_queue_hdr->reserved),
p_buf, p_buf_end);
return p_buf;
}
enum { QUEUE_FOUND_LEN = 8 + 4 + 4 + 4 + 4 };
BB_COMPILE_TIME_ASSERT(bdb_queue_found_len,
sizeof(struct bdb_queue_found) == QUEUE_FOUND_LEN);
const uint8_t *queue_found_get(struct bdb_queue_found *p_queue_found,
const uint8_t *p_buf, const uint8_t *p_buf_end)
{
if (p_buf_end < p_buf || QUEUE_FOUND_LEN > (p_buf_end - p_buf))
return NULL;
p_buf = buf_get(&(p_queue_found->genid), sizeof(p_queue_found->genid),
p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_found->data_len), sizeof(p_queue_found->data_len),
p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_found->data_offset),
sizeof(p_queue_found->data_offset), p_buf, p_buf_end);
p_buf =
buf_get(&(p_queue_found->trans.num_fragments),
sizeof(p_queue_found->trans.num_fragments), p_buf, p_buf_end);
p_buf = buf_get(&(p_queue_found->epoch), sizeof(p_queue_found->epoch),
p_buf, p_buf_end);
return p_buf;
}
uint8_t *queue_found_put(const struct bdb_queue_found *p_queue_found,
uint8_t *p_buf, const uint8_t *p_buf_end)
{
if (p_buf_end < p_buf || QUEUE_FOUND_LEN > (p_buf_end - p_buf))
return NULL;
p_buf = buf_put(&(p_queue_found->genid), sizeof(p_queue_found->genid),
p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_found->data_len), sizeof(p_queue_found->data_len),
p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_found->data_offset),
sizeof(p_queue_found->data_offset), p_buf, p_buf_end);
p_buf =
buf_put(&(p_queue_found->trans.num_fragments),
sizeof(p_queue_found->trans.num_fragments), p_buf, p_buf_end);
p_buf = buf_put(&(p_queue_found->epoch), sizeof(p_queue_found->epoch),
p_buf, p_buf_end);
return p_buf;
}
struct bdb_queue_priv {
struct bdb_queue_stats stats;
uint32_t known_lost_consumers;
int last_orphaned_consumers_alarm;
};
/* This is based on the old genid function but without all the extra dta file
* munging stuff that was added for dtastripe - all we need for queues are
* unique keys. These genids cannot be zero. */
static unsigned long long get_queue_genid(bdb_state_type *bdb_state)
{
unsigned long long genid;
unsigned int *iptr;
unsigned int next_seed;
iptr = (unsigned int *)&genid;
do {
/* there is a seed_lock and a seed for each bdb_state */
Pthread_mutex_lock(&(bdb_state->seed_lock));
bdb_state->seed++;
next_seed = bdb_state->seed;
Pthread_mutex_unlock(&(bdb_state->seed_lock));
iptr[0] = comdb2_time_epoch();
iptr[1] = next_seed;
} while (genid == 0);
return genid;
}
void bdb_queue_init_priv(bdb_state_type *bdb_state)
{
if (bdb_state->bdbtype == BDBTYPE_QUEUEDB) {
bdb_queuedb_init_priv(bdb_state);
return;
}
bdb_state->qpriv = calloc(1, sizeof(bdb_queue_priv));
if (!bdb_state->qpriv) {
logmsg(LOGMSG_FATAL, "%s: out of memory\n", __func__);
exit(1);
}
}
/* mark a consumer as active or inactive. */
int bdb_queue_consumer(bdb_state_type *bdb_state, int consumer, int active,
int *bdberr)
{
*bdberr = BDBERR_NOERROR;
if (consumer < 0 || consumer >= BDBQUEUE_MAX_CONSUMERS) {
*bdberr = BDBERR_BADARGS;
return -1;
}
BDB_READLOCK("bdb_queue_consumer");
{
if (active)
bset(&bdb_state->active_consumers, consumer);
else
bclr(&bdb_state->active_consumers, consumer);
}
BDB_RELLOCK();
return 0;
}
/* Calculate how many items you can fit per page given the expected average
* item size, the page size and whether or not checksums are enabled.
* This is reverse engineered from berkdb source code (ideally we'd
* just call their macros..) */
static int items_per_page(int avg_item_sz, int pagesize, int checksums)
{
/* Remove size of page header; this is from dbinc/db_page.h
* QPAGE_NORMAL and QPAGE_CHKSUM. */
if (checksums)
pagesize -= 48;
else
pagesize -= 28;
/* Each item has a 1 byte header in berkeley, and then is rounded to 32
* bits. Also we have our own header. */
avg_item_sz += sizeof(struct bdb_queue_header);
avg_item_sz++;
avg_item_sz = (avg_item_sz + 3) & ~3;
return pagesize / avg_item_sz;
}
static int max_item_size(int pagesize, int checksums)
{
/* Remove size of page header; this is from dbinc/db_page.h
* QPAGE_NORMAL and QPAGE_CHKSUM. */
if (checksums)
pagesize -= 48;
else
pagesize -= 28;
/* Remaining pagesize must be 32 bit aligned. Subtract one for the
* 1 byte berkdb item header and you have the maximum possible user
* level page size. Also subtract our own item header. */
return pagesize - 1 - sizeof(struct bdb_queue_header);
}
static int pagesize_wasteage(int avg_item_sz, int pagesize, int checksums)
{
int wasteage;
/* Remove size of page header; this is from dbinc/db_page.h
* QPAGE_NORMAL and QPAGE_CHKSUM. */
if (checksums)
wasteage = pagesize - 48;
else
wasteage = pagesize - 28;
/* Each item has a 1 byte header in berkeley, and then is rounded to 32
* bits. Also we have our own header. */
avg_item_sz += sizeof(struct bdb_queue_header);
avg_item_sz++;
avg_item_sz = (avg_item_sz + 3) & ~3;
return wasteage % avg_item_sz;
}
/* bb_filexfer transfers 100KB at a time. don't ever specify a page size
* that does not divide evently into that. in fact, don't go over 8KB. */
static int pagesize_ok(int pagesize)
{
if (pagesize <= 0)
return -1;
if ((100 * 1024) % pagesize != 0)
return -1;
if (pagesize > (8 * 1024))
return -1;
return 0;
}
int bdb_queue_best_pagesize(int avg_item_sz)
{
int pagesize;
int bestpagesize;
int bestwasteage;
int checksums = 1; /* assume checksums on for now */
/* Discover the minimum page size that will cover items of this length. */
pagesize = 128;
/* Don't go below this, or set_pagesize will fail */
if (pagesize < 512 /*db_int.h/DB_MIN_PGSIZE*/)
pagesize = 512;
while (max_item_size(pagesize, checksums) < avg_item_sz) {
pagesize <<= 1;
if (pagesize_ok(pagesize) != 0) {
/* These items are huge! Make no suggestion. */
return 0;
}
}
/* Calculate the efficiency of this page size and higher page sizes
* until we find an optimum. */
bestpagesize = pagesize;
bestwasteage = pagesize_wasteage(avg_item_sz, pagesize, checksums);
while (pagesize <= 0x10000) {
if (pagesize_ok(pagesize) == 0) {
int wasteage = pagesize_wasteage(avg_item_sz, pagesize, checksums);
if (wasteage < bestwasteage) {
bestwasteage = wasteage;
bestpagesize = pagesize;
}
}
pagesize <<= 1;
}
return bestpagesize;
}
extern int gbl_rowlocks;
static int bdb_queue_add_int(bdb_state_type *bdb_state, tran_type *intran,
const void *dta, size_t dtalen, int *bdberr,
unsigned long long *out_genid)
{
size_t numfragments;
char *fragment;
size_t lrl;
size_t nfrag;
unsigned long long genid;
tran_type *tran;
if (gbl_rowlocks) {
get_physical_transaction(bdb_state, intran, &tran, 0);
} else
tran = intran;
if (out_genid)
*out_genid = 0;
if (!bdb_state->read_write) {
*bdberr = BDBERR_READONLY;
return -1;
}
*bdberr = BDBERR_NOERROR;
/* if no consumers are registered then don't enqueue this thing, since
* nobody wants it. */
if (bdb_state->active_consumers == 0)
return 0;
lrl = bdb_state->queue_item_sz - sizeof(struct bdb_queue_header);
/* Work out how many fragemnts we need. */
numfragments = (dtalen + (lrl - 1)) / lrl;
fragment = malloc(bdb_state->queue_item_sz);
if (!fragment) {
logmsg(LOGMSG_ERROR, "bdb_queue_add_int: cannot malloc %zu bytes\n",
bdb_state->queue_item_sz);
*bdberr = BDBERR_MALLOC;
return -1;
}
genid = get_queue_genid(bdb_state);
/* Add each fragment. */
for (nfrag = 0; nfrag < numfragments; nfrag++) {
struct bdb_queue_header hdr = {0};
/*struct bdb_queue_header *)fragment;*/
uint8_t *p_buf = (uint8_t *)fragment,
*p_buf_end = (p_buf + bdb_state->queue_item_sz);
size_t offset, length;
DBT dbt_key, dbt_data;
db_recno_t recno;
int rc;
/* Construct the fragment. */
offset = nfrag * lrl;
length = lrl;
if (offset + length > dtalen)
length = dtalen - offset;
bzero(fragment, sizeof(struct bdb_queue_header));
memcpy(hdr.genid, &genid, sizeof(genid));
hdr.fragment_no = nfrag;
hdr.num_fragments = numfragments;
hdr.total_sz = dtalen;
hdr.fragment_sz = length;
if (nfrag == 0)
hdr.consumer_mask = bdb_state->active_consumers;
if (!(p_buf = queue_hdr_put(&hdr, p_buf, p_buf_end))) {
logmsg(LOGMSG_ERROR, "%s: queue_hdr_put failed\n", __FUNCTION__);
*bdberr = BDBERR_MISC;
free(fragment);
return -1;
}
p_buf = buf_no_net_put(((const char *)dta) + offset, length, p_buf,
p_buf_end);
/* First fragment has a consumer mask to say who will consume it. */
/* Construct dbt_key and dbt_data */
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
dbt_key.data = &recno;
dbt_key.size = sizeof(recno);
dbt_key.ulen = sizeof(recno);
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.data = fragment;
dbt_data.size = length + sizeof(struct bdb_queue_header);
dbt_data.flags = DB_DBT_USERMEM;
/* Add it. */
rc =
bdb_state->dbp_data[0][0]->put(bdb_state->dbp_data[0][0], tran->tid,
&dbt_key, &dbt_data, DB_APPEND);
if (rc != 0) {
switch (rc) {
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
*bdberr = BDBERR_MISC;
logmsg(LOGMSG_ERROR, "%s: put failed %d %s\n", __FUNCTION__, rc,
db_strerror(rc));
break;
}
free(fragment);
return -1;
}
}
free(fragment);
if (out_genid)
*out_genid = genid;
return 0;
}
unsigned long long bdb_queue_item_genid(const void *dta)
{
if (dta) {
uint8_t *p_buf = (uint8_t *)dta;
uint8_t *p_buf_end = (p_buf + QUEUE_FOUND_LEN);
struct bdb_queue_found item;
if (!queue_found_get(&item, p_buf, p_buf_end)) {
logmsg(LOGMSG_ERROR, "%s line %d: queue_found_get returns NULL\n",
__func__, __LINE__);
return 0;
}
return item.genid;
}
return 0;
}
/* add an item to the end of the queue. */
int bdb_queue_add(bdb_state_type *bdb_state, tran_type *tran, const void *dta,
size_t dtalen, int *bdberr, unsigned long long *out_genid)
{
int rc = 0;
BDB_READLOCK("bdb_queue_add");
if (bdb_state->bdbtype == BDBTYPE_QUEUEDB) {
rc = bdb_queuedb_add(bdb_state, tran, dta, dtalen, bdberr, out_genid);
} else {
rc = bdb_queue_add_int(bdb_state, tran, dta, dtalen, bdberr, out_genid);
}
BDB_RELLOCK();
return rc;
}
static int bdb_queue_add_goose_int(bdb_state_type *bdb_state, tran_type *tran,
int *bdberr)
{
int rc;
DBT dbt_key, dbt_data;
struct bdb_queue_header hdr;
db_recno_t recno;
if (!bdb_state->read_write) {
*bdberr = BDBERR_READONLY;
return -1;
}
*bdberr = BDBERR_NOERROR;
/* Specifically, it's the zero genid that marks this record as a goose. */
bzero(&hdr, sizeof(hdr));
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
dbt_key.data = &recno;
dbt_key.size = sizeof(recno);
dbt_key.ulen = sizeof(recno);
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.data = &hdr;
dbt_data.size = sizeof(struct bdb_queue_header);
dbt_data.flags = DB_DBT_USERMEM;
rc = bdb_state->dbp_data[0][0]->put(bdb_state->dbp_data[0][0], tran->tid,
&dbt_key, &dbt_data, DB_APPEND);
if (rc != 0) {
switch (rc) {
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
*bdberr = BDBERR_MISC;
logmsg(LOGMSG_ERROR, "bdb_queue_add_goose_int: put failed %d %s\n", rc,
db_strerror(errno));
break;
}
return -1;
}
return 0;
}
int bdb_queue_add_goose(bdb_state_type *bdb_state, tran_type *tran, int *bdberr)
{
int rc = 0;
BDB_READLOCK("bdb_queue_add_goose");
if (bdb_state->bdbtype == BDBTYPE_QUEUE) {
rc = bdb_queue_add_goose_int(bdb_state, tran, bdberr);
}
BDB_RELLOCK();
return rc;
}
static int bdb_queue_check_goose_int(bdb_state_type *bdb_state, tran_type *tran,
int *bdberr)
{
DB_TXN *tid;
int tmptid;
uint8_t hdrbuf[QUEUE_HDR_LEN];
uint8_t *p_buf = hdrbuf, *p_buf_end = (p_buf + sizeof(hdrbuf));
DBT dbt_key, dbt_data;
DBC *dbcp;
db_recno_t recno;
struct bdb_queue_header hdr;
int rc, outrc;
if (tran) {
tid = tran->tid;
tmptid = 0;
} else if (TXN_READ_HACK()) {
rc = bdb_state->dbenv->txn_begin(bdb_state->dbenv, NULL, &tid, 0);
if (rc != 0) {
logmsg(LOGMSG_ERROR,
":bdb_queue_check_goose_int txn_begin failed %d %s\n", rc,
db_strerror(rc));
*bdberr = BDBERR_MISC;
return -1;
}
tmptid = 1;
} else {
tid = NULL;
tmptid = 0;
}
rc = bdb_state->dbp_data[0][0]->cursor(bdb_state->dbp_data[0][0], tid,
&dbcp, 0);
if (rc != 0) {
switch (rc) {
case DB_REP_HANDLE_DEAD:
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
logmsg(LOGMSG_ERROR, "bdb_queue_check_goose_int: "
"cursor failed tid=%p %d %s\n",
tid, rc, db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
if (tid && tmptid)
tid->abort(tid);
return -1;
}
/* Default return is 2 - not found. If we find a goose then we'll change
* this to 0. */
outrc = 2;
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
dbt_key.ulen = sizeof(recno);
dbt_key.data = &recno;
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.ulen = sizeof(hdr);
dbt_data.doff = 0;
dbt_data.dlen = sizeof(struct bdb_queue_header);
dbt_data.ulen = dbt_data.dlen;
dbt_data.data = &hdrbuf;
dbt_data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
rc = dbcp->c_get(dbcp, &dbt_key, &dbt_data, DB_FIRST);
if (rc == 0) {
if (!(queue_hdr_get(&hdr, p_buf, p_buf_end))) {
logmsg(LOGMSG_ERROR, "%s: queue_hdr_get failed\n", __FUNCTION__);
*bdberr = BDBERR_MISC;
outrc = -1;
} else if (hdr.genid[0] == 0 && hdr.genid[1] == 0) {
/* Found a goose! */
outrc = 0;
}
} else if (rc != DB_NOTFOUND) {
switch (rc) {
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
logmsg(LOGMSG_ERROR, "bdb_queue_check_goose_int: c_get failed %d %s\n",
rc, db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
outrc = -1;
}
rc = dbcp->c_close(dbcp);
if (rc != 0) {
switch (rc) {
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
logmsg(LOGMSG_ERROR, "bdb_queue_check_goose_int: c_close failed %d %s\n",
rc, db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
outrc = -1;
}
if (tid && tmptid)
tid->abort(tid);
return outrc;
}
int bdb_queue_check_goose(bdb_state_type *bdb_state, tran_type *tran,
int *bdberr)
{
int rc = 0;
BDB_READLOCK("bdb_queue_check_goose");
if (bdb_state->bdbtype == BDBTYPE_QUEUE) {
rc = bdb_queue_check_goose_int(bdb_state, tran, bdberr);
}
BDB_RELLOCK();
return rc;
}
/* caller is responsible for rolling back if a non-goose is consumed. */
static int bdb_queue_consume_goose_int(bdb_state_type *bdb_state,
tran_type *tran, int *bdberr)
{
DBT dbt_key, dbt_data;
db_recno_t recno;
uint8_t hdrbuf[QUEUE_HDR_LEN];
uint8_t *p_buf = hdrbuf, *p_buf_end = (p_buf + sizeof(hdrbuf));
struct bdb_queue_header hdr;
int rc;
if (!bdb_state->read_write) {
*bdberr = BDBERR_READONLY;
return -1;
}
*bdberr = BDBERR_NOERROR;
/* Consume the head. */
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
dbt_key.data = &recno;
dbt_key.size = sizeof(recno);
dbt_key.ulen = sizeof(recno);
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.doff = 0;
dbt_data.dlen = sizeof(struct bdb_queue_header);
dbt_data.ulen = sizeof(struct bdb_queue_header);
dbt_data.data = &hdrbuf;
dbt_data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
rc = bdb_state->dbp_data[0][0]->get(bdb_state->dbp_data[0][0], tran->tid,
&dbt_key, &dbt_data, DB_CONSUME);
if (rc != 0) {
switch (rc) {
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
case DB_NOTFOUND:
*bdberr = BDBERR_DELNOTFOUND;
break;
default:
logmsg(LOGMSG_ERROR, "bdb_queue_consume_goose_int: get failed %d %s\n",
rc, db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
return 0;
} else {
/* If the record is not a goose then set BDBERR_DELNOTFOUND.
* The caller should detect this and roll back. */
/*
fprintf(stderr, "got recno=%u %08x:%08x size=%u ulen=%u to consume\n",
recno, hdr.genid[0], hdr.genid[1], dbt_data.size,
dbt_data.ulen);
fsnapf(stderr, &hdr, dbt_data.ulen);
*/
if (!(queue_hdr_get(&hdr, p_buf, p_buf_end))) {
logmsg(LOGMSG_ERROR, "%s: queue_hdr_get failed\n", __FUNCTION__);
*bdberr = BDBERR_MISC;
return -1;
}
if (hdr.genid[0] || hdr.genid[1]) {
*bdberr = BDBERR_DELNOTFOUND;
return -1;
}
}
return 0;
}
int bdb_queue_consume_goose(bdb_state_type *bdb_state, tran_type *tran,
int *bdberr)
{
int rc = 0;
BDB_READLOCK("bdb_queue_consume_goose");
if (bdb_state->bdbtype == BDBTYPE_QUEUE) {
rc = bdb_queue_consume_goose_int(bdb_state, tran, bdberr);
}
BDB_RELLOCK();
return rc;
}
static int bdb_queue_walk_int(bdb_state_type *bdb_state, int flags,
bbuint32_t *lastitem,
bdb_queue_walk_callback_t callback, void *userptr,
int *bdberr)
{
DBT dbt_key, dbt_data;
DBC *dbcp;
struct bdb_queue_header hdr;
uint8_t hdrbuf[QUEUE_HDR_LEN];
uint8_t *p_buf = hdrbuf, *p_buf_end = (p_buf + sizeof(hdrbuf));
db_recno_t recno;
bbuint32_t consumer_mask = 0xffffffff;
int rc;
int tmptid = 0;
DB_TXN *tid = NULL;
#if 0
if(flags & BDB_QUEUE_WALK_KNOWN_CONSUMERS_ONLY)
consumer_mask &= ~bdb_state->active_consumers;
#endif
if (TXN_READ_HACK()) {
rc = bdb_state->dbenv->txn_begin(bdb_state->dbenv, NULL, &tid, 0);
if (rc != 0) {
logmsg(LOGMSG_ERROR, "%s: txn_begin failed %d %s\n", __func__, rc,
db_strerror(rc));
*bdberr = BDBERR_MISC;
return -1;
}
tmptid = 1;
}
rc = bdb_state->dbp_data[0][0]->cursor(bdb_state->dbp_data[0][0], tid,
&dbcp, 0);
if (rc != 0) {
switch (rc) {
case DB_REP_HANDLE_DEAD:
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
logmsg(LOGMSG_ERROR, "bdb_queue_walk_int: cursor failed %d %s\n", rc,
db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
if (tid && tmptid)
tid->abort(tid);
return -1;
}
/* if doing a restart get back to where we were so that DB_NEXT will put us
* on the next item. */
if (flags & BDB_QUEUE_WALK_RESTART) {
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
recno = (db_recno_t)(*lastitem);
dbt_key.ulen = sizeof(recno);
dbt_key.data = &recno;
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.ulen = sizeof(hdr);
dbt_data.doff = 0;
dbt_data.dlen = sizeof(struct bdb_queue_header);
dbt_data.data = &hdrbuf;
dbt_data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
rc = dbcp->c_get(dbcp, &dbt_key, &dbt_data, DB_SET);
if (rc != DB_NOTFOUND && rc != DB_KEYEMPTY) {
switch (rc) {
case DB_REP_HANDLE_DEAD:
case DB_LOCK_DEADLOCK:
*bdberr = BDBERR_DEADLOCK;
break;
default:
logmsg(LOGMSG_ERROR,
"bdb_queue_walk_int: restart c_get failed %d %s\n", rc,
db_strerror(rc));
*bdberr = BDBERR_MISC;
break;
}
dbcp->c_close(dbcp);
if (tid && tmptid)
tid->abort(tid);
return -1;
}
if (!(queue_hdr_get(&hdr, p_buf, p_buf_end))) {
logmsg(LOGMSG_ERROR, "%s: queue_hdr_get failed\n", __FUNCTION__);
*bdberr = BDBERR_MISC;
dbcp->c_close(dbcp);
if (tid && tmptid)
tid->abort(tid);
return -1;
}
}
bzero(&dbt_key, sizeof(dbt_key));
bzero(&dbt_data, sizeof(dbt_data));
dbt_key.ulen = sizeof(recno);
dbt_key.data = &recno;
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.ulen = sizeof(hdr);
dbt_data.doff = 0;
dbt_data.dlen = sizeof(struct bdb_queue_header);
dbt_data.ulen = dbt_data.dlen;
dbt_data.data = &hdrbuf;
dbt_data.flags = DB_DBT_USERMEM | DB_DBT_PARTIAL;
rc = dbcp->c_get(dbcp, &dbt_key, &dbt_data, DB_NEXT);
while (rc == 0) {
p_buf = hdrbuf;
if (!(queue_hdr_get(&hdr, p_buf, p_buf_end))) {
logmsg(LOGMSG_ERROR, "%s: queue_hdr_get failed\n", __FUNCTION__);
*bdberr = BDBERR_MISC;
dbcp->c_close(dbcp);
if (tid && tmptid)
tid->abort(tid);
return -1;
}
/* Skip zero genid records as those are dummies. */
if (hdr.fragment_no == 0 && (hdr.consumer_mask & consumer_mask) &&
(hdr.genid[0] || hdr.genid[1])) {
int consumern;
/* Call the callback for each consumer that hasn't yet consumed
* this message. */
for (consumern = 0; consumern < 32; consumern++) {
if (btst(&consumer_mask, consumern) &&
btst(&hdr.consumer_mask, consumern)) {
int callbackrc =
callback(consumern, (size_t)hdr.total_sz,
(unsigned int)hdr.genid[0], /* epoch */
userptr);
if (callbackrc == BDB_QUEUE_WALK_STOP) {
dbcp->c_close(dbcp);
if (tid && tmptid)
tid->abort(tid);
return 0;
} else if (callbackrc == BDB_QUEUE_WALK_STOP_CONSUMER) {
/* no more from this consumer, thanks */
bclr(&consumer_mask, consumern);
} else if (callbackrc == BDB_QUEUE_WALK_CONTINUE) {
/* carry on */
} else {
/* not sure what this means? */
}
}
}
if (flags & BDB_QUEUE_WALK_FIRST_ONLY) {
consumer_mask &= ~hdr.consumer_mask;
if (consumer_mask == 0)
break;
}
}
/* save recno in case we need to restart */
if (lastitem)
*lastitem = (bbuint32_t)recno;
dbt_key.ulen = sizeof(recno);
dbt_key.data = &recno;
dbt_key.flags = DB_DBT_USERMEM;
dbt_data.ulen = sizeof(hdr);
dbt_data.doff = 0;
dbt_data.dlen = sizeof(struct bdb_queue_header);