/home/dcp1990/prog/fakedbfs/include/fakedbfs/query.h

Go to the documentation of this file.

/*
 * Copyright (c) 2005, Dan Ponte
 *
 * query.h - query opcodes and such
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */
/* $Amigan: fakedbfs/include/fakedbfs/query.h,v 1.19 2006/04/19 19:58:22 dcp1990 Exp $ */
#ifndef HAVE_QUERY_H
#define HAVE_QUERY_H 1
#ifndef HAVE_DBSPECDATA_H
#include <fakedbfs/dbspecdata.h>
#endif
#include <fakedbfs/fdbfsregex.h>

/* See doc/QUERY_OPCODES for how these are used */
#define OP_BEGINQ       0x1
#define OP_SETCAT       0x2
#define OP_BEGIN_GRP    0x3
#define OP_CLOSE_GRP    0x4
#define OPL_AND         0x5
#define OPL_OR          0x6
#define OPL_NOT         0x7
#define OPL_EQUAL       0x8
#define OP_COLNAME      0x9
#define OP_STRING       0xA
#define OP_INT          0xB
#define OP_UINT         0xC
#define OP_VOID         0xD
#define OP_FLOAT        0xE
#define OP_PUSH         0xF
#define OP_POP          0x10
#define OP_ENDQ         0x11
#define OP_SELCN        0x12
#define OP_REGEXP       0x13
#define OP_NULL         0x14
#define OPL_NEQU        0x15
#define OPL_GTHAN       0x16
#define OPL_LTHAN       0x17
#define OPL_GTHEQU      0x18
#define OPL_LTHEQU      0x19
#define OP_NOTREGEXP    0x1A

#define USED_O1         0x1
#define USED_O2         0x2
#define USED_O3         0x4
#define US_DYNA         0x8 /* free free(3) o3 if set */
#define US_FILE         0xF /* mmap or whatever */

#define Q_FINISHED 0x1
#define Q_NEXT 0x2
#define Q_INST_AFTER_END 0x3
#define Q_UNBALANCED_GROUP 0x4
#define Q_INVALID_O1 0x5
#define Q_INVALID_O2 0x6
#define Q_INVALID_O3 0x7
#define Q_STEP_ON_UNINIT 0x8
#define Q_MISSING_OPERAND 0x9
#define Q_CATALOGUE_NOT_SET 0xA
#define Q_OPERATION_WITHOUT_OPERANDS 0xB
#define Q_DOUBLE_OPERAND 0xC
#define Q_FDBFS_ERROR 0xD /* check q->f->error.emsg */
#define Q_NO_COLUMNS 0xE
#define Q_NO_SUCH_CAT 0xF
#define Q_NO_SUCH_CELEM 0x10
#define Q_STACK_FULL 0x11
#define Q_UNKNOWNSTATE 0xFF

typedef struct {
        int o1;
        unsigned int o2;
        void *o3;
        int used;
} operands_t;

typedef struct Inst {
        int opcode;
        operands_t ops;
        struct Inst *next;
        struct Inst *last;
} inst_t;

typedef struct Result {
        struct Field *fld;
        struct Result *next; /* for your convenience; none of libfakedbfs' functions use this */
} result_t;

enum estate {
        init = 0, /* not started yet */
        more, /* more rows waiting */
        finished /* done; reset state and set to init */
};

typedef struct {
        operands_t *stackbase, *top, *csp;
        size_t stacksize; /* int number of elements, not bytes */
        size_t items;
        fdbfs_t *f;
        inst_t *insthead;
        inst_t *lastinst;
        short int error;
        char *yytext;
        /* state info */
        short int allcols;
        char *catalogue;
        enum estate exec_state;
        sqlite3_stmt *cst;
        struct CatalogueHead *ourcat; /* our paticular one */
        struct CatalogueHead *cath;
        struct EnumHead *enumh;
} query_t;

typedef struct {
        freg_t *re;
        char *colname;
        char *tregex;
} qreg_t;

query_t* fdbfs_query_new(fdbfs_t *f, size_t stacksize);

void fdbfs_query_destroy(query_t *q);

int fdbfs_query_qi(query_t *q, int opcode, int op1, unsigned int op2, void *op3, int used);

int fdbfs_query_qne(query_t *q);

int fdbfs_query_step(query_t *q);

int fdbfs_query_init_exec(query_t *q);


int fdbfs_query_spush(query_t *q, int o1, unsigned int o2, void *o3, int used);

int fdbfs_query_spop(query_t *q, operands_t *bf);

int fdbfs_query_pop1(query_t *q, int *o1);

int fdbfs_query_pop2(query_t *q, unsigned int *o2);

int fdbfs_query_pop3(query_t *q, void **o3);

int fdbfs_query_push1(query_t *q, int o1);

int fdbfs_query_push2(query_t *q, unsigned int o2);

int fdbfs_query_push3(query_t *q, void *o3); /* we could use macros for push*(), but oh well */

qreg_t* fdbfs_qreg_compile(const char *regex, int case_insens, char **errmsg);

void fdbfs_qreg_destroy(qreg_t *q);

void* fdbfs_query_read_file(fdbfs_t *f, const char *fn);

int fdbfs_query_parse(query_t *q, const char *qstr);

int fdbfs_query_qtok(char **cp, int *tval, Toke *toke, char *ctok /* MUST be a buffer at least 512b long */);

void fdbfs_db_regex_func(sqlite3_context *ctx, int i, sqlite3_value **sqval);

const char* fdbfs_query_error(int rc);

#endif

---