mirror of
https://github.com/postgres/postgres.git
synced 2025-04-27 22:56:53 +03:00
978de9d06d
- change the alignment requirement of lexemes in TSVector slightly. Lexeme strings were always padded to 2-byte aligned length to make sure that if there's position array (uint16[]) it has the right alignment. The patch changes that so that the padding is not done when there's no positions. That makes the storage of tsvectors without positions slightly more compact. - added some #include "miscadmin.h" lines I missed in the earlier when I added calls to check_stack_depth(). - Reimplement the send/recv functions, and added a comment above them describing the on-wire format. The CRC is now recalculated in tsquery as well per previous discussion.
384 lines
7.8 KiB
C
384 lines
7.8 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* tsquery_util.c
|
|
* Utilities for tsquery datatype
|
|
*
|
|
* Portions Copyright (c) 1996-2007, PostgreSQL Global Development Group
|
|
*
|
|
*
|
|
* IDENTIFICATION
|
|
* $PostgreSQL: pgsql/src/backend/utils/adt/tsquery_util.c,v 1.4 2007/09/07 16:03:40 teodor Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
|
|
#include "postgres.h"
|
|
|
|
#include "tsearch/ts_type.h"
|
|
#include "tsearch/ts_utils.h"
|
|
#include "miscadmin.h"
|
|
|
|
QTNode *
|
|
QT2QTN(QueryItem * in, char *operand)
|
|
{
|
|
QTNode *node = (QTNode *) palloc0(sizeof(QTNode));
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
node->valnode = in;
|
|
|
|
if (in->type == QI_OPR)
|
|
{
|
|
node->child = (QTNode **) palloc0(sizeof(QTNode *) * 2);
|
|
node->child[0] = QT2QTN(in + 1, operand);
|
|
node->sign = node->child[0]->sign;
|
|
if (in->operator.oper == OP_NOT)
|
|
node->nchild = 1;
|
|
else
|
|
{
|
|
node->nchild = 2;
|
|
node->child[1] = QT2QTN(in + in->operator.left, operand);
|
|
node->sign |= node->child[1]->sign;
|
|
}
|
|
}
|
|
else if (operand)
|
|
{
|
|
node->word = operand + in->operand.distance;
|
|
node->sign = 1 << (in->operand.valcrc % 32);
|
|
}
|
|
|
|
return node;
|
|
}
|
|
|
|
void
|
|
QTNFree(QTNode * in)
|
|
{
|
|
if (!in)
|
|
return;
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (in->valnode->type == QI_VAL && in->word && (in->flags & QTN_WORDFREE) != 0)
|
|
pfree(in->word);
|
|
|
|
if (in->child)
|
|
{
|
|
if (in->valnode)
|
|
{
|
|
if (in->valnode->type == QI_OPR && in->nchild > 0)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
QTNFree(in->child[i]);
|
|
}
|
|
if (in->flags & QTN_NEEDFREE)
|
|
pfree(in->valnode);
|
|
}
|
|
pfree(in->child);
|
|
}
|
|
|
|
pfree(in);
|
|
}
|
|
|
|
int
|
|
QTNodeCompare(QTNode * an, QTNode * bn)
|
|
{
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (an->valnode->type != bn->valnode->type)
|
|
return (an->valnode->type > bn->valnode->type) ? -1 : 1;
|
|
|
|
if (an->valnode->type == QI_OPR)
|
|
{
|
|
QueryOperator *ao = &an->valnode->operator;
|
|
QueryOperator *bo = &bn->valnode->operator;
|
|
|
|
if(ao->oper != bo->oper)
|
|
return (ao->oper > bo->oper) ? -1 : 1;
|
|
|
|
if (an->nchild != bn->nchild)
|
|
return (an->nchild > bn->nchild) ? -1 : 1;
|
|
|
|
{
|
|
int i,
|
|
res;
|
|
|
|
for (i = 0; i < an->nchild; i++)
|
|
if ((res = QTNodeCompare(an->child[i], bn->child[i])) != 0)
|
|
return res;
|
|
}
|
|
return 0;
|
|
}
|
|
else
|
|
{
|
|
QueryOperand *ao = &an->valnode->operand;
|
|
QueryOperand *bo = &bn->valnode->operand;
|
|
|
|
Assert(an->valnode->type == QI_VAL);
|
|
|
|
if (ao->valcrc != bo->valcrc)
|
|
{
|
|
return (ao->valcrc > bo->valcrc) ? -1 : 1;
|
|
}
|
|
|
|
if (ao->length == bo->length)
|
|
return strncmp(an->word, bn->word, ao->length);
|
|
else
|
|
return (ao->length > bo->length) ? -1 : 1;
|
|
}
|
|
}
|
|
|
|
static int
|
|
cmpQTN(const void *a, const void *b)
|
|
{
|
|
return QTNodeCompare(*(QTNode **) a, *(QTNode **) b);
|
|
}
|
|
|
|
void
|
|
QTNSort(QTNode * in)
|
|
{
|
|
int i;
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (in->valnode->type != QI_OPR)
|
|
return;
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
QTNSort(in->child[i]);
|
|
if (in->nchild > 1)
|
|
qsort((void *) in->child, in->nchild, sizeof(QTNode *), cmpQTN);
|
|
}
|
|
|
|
bool
|
|
QTNEq(QTNode * a, QTNode * b)
|
|
{
|
|
uint32 sign = a->sign & b->sign;
|
|
|
|
if (!(sign == a->sign && sign == b->sign))
|
|
return 0;
|
|
|
|
return (QTNodeCompare(a, b) == 0) ? true : false;
|
|
}
|
|
|
|
/*
|
|
* Remove unnecessary intermediate nodes. For example:
|
|
*
|
|
* OR OR
|
|
* a OR -> a b c
|
|
* b c
|
|
*/
|
|
void
|
|
QTNTernary(QTNode * in)
|
|
{
|
|
int i;
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (in->valnode->type != QI_OPR)
|
|
return;
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
QTNTernary(in->child[i]);
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
{
|
|
QTNode *cc = in->child[i];
|
|
|
|
if (cc->valnode->type == QI_OPR && in->valnode->operator.oper == cc->valnode->operator.oper)
|
|
{
|
|
int oldnchild = in->nchild;
|
|
|
|
in->nchild += cc->nchild - 1;
|
|
in->child = (QTNode **) repalloc(in->child, in->nchild * sizeof(QTNode *));
|
|
|
|
if (i + 1 != oldnchild)
|
|
memmove(in->child + i + cc->nchild, in->child + i + 1,
|
|
(oldnchild - i - 1) * sizeof(QTNode *));
|
|
|
|
memcpy(in->child + i, cc->child, cc->nchild * sizeof(QTNode *));
|
|
i += cc->nchild - 1;
|
|
|
|
if(cc->flags & QTN_NEEDFREE)
|
|
pfree(cc->valnode);
|
|
pfree(cc);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Convert a tree to binary tree by inserting intermediate nodes.
|
|
* (Opposite of QTNTernary)
|
|
*/
|
|
void
|
|
QTNBinary(QTNode * in)
|
|
{
|
|
int i;
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (in->valnode->type != QI_OPR)
|
|
return;
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
QTNBinary(in->child[i]);
|
|
|
|
if (in->nchild <= 2)
|
|
return;
|
|
|
|
while (in->nchild > 2)
|
|
{
|
|
QTNode *nn = (QTNode *) palloc0(sizeof(QTNode));
|
|
|
|
nn->valnode = (QueryItem *) palloc0(sizeof(QueryItem));
|
|
nn->child = (QTNode **) palloc0(sizeof(QTNode *) * 2);
|
|
|
|
nn->nchild = 2;
|
|
nn->flags = QTN_NEEDFREE;
|
|
|
|
nn->child[0] = in->child[0];
|
|
nn->child[1] = in->child[1];
|
|
nn->sign = nn->child[0]->sign | nn->child[1]->sign;
|
|
|
|
nn->valnode->type = in->valnode->type;
|
|
nn->valnode->operator.oper = in->valnode->operator.oper;
|
|
|
|
in->child[0] = nn;
|
|
in->child[1] = in->child[in->nchild - 1];
|
|
in->nchild--;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Count the total length of operand string in tree, including '\0'-
|
|
* terminators.
|
|
*/
|
|
static void
|
|
cntsize(QTNode * in, int *sumlen, int *nnode)
|
|
{
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
*nnode += 1;
|
|
if (in->valnode->type == QI_OPR)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
cntsize(in->child[i], sumlen, nnode);
|
|
}
|
|
else
|
|
{
|
|
*sumlen += in->valnode->operand.length + 1;
|
|
}
|
|
}
|
|
|
|
typedef struct
|
|
{
|
|
QueryItem *curitem;
|
|
char *operand;
|
|
char *curoperand;
|
|
} QTN2QTState;
|
|
|
|
static void
|
|
fillQT(QTN2QTState *state, QTNode *in)
|
|
{
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
if (in->valnode->type == QI_VAL)
|
|
{
|
|
memcpy(state->curitem, in->valnode, sizeof(QueryOperand));
|
|
|
|
memcpy(state->curoperand, in->word, in->valnode->operand.length);
|
|
state->curitem->operand.distance = state->curoperand - state->operand;
|
|
state->curoperand[in->valnode->operand.length] = '\0';
|
|
state->curoperand += in->valnode->operand.length + 1;
|
|
state->curitem++;
|
|
}
|
|
else
|
|
{
|
|
QueryItem *curitem = state->curitem;
|
|
|
|
Assert(in->valnode->type == QI_OPR);
|
|
|
|
memcpy(state->curitem, in->valnode, sizeof(QueryOperator));
|
|
|
|
Assert(in->nchild <= 2);
|
|
state->curitem++;
|
|
|
|
fillQT(state, in->child[0]);
|
|
|
|
if (in->nchild == 2)
|
|
{
|
|
curitem->operator.left = state->curitem - curitem;
|
|
fillQT(state, in->child[1]);
|
|
}
|
|
}
|
|
}
|
|
|
|
TSQuery
|
|
QTN2QT(QTNode *in)
|
|
{
|
|
TSQuery out;
|
|
int len;
|
|
int sumlen = 0,
|
|
nnode = 0;
|
|
QTN2QTState state;
|
|
|
|
cntsize(in, &sumlen, &nnode);
|
|
len = COMPUTESIZE(nnode, sumlen);
|
|
|
|
out = (TSQuery) palloc(len);
|
|
SET_VARSIZE(out, len);
|
|
out->size = nnode;
|
|
|
|
state.curitem = GETQUERY(out);
|
|
state.operand = state.curoperand = GETOPERAND(out);
|
|
|
|
fillQT(&state, in);
|
|
return out;
|
|
}
|
|
|
|
QTNode *
|
|
QTNCopy(QTNode *in)
|
|
{
|
|
QTNode *out;
|
|
|
|
/* since this function recurses, it could be driven to stack overflow. */
|
|
check_stack_depth();
|
|
|
|
out = (QTNode *) palloc(sizeof(QTNode));
|
|
|
|
*out = *in;
|
|
out->valnode = (QueryItem *) palloc(sizeof(QueryItem));
|
|
*(out->valnode) = *(in->valnode);
|
|
out->flags |= QTN_NEEDFREE;
|
|
|
|
if (in->valnode->type == QI_VAL)
|
|
{
|
|
out->word = palloc(in->valnode->operand.length + 1);
|
|
memcpy(out->word, in->word, in->valnode->operand.length);
|
|
out->word[in->valnode->operand.length] = '\0';
|
|
out->flags |= QTN_WORDFREE;
|
|
}
|
|
else
|
|
{
|
|
int i;
|
|
|
|
out->child = (QTNode **) palloc(sizeof(QTNode *) * in->nchild);
|
|
|
|
for (i = 0; i < in->nchild; i++)
|
|
out->child[i] = QTNCopy(in->child[i]);
|
|
}
|
|
|
|
return out;
|
|
}
|