summaryrefslogtreecommitdiff
path: root/src/upb_handlers.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/upb_handlers.c')
-rw-r--r--src/upb_handlers.c311
1 files changed, 0 insertions, 311 deletions
diff --git a/src/upb_handlers.c b/src/upb_handlers.c
deleted file mode 100644
index f513dfd..0000000
--- a/src/upb_handlers.c
+++ /dev/null
@@ -1,311 +0,0 @@
-/*
- * upb - a minimalist implementation of protocol buffers.
- *
- * Copyright (c) 2011 Google Inc. See LICENSE for details.
- * Author: Josh Haberman <jhaberman@gmail.com>
- */
-
-#include <stdlib.h>
-#include "upb_handlers.h"
-
-
-/* upb_mhandlers **************************************************************/
-
-static upb_mhandlers *upb_mhandlers_new() {
- upb_mhandlers *m = malloc(sizeof(*m));
- upb_inttable_init(&m->fieldtab, 8, sizeof(upb_fhandlers));
- m->startmsg = NULL;
- m->endmsg = NULL;
- m->tablearray = NULL;
- m->is_group = false;
- return m;
-}
-
-static upb_fhandlers *_upb_mhandlers_newfhandlers(upb_mhandlers *m, uint32_t n,
- upb_fieldtype_t type,
- bool repeated) {
- uint32_t tag = n << 3 | upb_types[type].native_wire_type;
- upb_fhandlers *f = upb_inttable_lookup(&m->fieldtab, tag);
- if (f) abort();
- upb_fhandlers new_f = {false, type, repeated,
- repeated && upb_isprimitivetype(type), UPB_ATOMIC_INIT(0),
- n, m, NULL, UPB_NO_VALUE, NULL, NULL, NULL, NULL, NULL, 0, 0, 0, NULL};
- upb_inttable_insert(&m->fieldtab, tag, &new_f);
- f = upb_inttable_lookup(&m->fieldtab, tag);
- assert(f);
- assert(f->type == type);
- return f;
-}
-
-upb_fhandlers *upb_mhandlers_newfhandlers(upb_mhandlers *m, uint32_t n,
- upb_fieldtype_t type, bool repeated) {
- assert(type != UPB_TYPE(MESSAGE));
- assert(type != UPB_TYPE(GROUP));
- return _upb_mhandlers_newfhandlers(m, n, type, repeated);
-}
-
-upb_fhandlers *upb_mhandlers_newfhandlers_subm(upb_mhandlers *m, uint32_t n,
- upb_fieldtype_t type,
- bool repeated,
- upb_mhandlers *subm) {
- assert(type == UPB_TYPE(MESSAGE) || type == UPB_TYPE(GROUP));
- assert(subm);
- upb_fhandlers *f = _upb_mhandlers_newfhandlers(m, n, type, repeated);
- f->submsg = subm;
- if (type == UPB_TYPE(GROUP))
- _upb_mhandlers_newfhandlers(subm, n, UPB_TYPE_ENDGROUP, false);
- return f;
-}
-
-
-/* upb_handlers ***************************************************************/
-
-upb_handlers *upb_handlers_new() {
- upb_handlers *h = malloc(sizeof(*h));
- upb_atomic_init(&h->refcount, 1);
- h->msgs_len = 0;
- h->msgs_size = 4;
- h->msgs = malloc(h->msgs_size * sizeof(*h->msgs));
- h->should_jit = true;
- return h;
-}
-
-void upb_handlers_ref(upb_handlers *h) { upb_atomic_ref(&h->refcount); }
-
-void upb_handlers_unref(upb_handlers *h) {
- if (upb_atomic_unref(&h->refcount)) {
- for (int i = 0; i < h->msgs_len; i++) {
- upb_mhandlers *mh = h->msgs[i];
- upb_inttable_free(&mh->fieldtab);
- free(mh->tablearray);
- free(mh);
- }
- free(h->msgs);
- free(h);
- }
-}
-
-upb_mhandlers *upb_handlers_newmhandlers(upb_handlers *h) {
- if (h->msgs_len == h->msgs_size) {
- h->msgs_size *= 2;
- h->msgs = realloc(h->msgs, h->msgs_size * sizeof(*h->msgs));
- }
- upb_mhandlers *mh = upb_mhandlers_new();
- h->msgs[h->msgs_len++] = mh;
- return mh;
-}
-
-typedef struct {
- upb_mhandlers *mh;
-} upb_mtab_ent;
-
-static upb_mhandlers *upb_regmsg_dfs(upb_handlers *h, upb_msgdef *m,
- upb_onmsgreg *msgreg_cb,
- upb_onfieldreg *fieldreg_cb,
- void *closure, upb_strtable *mtab) {
- upb_mhandlers *mh = upb_handlers_newmhandlers(h);
- upb_mtab_ent e = {mh};
- upb_strtable_insert(mtab, m->base.fqname, &e);
- if (msgreg_cb) msgreg_cb(closure, mh, m);
- upb_msg_iter i;
- for(i = upb_msg_begin(m); !upb_msg_done(i); i = upb_msg_next(m, i)) {
- upb_fielddef *f = upb_msg_iter_field(i);
- upb_fhandlers *fh;
- if (upb_issubmsg(f)) {
- upb_mhandlers *sub_mh;
- upb_mtab_ent *subm_ent;
- // The table lookup is necessary to break the DFS for type cycles.
- if ((subm_ent = upb_strtable_lookup(mtab, f->def->fqname)) != NULL) {
- sub_mh = subm_ent->mh;
- } else {
- sub_mh = upb_regmsg_dfs(h, upb_downcast_msgdef(f->def), msgreg_cb,
- fieldreg_cb, closure, mtab);
- }
- fh = upb_mhandlers_newfhandlers_subm(
- mh, f->number, f->type, upb_isseq(f), sub_mh);
- } else {
- fh = upb_mhandlers_newfhandlers(mh, f->number, f->type, upb_isseq(f));
- }
- if (fieldreg_cb) fieldreg_cb(closure, fh, f);
- }
- return mh;
-}
-
-upb_mhandlers *upb_handlers_regmsgdef(upb_handlers *h, upb_msgdef *m,
- upb_onmsgreg *msgreg_cb,
- upb_onfieldreg *fieldreg_cb,
- void *closure) {
- upb_strtable mtab;
- upb_strtable_init(&mtab, 8, sizeof(upb_mtab_ent));
- upb_mhandlers *ret =
- upb_regmsg_dfs(h, m, msgreg_cb, fieldreg_cb, closure, &mtab);
- upb_strtable_free(&mtab);
- return ret;
-}
-
-
-/* upb_dispatcher *************************************************************/
-
-static upb_fhandlers toplevel_f = {
- false, UPB_TYPE(GROUP), false, false, UPB_ATOMIC_INIT(0), 0,
- NULL, NULL, // submsg
-#ifdef NDEBUG
- {{0}},
-#else
- {{0}, -1},
-#endif
- NULL, NULL, NULL, NULL, NULL, 0, 0, 0, NULL};
-
-void upb_dispatcher_init(upb_dispatcher *d, upb_handlers *h,
- upb_skip_handler *skip, upb_exit_handler *exit,
- void *srcclosure) {
- d->handlers = h;
- upb_handlers_ref(h);
- for (int i = 0; i < h->msgs_len; i++) {
- upb_mhandlers *m = h->msgs[i];
- upb_inttable_compact(&m->fieldtab);
- }
- d->stack[0].f = &toplevel_f;
- d->limit = &d->stack[UPB_MAX_NESTING];
- d->skip = skip;
- d->exit = exit;
- d->srcclosure = srcclosure;
- upb_status_init(&d->status);
-}
-
-upb_dispatcher_frame *upb_dispatcher_reset(upb_dispatcher *d, void *closure) {
- d->msgent = d->handlers->msgs[0];
- d->dispatch_table = &d->msgent->fieldtab;
- d->top = d->stack;
- d->top->closure = closure;
- d->top->is_sequence = false;
- return d->top;
-}
-
-void upb_dispatcher_uninit(upb_dispatcher *d) {
- upb_handlers_unref(d->handlers);
- upb_status_uninit(&d->status);
-}
-
-void upb_dispatch_startmsg(upb_dispatcher *d) {
- upb_flow_t flow = UPB_CONTINUE;
- if (d->msgent->startmsg) d->msgent->startmsg(d->top->closure);
- if (flow != UPB_CONTINUE) _upb_dispatcher_unwind(d, flow);
-}
-
-void upb_dispatch_endmsg(upb_dispatcher *d, upb_status *status) {
- assert(d->top == d->stack);
- if (d->msgent->endmsg) d->msgent->endmsg(d->top->closure, &d->status);
- // TODO: should we avoid this copy by passing client's status obj to cbs?
- upb_status_copy(status, &d->status);
-}
-
-void indent(upb_dispatcher *d) {
- for (int i = 0; i < (d->top - d->stack); i++) fprintf(stderr, " ");
-}
-
-void indentm1(upb_dispatcher *d) {
- for (int i = 0; i < (d->top - d->stack - 1); i++) fprintf(stderr, " ");
-}
-
-upb_dispatcher_frame *upb_dispatch_startseq(upb_dispatcher *d,
- upb_fhandlers *f) {
- //indent(d);
- //fprintf(stderr, "START SEQ: %d\n", f->number);
- if((d->top+1) >= d->limit) {
- upb_status_setf(&d->status, UPB_ERROR, "Nesting too deep.");
- _upb_dispatcher_unwind(d, UPB_BREAK);
- return d->top; // Dummy.
- }
-
- upb_sflow_t sflow = UPB_CONTINUE_WITH(d->top->closure);
- if (f->startseq) sflow = f->startseq(d->top->closure, f->fval);
- if (sflow.flow != UPB_CONTINUE) {
- _upb_dispatcher_unwind(d, sflow.flow);
- return d->top; // Dummy.
- }
-
- ++d->top;
- d->top->f = f;
- d->top->is_sequence = true;
- d->top->closure = sflow.closure;
- return d->top;
-}
-
-upb_dispatcher_frame *upb_dispatch_endseq(upb_dispatcher *d) {
- //indentm1(d);
- //fprintf(stderr, "END SEQ\n");
- assert(d->top > d->stack);
- assert(d->top->is_sequence);
- upb_fhandlers *f = d->top->f;
- --d->top;
- upb_flow_t flow = UPB_CONTINUE;
- if (f->endseq) flow = f->endseq(d->top->closure, f->fval);
- if (flow != UPB_CONTINUE) {
- printf("YO, UNWINDING!\n");
- _upb_dispatcher_unwind(d, flow);
- return d->top; // Dummy.
- }
- d->msgent = d->top->f->submsg ? d->top->f->submsg : d->handlers->msgs[0];
- d->dispatch_table = &d->msgent->fieldtab;
- return d->top;
-}
-
-upb_dispatcher_frame *upb_dispatch_startsubmsg(upb_dispatcher *d,
- upb_fhandlers *f) {
- //indent(d);
- //fprintf(stderr, "START SUBMSG: %d\n", f->number);
- if((d->top+1) >= d->limit) {
- upb_status_setf(&d->status, UPB_ERROR, "Nesting too deep.");
- _upb_dispatcher_unwind(d, UPB_BREAK);
- return d->top; // Dummy.
- }
-
- upb_sflow_t sflow = UPB_CONTINUE_WITH(d->top->closure);
- if (f->startsubmsg) sflow = f->startsubmsg(d->top->closure, f->fval);
- if (sflow.flow != UPB_CONTINUE) {
- _upb_dispatcher_unwind(d, sflow.flow);
- return d->top; // Dummy.
- }
-
- ++d->top;
- d->top->f = f;
- d->top->is_sequence = false;
- d->top->closure = sflow.closure;
- d->msgent = f->submsg;
- d->dispatch_table = &d->msgent->fieldtab;
- upb_dispatch_startmsg(d);
- return d->top;
-}
-
-upb_dispatcher_frame *upb_dispatch_endsubmsg(upb_dispatcher *d) {
- //indentm1(d);
- //fprintf(stderr, "END SUBMSG\n");
- assert(d->top > d->stack);
- assert(!d->top->is_sequence);
- upb_fhandlers *f = d->top->f;
- if (d->msgent->endmsg) d->msgent->endmsg(d->top->closure, &d->status);
- d->msgent = d->top->f->msg;
- d->dispatch_table = &d->msgent->fieldtab;
- --d->top;
- upb_flow_t flow = UPB_CONTINUE;
- if (f->endsubmsg) f->endsubmsg(d->top->closure, f->fval);
- if (flow != UPB_CONTINUE) _upb_dispatcher_unwind(d, flow);
- return d->top;
-}
-
-bool upb_dispatcher_stackempty(upb_dispatcher *d) {
- return d->top == d->stack;
-}
-
-void _upb_dispatcher_unwind(upb_dispatcher *d, upb_flow_t flow) {
- upb_dispatcher_frame *frame = d->top;
- while (1) {
- frame->f->submsg->endmsg(frame->closure, &d->status);
- frame->f->endsubmsg(frame->closure, frame->f->fval);
- --frame;
- if (frame < d->stack) { d->exit(d->srcclosure); return; }
- d->top = frame;
- if (flow == UPB_SKIPSUBMSG) return;
- }
-}
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback