14 |
* |
* |
15 |
* Based on: |
* Based on: |
16 |
* - C example from PostgreSQL documentation (BSD licence) |
* - C example from PostgreSQL documentation (BSD licence) |
17 |
* - example002.c from Hyper Estraier (GPL) |
* - coreexample002.c and nodeexample002.c from Hyper Estraier (GPL) |
18 |
* - _textin/_textout from pgcurl.c (LGPL) |
* - _textin/_textout from pgcurl.c (LGPL) |
19 |
* |
* |
20 |
* This code is licenced under GPL |
* This code is licenced under GPL |
28 |
#include "miscadmin.h" |
#include "miscadmin.h" |
29 |
#include <estraier.h> |
#include <estraier.h> |
30 |
#include <cabin.h> |
#include <cabin.h> |
31 |
|
#include <estnode.h> |
32 |
|
|
33 |
#define _textin(str) DirectFunctionCall1(textin, CStringGetDatum(str)) |
#define _textin(str) DirectFunctionCall1(textin, CStringGetDatum(str)) |
34 |
#define _textout(str) DatumGetPointer(DirectFunctionCall1(textout, PointerGetDatum(str))) |
#define _textout(str) DatumGetPointer(DirectFunctionCall1(textout, PointerGetDatum(str))) |
35 |
#define GET_STR(textp) DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(textp))) |
#define GET_STR(textp) DatumGetCString(DirectFunctionCall1(textout, PointerGetDatum(textp))) |
36 |
#define GET_TEXT(cstrp) DatumGetTextP(DirectFunctionCall1(textin, CStringGetDatum(cstrp))) |
#define GET_TEXT(cstrp) DatumGetTextP(DirectFunctionCall1(textin, CStringGetDatum(cstrp))) |
37 |
|
|
38 |
|
/* SortMem got renamed in PostgreSQL 8.0 */ |
39 |
|
#ifndef SortMem |
40 |
|
#define SortMem 16 * 1024 |
41 |
|
#endif |
42 |
|
|
43 |
|
#define ATTR_DELIMITER "{{!}}" |
44 |
|
|
45 |
/* prototype */ |
/* prototype */ |
46 |
char *attr2text(ESTDOC *doc, char *attr); |
char *attr2text(ESTDOC *doc, char *attr); |
47 |
|
char *node_attr2text(ESTRESDOC *rdoc, char *attr); |
48 |
|
|
49 |
|
|
50 |
/* work in progress */ |
/* work in progress */ |
51 |
PG_FUNCTION_INFO_V1(pgest_attr); |
PG_FUNCTION_INFO_V1(pgest_attr); |
52 |
Datum pgest_attr(PG_FUNCTION_ARGS) |
Datum pgest_attr(PG_FUNCTION_ARGS) |
53 |
{ |
{ |
54 |
ArrayType *attr_arr = PG_GETARG_ARRAYTYPE_P(5); |
ArrayType *attr_arr = PG_GETARG_ARRAYTYPE_P(6); |
55 |
Oid attr_element_type = ARR_ELEMTYPE(attr_arr); |
Oid attr_element_type = ARR_ELEMTYPE(attr_arr); |
56 |
int attr_ndims = ARR_NDIM(attr_arr); |
int attr_ndims = ARR_NDIM(attr_arr); |
57 |
int *attr_dim_counts = ARR_DIMS(attr_arr); |
int *attr_dim_counts = ARR_DIMS(attr_arr); |
85 |
char *index_path; |
char *index_path; |
86 |
char *query; |
char *query; |
87 |
char *attr; |
char *attr; |
88 |
|
char *order; |
89 |
|
|
90 |
|
|
91 |
/* only allow 1D input array */ |
/* only allow 1D input array */ |
148 |
index_path = _textout(PG_GETARG_TEXT_P(0)); |
index_path = _textout(PG_GETARG_TEXT_P(0)); |
149 |
|
|
150 |
/* query string */ |
/* query string */ |
151 |
if (PG_ARGISNULL(0)) { |
if (PG_ARGISNULL(1)) { |
152 |
query = ""; |
query = ""; |
153 |
} else { |
} else { |
154 |
query = _textout(PG_GETARG_TEXT_P(1)); |
query = _textout(PG_GETARG_TEXT_P(1)); |
160 |
} else { |
} else { |
161 |
attr = _textout(PG_GETARG_TEXT_P(2)); |
attr = _textout(PG_GETARG_TEXT_P(2)); |
162 |
} |
} |
163 |
|
|
164 |
|
/* sort order */ |
165 |
|
if (PG_ARGISNULL(3)) { |
166 |
|
order = ""; |
167 |
|
} else { |
168 |
|
order = _textout(PG_GETARG_TEXT_P(3)); |
169 |
|
} |
170 |
|
|
171 |
|
|
172 |
/* limit */ |
/* limit */ |
173 |
if (PG_ARGISNULL(3)) { |
if (PG_ARGISNULL(4)) { |
174 |
limit = 0; |
limit = 0; |
175 |
} else { |
} else { |
176 |
limit = PG_GETARG_INT32(3); |
limit = PG_GETARG_INT32(4); |
177 |
} |
} |
178 |
|
|
179 |
/* offset */ |
/* offset */ |
180 |
if (PG_ARGISNULL(4)) { |
if (PG_ARGISNULL(5)) { |
181 |
offset = 0; |
offset = 0; |
182 |
} else { |
} else { |
183 |
offset = PG_GETARG_INT32(4); |
offset = PG_GETARG_INT32(5); |
184 |
} |
} |
185 |
|
|
186 |
|
|
207 |
|
|
208 |
/* minimum valid attribute length is 10: @a STREQ a */ |
/* minimum valid attribute length is 10: @a STREQ a */ |
209 |
if (! PG_ARGISNULL(2) && strlen(attr) >= 10) { |
if (! PG_ARGISNULL(2) && strlen(attr) >= 10) { |
210 |
elog(DEBUG1,"est_cond_add_attr(%s)", attr); |
elog(DEBUG1,"attributes: %s", attr); |
211 |
est_cond_add_attr(cond, attr); |
char *curr_attr; |
212 |
|
curr_attr = strtok(attr, ATTR_DELIMITER); |
213 |
|
while (curr_attr) { |
214 |
|
elog(DEBUG1,"est_cond_add_attr(%s)", curr_attr); |
215 |
|
est_cond_add_attr(cond, curr_attr); |
216 |
|
curr_attr = strtok(NULL, ATTR_DELIMITER); |
217 |
|
} |
218 |
|
} |
219 |
|
|
220 |
|
/* set the search phrase to the search condition object */ |
221 |
|
if (! PG_ARGISNULL(3) && strlen(order) > 0) { |
222 |
|
elog(DEBUG1,"est_cond_set_order(%s)", order); |
223 |
|
est_cond_set_order(cond, order); |
224 |
|
} |
225 |
|
|
226 |
|
if (limit) { |
227 |
|
elog(DEBUG1,"est_cond_set_max(%d)", limit + offset); |
228 |
|
est_cond_set_max(cond, limit + offset); |
229 |
} |
} |
230 |
|
|
231 |
/* get the result of search */ |
/* get the result of search */ |
238 |
|
|
239 |
/* total number of tuples to be returned */ |
/* total number of tuples to be returned */ |
240 |
if (limit && limit < resnum) { |
if (limit && limit < resnum) { |
241 |
nrows = limit - offset; |
nrows = limit; |
242 |
} else { |
} else { |
243 |
nrows = resnum - offset; |
nrows = resnum - offset; |
244 |
} |
} |
246 |
|
|
247 |
elog(DEBUG1, "pgest_attr: found %d hits for %s", resnum, query); |
elog(DEBUG1, "pgest_attr: found %d hits for %s", resnum, query); |
248 |
|
|
|
|
|
249 |
values = (char **) palloc(ncols * sizeof(char *)); |
values = (char **) palloc(ncols * sizeof(char *)); |
250 |
|
|
251 |
for (i = 0; i < nrows; i++) |
for (i = 0; i < nrows; i++) |
253 |
|
|
254 |
/* get result from estraier */ |
/* get result from estraier */ |
255 |
if (! ( doc = est_db_get_doc(db, est_result[i + offset], 0)) ) { |
if (! ( doc = est_db_get_doc(db, est_result[i + offset], 0)) ) { |
256 |
elog(INFO, "can't find result %d", i + offset); |
elog(INFO, "pgest_attr: can't find result %d", i + offset); |
257 |
} else { |
} else { |
258 |
elog(DEBUG1, "URI: %s\n Title: %s\n", |
elog(DEBUG1, "URI: %s\n Title: %s\n", |
259 |
est_doc_attr(doc, "@uri"), |
est_doc_attr(doc, "@uri"), |
285 |
/* now store it */ |
/* now store it */ |
286 |
tuplestore_puttuple(tupstore, tuple); |
tuplestore_puttuple(tupstore, tuple); |
287 |
|
|
|
|
|
288 |
/* delete estraier document object */ |
/* delete estraier document object */ |
289 |
est_doc_delete(doc); |
if (doc) est_doc_delete(doc); |
290 |
} |
} |
291 |
|
|
292 |
tuplestore_donestoring(tupstore); |
tuplestore_donestoring(tupstore); |
302 |
rsinfo->setDesc = tupdesc; |
rsinfo->setDesc = tupdesc; |
303 |
MemoryContextSwitchTo(oldcontext); |
MemoryContextSwitchTo(oldcontext); |
304 |
|
|
305 |
|
est_cond_delete(cond); |
306 |
|
|
307 |
if(!est_db_close(db, &ecode)){ |
if(!est_db_close(db, &ecode)){ |
308 |
ereport(ERROR, (errcode(ERRCODE_IO_ERROR), |
ereport(ERROR, (errcode(ERRCODE_IO_ERROR), |
309 |
errmsg("est_db_close: %d", ecode), |
errmsg("est_db_close: %d", ecode), |
321 |
int len; |
int len; |
322 |
int attrlen; |
int attrlen; |
323 |
|
|
324 |
|
if (! doc) return (Datum) NULL; |
325 |
|
|
326 |
elog(DEBUG1, "doc: %08x, attr: %s", doc, attr); |
elog(DEBUG1, "doc: %08x, attr: %s", doc, attr); |
327 |
|
|
328 |
if ( (attrval = est_doc_attr(doc, attr)) && (attrlen = strlen(attrval)) ) { |
if ( (attrval = est_doc_attr(doc, attr)) && (attrlen = strlen(attrval)) ) { |
336 |
|
|
337 |
len++; |
len++; |
338 |
len *= sizeof(char); |
len *= sizeof(char); |
339 |
|
|
340 |
|
elog(DEBUG2, "palloc(%d)", len); |
341 |
|
|
342 |
|
val = palloc(len); |
343 |
|
|
344 |
|
memset(val, 0, len); |
345 |
|
strncpy(val, attrval, len); |
346 |
|
|
347 |
|
elog(DEBUG2, "val=%s", val); |
348 |
|
|
349 |
|
return val; |
350 |
|
} |
351 |
|
|
352 |
|
/* |
353 |
|
* variation on theme: use node API which doesn't open index on |
354 |
|
* every query which is much faster for large indexes |
355 |
|
* |
356 |
|
*/ |
357 |
|
|
358 |
|
/* select * from pgest( */ |
359 |
|
#define _arg_node_uri 0 |
360 |
|
#define _arg_login 1 |
361 |
|
#define _arg_passwd 2 |
362 |
|
#define _arg_depth 3 |
363 |
|
#define _arg_query 4 |
364 |
|
#define _arg_attr 5 |
365 |
|
#define _arg_order 6 |
366 |
|
#define _arg_limit 7 |
367 |
|
#define _arg_offset 8 |
368 |
|
#define _arg_attr_array 9 |
369 |
|
/* as (foo text, ... ); */ |
370 |
|
|
371 |
|
|
372 |
|
PG_FUNCTION_INFO_V1(pgest_node); |
373 |
|
Datum pgest_node(PG_FUNCTION_ARGS) |
374 |
|
{ |
375 |
|
ArrayType *attr_arr = PG_GETARG_ARRAYTYPE_P(_arg_attr_array); |
376 |
|
Oid attr_element_type = ARR_ELEMTYPE(attr_arr); |
377 |
|
int attr_ndims = ARR_NDIM(attr_arr); |
378 |
|
int *attr_dim_counts = ARR_DIMS(attr_arr); |
379 |
|
int *attr_dim_lower_bounds = ARR_LBOUND(attr_arr); |
380 |
|
int ncols = 0; |
381 |
|
int nrows = 0; |
382 |
|
int indx[MAXDIM]; |
383 |
|
int16 attr_len; |
384 |
|
bool attr_byval; |
385 |
|
char attr_align; |
386 |
|
ReturnSetInfo *rsinfo = (ReturnSetInfo *) fcinfo->resultinfo; |
387 |
|
AttInMetadata *attinmeta; |
388 |
|
TupleDesc tupdesc; |
389 |
|
Tuplestorestate *tupstore = NULL; |
390 |
|
HeapTuple tuple; |
391 |
|
MemoryContext per_query_ctx; |
392 |
|
MemoryContext oldcontext; |
393 |
|
Datum dvalue; |
394 |
|
char **values; |
395 |
|
int rsinfo_ncols; |
396 |
|
int i, j; |
397 |
|
/* estvars */ |
398 |
|
ESTNODE *node; |
399 |
|
ESTCOND *cond; |
400 |
|
ESTNODERES *nres; |
401 |
|
ESTRESDOC *rdoc; |
402 |
|
const CBLIST *texts; |
403 |
|
int resnum = 0; |
404 |
|
int limit = 0; |
405 |
|
int offset = 0; |
406 |
|
int depth = 0; |
407 |
|
|
408 |
|
char *node_url; |
409 |
|
char *user, *passwd; |
410 |
|
char *query; |
411 |
|
char *attr; |
412 |
|
char *order; |
413 |
|
|
414 |
|
|
415 |
|
/* only allow 1D input array */ |
416 |
|
if (attr_ndims == 1) |
417 |
|
{ |
418 |
|
ncols = attr_dim_counts[0]; |
419 |
|
} |
420 |
|
else |
421 |
|
ereport(ERROR, |
422 |
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE), |
423 |
|
errmsg("invalid input array"), |
424 |
|
errdetail("Input array must have 1 dimension"))); |
425 |
|
|
426 |
|
/* check to see if caller supports us returning a tuplestore */ |
427 |
|
if (!rsinfo || !(rsinfo->allowedModes & SFRM_Materialize)) |
428 |
|
ereport(ERROR, |
429 |
|
(errcode(ERRCODE_SYNTAX_ERROR), |
430 |
|
errmsg("materialize mode required, but it is not " \ |
431 |
|
"allowed in this context"))); |
432 |
|
|
433 |
|
/* get info about element type needed to construct the array */ |
434 |
|
get_typlenbyvalalign(attr_element_type, &attr_len, &attr_byval, &attr_align); |
435 |
|
|
436 |
|
/* get the requested return tuple description */ |
437 |
|
tupdesc = rsinfo->expectedDesc; |
438 |
|
rsinfo_ncols = tupdesc->natts; |
439 |
|
|
440 |
|
/* |
441 |
|
* The requested tuple description better match up with the array |
442 |
|
* we were given. |
443 |
|
*/ |
444 |
|
if (rsinfo_ncols != ncols) |
445 |
|
ereport(ERROR, |
446 |
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE), |
447 |
|
errmsg("invalid input array"), |
448 |
|
errdetail("Number of elements in array must match number of query specified columns."))); |
449 |
|
|
450 |
|
/* OK, use it */ |
451 |
|
attinmeta = TupleDescGetAttInMetadata(tupdesc); |
452 |
|
|
453 |
|
/* Now go to work */ |
454 |
|
rsinfo->returnMode = SFRM_Materialize; |
455 |
|
|
456 |
|
per_query_ctx = fcinfo->flinfo->fn_mcxt; |
457 |
|
oldcontext = MemoryContextSwitchTo(per_query_ctx); |
458 |
|
|
459 |
|
/* initialize our tuplestore */ |
460 |
|
tupstore = tuplestore_begin_heap(true, false, SortMem); |
461 |
|
|
462 |
|
|
463 |
|
/* take rest of arguments from function */ |
464 |
|
|
465 |
|
/* node URL */ |
466 |
|
if (PG_ARGISNULL(_arg_node_uri)) { |
467 |
|
ereport(ERROR, |
468 |
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE), |
469 |
|
errmsg("node URL can't be null"), |
470 |
|
errdetail("Node URL must be valid URL to HyperEstraier node"))); |
471 |
|
} |
472 |
|
node_url = _textout(PG_GETARG_TEXT_P(_arg_node_uri)); |
473 |
|
|
474 |
|
/* login and password */ |
475 |
|
if (PG_ARGISNULL(_arg_login) || PG_ARGISNULL(_arg_passwd)) { |
476 |
|
ereport(ERROR, |
477 |
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE), |
478 |
|
errmsg("username and password can't be NULL"), |
479 |
|
errdetail("You must specify valid username and password to HyperEstraier node"))); |
480 |
|
} |
481 |
|
user = _textout(PG_GETARG_TEXT_P(_arg_login)); |
482 |
|
passwd = _textout(PG_GETARG_TEXT_P(_arg_passwd)); |
483 |
|
|
484 |
|
/* depth of search */ |
485 |
|
if (PG_ARGISNULL(_arg_depth)) { |
486 |
|
depth = 0; |
487 |
|
} else { |
488 |
|
depth = PG_GETARG_INT32(_arg_depth); |
489 |
|
} |
490 |
|
|
491 |
|
/* query string */ |
492 |
|
if (PG_ARGISNULL(_arg_query)) { |
493 |
|
query = ""; |
494 |
|
} else { |
495 |
|
query = _textout(PG_GETARG_TEXT_P(_arg_query)); |
496 |
|
} |
497 |
|
|
498 |
|
/* atribute filter */ |
499 |
|
if (PG_ARGISNULL(_arg_attr)) { |
500 |
|
attr = ""; |
501 |
|
} else { |
502 |
|
attr = _textout(PG_GETARG_TEXT_P(_arg_attr)); |
503 |
|
} |
504 |
|
|
505 |
|
/* sort order */ |
506 |
|
if (PG_ARGISNULL(_arg_order)) { |
507 |
|
order = ""; |
508 |
|
} else { |
509 |
|
order = _textout(PG_GETARG_TEXT_P(_arg_order)); |
510 |
|
} |
511 |
|
|
512 |
|
|
513 |
|
/* limit */ |
514 |
|
if (PG_ARGISNULL(_arg_limit)) { |
515 |
|
limit = 0; |
516 |
|
} else { |
517 |
|
limit = PG_GETARG_INT32(_arg_limit); |
518 |
|
} |
519 |
|
|
520 |
|
/* offset */ |
521 |
|
if (PG_ARGISNULL(_arg_offset)) { |
522 |
|
offset = 0; |
523 |
|
} else { |
524 |
|
offset = PG_GETARG_INT32(_arg_offset); |
525 |
|
} |
526 |
|
|
527 |
|
/* initialize the network environment */ |
528 |
|
if(!est_init_net_env()){ |
529 |
|
ereport(ERROR, (errcode(ERRCODE_QUERY_CANCELED), |
530 |
|
errmsg("pgest_node: can't create network enviroment"))); |
531 |
|
} |
532 |
|
|
533 |
|
/* create the node connection object */ |
534 |
|
elog(DEBUG1, "pgest_node: est_node_new(%s) as %s", node_url, user); |
535 |
|
node = est_node_new(node_url); |
536 |
|
est_node_set_auth(node, user, passwd); |
537 |
|
|
538 |
|
elog(DEBUG1, "pgest_node: node: %s (d:%d) query[%s] attr[%s] limit %d offset %d", node_url, depth, query, (PG_ARGISNULL(_arg_attr) ? "NULL" : attr), limit, offset); |
539 |
|
|
540 |
|
/* create a search condition object */ |
541 |
|
if (!(cond = est_cond_new())) { |
542 |
|
ereport(ERROR, (errcode(ERRCODE_QUERY_CANCELED), |
543 |
|
errmsg("pgest_node: est_cond_new failed"))); |
544 |
|
} |
545 |
|
|
546 |
|
/* set the search phrase to the search condition object */ |
547 |
|
if (! PG_ARGISNULL(_arg_query) && strlen(query) > 0) |
548 |
|
est_cond_set_phrase(cond, query); |
549 |
|
|
550 |
|
/* minimum valid attribute length is 10: @a STREQ a */ |
551 |
|
if (! PG_ARGISNULL(_arg_attr) && strlen(attr) >= 10) { |
552 |
|
elog(DEBUG1,"attributes: %s", attr); |
553 |
|
char *curr_attr; |
554 |
|
curr_attr = strtok(attr, ATTR_DELIMITER); |
555 |
|
while (curr_attr) { |
556 |
|
elog(DEBUG1,"est_cond_add_attr(%s)", curr_attr); |
557 |
|
est_cond_add_attr(cond, curr_attr); |
558 |
|
curr_attr = strtok(NULL, ATTR_DELIMITER); |
559 |
|
} |
560 |
|
} |
561 |
|
|
562 |
|
/* set the search phrase to the search condition object */ |
563 |
|
if (! PG_ARGISNULL(_arg_order) && strlen(order) > 0) { |
564 |
|
elog(DEBUG1,"est_cond_set_order(%s)", order); |
565 |
|
est_cond_set_order(cond, order); |
566 |
|
} |
567 |
|
|
568 |
|
if (limit) { |
569 |
|
elog(DEBUG1,"est_cond_set_max(%d)", limit + offset); |
570 |
|
est_cond_set_max(cond, limit + offset); |
571 |
|
} |
572 |
|
|
573 |
|
/* get the result of search */ |
574 |
|
nres = est_node_search(node, cond, depth); |
575 |
|
|
576 |
|
if (! nres) { |
577 |
|
int status = est_node_status(node); |
578 |
|
est_cond_delete(cond); |
579 |
|
est_node_delete(node); |
580 |
|
est_free_net_env(); |
581 |
|
ereport(ERROR, (errcode(ERRCODE_QUERY_CANCELED), |
582 |
|
errmsg("pgest_node: search failed, node status %d", status))); |
583 |
|
} |
584 |
|
|
585 |
|
/* get number of results */ |
586 |
|
resnum = est_noderes_doc_num(nres); |
587 |
|
|
588 |
|
/* check if results exists */ |
589 |
|
if ( 0 == resnum ) { |
590 |
|
elog(INFO, "pgest_node: no results for: %s", query ); |
591 |
|
} |
592 |
|
|
593 |
|
/* total number of tuples to be returned */ |
594 |
|
if (limit && limit < resnum) { |
595 |
|
nrows = limit; |
596 |
|
} else { |
597 |
|
nrows = resnum - offset; |
598 |
|
} |
599 |
|
|
600 |
|
|
601 |
|
elog(DEBUG1, "pgest_node: found %d hits for %s", resnum, query); |
602 |
|
|
603 |
|
|
604 |
|
values = (char **) palloc(ncols * sizeof(char *)); |
605 |
|
|
606 |
|
for (i = 0; i < nrows; i++) |
607 |
|
{ |
608 |
|
|
609 |
|
/* get result from estraier */ |
610 |
|
if (! ( rdoc = est_noderes_get_doc(nres, i + offset) )) { |
611 |
|
elog(INFO, "pgest_node: can't find result %d", i + offset); |
612 |
|
} else { |
613 |
|
elog(DEBUG1, "URI: %s\n Title: %s\n", |
614 |
|
est_resdoc_attr(rdoc, "@uri"), |
615 |
|
est_resdoc_attr(rdoc, "@title") |
616 |
|
); |
617 |
|
} |
618 |
|
|
619 |
|
/* iterate over results */ |
620 |
|
for (j = 0; j < ncols; j++) |
621 |
|
{ |
622 |
|
bool isnull; |
623 |
|
|
624 |
|
/* array value of this position */ |
625 |
|
indx[0] = j + attr_dim_lower_bounds[0]; |
626 |
|
|
627 |
|
dvalue = array_ref(attr_arr, attr_ndims, indx, -1, attr_len, attr_byval, attr_align, &isnull); |
628 |
|
|
629 |
|
if (!isnull && rdoc) |
630 |
|
values[j] = DatumGetCString( |
631 |
|
node_attr2text(rdoc, |
632 |
|
(char *)DirectFunctionCall1(textout, dvalue) |
633 |
|
)); |
634 |
|
else |
635 |
|
values[j] = NULL; |
636 |
|
} |
637 |
|
/* construct the tuple */ |
638 |
|
tuple = BuildTupleFromCStrings(attinmeta, values); |
639 |
|
|
640 |
|
/* now store it */ |
641 |
|
tuplestore_puttuple(tupstore, tuple); |
642 |
|
|
643 |
|
} |
644 |
|
|
645 |
|
tuplestore_donestoring(tupstore); |
646 |
|
rsinfo->setResult = tupstore; |
647 |
|
|
648 |
|
/* |
649 |
|
* SFRM_Materialize mode expects us to return a NULL Datum. The actual |
650 |
|
* tuples are in our tuplestore and passed back through |
651 |
|
* rsinfo->setResult. rsinfo->setDesc is set to the tuple description |
652 |
|
* that we actually used to build our tuples with, so the caller can |
653 |
|
* verify we did what it was expecting. |
654 |
|
*/ |
655 |
|
rsinfo->setDesc = tupdesc; |
656 |
|
MemoryContextSwitchTo(oldcontext); |
657 |
|
|
658 |
|
/* delete the node result object */ |
659 |
|
est_noderes_delete(nres); |
660 |
|
|
661 |
|
/* destroy the search condition object */ |
662 |
|
est_cond_delete(cond); |
663 |
|
|
664 |
|
/* destroy the node object */ |
665 |
|
est_node_delete(node); |
666 |
|
|
667 |
|
/* free the networking environment */ |
668 |
|
est_free_net_env(); |
669 |
|
|
670 |
|
return (Datum) 0; |
671 |
|
} |
672 |
|
|
673 |
|
/* make text var from node attr */ |
674 |
|
char *node_attr2text(ESTRESDOC *rdoc, char *attr) { |
675 |
|
char *val; |
676 |
|
const char *attrval; |
677 |
|
int len; |
678 |
|
int attrlen; |
679 |
|
|
680 |
|
if (! rdoc) return (Datum) NULL; |
681 |
|
|
682 |
|
elog(DEBUG1, "doc: %08x, attr: %s", rdoc, attr); |
683 |
|
|
684 |
|
if ( (attrval = est_resdoc_attr(rdoc, attr)) && (attrlen = strlen(attrval)) ) { |
685 |
|
val = (char *) palloc(attrlen * sizeof(char)); |
686 |
|
} else { |
687 |
|
return (Datum) NULL; |
688 |
|
} |
689 |
|
|
690 |
|
len = strlen(attrval); |
691 |
|
elog(DEBUG1, "node_attr2text(%s) = '%s' %d bytes", attr, attrval, len); |
692 |
|
|
693 |
|
len++; |
694 |
|
len *= sizeof(char); |
695 |
|
|
696 |
elog(DEBUG2, "palloc(%d)", len); |
elog(DEBUG2, "palloc(%d)", len); |
697 |
|
|