| 1 |
/* |
| 2 |
* integrate swish-e into PostgreSQL |
| 3 |
* |
| 4 |
* Dobrica Pavlinusic <dpavlin@rot13.org> 2005-02-18 |
| 5 |
* |
| 6 |
* TODO: |
| 7 |
* - check null input using PG_ARGISNULL before using PG_GETARG_xxxx |
| 8 |
* - support composite type arguments |
| 9 |
* |
| 10 |
* NOTES: |
| 11 |
* - clear structures with memset to support hash indexes (who whould like |
| 12 |
* to create hash index on table returned from function?) |
| 13 |
* - number of returned rows is set by PostgreSQL evaluator, see: |
| 14 |
* http://archives.postgresql.org/pgsql-hackers/2005-02/msg00546.php |
| 15 |
* |
| 16 |
* Based on: |
| 17 |
* - C example from PostgreSQL documentation (BSD licence) |
| 18 |
* - swish-e example src/libtest.c (GPL) |
| 19 |
* - _textin/_textout from pgcurl.c (LGPL) |
| 20 |
* |
| 21 |
* This code is licenced under GPL |
| 22 |
*/ |
| 23 |
|
| 24 |
#include "postgres.h" |
| 25 |
#include "fmgr.h" |
| 26 |
#include "funcapi.h" |
| 27 |
#include "utils/builtins.h" |
| 28 |
#include <swish-e.h> |
| 29 |
|
| 30 |
#define _textin(str) DirectFunctionCall1(textin, CStringGetDatum(str)) |
| 31 |
#define _textout(str) DatumGetPointer(DirectFunctionCall1(textout, PointerGetDatum(str))) |
| 32 |
#define GET_STR(textp) DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(textp))) |
| 33 |
#define GET_TEXT(cstrp) DatumGetTextP(DirectFunctionCall1(textin, CStringGetDatum(cstrp))) |
| 34 |
|
| 35 |
|
| 36 |
SW_HANDLE swish_handle = NULL;/* Database handle */ |
| 37 |
SW_SEARCH search = NULL; /* search handle -- holds search parameters */ |
| 38 |
SW_RESULTS swish_results = NULL; /* results handle -- holds list of results */ |
| 39 |
|
| 40 |
/* define PostgreSQL v1 function */ |
| 41 |
PG_FUNCTION_INFO_V1(pgswish); |
| 42 |
Datum pgswish(PG_FUNCTION_ARGS) { |
| 43 |
|
| 44 |
FuncCallContext *funcctx; |
| 45 |
int call_cntr; |
| 46 |
int max_calls; |
| 47 |
TupleDesc tupdesc; |
| 48 |
TupleTableSlot *slot; |
| 49 |
AttInMetadata *attinmeta; |
| 50 |
char *index_path; |
| 51 |
char *query; |
| 52 |
|
| 53 |
/* stuff done only on the first call of the function */ |
| 54 |
if (SRF_IS_FIRSTCALL()) { |
| 55 |
MemoryContext oldcontext; |
| 56 |
|
| 57 |
/* take arguments from function */ |
| 58 |
//index_path = _textout(PG_GETARG_TEXT_P(0)); |
| 59 |
index_path = _textout(PG_GETARG_TEXT_P(0)); |
| 60 |
query = _textout(PG_GETARG_TEXT_P(1)); |
| 61 |
|
| 62 |
/* create a function context for cross-call persistence */ |
| 63 |
funcctx = SRF_FIRSTCALL_INIT(); |
| 64 |
|
| 65 |
/* switch to memory context appropriate for multiple function calls */ |
| 66 |
oldcontext = MemoryContextSwitchTo(funcctx->multi_call_memory_ctx); |
| 67 |
|
| 68 |
|
| 69 |
/* Send any errors or warnings to stderr (default is stdout) */ |
| 70 |
SwishErrorsToStderr(); |
| 71 |
|
| 72 |
elog(INFO, "pgswish: SwishInit(%s)", index_path); |
| 73 |
|
| 74 |
swish_handle = SwishInit( index_path ); |
| 75 |
|
| 76 |
if (! swish_handle) { |
| 77 |
elog(ERROR, "pgswish: can't open %s", index_path); |
| 78 |
SRF_RETURN_DONE(funcctx); |
| 79 |
} |
| 80 |
|
| 81 |
error_or_abort( swish_handle ); |
| 82 |
/* set ranking scheme. default is 0 */ |
| 83 |
SwishRankScheme( swish_handle, 0 ); |
| 84 |
error_or_abort( swish_handle ); |
| 85 |
|
| 86 |
elog(INFO, "pgswish: SwishQuery(%s)", query); |
| 87 |
/* Here's a short-cut to searching that creates a search object and searches at the same time */ |
| 88 |
swish_results = SwishQuery( swish_handle, query); |
| 89 |
error_or_abort( swish_handle ); |
| 90 |
|
| 91 |
/* total number of tuples to be returned */ |
| 92 |
funcctx->max_calls = SwishHits( swish_results ); |
| 93 |
|
| 94 |
/* check if results exists */ |
| 95 |
if ( 0 == funcctx->max_calls ) |
| 96 |
elog(INFO, "no results for: %s", query ); |
| 97 |
|
| 98 |
elog(INFO, "pgswish: SwishHits = %d", funcctx->max_calls); |
| 99 |
|
| 100 |
/* Build a tuple description for a __pgswish tuple */ |
| 101 |
tupdesc = RelationNameGetTupleDesc("__pgswish"); |
| 102 |
|
| 103 |
/* allocate a slot for a tuple with this tupdesc */ |
| 104 |
slot = TupleDescGetSlot(tupdesc); |
| 105 |
|
| 106 |
/* assign slot to function context */ |
| 107 |
funcctx->slot = slot; |
| 108 |
|
| 109 |
/* |
| 110 |
* generate attribute metadata needed later to produce tuples from raw |
| 111 |
* C strings |
| 112 |
*/ |
| 113 |
attinmeta = TupleDescGetAttInMetadata(tupdesc); |
| 114 |
funcctx->attinmeta = attinmeta; |
| 115 |
|
| 116 |
MemoryContextSwitchTo(oldcontext); |
| 117 |
|
| 118 |
elog(INFO, "SRF_IS_FIRSTCALL done"); |
| 119 |
} |
| 120 |
|
| 121 |
/* stuff done on every call of the function */ |
| 122 |
funcctx = SRF_PERCALL_SETUP(); |
| 123 |
|
| 124 |
call_cntr = funcctx->call_cntr; |
| 125 |
max_calls = funcctx->max_calls; |
| 126 |
slot = funcctx->slot; |
| 127 |
attinmeta = funcctx->attinmeta; |
| 128 |
|
| 129 |
if (call_cntr < max_calls) { |
| 130 |
char **values; |
| 131 |
HeapTuple tuple; |
| 132 |
Datum result; |
| 133 |
SW_RESULT *sw_res; /* one row from swish-e results */ |
| 134 |
|
| 135 |
elog(INFO, "pgswish: loop count %d", call_cntr); |
| 136 |
|
| 137 |
if (! swish_results) { |
| 138 |
elog(ERROR, "pgswish: no swish-e results"); |
| 139 |
SRF_RETURN_DONE(funcctx); |
| 140 |
} |
| 141 |
|
| 142 |
elog(INFO, "pgswish: check for swish-e error"); |
| 143 |
error_or_abort( swish_handle ); |
| 144 |
|
| 145 |
/* |
| 146 |
* Prepare a values array for storage in our slot. |
| 147 |
* This should be an array of C strings which will |
| 148 |
* be processed later by the type input functions. |
| 149 |
*/ |
| 150 |
|
| 151 |
sw_res = SwishNextResult( swish_results ); |
| 152 |
if (! sw_res) { |
| 153 |
elog(ERROR, "pgswish: swish-e sort result list: %d rows expected %d", call_cntr, max_calls - 1); |
| 154 |
SRF_RETURN_DONE(funcctx); |
| 155 |
} |
| 156 |
|
| 157 |
elog(INFO, "Path: %s\n Rank: %lu\n Size: %lu\n Title: %s\n Index: %s\n Modified: %s\n Record #: %lu\n File #: %lu\n\n", |
| 158 |
SwishResultPropertyStr ( sw_res, "swishdocpath" ), |
| 159 |
SwishResultPropertyULong ( sw_res, "swishrank" ), |
| 160 |
SwishResultPropertyULong ( sw_res, "swishdocsize" ), |
| 161 |
SwishResultPropertyStr ( sw_res, "swishtitle"), |
| 162 |
SwishResultPropertyStr ( sw_res, "swishdbfile" ), |
| 163 |
SwishResultPropertyStr ( sw_res, "swishlastmodified" ), |
| 164 |
SwishResultPropertyULong ( sw_res, "swishreccount" ), /* can figure this out in loop, of course */ |
| 165 |
SwishResultPropertyULong ( sw_res, "swishfilenum" ) |
| 166 |
); |
| 167 |
|
| 168 |
values = (char **) palloc(4 * sizeof(char *)); |
| 169 |
|
| 170 |
values[0] = prop2int( sw_res, "swishrank" ); |
| 171 |
values[1] = prop2text( sw_res, "swishdocpath" ); |
| 172 |
values[2] = prop2text( sw_res, "swishtitle" ); |
| 173 |
values[3] = prop2int( sw_res, "swishdocsize" ); |
| 174 |
|
| 175 |
/* |
| 176 |
values[0] = (char *) palloc(16 * sizeof(char)); |
| 177 |
snprintf(values[0], 16, "%d", 1); |
| 178 |
values[1] = (char *) palloc(16 * sizeof(char)); |
| 179 |
snprintf(values[1], 16, "%d", 2); |
| 180 |
values[2] = (char *) palloc(16 * sizeof(char)); |
| 181 |
snprintf(values[2], 16, "%d", 3); |
| 182 |
values[3] = (char *) palloc(16 * sizeof(char)); |
| 183 |
snprintf(values[3], 16, "%d", 4); |
| 184 |
*/ |
| 185 |
|
| 186 |
/* build a tuple */ |
| 187 |
tuple = BuildTupleFromCStrings(attinmeta, values); |
| 188 |
|
| 189 |
/* make the tuple into a datum */ |
| 190 |
result = TupleGetDatum(slot, tuple); |
| 191 |
|
| 192 |
/* clean up ? */ |
| 193 |
pfree(values[0]); |
| 194 |
pfree(values[1]); |
| 195 |
pfree(values[2]); |
| 196 |
pfree(values[3]); |
| 197 |
pfree(values); |
| 198 |
|
| 199 |
elog(INFO, "row: %s|%s|%s|%s",values[0],values[1],values[2],values[3]); |
| 200 |
|
| 201 |
SRF_RETURN_NEXT(funcctx, result); |
| 202 |
} else { |
| 203 |
elog(INFO, "loop over"); |
| 204 |
|
| 205 |
/* free swish object and close */ |
| 206 |
Free_Search_Object( search ); |
| 207 |
SwishClose( swish_handle ); |
| 208 |
|
| 209 |
/* do when there is no more left */ |
| 210 |
SRF_RETURN_DONE(funcctx); |
| 211 |
} |
| 212 |
} |
| 213 |
|
| 214 |
/* |
| 215 |
* elog errors |
| 216 |
* |
| 217 |
*/ |
| 218 |
|
| 219 |
char *prop2text(SW_RESULT sw_res, char *propname) { |
| 220 |
char *val; |
| 221 |
char *prop; |
| 222 |
int len; |
| 223 |
|
| 224 |
elog(INFO, "prop2text(%s)", propname); |
| 225 |
|
| 226 |
prop = SwishResultPropertyStr( sw_res, propname ); |
| 227 |
error_or_abort( swish_handle ); |
| 228 |
|
| 229 |
len = strlen(prop); |
| 230 |
elog(INFO, "prop2text(%s) = '%s' %d bytes", propname, prop, len); |
| 231 |
|
| 232 |
len++; |
| 233 |
len *= sizeof(char); |
| 234 |
|
| 235 |
elog(INFO, "palloc(%d)", len); |
| 236 |
|
| 237 |
val = palloc(len); |
| 238 |
|
| 239 |
memset(val, 0, len); |
| 240 |
strncpy(val, prop, len); |
| 241 |
|
| 242 |
elog(INFO, "val=%s", val); |
| 243 |
|
| 244 |
return val; |
| 245 |
} |
| 246 |
|
| 247 |
char *prop2int(SW_RESULT sw_res, char *propname) { |
| 248 |
char *val; |
| 249 |
unsigned long prop; |
| 250 |
int len; |
| 251 |
|
| 252 |
elog(INFO, "prop2int(%s)", propname); |
| 253 |
|
| 254 |
prop = SwishResultPropertyULong( sw_res, propname ); |
| 255 |
error_or_abort( swish_handle ); |
| 256 |
|
| 257 |
elog(INFO, "prop2int(%s) = %lu", propname, prop); |
| 258 |
|
| 259 |
len = 128 * sizeof(char); |
| 260 |
elog(INFO, "palloc(%d)", len); |
| 261 |
|
| 262 |
val = palloc(len); |
| 263 |
memset(val, 0, len); |
| 264 |
|
| 265 |
snprintf(val, len, "%lu", prop); |
| 266 |
|
| 267 |
elog(INFO, "val=%s", val); |
| 268 |
|
| 269 |
return val; |
| 270 |
} |
| 271 |
|
| 272 |
|
| 273 |
static void error_or_abort( SW_HANDLE swish_handle ) { |
| 274 |
if ( !SwishError( swish_handle ) ) |
| 275 |
return; |
| 276 |
|
| 277 |
/* print a message */ |
| 278 |
elog(ERROR, |
| 279 |
"pgswish error: Number [%d], Type [%s], Optional Message: [%s]\n", |
| 280 |
SwishError( swish_handle ), |
| 281 |
SwishErrorString( swish_handle ), |
| 282 |
SwishLastErrorMsg( swish_handle ) |
| 283 |
); |
| 284 |
if ( search ) Free_Search_Object( search ); |
| 285 |
SwishClose( swish_handle ); |
| 286 |
|
| 287 |
/* do when there is no more left */ |
| 288 |
} |
| 289 |
|
Parent Directory
| 
Revision Log