firebird/firebird-mirror
firebird/firebird-mirror
8
0
Fork 1
mirror of https://github.com/FirebirdSQL/firebird.git synced 2025-01-31 15:23:03 +01:00
Code Issues
d59001341c
firebird-mirror/src/jrd/rse.cpp
dimitr e6909de7f7 Wipe out the SCROLLABLE_CURSORS code + minor cleanup. 
Also, surfaced scrollability for PSQL cursors (without internal support yet).
2009-10-31 06:25:01 +00:00

3003 lines
77 KiB
C++
Raw Blame History

/*
* PROGRAM: JRD Access Method
* MODULE: rse.cpp
* DESCRIPTION: Run time record fetching
*
* The contents of this file are subject to the Interbase Public
* License Version 1.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy
* of the License at http://www.Inprise.com/IPL.html
*
* Software distributed under the License is distributed on an
* "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, either express
* or implied. See the License for the specific language governing
* rights and limitations under the License.
*
* The Original Code was created by Inprise Corporation
* and its predecessors. Portions created by Inprise Corporation are
* Copyright (C) Inprise Corporation.
*
* All Rights Reserved.
* Contributor(s): ______________________________________.
*
* 2001.07.28: John Bellardo: Implemented rse_skip and made rse_first work with
* seekable streams.
* 2002.02.22 Claudio Valderrama: Fix SF Bugs #225283, #518279, #514186 & #221925.
*
* 2002.10.29 Sean Leyne - Removed obsolete "Netware" port
*
* 2002.10.30 Sean Leyne - Removed support for obsolete "PC_PLATFORM" define
*
*/
#include "firebird.h"
#include <errno.h>
#include "../jrd/common.h"
#include <stdio.h>
#include <string.h>
#include "memory_routines.h"
#include "../jrd/jrd.h"
#include "../jrd/req.h"
#include "../jrd/val.h"
#include "../jrd/exe.h"
#include "../jrd/rse.h"
#include "../jrd/sbm.h"
#include "../jrd/lls.h"
#include "../jrd/sort.h"
#include "../jrd/intl.h"
#include "../jrd/ods.h"
#include "../jrd/btr.h"
#include "../jrd/lck.h"
#include "../jrd/cch.h"
#include "../jrd/tra.h"
#include "gen/iberror.h"
#include "../jrd/gdsassert.h"
#include "../jrd/dpm_proto.h"
#include "../jrd/err_proto.h"
#include "../jrd/evl_proto.h"
#include "../jrd/exe_proto.h"
#include "../jrd/ext_proto.h"
#include "../jrd/gds_proto.h"
#include "../jrd/intl_proto.h"
#include "../jrd/jrd_proto.h"
#include "../jrd/met_proto.h"
#include "../jrd/mov_proto.h"
#include "../jrd/nav_proto.h"
#include "../jrd/rlck_proto.h"
#include "../jrd/rse_proto.h"
#include "../jrd/sort_proto.h"
#include "../jrd/vio_proto.h"
#include "../jrd/VirtualTable.h"
#include "../jrd/opt_proto.h"
#include "../jrd/trace/TraceManager.h"
#include "../jrd/trace/TraceJrdHelpers.h"
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_IO_H
#include <io.h>
#endif
using namespace Jrd;
using namespace Firebird;
static void close_merge(thread_db*, RecordSource*, irsb_mrg*);
static void close_procedure(thread_db*, RecordSource*);
static SSHORT compare(thread_db*, jrd_nod*, jrd_nod*);
static SSHORT compare_longs(const SLONG*, const SLONG*, USHORT);
static bool fetch_record(thread_db*, RecordSource*, USHORT);
static bool get_merge_join(thread_db*, RecordSource*, irsb_mrg*);
static bool get_merge_fetch(thread_db*, RecordSource*, SSHORT);
static SLONG get_merge_record(thread_db*, RecordSource*, irsb_mrg::irsb_mrg_repeat *);
static UCHAR *get_sort(thread_db*, RecordSource*);
static bool fetch_left(thread_db*, RecordSource*, IRSB);
static UCHAR* get_merge_data(thread_db*, merge_file*, SLONG);
static bool get_procedure(thread_db*, RecordSource*, irsb_procedure*, record_param*);
static bool get_union(thread_db*, RecordSource*, IRSB);
static void invalidate_child_rpbs(thread_db*, RecordSource*);
static void join_to_nulls(thread_db*, StreamStack*);
static void map_sort_data(thread_db*, jrd_req*, SortMap*, UCHAR *);
static void open_merge(thread_db*, RecordSource*, irsb_mrg*);
static void open_procedure(thread_db*, RecordSource*, irsb_procedure*);
static void open_sort(thread_db*, RecordSource*, irsb_sort*); //, FB_UINT64);
static void proc_assignment(thread_db*, const dsc*, const dsc*, UCHAR*, const dsc*, SSHORT, Record*);
static void pop_rpbs(jrd_req*, RecordSource*);
static void push_rpbs(thread_db*, jrd_req*, RecordSource*);
static ULONG read_merge_block(thread_db*, merge_file*, ULONG);
static bool reject(const UCHAR*, const UCHAR*, void*);
static void restore_record(record_param*);
static void save_record(thread_db*, record_param*);
static void write_merge_block(thread_db*, merge_file*, ULONG);
static const char* const SCRATCH = "fb_merge_";
void RSE_close(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* R S E _ c l o s e
*
**************************************
*
* Functional description
*
* hvlad: for RSB's marked as part of recursive sub-tree we must free
* resources stored in impure area as this area is over-written when
* recursion returns to the upper level. See also RSBRecurse::get()
*
**************************************/
SET_TDBB(tdbb);
invalidate_child_rpbs(tdbb, rsb);
jrd_req* request = tdbb->getRequest();
const bool bFreeAll = (rsb->rsb_flags & rsb_recursive);
while (true)
{
irsb_sort* impure = (irsb_sort*) ((UCHAR*) request + rsb->rsb_impure);
if (!(impure->irsb_flags & irsb_open))
return;
impure->irsb_flags &= ~irsb_open;
switch (rsb->rsb_type)
{
case rsb_indexed:
if (bFreeAll)
{
irsb_index* imp_idx = (irsb_index*) impure;
if (imp_idx->irsb_bitmap)
{
delete (*imp_idx->irsb_bitmap);
*imp_idx->irsb_bitmap = NULL;
}
}
return;
case rsb_navigate:
{
irsb_nav* imp_nav = (irsb_nav*) impure;
if (bFreeAll)
{
if (imp_nav->irsb_nav_bitmap)
{
delete (*imp_nav->irsb_nav_bitmap);
*imp_nav->irsb_nav_bitmap = NULL;
}
delete imp_nav->irsb_nav_records_visited;
imp_nav->irsb_nav_records_visited = NULL;
}
if (imp_nav->irsb_nav_page)
{
imp_nav->irsb_nav_btr_gc_lock->enablePageGC(tdbb);
imp_nav->irsb_nav_page = 0;
}
}
return;
case rsb_sequential:
{
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
if (rpb->getWindow(tdbb).win_flags & WIN_large_scan &&
rpb->rpb_relation->rel_scan_count)
{
--rpb->rpb_relation->rel_scan_count;
}
return;
}
case rsb_first:
case rsb_skip:
case rsb_boolean:
case rsb_aggregate:
rsb = rsb->rsb_next;
break;
case rsb_cross:
{
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count; ptr < end; ptr++)
{
RSE_close(tdbb, *ptr);
}
return;
}
case rsb_left_cross:
RSE_close(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
RSE_close(tdbb, rsb->rsb_arg[RSB_LEFT_inner]);
return;
case rsb_procedure:
close_procedure(tdbb, rsb);
return;
case rsb_merge:
close_merge(tdbb, rsb, (irsb_mrg*) impure);
return;
case rsb_sort:
SORT_fini(impure->irsb_sort_handle);
impure->irsb_sort_handle = NULL;
rsb = rsb->rsb_next;
break;
case rsb_union:
{
const USHORT i = ((IRSB) impure)->irsb_count;
if (i >= rsb->rsb_count)
return;
rsb = rsb->rsb_arg[i];
}
break;
case rsb_recursive_union:
RSBRecurse::close(tdbb, rsb, (irsb_recurse*) impure);
return;
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
EXT_close(rsb);
return;
case rsb_record_stream:
rsb->rsb_record_stream->close(tdbb);
return;
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
}
}
bool RSE_get_record(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* R S E _ g e t _ r e c o r d
*
**************************************
*
* Functional description
* External entrypoint for RSE_internal_get_record().
* Check whether we need to count records
* retrieved at the top level of the rsb tree.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
IRSB impure = (IRSB) ((UCHAR*) request + rsb->rsb_impure);
impure->irsb_flags |= irsb_eof;
/* Turn off the flag so that records at a
lower level will not be counted. */
const bool count = (request->req_flags & req_count_records) != 0;
request->req_flags &= ~req_count_records;
bool result;
while ( (result = RSE_internal_get_record(tdbb, rsb, NULL)) )
{
if (rsb->rsb_flags & rsb_writelock)
{
// Lock record if we were asked for it
jrd_tra* transaction = request->req_transaction;
RecordSource* table_rsb = rsb;
// Skip nodes without streams
while (table_rsb->rsb_type == rsb_boolean ||
table_rsb->rsb_type == rsb_sort ||
table_rsb->rsb_type == rsb_first ||
table_rsb->rsb_type == rsb_skip)
{
table_rsb = table_rsb->rsb_next;
}
// Raise error if we cannot lock this kind of stream
if (table_rsb->rsb_type != rsb_sequential &&
table_rsb->rsb_type != rsb_indexed &&
table_rsb->rsb_type != rsb_navigate)
{
ERR_post(Arg::Gds(isc_record_lock_not_supp));
}
record_param* org_rpb = &request->req_rpb[table_rsb->rsb_stream];
jrd_rel* relation = org_rpb->rpb_relation;
// Raise error if we cannot lock this kind of stream
if (!relation || relation->rel_view_rse || relation->rel_file || relation->isVirtual())
{
ERR_post(Arg::Gds(isc_record_lock_not_supp));
}
RLCK_reserve_relation(tdbb, transaction, relation, true);
// Fetch next record if current was deleted before being locked
if (!VIO_writelock(tdbb, org_rpb, rsb, transaction)) {
continue;
}
}
if (count) {
request->req_records_selected++;
request->req_records_affected.bumpFetched();
}
impure->irsb_flags &= ~irsb_eof;
break;
}
/* reset the flag to whatever it was */
if (count)
request->req_flags |= req_count_records;
return result;
}
void RSE_open(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* R S E _ o p e n
*
**************************************
*
* Functional description
* Open a stream, as represented by the
* record source block (rsb).
*
**************************************/
SINT64 first_records = -1, skip_records = 0;
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
// Initialize dependent invariants if any
if (rsb->rsb_invariants)
{
SLONG *ptr, *end;
for (ptr = rsb->rsb_invariants->begin(), end = rsb->rsb_invariants->end(); ptr < end; ptr++)
{
reinterpret_cast<impure_value*>((SCHAR *) request + *ptr)->vlu_flags = 0;
}
}
while (true)
{
irsb_index* impure = (irsb_index*) ((SCHAR *) request + rsb->rsb_impure);
impure->irsb_flags |= irsb_first | irsb_open;
impure->irsb_flags &= ~(irsb_singular_processed | irsb_checking_singular | irsb_eof);
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
rpb->getWindow(tdbb).win_flags = 0;
switch (rsb->rsb_type)
{
case rsb_indexed:
impure->irsb_bitmap = EVL_bitmap(tdbb, (jrd_nod*) rsb->rsb_arg[0], NULL);
#ifdef SUPERSERVER_V2
impure->irsb_prefetch_number = -1;
#endif
case rsb_navigate:
case rsb_sequential:
if (rsb->rsb_type == rsb_sequential)
{
Database* dbb = tdbb->getDatabase();
BufferControl* bcb = dbb->dbb_bcb;
/* Unless this is the only attachment, limit the cache flushing
effect of large sequential scans on the page working sets of
other attachments. */
Jrd::Attachment* attachment = tdbb->getAttachment();
if (attachment && (attachment != dbb->dbb_attachments || attachment->att_next))
{
/* If the relation has more data pages than the number of
pages in the buffer cache then mark the input window
block as a large scan so that a data page is released
to the LRU tail after its last record is fetched.
A database backup treats everything as a large scan
because the cumulative effect of scanning all relations
is equal to that of a single large relation. */
if (attachment->att_flags & ATT_gbak_attachment ||
DPM_data_pages(tdbb, rpb->rpb_relation) > (SLONG) bcb->bcb_count)
{
rpb->getWindow(tdbb).win_flags = WIN_large_scan;
rpb->rpb_org_scans = rpb->rpb_relation->rel_scan_count++;
}
}
}
RLCK_reserve_relation(tdbb, request->req_transaction, rpb->rpb_relation, false);
rpb->rpb_number.setValue(BOF_NUMBER);
return;
case rsb_cross:
return;
case rsb_sort:
// dimitr: we can avoid reading and sorting the entire
// record set, if there's actually nothing to return
if (first_records) {
open_sort(tdbb, rsb, (irsb_sort*) impure);//,
//(first_records < 0) ? 0 : (FB_UINT64) first_records + skip_records);
}
else {
((irsb_sort*) impure)->irsb_sort_handle = NULL;
}
return;
case rsb_procedure:
open_procedure(tdbb, rsb, (irsb_procedure*) impure);
return;
case rsb_first:
{
const dsc* desc = EVL_expr(tdbb, (jrd_nod*) rsb->rsb_arg[0]);
first_records = (desc && !(request->req_flags & req_null)) ?
MOV_get_int64(desc, 0) : 0;
if (first_records < 0)
ERR_post(Arg::Gds(isc_bad_limit_param));
((irsb_first_n*) impure)->irsb_count = first_records;
rsb = rsb->rsb_next;
}
break;
case rsb_skip:
{
const dsc* desc = EVL_expr(tdbb, (jrd_nod*) rsb->rsb_arg[0]);
skip_records = (desc && !(request->req_flags & req_null)) ?
MOV_get_int64(desc, 0) : 0;
if (skip_records < 0)
ERR_post(Arg::Gds(isc_bad_skip_param));
((irsb_skip_n*) impure)->irsb_count = skip_records + 1;
rsb = rsb->rsb_next;
}
break;
case rsb_boolean:
rsb = rsb->rsb_next;
break;
case rsb_union:
{
((IRSB) impure)->irsb_count = 0;
VIO_record(tdbb, rpb, rsb->rsb_format, tdbb->getDefaultPool());
/* Initialize the record number of each stream in the union */
RecordSource** ptr = &rsb->rsb_arg[rsb->rsb_count];
for (const RecordSource* const* const end = ptr + (USHORT)(IPTR) *ptr;
++ptr <= end;)
{
request->req_rpb[(USHORT)(IPTR) *ptr].rpb_number.setValue(BOF_NUMBER);
}
rsb = rsb->rsb_arg[0];
}
break;
case rsb_recursive_union:
RSBRecurse::open(tdbb, rsb, (irsb_recurse*) impure);
return;
case rsb_aggregate:
((IRSB) impure)->irsb_count = 3;
VIO_record(tdbb, rpb, rsb->rsb_format, tdbb->getDefaultPool());
return;
case rsb_merge:
open_merge(tdbb, rsb, (irsb_mrg*) impure);
return;
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
EXT_open(tdbb, rsb);
return;
case rsb_record_stream:
rsb->rsb_record_stream->open(tdbb);
return;
case rsb_left_cross:
{
RSE_open(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
impure->irsb_flags &= ~(irsb_first | irsb_in_opened | irsb_join_full);
impure->irsb_flags |= irsb_mustread;
/* Allocate a record block for each union/aggregate/procedure
stream in the right sub-stream. The block will be needed
if we join to nulls before opening the rsbs */
for (RsbStack::iterator stack(*(rsb->rsb_left_rsbs)); stack.hasData(); ++stack)
{
VIO_record(tdbb, &request->req_rpb[stack.object()->rsb_stream],
stack.object()->rsb_format, tdbb->getDefaultPool());
}
return;
}
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
}
}
static void close_merge(thread_db* tdbb, RecordSource* rsb, irsb_mrg* impure)
{
/**************************************
*
* c l o s e _ m e r g e
*
**************************************
*
* Functional description
* Close a merge stream by closing all substreams
* and cleaning up after any prior sort-merge retrieval.
*
**************************************/
SET_TDBB(tdbb);
/* do two simultaneous but unrelated things in one loop */
irsb_mrg::irsb_mrg_repeat* tail = impure->irsb_mrg_rpt;
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count * 2; ptr < end; ptr += 2, tail++)
{
/* close all the substreams for the sort-merge */
RSE_close(tdbb, *ptr);
/* Release memory associated with the merge file block
and the sort file block. Also delete the merge file
if one exists. */
merge_file* mfb = &tail->irsb_mrg_file;
delete mfb->mfb_space;
mfb->mfb_space = NULL;
delete[] mfb->mfb_block_data;
mfb->mfb_block_data = NULL;
}
}
static void close_procedure(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* c l o s e _ p r o c e d u r e
*
**************************************
*
* Functional description
* Shut down a procedural view.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
irsb_procedure* impure = (irsb_procedure*) ((UCHAR *) request + rsb->rsb_impure);
jrd_req* proc_request = impure->irsb_req_handle;
if (proc_request) {
EXE_unwind(tdbb, proc_request);
proc_request->req_flags &= ~req_in_use;
impure->irsb_req_handle = 0;
proc_request->req_attachment = NULL;
}
delete impure->irsb_message;
impure->irsb_message = NULL;
}
// It seems strange this function doesn't take two const nodes,
// but EVL_expr can change node1 and node2' args.
static SSHORT compare(thread_db* tdbb, jrd_nod* node1, jrd_nod* node2)
{
/**************************************
*
* c o m p a r e
*
**************************************
*
* Functional description
* Compare values of two sorts lists, return result. This is used for
* sort merge join.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
jrd_nod* const* ptr1 = node1->nod_arg;
jrd_nod* const* ptr2 = node2->nod_arg;
for (const jrd_nod* const* const end = ptr1 + node1->nod_count; ptr1 < end; ptr1++, ptr2++)
{
const dsc* desc1 = EVL_expr(tdbb, *ptr1);
const ULONG flags = request->req_flags;
const dsc* desc2 = EVL_expr(tdbb, *ptr2);
if (flags & req_null)
{
if (!(request->req_flags & req_null)) {
return -1;
}
// AB: When both expression evaluated NULL then
// we return 0 ( (NULL = NULL) = true).
//
// Currently this (0 and higher) isn't used by the
// MERGE procedure, but when we allow MERGE to
// handle outer-joins we must not forget this one !!!
return 0;
}
if (request->req_flags & req_null) {
return 1;
}
// AB: MOV_compare can't handle NULL parameters
// therefore check before passing all null flags.
const SSHORT result = MOV_compare(desc1, desc2);
if (result != 0) {
return result;
}
}
return 0;
}
static SSHORT compare_longs(const SLONG* p, const SLONG* q, USHORT count)
{
/**************************************
*
* c o m p a r e _ l o n g s
*
**************************************
*
* Functional description
* Compare two strings of SLONG words.
*
**************************************/
for (; count; p++, q++, --count)
{
if (*p > *q)
return 1;
if (*p < *q)
return -1;
}
return 0;
}
static bool fetch_record(thread_db* tdbb, RecordSource* rsb, USHORT n)
{
/**************************************
*
* f e t c h _ r e c o r d
*
**************************************
*
* Functional description
* Get a record for a sub-stream of a cross. If the
* sub-stream is dry, close it and recurse to get the
* next record from the previous stream. If there isn't
* a previous stream, then the cross is finished, so
* return false.
*
**************************************/
SET_TDBB(tdbb);
fb_assert(rsb->rsb_type == rsb_cross);
RecordSource* sub_rsb = rsb->rsb_arg[n];
if (RSE_internal_get_record(tdbb, sub_rsb, NULL))
{
return true;
}
// We have exhausted this stream, so close it; if there is
// another candidate record from the n-1 streams to the left,
// then reopen the stream and start again from the beginning.
while (true)
{
RSE_close(tdbb, sub_rsb);
if (n == 0 || !fetch_record(tdbb, rsb, n - 1))
{
return false;
}
RSE_open(tdbb, sub_rsb);
if (RSE_internal_get_record(tdbb, sub_rsb, NULL))
{
return true;
}
}
}
static bool fetch_left(thread_db* tdbb, RecordSource* rsb, IRSB impure)
{
/**************************************
*
* f e t c h _ l e f t
*
**************************************
*
* Functional description
* Get records for a left outer join. Records are read
* from the left sub-stream when the right sub-stream is
* dry or when it is not yet open. When the left
* sub-stream's boolean is true, open the right sub-stream
* and read a record. When the right sub-stream becomes dry,
* close it, and if nothing has been joined to the left
* sub-stream's current record, join a null valued right
* sub-stream record. When the left sub-stream is dry,
* the outer join is finished, so return false.
*
**************************************/
SET_TDBB(tdbb);
if (!(impure->irsb_flags & irsb_join_full))
{
while (true)
{
if (impure->irsb_flags & irsb_mustread)
{
if (!RSE_internal_get_record(tdbb, rsb->rsb_arg[RSB_LEFT_outer], NULL))
{
if (rsb->rsb_left_inner_streams->isEmpty())
return false;
/* We have a full outer join. Open up the inner stream
one more time. */
RSE_close(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
impure->irsb_flags |= irsb_join_full;
RSE_open(tdbb, rsb->rsb_arg[RSB_LEFT_inner]);
break;
}
if (rsb->rsb_arg[RSB_LEFT_boolean] &&
!EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[RSB_LEFT_boolean]))
{
/* The boolean pertaining to the left sub-stream is false
so just join sub-stream to a null valued right sub-stream */
join_to_nulls(tdbb, rsb->rsb_left_streams);
return true;
}
impure->irsb_flags &= ~(irsb_mustread | irsb_joined);
impure->irsb_flags |= irsb_in_opened;
RSE_open(tdbb, rsb->rsb_arg[RSB_LEFT_inner]);
}
while (RSE_internal_get_record(tdbb, rsb->rsb_arg[RSB_LEFT_inner], NULL))
{
if (!rsb->rsb_arg[RSB_LEFT_inner_boolean] ||
EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[RSB_LEFT_inner_boolean]))
{
impure->irsb_flags |= irsb_joined;
return true;
}
}
RSE_close(tdbb, rsb->rsb_arg[RSB_LEFT_inner]);
impure->irsb_flags |= irsb_mustread;
if (!(impure->irsb_flags & irsb_joined))
{
/* The current left sub-stream record has not been joined
to anything. Join it to a null valued right sub-stream */
join_to_nulls(tdbb, rsb->rsb_left_streams);
return true;
}
}
}
/* Continue with a full outer join. */
RecordSource* full = rsb->rsb_arg[RSB_LEFT_inner];
full = (full->rsb_type == rsb_boolean) ? full->rsb_next : full;
if (impure->irsb_flags & irsb_in_opened)
{
/* The inner stream was opened at some point. If it doesn't have a
boolean, then all of its records have been returned. Otherwise,
find the records that haven't been. */
bool found;
do {
if (!RSE_internal_get_record(tdbb, full, NULL))
return false;
RSE_open(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
while ( (found = RSE_internal_get_record(tdbb, rsb->rsb_arg[RSB_LEFT_outer], NULL)) )
{
if ((!rsb->rsb_arg[RSB_LEFT_boolean] ||
EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[RSB_LEFT_boolean])) &&
(!rsb->rsb_arg[RSB_LEFT_inner_boolean] ||
EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[RSB_LEFT_inner_boolean])) &&
(full == rsb->rsb_arg[RSB_LEFT_inner] ||
EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[RSB_LEFT_inner]->rsb_arg[0])))
{
break;
}
}
RSE_close(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
} while (found);
}
else if (!RSE_internal_get_record(tdbb, full, NULL))
return false;
join_to_nulls(tdbb, rsb->rsb_left_inner_streams);
return true;
}
static UCHAR *get_merge_data(thread_db* tdbb, merge_file* mfb, SLONG record)
{
/**************************************
*
* g e t _ m e r g e _ d a t a
*
**************************************
*
* Functional description
* Get merge data for record from merge
* equivalence file.
*
**************************************/
fb_assert(record >= 0 && record < (SLONG) mfb->mfb_equal_records);
const ULONG merge_block = record / mfb->mfb_blocking_factor;
if (merge_block != mfb->mfb_current_block) {
mfb->mfb_current_block = read_merge_block(tdbb, mfb, merge_block);
}
const ULONG merge_offset = (record % mfb->mfb_blocking_factor) * mfb->mfb_record_size;
return (mfb->mfb_block_data + merge_offset);
}
static bool get_merge_fetch(thread_db* tdbb, RecordSource* rsb, SSHORT stream)
{
/**************************************
*
* g e t _ m e r g e _ f e t c h
*
**************************************
*
* Functional description
* Get the next record from a stream within a sort/merge
* record group.
*
**************************************/
SET_TDBB(tdbb);
irsb_mrg* impure = (irsb_mrg*) ((UCHAR*) tdbb->getRequest() + rsb->rsb_impure);
irsb_mrg::irsb_mrg_repeat* tail = impure->irsb_mrg_rpt + stream;
const SSHORT m = tail->irsb_mrg_order;
tail = impure->irsb_mrg_rpt + m;
RecordSource* sub_rsb = rsb->rsb_arg[m + m];
SLONG record = tail->irsb_mrg_equal_current;
++record;
if (record > tail->irsb_mrg_equal_end) {
if (stream == 0 || !get_merge_fetch(tdbb, rsb, stream - 1))
return false;
record = tail->irsb_mrg_equal;
}
tail->irsb_mrg_equal_current = record;
merge_file* mfb = &tail->irsb_mrg_file;
map_sort_data(tdbb, tdbb->getRequest(), (SortMap*) sub_rsb->rsb_arg[0],
get_merge_data(tdbb, mfb, record));
return true;
}
static bool get_merge_join(thread_db* tdbb, RecordSource* rsb, irsb_mrg* impure)
{
/**************************************
*
* g e t _ m e r g e _ j o i n
*
**************************************
*
* Functional description
* Get the next tuple from a sort/merge join.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
const RecordSource* const* const end = rsb->rsb_arg + rsb->rsb_count * 2;
/* If there is a record group already formed, fetch the next combination */
if (get_merge_fetch(tdbb, rsb, rsb->rsb_count - 1))
return true;
RecordSource** ptr;
irsb_mrg::irsb_mrg_repeat* tail;
/* Assuming we are done with the current value group, advance each
stream one record. If any comes up dry, we're done. */
RecordSource** highest_ptr = rsb->rsb_arg;
for (ptr = rsb->rsb_arg, tail = impure->irsb_mrg_rpt; ptr < end; ptr += 2, tail++)
{
RecordSource* sort_rsb = *ptr;
SortMap* map = (SortMap*) sort_rsb->rsb_arg[0];
merge_file* mfb = &tail->irsb_mrg_file;
/* reset equality group record positions */
tail->irsb_mrg_equal = 0;
tail->irsb_mrg_equal_current = 0;
tail->irsb_mrg_equal_end = 0;
/* If there is a record waiting, use it. Otherwise get another */
SLONG record = tail->irsb_mrg_last_fetched;
if (record >= 0)
{
tail->irsb_mrg_last_fetched = -1;
const UCHAR* const last_data = get_merge_data(tdbb, mfb, record);
mfb->mfb_current_block = 0;
UCHAR* const first_data = get_merge_data(tdbb, mfb, 0);
if (first_data != last_data)
memcpy(first_data, last_data, map->smb_length);
mfb->mfb_equal_records = 1;
record = 0;
}
else
{
mfb->mfb_current_block = 0;
mfb->mfb_equal_records = 0;
if ((record = get_merge_record(tdbb, sort_rsb, tail)) < 0)
return false;
}
/* Map data into target records and do comparison */
map_sort_data(tdbb, request, map, get_merge_data(tdbb, mfb, record));
if (ptr != highest_ptr && compare(tdbb, (jrd_nod*) highest_ptr[1], (jrd_nod*) ptr[1]) < 0)
{
highest_ptr = ptr;
}
}
/* Loop thru the streams advancing each up to the target value. If any
exceeds the target value, start over */
for (;;)
{
for (ptr = rsb->rsb_arg, tail = impure->irsb_mrg_rpt; ptr < end; ptr += 2, tail++)
{
if (highest_ptr != ptr)
{
int result;
while ( (result = compare(tdbb, (jrd_nod*) highest_ptr[1], (jrd_nod*) ptr[1])) )
{
if (result < 0) {
highest_ptr = ptr;
goto recycle;
}
RecordSource* sort_rsb = *ptr;
merge_file* mfb = &tail->irsb_mrg_file;
mfb->mfb_current_block = 0;
mfb->mfb_equal_records = 0;
const SLONG record = get_merge_record(tdbb, sort_rsb, tail);
if (record < 0)
return false;
map_sort_data(tdbb, request, (SortMap*) sort_rsb->rsb_arg[0],
get_merge_data(tdbb, mfb, record));
}
}
}
break;
recycle:;
}
/* Finally compute equality group for each stream in sort/merge */
for (ptr = rsb->rsb_arg, tail = impure->irsb_mrg_rpt; ptr < end; ptr += 2, tail++)
{
RecordSource* sort_rsb = *ptr;
SortMap* map = (SortMap*) sort_rsb->rsb_arg[0];
merge_file* mfb = &tail->irsb_mrg_file;
Firebird::HalfStaticArray<ULONG, 64> key;
ULONG* const first_data = key.getBuffer(map->smb_key_length);
const ULONG key_length = map->smb_key_length * sizeof(ULONG);
memcpy(first_data, get_merge_data(tdbb, mfb, 0), key_length);
SLONG record;
while ((record = get_merge_record(tdbb, sort_rsb, tail)) >= 0)
{
if (compare_longs((const SLONG*) first_data,
(const SLONG*) get_merge_data(tdbb, mfb, record),
map->smb_key_length))
{
tail->irsb_mrg_last_fetched = record;
break;
}
tail->irsb_mrg_equal_end = record;
}
if (mfb->mfb_current_block)
write_merge_block(tdbb, mfb, mfb->mfb_current_block);
}
/* Optimize cross product of equivalence groups by ordering the streams
from left (outermost) to right (innermost) by descending cardinality
of merge blocks. This ordering will vary for each set of equivalence
groups and cannot be statically assigned by the optimizer. */
typedef Firebird::Stack<irsb_mrg::irsb_mrg_repeat*> ImrStack;
ImrStack best_tails;
tail = impure->irsb_mrg_rpt;
for (const irsb_mrg::irsb_mrg_repeat* const tail_end = tail + rsb->rsb_count;
tail < tail_end; tail++)
{
irsb_mrg::irsb_mrg_repeat* best_tail = NULL;
ULONG most_blocks = 0;
for (irsb_mrg::irsb_mrg_repeat* tail2 = impure->irsb_mrg_rpt; tail2 < tail_end; tail2++)
{
ImrStack::iterator stack(best_tails);
for (; stack.hasData(); ++stack)
{
if (stack.object() == tail2)
{
break;
}
}
if (stack.hasData()) {
continue;
}
merge_file* mfb = &tail2->irsb_mrg_file;
ULONG blocks = mfb->mfb_equal_records / mfb->mfb_blocking_factor;
if (++blocks > most_blocks) {
most_blocks = blocks;
best_tail = tail2;
}
}
best_tails.push(best_tail);
tail->irsb_mrg_order = best_tail - impure->irsb_mrg_rpt;
}
/*
while (best_tails) {
LLS_POP(&best_tails);
}
*/
return true;
}
static SLONG get_merge_record(thread_db* tdbb,
RecordSource* rsb, irsb_mrg::irsb_mrg_repeat * impure)
{
/**************************************
*
* g e t _ m e r g e _ r e c o r d
*
**************************************
*
* Functional description
* Get the next record from sort. If there is one, allocate
* a sort/merge record block for it.
*
**************************************/
SET_TDBB(tdbb);
UCHAR* sort_data = get_sort(tdbb, rsb);
if (!sort_data)
return -1;
SortMap* map = (SortMap*) rsb->rsb_arg[0];
merge_file* mfb = &impure->irsb_mrg_file;
const SLONG record = mfb->mfb_equal_records;
const ULONG merge_block = record / mfb->mfb_blocking_factor;
if (merge_block != mfb->mfb_current_block)
{
write_merge_block(tdbb, mfb, mfb->mfb_current_block);
mfb->mfb_current_block = merge_block;
}
const ULONG merge_offset = (record % mfb->mfb_blocking_factor) * mfb->mfb_record_size;
UCHAR* merge_data = mfb->mfb_block_data + merge_offset;
memcpy(merge_data, sort_data, map->smb_length);
++mfb->mfb_equal_records;
return record;
}
static bool get_procedure(thread_db* tdbb,
RecordSource* rsb,
irsb_procedure* impure,
record_param* rpb)
{
/**************************************
*
* g e t _ p r o c e d u r e
*
**************************************
*
* Functional description
* Get the next record from a procedural view.
*
**************************************/
SET_TDBB(tdbb);
jrd_prc* procedure = rsb->rsb_procedure;
jrd_req* request = tdbb->getRequest();
impure = (irsb_procedure*) ((UCHAR *) request + rsb->rsb_impure);
jrd_req* proc_request = impure->irsb_req_handle;
Format* rec_format = procedure->prc_format;
const Format* msg_format = (Format*) procedure->prc_output_msg->nod_arg[e_msg_format];
if (!impure->irsb_message)
{
const SLONG size = msg_format->fmt_length + FB_ALIGNMENT;
impure->irsb_message = FB_NEW_RPT(*tdbb->getDefaultPool(), size) VaryingString();
impure->irsb_message->str_length = size;
}
UCHAR* om = (UCHAR *) FB_ALIGN((U_IPTR) impure->irsb_message->str_data, FB_ALIGNMENT);
USHORT oml = impure->irsb_message->str_length - FB_ALIGNMENT;
Record* record;
if (!rpb->rpb_record) {
record = rpb->rpb_record =
FB_NEW_RPT(*tdbb->getDefaultPool(), rec_format->fmt_length) Record(*tdbb->getDefaultPool());
record->rec_format = rec_format;
record->rec_length = rec_format->fmt_length;
}
else
record = rpb->rpb_record;
TraceProcFetch trace(tdbb, proc_request);
try {
EXE_receive(tdbb, proc_request, 1, oml, om);
dsc desc = msg_format->fmt_desc[msg_format->fmt_count - 1];
desc.dsc_address = (UCHAR*) (om + (IPTR) desc.dsc_address);
USHORT eos;
dsc eos_desc;
eos_desc.dsc_dtype = dtype_short;
eos_desc.dsc_scale = 0;
eos_desc.dsc_length = sizeof(SSHORT);
eos_desc.dsc_sub_type = 0;
eos_desc.dsc_flags = 0;
eos_desc.dsc_address = (UCHAR*) &eos;
MOV_move(tdbb, &desc, &eos_desc);
if (!eos)
{
trace.fetch(true, res_successful);
return false;
}
}
catch (const Firebird::Exception&)
{
trace.fetch(true, res_failed);
close_procedure(tdbb, rsb);
throw;
}
for (int i = 0; i < rec_format->fmt_count; i++)
{
proc_assignment(tdbb,
&msg_format->fmt_desc[2 * i],
&msg_format->fmt_desc[2 * i + 1],
om,
&rec_format->fmt_desc[i],
i,
record);
}
trace.fetch(false, res_successful);
return true;
}
bool RSE_internal_get_record(thread_db* tdbb,
RecordSource* rsb,
RecordSource* parent_rsb)
{
/**************************************
*
* R S E _ i n t e r n a l _ g e t _ r e c o r d
*
**************************************
*
* Functional description
* Get a record from an open record stream.
*
**************************************/
SET_TDBB(tdbb);
if (--tdbb->tdbb_quantum < 0)
JRD_reschedule(tdbb, 0, true);
/* check request flags for special processing */
jrd_req* request = tdbb->getRequest();
if (request->req_flags & req_abort)
{
return false;
}
if (!request->req_transaction)
{
return false;
}
IRSB impure = (IRSB) ((UCHAR *) request + rsb->rsb_impure);
if (impure->irsb_flags & irsb_singular_processed)
{
return false;
}
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
switch (rsb->rsb_type)
{
case rsb_sequential:
if (!VIO_next_record(tdbb, rpb, /*rsb,*/ request->req_transaction, request->req_pool, false))
{
rpb->rpb_number.setValid(false);
return false;
}
rpb->rpb_number.setValid(true);
break;
case rsb_indexed:
{
RecordBitmap **pbitmap = ((irsb_index*) impure)->irsb_bitmap, *bitmap;
if (!pbitmap || !(bitmap = *pbitmap))
{
rpb->rpb_number.setValid(false);
return false;
}
bool result = false;
// NS: Original code was the following:
// while (SBM_next(*bitmap, &rpb->rpb_number))
if (rpb->rpb_number.isBof() ? bitmap->getFirst() : bitmap->getNext())
{
do
{
rpb->rpb_number.setValue(bitmap->current());
#ifdef SUPERSERVER_V2
/* Prefetch next set of data pages from bitmap. */
if (rpb->rpb_number > ((irsb_index*) impure)->irsb_prefetch_number)
{
((irsb_index*) impure)->irsb_prefetch_number =
DPM_prefetch_bitmap(tdbb, rpb->rpb_relation, *bitmap, rpb->rpb_number);
}
#endif
if (VIO_get(tdbb, rpb, request->req_transaction, request->req_pool))
{
result = true;
break;
}
} while (bitmap->getNext());
}
if (result)
{
rpb->rpb_number.setValid(true);
break;
}
rpb->rpb_number.setValid(false);
return false;
}
case rsb_navigate:
if (!NAV_get_record(tdbb, rsb, (IRSB_NAV) impure, rpb))
{
rpb->rpb_number.setValid(false);
return false;
}
rpb->rpb_number.setValid(true);
break;
case rsb_boolean:
{
bool result;
/* For ANY and ALL clauses (ALL is handled as a negated ANY),
we must first detect them, and then make sure that the returned
results are correct. This mainly entails making sure that
there are in fact records in the source stream to test against.
If there were none, the response must be FALSE.
Also, if the result of the column comparison is always
NULL, this must also be returned as NULL. (Note that normally,
an AND of a NULL and a FALSE would be FALSE, not NULL).
This all depends on evl.c putting the unoptimized expression
in the rsb. The unoptimized expression always has the
select expression on the left, and the column comparison
on the right. */
jrd_nod* select_node; // ANY/ALL select node pointer
// ANY/ALL column node pointer
jrd_nod* column_node = (jrd_nod*) rsb->rsb_any_boolean;
if (column_node && (request->req_flags & (req_ansi_all | req_ansi_any)))
{
/* see if there's a select node to work with */
if (column_node->nod_type == nod_and)
{
select_node = column_node->nod_arg[0];
column_node = column_node->nod_arg[1];
}
else
{
select_node = NULL;
}
}
if (column_node && (request->req_flags & req_ansi_any))
{
bool any_null; // some records null for ANY/ALL
bool any_true; // some records true for ANY/ALL
request->req_flags &= ~req_ansi_any;
if (request->req_flags & req_ansi_not)
{
request->req_flags &= ~req_ansi_not;
/* do NOT ANY */
/* if the subquery was the empty set
(numTrue + numFalse + numUnknown = 0)
or if all were false
(numTrue + numUnknown = 0),
NOT ANY is true */
any_null = false;
any_true = false;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, rsb))
{
if (EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[0]))
{
/* found a TRUE value */
any_true = true;
break;
}
/* check for select stream and nulls */
if (!select_node)
{
if (request->req_flags & req_null)
{
any_null = true;
break;
}
}
else
{
request->req_flags &= ~req_null;
// select for ANY/ALL processing
const bool select_value = EVL_boolean(tdbb, select_node);
/* see if any record in select stream */
if (select_value)
{
/* see if any nulls */
request->req_flags &= ~req_null;
EVL_boolean(tdbb, column_node);
/* see if any record is null */
if (request->req_flags & req_null) {
any_null = true;
break;
}
}
}
}
request->req_flags &= ~req_null;
if (any_null || any_true)
result = true;
else
{
invalidate_child_rpbs(tdbb, rsb);
return false;
}
break;
}
else
{
/* do ANY */
/* if the subquery was true for any comparison,
ANY is true */
result = false;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, rsb))
{
if (EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[0])) {
result = true;
break;
}
}
request->req_flags &= ~req_null;
if (result)
break;
invalidate_child_rpbs(tdbb, rsb);
return false;
}
}
else if (column_node && (request->req_flags & req_ansi_all))
{
bool any_false; // some records false for ANY/ALL
request->req_flags &= ~req_ansi_all;
if (request->req_flags & req_ansi_not)
{
request->req_flags &= ~req_ansi_not;
/* do NOT ALL */
/* if the subquery was false for any comparison,
NOT ALL is true */
any_false = false;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, rsb))
{
request->req_flags &= ~req_null;
/* look for a FALSE (and not null either) */
if (!EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[0]) &&
!(request->req_flags & req_null))
{
/* make sure it wasn't FALSE because there's
no select stream record */
if (select_node) {
request->req_flags &= ~req_null;
// select for ANY/ALL processing
const bool select_value = EVL_boolean(tdbb, select_node);
if (select_value) {
any_false = true;
break;
}
}
else {
any_false = true;
break;
}
}
}
request->req_flags &= ~req_null;
if (any_false)
{
invalidate_child_rpbs(tdbb, rsb);
return false;
}
result = true;
break;
}
else
{
/* do ALL */
/* if the subquery was the empty set
(numTrue + numFalse + numUnknown = 0)
or if all were true
(numFalse + numUnknown = 0),
ALL is true */
any_false = false;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, rsb))
{
request->req_flags &= ~req_null;
/* look for a FALSE or null */
if (!EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[0]))
{
/* make sure it wasn't FALSE because there's
no select stream record */
if (select_node) {
request->req_flags &= ~req_null;
// select for ANY/ALL processing
const bool select_value = EVL_boolean(tdbb, select_node);
if (select_value) {
any_false = true;
break;
}
}
else {
any_false = true;
break;
}
}
}
request->req_flags &= ~req_null;
if (any_false)
{
invalidate_child_rpbs(tdbb, rsb);
return false;
}
result = true;
break;
}
}
else
{
bool flag = false;
result = false;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, rsb))
{
if (EVL_boolean(tdbb, (jrd_nod*) rsb->rsb_arg[0])) {
result = true;
break;
}
if (request->req_flags & req_null)
flag = true;
}
if (flag)
request->req_flags |= req_null;
if (result)
break;
invalidate_child_rpbs(tdbb, rsb);
return false;
}
}
/******
*** IMPORTANT!!
*
* If the RecordSource list contains both a rsb_first node and a rsb_skip node
* the rsb_skip node MUST be after the rsb_first node in the list.
* The reason is the rsb_skip calls get_record in a loop to skip
* over the first n records in the stream. If the rsb_first node
* was down stream the counter associated with rsb_first would
* be decremented by the calls to get_record that never return a
* record to the user. Possible symptoms of this are erroneous
* empty result sets (when skip >= first) and too small result sets
* (when first > skip, first - skip records will be returned).
*******/
case rsb_first:
if (((irsb_first_n*) impure)->irsb_count <= 0)
{
invalidate_child_rpbs(tdbb, rsb);
return false;
}
((irsb_first_n*) impure)->irsb_count--;
if (!RSE_internal_get_record(tdbb, rsb->rsb_next, NULL))
return false;
break;
case rsb_skip:
{
irsb_skip_n* skip = (irsb_skip_n*) impure;
while (skip->irsb_count > 1) {
skip->irsb_count--;
if (!RSE_internal_get_record(tdbb, rsb->rsb_next, NULL))
return false;
}
skip->irsb_count--;
if (!RSE_internal_get_record(tdbb, rsb->rsb_next, NULL))
return false;
}
break;
case rsb_merge:
if (!get_merge_join(tdbb, rsb, (irsb_mrg*) impure))
{
return false;
}
break;
case rsb_procedure:
if (!get_procedure(tdbb, rsb, (irsb_procedure*) impure, rpb))
{
rpb->rpb_number.setValid(false);
return false;
}
rpb->rpb_number.setValid(true);
break;
case rsb_sort:
{
UCHAR* data;
if (!(data = get_sort(tdbb, rsb)))
{
return false;
}
map_sort_data(tdbb, request, (SortMap*) rsb->rsb_arg[0], data);
}
break;
case rsb_cross:
if (impure->irsb_flags & irsb_first) {
for (USHORT i = 0; i < rsb->rsb_count; i++)
{
RSE_open(tdbb, rsb->rsb_arg[i]);
if (!fetch_record(tdbb, rsb, i))
{
return false;
}
}
impure->irsb_flags &= ~irsb_first;
break;
}
/* in the case of a project which has been mapped to an index,
we need to make sure that we only return a single record for
each of the leftmost records in the join */
if (rsb->rsb_flags & rsb_project)
{
if (!fetch_record(tdbb, rsb, 0))
{
return false;
}
}
// hvlad: self referenced members are removed from recursive SELECT's
// in recursive CTE (it is done in dsql\pass1.cpp). If there are no other
// members in such SELECT then rsb_count will be zero. Handle it
else if (rsb->rsb_count == 0)
return false;
else if (!fetch_record(tdbb, rsb, rsb->rsb_count - 1))
{
return false;
}
break;
case rsb_union:
if (!get_union(tdbb, rsb, impure))
return false;
break;
case rsb_recursive_union:
if (!RSBRecurse::get(tdbb, rsb, (irsb_recurse*) impure))
return false;
break;
case rsb_aggregate:
if ( (impure->irsb_count =
EVL_group(tdbb, rsb->rsb_next, (jrd_nod*) rsb->rsb_arg[0], impure->irsb_count)) )
{
rpb->rpb_number.setValid(true);
break;
}
return false;
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
if (!EXT_get(tdbb, rsb))
{
rpb->rpb_number.setValid(false);
return false;
}
rpb->rpb_number.setValid(true);
break;
case rsb_record_stream:
if (!rsb->rsb_record_stream->get(tdbb))
{
rpb->rpb_number.setValid(false);
return false;
}
rpb->rpb_number.setValid(true);
break;
case rsb_left_cross:
if (!fetch_left(tdbb, rsb, impure))
{
return false;
}
break;
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
/* Check to see if we need to update the record_count. This record
count is used in NAV_get_record and needs to be updated before
checking for singularity. Note that in our check for singularity
we call get_record which calls NAV_get_record where this count
is used. Bug # 8415, 8416 */
if (rsb->rsb_type == rsb_boolean)
rsb->rsb_next->rsb_record_count++;
else if (!parent_rsb || parent_rsb->rsb_type != rsb_boolean)
rsb->rsb_record_count++;
if (rsb->rsb_flags & rsb_singular && !(impure->irsb_flags & irsb_checking_singular))
{
push_rpbs(tdbb, request, rsb);
impure->irsb_flags |= irsb_checking_singular;
if (RSE_internal_get_record(tdbb, rsb, parent_rsb)) {
impure->irsb_flags &= ~irsb_checking_singular;
ERR_post(Arg::Gds(isc_sing_select_err));
}
pop_rpbs(request, rsb);
impure->irsb_flags &= ~irsb_checking_singular;
impure->irsb_flags |= irsb_singular_processed;
}
return true;
}
static UCHAR *get_sort(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* g e t _ s o r t
*
**************************************
*
* Functional description
* Get the next raw record from a sort stream. The caller has the
* responsibility for mapping the raw data in the target records.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
irsb_sort* impure = (irsb_sort*) ((UCHAR *) request + rsb->rsb_impure);
/* Get address of record from sort. If the address if null, we
ran out of records. This is known in the trade as "end of file." */
ULONG* data = 0;
SORT_get(tdbb, impure->irsb_sort_handle, &data);
return reinterpret_cast<UCHAR*>(data);
}
static bool get_union(thread_db* tdbb, RecordSource* rsb, IRSB impure)
{
/**************************************
*
* g e t _ u n i o n
*
**************************************
*
* Functional description
* Get next record in a union.
*
**************************************/
SET_TDBB(tdbb);
RecordSource** rsb_ptr = rsb->rsb_arg + impure->irsb_count;
/* March thru the sub-streams (tributaries?) looking for a record */
while (!RSE_internal_get_record(tdbb, *rsb_ptr, NULL))
{
RSE_close(tdbb, *rsb_ptr);
impure->irsb_count += 2;
if (impure->irsb_count >= rsb->rsb_count)
return false;
rsb_ptr += 2;
RSE_open(tdbb, *rsb_ptr);
}
/* We've got a record, map it into the target record */
jrd_nod* map = (jrd_nod*) rsb_ptr[1];
jrd_nod** ptr = map->nod_arg;
for (const jrd_nod* const* const end = ptr + map->nod_count; ptr < end; ptr++)
EXE_assignment(tdbb, *ptr);
return true;
}
static void invalidate_child_rpbs(thread_db* tdbb, RecordSource* rsb)
{
/**************************************
*
* i n v a l i d a t e _ c h i l d _ r p b s
*
**************************************
*
* Functional description
* Mark child RPBs as invalid.
*
**************************************/
SET_TDBB(tdbb);
while (true)
{
jrd_req* request = tdbb->getRequest();
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
switch (rsb->rsb_type)
{
case rsb_indexed:
case rsb_navigate:
case rsb_sequential:
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
case rsb_record_stream:
case rsb_procedure:
rpb->rpb_number.setValid(false);
return;
case rsb_first:
case rsb_skip:
case rsb_boolean:
case rsb_aggregate:
case rsb_sort:
rsb = rsb->rsb_next;
break;
case rsb_cross:
{
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count; ptr < end; ptr++)
{
invalidate_child_rpbs(tdbb, *ptr);
}
return;
}
case rsb_left_cross:
invalidate_child_rpbs(tdbb, rsb->rsb_arg[RSB_LEFT_outer]);
invalidate_child_rpbs(tdbb, rsb->rsb_arg[RSB_LEFT_inner]);
return;
case rsb_merge:
{
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count * 2;
ptr < end; ptr += 2)
{
invalidate_child_rpbs(tdbb, *ptr);
}
}
return;
case rsb_union:
{
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* end = ptr + rsb->rsb_count; ptr < end; ptr += 2)
invalidate_child_rpbs(tdbb, *ptr);
}
return;
case rsb_recursive_union:
{
// hvlad: recursive CTE is always a 'union all' of
// exactly two members.
// see also comments for RSBRecurse::open
invalidate_child_rpbs(tdbb, rsb->rsb_arg[0]);
invalidate_child_rpbs(tdbb, rsb->rsb_arg[2]);
}
return;
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
}
}
static void join_to_nulls(thread_db* tdbb, StreamStack* stream)
{
/**************************************
*
* j o i n _ t o _ n u l l s
*
**************************************
*
* Functional description
* Loop through the streams on the right side of a left
* outer join, and make them all indicate a null record.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
for (StreamStack::iterator stack(*stream); stack.hasData(); ++stack)
{
record_param* rpb = &request->req_rpb[stack.object()];
rpb->rpb_number.setValid(false);
/* Make sure a record block has been allocated. If there isn't
one, first find the format, then allocate the record block */
Record* record = rpb->rpb_record;
if (!record) {
const Format* format = rpb->rpb_relation->rel_current_format;
if (!format) {
format = MET_format(tdbb, rpb->rpb_relation, rpb->rpb_format_number);
}
record = VIO_record(tdbb, rpb, format, tdbb->getDefaultPool());
}
if (record->rec_format) {
record->rec_fmt_bk = record->rec_format;
}
record->rec_format = NULL;
}
}
static void map_sort_data(thread_db* tdbb, jrd_req* request, SortMap* map, UCHAR * data)
{
/**************************************
*
* m a p _ s o r t _ d a t a
*
**************************************
*
* Functional description
* Given a sort record, a sort map, and a request, map data from
* the raw sort record to civilized record blocks.
*
**************************************/
DSC from, to;
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
const UCHAR flag = *(data + item->smb_flag_offset);
from = item->smb_desc;
from.dsc_address = data + (IPTR) from.dsc_address;
jrd_nod* node = item->smb_node;
if (node && node->nod_type != nod_field)
continue;
/* if moving a TEXT item into the key portion of
the sort record, then want to sort by
language dependant order */
/* in the case below a nod_field is being converted to
a sort key, there is a later nod_field in the item
list that contains the data to send back
*/
if (IS_INTL_DATA(&item->smb_desc) &&
(USHORT)(IPTR) item->smb_desc.dsc_address < map->smb_key_length * sizeof(ULONG))
{
continue;
}
record_param* rpb = &request->req_rpb[item->smb_stream];
const SSHORT id = item->smb_field_id;
if (id < 0)
{
switch (id)
{
case SMB_TRANS_ID:
rpb->rpb_transaction_nr = *reinterpret_cast<SLONG*>(from.dsc_address);
break;
case SMB_DBKEY:
rpb->rpb_number.setValue(*reinterpret_cast<SINT64*>(from.dsc_address));
break;
case SMB_DBKEY_VALID:
rpb->rpb_number.setValid(*from.dsc_address != 0);
break;
default:
fb_assert(false);
}
rpb->rpb_stream_flags |= RPB_s_refetch;
continue;
}
Record* record = rpb->rpb_record;
if (record && !flag && !record->rec_format) {
fb_assert(record->rec_fmt_bk);
record->rec_format = record->rec_fmt_bk; // restore the format
}
EVL_field(0, record, id, &to);
if (flag)
SET_NULL(record, id);
else {
MOV_move(tdbb, &from, &to);
CLEAR_NULL(record, id);
}
}
}
static void open_merge(thread_db* tdbb, RecordSource* rsb, irsb_mrg* impure)
{
/**************************************
*
* o p e n _ m e r g e
*
**************************************
*
* Functional description
* Initialize a merge stream by opening all substreams
* and cleaning up after any prior sort-merge retrieval.
*
**************************************/
SET_TDBB(tdbb);
/* do two simultaneous but unrelated things in one loop */
RecordSource** ptr = rsb->rsb_arg;
const RecordSource* const* end = ptr + rsb->rsb_count * 2;
for (irsb_mrg::irsb_mrg_repeat* tail = impure->irsb_mrg_rpt; ptr < end; ptr += 2, tail++)
{
/* open all the substreams for the sort-merge */
RSE_open(tdbb, *ptr);
RecordSource* sort_rsb = *ptr;
SortMap* map = (SortMap*) sort_rsb->rsb_arg[0];
/* Reset equality group record positions */
tail->irsb_mrg_equal = -1;
tail->irsb_mrg_equal_end = -1;
tail->irsb_mrg_equal_current = -1;
tail->irsb_mrg_last_fetched = -1;
tail->irsb_mrg_order = tail - impure->irsb_mrg_rpt;
merge_file* mfb = &tail->irsb_mrg_file;
mfb->mfb_equal_records = 0;
mfb->mfb_current_block = 0;
mfb->mfb_record_size = ROUNDUP(map->smb_length, FB_ALIGNMENT);
mfb->mfb_block_size = MAX(mfb->mfb_record_size, MERGE_BLOCK_SIZE);
mfb->mfb_blocking_factor = mfb->mfb_block_size / mfb->mfb_record_size;
if (!mfb->mfb_block_data)
{
mfb->mfb_block_data = FB_NEW(*tdbb->getRequest()->req_pool) UCHAR[mfb->mfb_block_size];
}
}
}
static void open_procedure(thread_db* tdbb, RecordSource* rsb, irsb_procedure* impure)
{
/**************************************
*
* o p e n _ p r o c e d u r e
*
**************************************
*
* Functional description
* Initialize a procedural view.
*
**************************************/
SET_TDBB(tdbb);
jrd_nod* inputs = (jrd_nod*) rsb->rsb_arg[RSB_PRC_inputs];
jrd_prc* procedure = rsb->rsb_procedure;
jrd_req* request = tdbb->getRequest();
/* get rid of any lingering record */
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
delete rpb->rpb_record;
rpb->rpb_record = NULL;
USHORT iml;
UCHAR* im;
jrd_req* proc_request = EXE_find_request(tdbb, procedure->prc_request, false);
impure->irsb_req_handle = proc_request;
if (inputs)
{
enum jrd_req::req_s saved_state = request->req_operation;
jrd_nod** ptr = inputs->nod_arg;
for (const jrd_nod* const* const end = ptr + inputs->nod_count; ptr < end; ptr++)
{
EXE_assignment(tdbb, *ptr);
}
request->req_operation = saved_state;
jrd_nod* in_message = (jrd_nod*) rsb->rsb_arg[RSB_PRC_in_msg];
const Format* format = (Format*) in_message->nod_arg[e_msg_format];
iml = format->fmt_length;
im = (UCHAR *) request + in_message->nod_impure;
}
else {
iml = 0;
im = NULL;
}
/* req_proc_fetch flag used only when fetching rows, so
is set at end of open_procedure (). */
proc_request->req_flags &= ~req_proc_fetch;
try {
proc_request->req_timestamp = request->req_timestamp;
TraceProcExecute trace(tdbb, proc_request, request, inputs);
EXE_start(tdbb, proc_request, request->req_transaction);
if (iml) {
EXE_send(tdbb, proc_request, 0, iml, im);
}
trace.finish(true, res_successful);
}
catch (const Firebird::Exception&) {
close_procedure(tdbb, rsb);
throw;
}
proc_request->req_flags |= req_proc_fetch;
}
static void open_sort(thread_db* tdbb, RecordSource* rsb, irsb_sort* impure) //, FB_UINT64 max_records)
{
/**************************************
*
* o p e n _ s o r t
*
**************************************
*
* Functional description
* Initialize sort, open the sub-stream, pump all records
* into sort, etc. This gets things going.
*
**************************************/
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
RSE_open(tdbb, rsb->rsb_next);
SortMap* map = (SortMap*) rsb->rsb_arg[0];
ULONG records = 0;
// Get rid of the old sort areas if this request has been used already
SORT_fini(impure->irsb_sort_handle);
// Initialize for sort. If this is really a project operation,
// establish a callback routine to reject duplicate records.
impure->irsb_sort_handle =
SORT_init(tdbb->getDatabase(), &request->req_sorts,
map->smb_length, map->smb_keys, map->smb_keys, map->smb_key_desc,
((map->smb_flags & SMB_project) ? reject : NULL), 0); //, max_records);
try {
// Pump the input stream dry while pushing records into sort. For
// each record, map all fields into the sort record. The reverse
// mapping is done in get_sort().
dsc to, temp;
while (RSE_internal_get_record(tdbb, rsb->rsb_next, NULL))
{
records++;
// "Put" a record to sort. Actually, get the address of a place
// to build a record.
UCHAR* data = 0;
SORT_put(tdbb, impure->irsb_sort_handle, reinterpret_cast<ULONG**>(&data));
// Zero out the sort key. This solve a multitude of problems.
MOVE_CLEAR(data, (SLONG) map->smb_length);
// Loop thru all field (keys and hangers on) involved in the sort.
// Be careful to null field all unused bytes in the sort key.
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
to = item->smb_desc;
to.dsc_address = data + (IPTR) to.dsc_address;
bool flag = false;
dsc* from = 0;
if (item->smb_node)
{
from = EVL_expr(tdbb, item->smb_node);
if (request->req_flags & req_null)
flag = true;
}
else
{
from = &temp;
record_param* rpb = &request->req_rpb[item->smb_stream];
if (item->smb_field_id < 0)
{
switch (item->smb_field_id)
{
case SMB_TRANS_ID:
*reinterpret_cast<SLONG*>(to.dsc_address) = rpb->rpb_transaction_nr;
break;
case SMB_DBKEY:
*reinterpret_cast<SINT64*>(to.dsc_address) = rpb->rpb_number.getValue();
break;
case SMB_DBKEY_VALID:
*to.dsc_address = (UCHAR) rpb->rpb_number.isValid();
break;
default:
fb_assert(false);
}
continue;
}
if (!EVL_field(rpb->rpb_relation, rpb->rpb_record, item->smb_field_id, from))
{
flag = true;
}
}
*(data + item->smb_flag_offset) = flag ? TRUE : FALSE;
if (!flag) {
// If moving a TEXT item into the key portion of the sort record,
// then want to sort by language dependent order.
if (IS_INTL_DATA(&item->smb_desc) &&
(USHORT)(IPTR) item->smb_desc.dsc_address < map->smb_key_length * sizeof(ULONG))
{
INTL_string_to_key(tdbb, INTL_INDEX_TYPE(&item->smb_desc), from, &to,
(map->smb_flags & SMB_unique_sort ? INTL_KEY_UNIQUE : INTL_KEY_SORT));
}
else
MOV_move(tdbb, from, &to);
}
}
}
SORT_sort(tdbb, impure->irsb_sort_handle);
}
catch (const Firebird::Exception& ex) {
Firebird::stuff_exception(tdbb->tdbb_status_vector, ex);
SORT_fini(impure->irsb_sort_handle);
impure->irsb_sort_handle = NULL;
ERR_punt();
}
// For the sake of prudence, set all record parameter blocks to contain
// the most recent format. This is will guarentee that all fields mapped
// back to records by get_sort() have homes in the target record.
if (!records)
return;
SSHORT stream = -1;
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
if (item->smb_node && item->smb_node->nod_type != nod_field)
continue;
if (item->smb_stream == stream)
continue;
stream = item->smb_stream;
record_param* rpb = &request->req_rpb[stream];
if (rpb->rpb_relation)
VIO_record(tdbb, rpb, MET_current(tdbb, rpb->rpb_relation), tdbb->getDefaultPool());
}
}
static void proc_assignment(thread_db* tdbb,
const dsc* from_desc,
const dsc* flag_desc,
UCHAR* msg, // this param is logically const
const dsc* to_desc, SSHORT to_id, Record* record)
{
/**************************************
*
* p r o c _ a s s i g n m e n t
*
**************************************
*
* Functional description
* Perform an assignment from a message to a record format.
*
**************************************/
SSHORT indicator;
dsc desc2;
desc2.dsc_dtype = dtype_short;
desc2.dsc_scale = 0;
desc2.dsc_length = sizeof(SSHORT);
desc2.dsc_sub_type = 0;
desc2.dsc_flags = 0;
desc2.dsc_address = (UCHAR *) & indicator;
dsc desc1;
desc1 = *flag_desc;
desc1.dsc_address = msg + (IPTR) flag_desc->dsc_address;
MOV_move(tdbb, &desc1, &desc2);
if (indicator)
{
SET_NULL(record, to_id);
const USHORT l = to_desc->dsc_length;
UCHAR* p = record->rec_data + (IPTR) to_desc->dsc_address;
switch (to_desc->dsc_dtype)
{
case dtype_text:
/* YYY - not necessarily the right thing to do */
/* YYY for text formats that don't have trailing spaces */
if (l) {
const CHARSET_ID chid = DSC_GET_CHARSET(to_desc);
/*
CVC: I don't know if we have to check for dynamic-127 charset here.
If that is needed, the line above should be replaced by the ccmmented code here.
CHARSET_ID chid = INTL_TTYPE(to_desc);
if (chid == ttype_dynamic)
chid = INTL_charset(tdbb, chid);
*/
const char pad = chid == ttype_binary ? '\0' : ' ';
memset(p, pad, l);
}
break;
case dtype_cstring:
*p = 0;
break;
case dtype_varying:
*reinterpret_cast<SSHORT*>(p) = 0;
break;
default:
if (l)
memset(p, 0, l);
break;
}
}
else
{
CLEAR_NULL(record, to_id);
desc1 = *from_desc;
desc1.dsc_address = msg + (IPTR) desc1.dsc_address;
desc2 = *to_desc;
desc2.dsc_address = record->rec_data + (IPTR) desc2.dsc_address;
if (!DSC_EQUIV(&desc1, &desc2, false))
{
MOV_move(tdbb, &desc1, &desc2);
return;
}
switch (desc1.dsc_dtype)
{
case dtype_short:
*reinterpret_cast<SSHORT*>(desc2.dsc_address) = *reinterpret_cast<SSHORT*>(desc1.dsc_address);
break;
case dtype_long:
*reinterpret_cast<SLONG*>(desc2.dsc_address) = *reinterpret_cast<SLONG*>(desc1.dsc_address);
break;
case dtype_int64:
*reinterpret_cast<SINT64*>(desc2.dsc_address) = *reinterpret_cast<SINT64*>(desc1.dsc_address);
break;
default:
memcpy(desc2.dsc_address, desc1.dsc_address, desc1.dsc_length);
}
}
}
static void pop_rpbs(jrd_req* request, RecordSource* rsb)
{
/**************************************
*
* p o p _ r p b s
*
**************************************
*
* Functional description
* Restore record state to saved copy.
*
**************************************/
// temporary sparse bitmap of the used streams
Firebird::HalfStaticArray<UCHAR, OPT_STATIC_ITEMS> streams(*request->req_pool);
switch (rsb->rsb_type)
{
case rsb_indexed:
case rsb_sequential:
case rsb_procedure:
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
case rsb_navigate:
case rsb_union:
case rsb_recursive_union:
case rsb_aggregate:
case rsb_record_stream:
{
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
restore_record(rpb);
break;
}
case rsb_sort:
{
streams.grow(request->req_count);
memset(streams.begin(), 0, request->req_count * sizeof(UCHAR));
const SortMap* map = (SortMap*) rsb->rsb_arg[0];
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (const smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
streams[item->smb_stream] = 1;
}
for (int i = 0; i < request->req_count; i++)
{
if (streams[i])
{
record_param* rpb = &request->req_rpb[i];
restore_record(rpb);
}
}
}
break;
case rsb_merge:
{
streams.grow(request->req_count);
memset(streams.begin(), 0, request->req_count * sizeof(UCHAR));
const RecordSource* const* const end = rsb->rsb_arg + rsb->rsb_count * 2;
// irsb_mrg* impure = (irsb_mrg*) ((UCHAR *) request + rsb->rsb_impure);
for (const RecordSource* const* ptr = rsb->rsb_arg; ptr < end; ptr += 2)
{
const RecordSource* sort_rsb = *ptr;
const SortMap* map = (SortMap*) sort_rsb->rsb_arg[0];
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (const smb_repeat* item = map->smb_rpt; item < end_item; item += 2)
{
streams[item->smb_stream] = 1;
}
}
for (int i = 0; i < request->req_count; i++)
{
if (streams[i])
{
record_param* rpb = &request->req_rpb[i];
restore_record(rpb);
}
}
}
break;
case rsb_first:
case rsb_skip:
case rsb_boolean:
pop_rpbs(request, rsb->rsb_next);
break;
case rsb_cross:
{
/* Bug # 72369: singleton-SELECT in Stored Procedure gives wrong
* results when there are more than 2 streams in the cross.
* rsb_cross can have more than 2 rsb_arg's. Go through each one
*/
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count; ptr < end; ptr++)
{
pop_rpbs(request, *ptr);
}
}
break;
case rsb_left_cross:
pop_rpbs(request, rsb->rsb_arg[RSB_LEFT_outer]);
pop_rpbs(request, rsb->rsb_arg[RSB_LEFT_inner]);
break;
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
}
static void push_rpbs(thread_db* tdbb, jrd_req* request, RecordSource* rsb)
{
/**************************************
*
* p u s h _ r p b s
*
**************************************
*
* Functional description
* Save data state for current rsb
*
**************************************/
SET_TDBB(tdbb);
// temporary sparse bitmap of the used streams
Firebird::HalfStaticArray<UCHAR, OPT_STATIC_ITEMS> streams(*request->req_pool);
switch (rsb->rsb_type)
{
case rsb_indexed:
case rsb_sequential:
case rsb_procedure:
case rsb_ext_sequential:
case rsb_ext_indexed:
case rsb_ext_dbkey:
case rsb_navigate:
case rsb_union:
case rsb_recursive_union:
case rsb_aggregate:
case rsb_record_stream:
{
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
save_record(tdbb, rpb);
break;
}
case rsb_sort:
{
streams.grow(request->req_count);
memset(streams.begin(), 0, request->req_count * sizeof(UCHAR));
const SortMap* map = (SortMap*) rsb->rsb_arg[0];
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (const smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
streams[item->smb_stream] = 1;
}
for (int i = 0; i < request->req_count; i++)
{
if (streams[i])
{
record_param* rpb = &request->req_rpb[i];
save_record(tdbb, rpb);
}
}
}
break;
case rsb_merge:
{
streams.grow(request->req_count);
memset(streams.begin(), 0, request->req_count * sizeof(UCHAR));
const RecordSource* const* const end = rsb->rsb_arg + rsb->rsb_count * 2;
// irsb_mrg* impure = (irsb_mrg*) ((UCHAR *) request + rsb->rsb_impure);
for (const RecordSource* const* ptr = rsb->rsb_arg; ptr < end; ptr += 2)
{
const RecordSource* sort_rsb = *ptr;
const SortMap* map = (SortMap*) sort_rsb->rsb_arg[0];
const smb_repeat* const end_item = map->smb_rpt + map->smb_count;
for (const smb_repeat* item = map->smb_rpt; item < end_item; item++)
{
streams[item->smb_stream] = 1;
}
}
for (int i = 0; i < request->req_count; i++)
{
if (streams[i])
{
record_param* rpb = &request->req_rpb[i];
save_record(tdbb, rpb);
}
}
}
break;
case rsb_first:
case rsb_skip:
case rsb_boolean:
push_rpbs(tdbb, request, rsb->rsb_next);
break;
case rsb_cross:
{
/* Bug # 72369: singleton-SELECT in Stored Procedure gives wrong
* results when there are more than 2 streams in the cross.
* rsb_cross can have more than 2 rsb_arg's. Go through each one
*/
RecordSource** ptr = rsb->rsb_arg;
for (const RecordSource* const* const end = ptr + rsb->rsb_count; ptr < end; ptr++)
{
push_rpbs(tdbb, request, *ptr);
}
}
break;
/* BUG #8637: left outer join gives internal gds software consistency
check. Added case for rsb_left_cross. */
case rsb_left_cross:
push_rpbs(tdbb, request, rsb->rsb_arg[RSB_LEFT_outer]);
push_rpbs(tdbb, request, rsb->rsb_arg[RSB_LEFT_inner]);
break;
default:
BUGCHECK(166); /* msg 166 invalid rsb type */
}
}
static ULONG read_merge_block(thread_db* tdbb, merge_file* mfb, ULONG block)
{
/**************************************
*
* r e a d _ m e r g e _ b l o c k
*
**************************************
*
* Functional description
* Read a block from the merge equivalence file.
*
**************************************/
fb_assert(mfb->mfb_space);
SORT_read_block(mfb->mfb_space, mfb->mfb_block_size * block, mfb->mfb_block_data, mfb->mfb_block_size);
return block;
}
static bool reject(const UCHAR* /*record_a*/, const UCHAR* /*record_b*/, void* /*user_arg*/)
{
/**************************************
*
* r e j e c t
*
**************************************
*
* Functional description
* Callback routine used by project to reject duplicate records.
* Particularly dumb routine -- always returns true;
*
**************************************/
return true;
}
static void restore_record(record_param* rpb)
{
/**************************************
*
* r e s t o r e _ r e c o r d
*
**************************************
*
* Functional description
* Restore record to prior state
*
**************************************/
SaveRecordParam* rpb_copy = rpb->rpb_copy;
if (rpb_copy)
{
Record* record = rpb->rpb_record;
Record* rec_copy = rpb_copy->srpb_rpb->rpb_record;
if (rec_copy)
{
if (!record)
BUGCHECK(284); // msg 284 cannot restore singleton select data
const USHORT size = rec_copy->rec_length;
if (size > record->rec_length)
{
// hvlad: saved copy of record have longer format, reallocate
// given record to make enough space for saved data
thread_db* tdbb = JRD_get_thread_data();
record = VIO_record(tdbb, rpb, rec_copy->rec_format, tdbb->getDefaultPool());
}
else
{
record->rec_length = size;
record->rec_format = rec_copy->rec_format;
}
record->rec_number = rec_copy->rec_number;
memcpy(record->rec_data, rec_copy->rec_data, size);
delete rec_copy;
}
memcpy(rpb, rpb_copy->srpb_rpb, sizeof(record_param));
rpb->rpb_record = record;
delete rpb_copy;
rpb->rpb_copy = NULL;
}
}
static void save_record(thread_db* tdbb, record_param* rpb)
{
/**************************************
*
* s a v e _ r e c o r d
*
**************************************
*
* Functional description
* Save current record
*
**************************************/
SET_TDBB(tdbb);
SaveRecordParam* rpb_copy = rpb->rpb_copy;
if (rpb_copy)
delete rpb_copy->srpb_rpb->rpb_record;
else
rpb->rpb_copy = rpb_copy = FB_NEW(*tdbb->getDefaultPool()) SaveRecordParam();
memcpy(rpb_copy->srpb_rpb, rpb, sizeof(record_param));
Record* record = rpb->rpb_record;
if (record)
{
const SLONG size = record->rec_length;
Record* rec_copy = FB_NEW_RPT(*tdbb->getDefaultPool(), size) Record(*tdbb->getDefaultPool());
rpb_copy->srpb_rpb->rpb_record = rec_copy;
rec_copy->rec_length = size;
rec_copy->rec_format = record->rec_format;
rec_copy->rec_number = record->rec_number;
memcpy(rec_copy->rec_data, record->rec_data, size);
}
else
rpb_copy->srpb_rpb->rpb_record = NULL;
}
static void write_merge_block(thread_db* tdbb, merge_file* mfb, ULONG block)
{
/**************************************
*
* w r i t e _ m e r g e _ b l o c k
*
**************************************
*
* Functional description
* Write a block to the merge equivalence file. If
* the file doesn't exist, by all means, create one.
*
**************************************/
if (!mfb->mfb_space) {
MemoryPool& pool = *getDefaultMemoryPool();
mfb->mfb_space = FB_NEW(pool) TempSpace(pool, SCRATCH);
}
SORT_write_block(mfb->mfb_space, mfb->mfb_block_size * block, mfb->mfb_block_data, mfb->mfb_block_size);
}
const USHORT RSBRecurse::MAX_RECURSE_LEVEL = 1024;
// hvlad:
// values of rsb_arg's:
// 0 - 1st stream
// 1 - 1st stream map
// 2 - 2nd stream
// 3 - 2nd stream map
// 4 - count of the streams that make up the union
// 5..5+rsb_arg[4]-1 - numbers of the streams that make up the union
// 5+rsb_arg[4] - inner impure area size
// 6+rsb_arg[4] - number of stream for next level record
void RSBRecurse::open(thread_db* tdbb, RecordSource* rsb, irsb_recurse* irsb)
{
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
record_param* rpb = &request->req_rpb[rsb->rsb_stream];
VIO_record(tdbb, rpb, rsb->rsb_format, request->req_pool);
const USHORT streams = (USHORT)(U_IPTR) rsb->rsb_arg[rsb->rsb_count];
const USHORT map_stream = (USHORT)(U_IPTR) rsb->rsb_arg[streams + rsb->rsb_count + 2];
rpb = &request->req_rpb[map_stream];
VIO_record(tdbb, rpb, rsb->rsb_format, request->req_pool);
// Set up our instance data
irsb->irsb_mode = root;
irsb->irsb_level = 1;
irsb->irsb_stack = NULL;
irsb->irsb_data = NULL;
// Initialize the record number for both <root> and <child> stream
RecordSource** ptr = rsb->rsb_arg + rsb->rsb_count + 1;
const RecordSource* const* end = ptr + streams;
for (; ptr < end; ptr++)
{
const USHORT stream = (USHORT)(U_IPTR) *ptr;
request->req_rpb[stream].rpb_number.setValue(BOF_NUMBER);
}
RSE_open(tdbb, rsb->rsb_arg[0]);
}
bool RSBRecurse::get(thread_db* tdbb, RecordSource* rsb, irsb_recurse* irsb)
{
SET_TDBB(tdbb);
jrd_req* request = tdbb->getRequest();
const USHORT streams = (USHORT)(U_IPTR) rsb->rsb_arg[rsb->rsb_count];
const ULONG inner_size = (ULONG)(U_IPTR) rsb->rsb_arg[streams + rsb->rsb_count + 1];
const ULONG rpbs_size = sizeof(record_param) * streams;
const USHORT map_stream = (USHORT)(U_IPTR) rsb->rsb_arg[streams + rsb->rsb_count + 2];
RecordSource** rsb_ptr;
Record* record = request->req_rpb[rsb->rsb_stream].rpb_record;
Record* map_record = request->req_rpb[map_stream].rpb_record;
switch (irsb->irsb_mode)
{
case root:
rsb_ptr = &rsb->rsb_arg[0];
break;
case recurse:
{
// Stop infinite recursion of bad queries
if (irsb->irsb_level > MAX_RECURSE_LEVEL)
ERR_post(Arg::Gds(isc_req_max_clones_exceeded));
// Save where we are
char* const tmp = FB_NEW(*request->req_pool) char[inner_size + rpbs_size];
memcpy(tmp, irsb, inner_size);
char* p = tmp + inner_size;
RecordSource** ptr = rsb->rsb_arg + rsb->rsb_count + 1;
const RecordSource* const* end = ptr + streams;
for (; ptr < end; ptr++)
{
record_param* rpb = &request->req_rpb[(USHORT)(U_IPTR) *ptr];
memmove(p, rpb, sizeof(record_param));
p += sizeof(record_param);
// Don't overwrite record contents at next level of recursion.
// RSE_open and company will allocate new record if needed
rpb->rpb_record = NULL;
}
irsb->irsb_stack = tmp;
irsb->irsb_data = FB_NEW(*request->req_pool) char[record->rec_length];
memcpy(irsb->irsb_data, record->rec_data, record->rec_length);
irsb_recurse r = *irsb;
memset(irsb, 0, inner_size);
*irsb = r;
// (Re-)Open a new child stream & reset record number
rsb_ptr = &rsb->rsb_arg[2];
RSE_open(tdbb, *rsb_ptr);
irsb->irsb_level++;
}
break;
default:
fb_assert(false);
}
// Get the data -- if there is none go back one level and when
// there isn't a previous level, we're done
while (!RSE_internal_get_record(tdbb, *rsb_ptr, NULL))
{
if (irsb->irsb_level == 1)
{
return false;
}
RSE_close(tdbb, *rsb_ptr);
delete[] irsb->irsb_data;
char* const tmp = irsb->irsb_stack;
memcpy(irsb, tmp, inner_size);
char* p = tmp + inner_size;
RecordSource** ptr = rsb->rsb_arg + rsb->rsb_count + 1;
const RecordSource* const* end = ptr + streams;
for (; ptr < end; ptr++)
{
record_param* rpb = &request->req_rpb[(USHORT)(U_IPTR) *ptr];
Record* rec = rpb->rpb_record;
memmove(rpb, p, sizeof(record_param));
p += sizeof(record_param);
// We just restored record of current recursion level, delete record
// from upper level. It may be optimized in the future if needed.
delete rec;
}
delete[] tmp;
if (irsb->irsb_level > 1)
{
rsb_ptr = &rsb->rsb_arg[2];
// Reset our record data so that recursive WHERE clauses work
memcpy(record->rec_data, irsb->irsb_data, record->rec_length);
}
else
{
rsb_ptr = &rsb->rsb_arg[0];
}
}
irsb->irsb_mode = recurse;
// We've got a record, map it into the target record
jrd_nod* map = (jrd_nod*) rsb_ptr[1];
jrd_nod** ptr = map->nod_arg;
const jrd_nod *const *end = ptr + map->nod_count;
for (; ptr < end; ptr++) {
EXE_assignment(tdbb, *ptr);
}
// copy target (next level) record into main (current level) record
memcpy(record->rec_data, map_record->rec_data, record->rec_length);
return true;
}
void RSBRecurse::close(thread_db* tdbb, RecordSource* rsb, irsb_recurse* irsb)
{
SET_TDBB(tdbb);
const USHORT streams = (USHORT)(U_IPTR) rsb->rsb_arg[rsb->rsb_count];
const ULONG inner_size = (ULONG)(U_IPTR) rsb->rsb_arg[streams + rsb->rsb_count + 1];
while (irsb->irsb_level > 1)
{
RSE_close(tdbb, rsb->rsb_arg[2]);
delete[] irsb->irsb_data;
char* tmp = irsb->irsb_stack;
memcpy(irsb, tmp, inner_size);
delete[] tmp;
}
RSE_close(tdbb, rsb->rsb_arg[0]);
}
View Git Blame Copy Permalink