mirror of
https://git.postgresql.org/git/postgresql.git
synced 2024-08-22 10:13:24 +02:00
Because of gcc -Wmissing-prototypes, all functions in dynamically loadable modules must have a separate prototype declaration. This is meant to detect global functions that are not declared in header files, but in cases where the function is called via dfmgr, this is redundant. Besides filling up space with boilerplate, this is a frequent source of compiler warnings in extension modules. We can fix that by creating the function prototype as part of the PG_FUNCTION_INFO_V1 macro, which such modules have to use anyway. That makes the code of modules cleaner, because there is one less place where the entry points have to be listed, and creates an additional check that functions have the right prototype. Remove now redundant prototypes from contrib and other modules.
130 lines
2.6 KiB
C
130 lines
2.6 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* test_parser.c
|
|
* Simple example of a text search parser
|
|
*
|
|
* Copyright (c) 2007-2014, PostgreSQL Global Development Group
|
|
*
|
|
* IDENTIFICATION
|
|
* contrib/test_parser/test_parser.c
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#include "postgres.h"
|
|
|
|
#include "fmgr.h"
|
|
|
|
PG_MODULE_MAGIC;
|
|
|
|
|
|
/*
|
|
* types
|
|
*/
|
|
|
|
/* self-defined type */
|
|
typedef struct
|
|
{
|
|
char *buffer; /* text to parse */
|
|
int len; /* length of the text in buffer */
|
|
int pos; /* position of the parser */
|
|
} ParserState;
|
|
|
|
/* copy-paste from wparser.h of tsearch2 */
|
|
typedef struct
|
|
{
|
|
int lexid;
|
|
char *alias;
|
|
char *descr;
|
|
} LexDescr;
|
|
|
|
/*
|
|
* functions
|
|
*/
|
|
PG_FUNCTION_INFO_V1(testprs_start);
|
|
PG_FUNCTION_INFO_V1(testprs_getlexeme);
|
|
PG_FUNCTION_INFO_V1(testprs_end);
|
|
PG_FUNCTION_INFO_V1(testprs_lextype);
|
|
|
|
Datum
|
|
testprs_start(PG_FUNCTION_ARGS)
|
|
{
|
|
ParserState *pst = (ParserState *) palloc0(sizeof(ParserState));
|
|
|
|
pst->buffer = (char *) PG_GETARG_POINTER(0);
|
|
pst->len = PG_GETARG_INT32(1);
|
|
pst->pos = 0;
|
|
|
|
PG_RETURN_POINTER(pst);
|
|
}
|
|
|
|
Datum
|
|
testprs_getlexeme(PG_FUNCTION_ARGS)
|
|
{
|
|
ParserState *pst = (ParserState *) PG_GETARG_POINTER(0);
|
|
char **t = (char **) PG_GETARG_POINTER(1);
|
|
int *tlen = (int *) PG_GETARG_POINTER(2);
|
|
int startpos = pst->pos;
|
|
int type;
|
|
|
|
*t = pst->buffer + pst->pos;
|
|
|
|
if (pst->pos < pst->len &&
|
|
(pst->buffer)[pst->pos] == ' ')
|
|
{
|
|
/* blank type */
|
|
type = 12;
|
|
/* go to the next non-space character */
|
|
while (pst->pos < pst->len &&
|
|
(pst->buffer)[pst->pos] == ' ')
|
|
(pst->pos)++;
|
|
}
|
|
else
|
|
{
|
|
/* word type */
|
|
type = 3;
|
|
/* go to the next space character */
|
|
while (pst->pos < pst->len &&
|
|
(pst->buffer)[pst->pos] != ' ')
|
|
(pst->pos)++;
|
|
}
|
|
|
|
*tlen = pst->pos - startpos;
|
|
|
|
/* we are finished if (*tlen == 0) */
|
|
if (*tlen == 0)
|
|
type = 0;
|
|
|
|
PG_RETURN_INT32(type);
|
|
}
|
|
|
|
Datum
|
|
testprs_end(PG_FUNCTION_ARGS)
|
|
{
|
|
ParserState *pst = (ParserState *) PG_GETARG_POINTER(0);
|
|
|
|
pfree(pst);
|
|
PG_RETURN_VOID();
|
|
}
|
|
|
|
Datum
|
|
testprs_lextype(PG_FUNCTION_ARGS)
|
|
{
|
|
/*
|
|
* Remarks: - we have to return the blanks for headline reason - we use
|
|
* the same lexids like Teodor in the default word parser; in this way we
|
|
* can reuse the headline function of the default word parser.
|
|
*/
|
|
LexDescr *descr = (LexDescr *) palloc(sizeof(LexDescr) * (2 + 1));
|
|
|
|
/* there are only two types in this parser */
|
|
descr[0].lexid = 3;
|
|
descr[0].alias = pstrdup("word");
|
|
descr[0].descr = pstrdup("Word");
|
|
descr[1].lexid = 12;
|
|
descr[1].alias = pstrdup("blank");
|
|
descr[1].descr = pstrdup("Space symbols");
|
|
descr[2].lexid = 0;
|
|
|
|
PG_RETURN_POINTER(descr);
|
|
}
|