1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393
|
/****************************************************************
* *
* Copyright (c) 2001-2020 Fidelity National Information *
* Services, Inc. and/or its subsidiaries. All rights reserved. *
* *
* This source code contains the intellectual property *
* of its copyright holder(s), and is made available *
* under a license. If you do not know the terms of *
* the license, please stop and do not read further. *
* *
****************************************************************/
#include "mdef.h"
#include <stdarg.h>
#include "gtm_string.h"
#include "lv_val.h"
#include "subscript.h"
#include "stringpool.h"
#include <rtnhdr.h>
#include "mv_stent.h"
#include "collseq.h"
#include "compiler.h"
#include "op.h"
#include "do_xform.h"
#include "mvalconv.h"
#include "numcmp.h"
#include "promodemo.h" /* for "demote" prototype used in LV_NODE_GET_KEY */
GBLREF bool undef_inhibit;
GBLREF mv_stent *mv_chain;
GBLREF spdesc stringpool;
GBLREF symval *curr_symval;
GBLREF unsigned char *msp, *stackwarn, *stacktop;
LITREF mval literal_null;
error_def(ERR_LVNULLSUBS);
error_def(ERR_STACKOFLOW);
error_def(ERR_STACKCRIT);
void op_fnquery(int sbscnt, mval *dst, ...)
{
boolean_t found, is_num, is_str, last_sub_null, nullify_term;
ht_ent_mname *tabent;
int i, j, length;
lv_val *lvn, *lvns[MAX_LVSUBSCRIPTS], *v, *ve;
lvTree *lvt;
lvTreeNode **h1, **h2, *history[MAX_LVSUBSCRIPTS], *node, *nullsubsnode, *nullsubsparent, *parent;
mname_entry lvent;
mval *arg1, **argpp, *argp2, **argpp2, *args[MAX_LVSUBSCRIPTS], *lfrsbs, *mv, tmpmv, tmp_sbs,
*varname, *v1, *v2;
mval xform_args[MAX_LVSUBSCRIPTS]; /* for lclcol */
mstr format_out;
va_list var, var_dup;
DCL_THREADGBL_ACCESS;
SETUP_THREADGBL_ACCESS;
VAR_START(var, dst);
assert(3 <= sbscnt);
sbscnt -= 3;
varname = va_arg(var, mval *);
v = va_arg(var, lv_val *);
assert(v);
if (varname->str.len > MAX_MIDENT_LEN)
varname->str.len = MAX_MIDENT_LEN;
lvent.var_name.len = varname->str.len;
lvent.var_name.addr = varname->str.addr;
COMPUTE_HASH_MNAME(&lvent);
if (tabent = lookup_hashtab_mname(&curr_symval->h_symtab, &lvent))
{ /* if the variable exists find out if it has children */
ve = (lv_val *)tabent->value;
assert(ve);
assert(HTENT_VALID_MNAME(tabent, lv_val, ve));
assert(LV_IS_BASE_VAR(ve));
lvt = LV_GET_CHILD(ve);
assert((NULL == lvt) || (LV_GET_CHILD(v) == lvt));
} else
lvt = NULL;
if (NULL == lvt)
{ /* no such unsubscripted variable or no descendants */
*dst = literal_null;
return;
}
h1 = history;
*h1++ = (lvTreeNode *)v;
found = FALSE;
DEBUG_ONLY(node = NULL;)
for (i = 0, argpp = &args[0]; i < sbscnt; i++, argpp++, h1++)
{
if (NULL == lvt)
{ /* Subtree does not exist at this level. To get $query of input node,
* need to start from right sibling of parent level. */
h1--;
assert(h1 >= &history[1]);
assert(NULL != node);
assert(node == *h1);
node = *(h1 - 1);
lvt = LV_GET_CHILD(node);
assert(NULL != lvt);
break;
}
arg1 = *argpp = va_arg(var, mval *);
MV_FORCE_DEFINED(arg1);
is_str = MV_IS_STRING(arg1);
if (is_str)
{
if ((0 == arg1->str.len) && (i + 1 != sbscnt) && (LVNULLSUBS_NEVER == TREF(lv_null_subs)))
{ /* This is not the last subscript, we don't allow nulls subs and it was null */
va_end(var);
rts_error_csa(CSA_ARG(NULL) VARLSTCNT(1) ERR_LVNULLSUBS);
}
if (is_num = MV_IS_CANONICAL(arg1))
MV_FORCE_NUM(arg1);
else if ((0 == arg1->str.len) && (i + 1 == sbscnt))
{ /* The last search argument is a null string. For this situation, there is the possibility
* of a syntax collision if (1) the user had (for example) specified $Q(a(1,3,"") to get
* the first a(1,3,x) node or (2) this is the "next" element that was legitimately returned
* by $Query on the last call. If the element a(1,3,"") actually exists, the code whereby
* we simply strip off the last null search argument and continue will just find this
* element again. Because of this we save the mvals of the subscrips of the last $QUERY
* result if the result had a null last subscript. In that case, we will compare the input
* variable and subscripts with the last returned value. If they are identical, we will
* bypass the elimination of the trailing null subscript. This will allow the successor
* element to be found. Note that this is a single value that is kept for the entire
* process. Any intervening $QUery calls for other local variables will reset the check.
* SE 2/2004 (D9D08-002352).
*/
nullify_term = TRUE;
if ((TREF(last_fnquery_return_varname)).str.len && (sbscnt == TREF(last_fnquery_return_subcnt))
&& ((TREF(last_fnquery_return_varname)).str.len == varname->str.len)
&& (0 == memcmp((TREF(last_fnquery_return_varname)).str.addr,
varname->str.addr, varname->str.len)))
{ /* We have an equivalent varname and same number subscripts */
for (j = 0, argpp2 = &args[0], lfrsbs = TADR(last_fnquery_return_sub);
j < i; j++, argpp2++, lfrsbs++)
{ /* For each subscript prior to the trailing null subscript */
argp2 = *argpp2;
if (MV_IS_NUMERIC(argp2) && MV_IS_NUMERIC(lfrsbs))
{ /* Have numeric subscripts */
if (0 != numcmp(argp2, lfrsbs))
break; /* This subscript isn't the same */
} else if (MV_IS_STRING(argp2) && MV_IS_STRING(lfrsbs))
{ /* Should be string only in order to compare */
if ((argp2)->str.len == lfrsbs->str.len
&& 0 != memcmp((argp2)->str.addr, lfrsbs->str.addr,
lfrsbs->str.len))
break; /* This subscript isn't the same */
} else
break; /* This subscript isn't even close.. */
}
if (j == i)
nullify_term = FALSE;/* We made it through the loop unscathed !! */
}
if (nullify_term)
{
i++;
assert(i == sbscnt);
break;
}
}
} else /* not string */
{
assert(MV_IS_NUMERIC(arg1));
assert(MV_IS_CANONICAL(arg1));
is_num = TRUE;
}
if (!is_num)
{
assert(!TREE_KEY_SUBSCR_IS_CANONICAL(arg1->mvtype));
if (TREF(local_collseq))
{
ALLOC_XFORM_BUFF(arg1->str.len);
/* D9607-258 changed xback to xform and added xform_args[] to hold mval pointing to
* xform'd subscript which is in pool space. tmp_sbs (which is really a mval) was being
* overwritten if >1 alpha subscripts */
assert(NULL != TREF(lcl_coll_xform_buff));
tmp_sbs.mvtype = MV_STR;
tmp_sbs.str.addr = TREF(lcl_coll_xform_buff);
tmp_sbs.str.len = TREF(max_lcl_coll_xform_bufsiz);
/* KMK subscript index is i+1 */
do_xform(TREF(local_collseq), XFORM, &arg1->str, &tmp_sbs.str, &length);
tmp_sbs.str.len = length;
s2pool(&(tmp_sbs.str));
xform_args[i] = tmp_sbs;
arg1 = &xform_args[i];
}
node = lvAvlTreeLookupStr(lvt, arg1, &parent);
} else
{
tmp_sbs = *arg1;
arg1 = &tmp_sbs;
MV_FORCE_NUM(arg1);
TREE_KEY_SUBSCR_SET_MV_CANONICAL_BIT(arg1); /* used by the lvAvlTreeLookup* functions below */
if (MVTYPE_IS_INT(arg1->mvtype))
node = lvAvlTreeLookupInt(lvt, arg1, &parent);
else
node = lvAvlTreeLookupNum(lvt, arg1, &parent);
}
if (NULL == node)
break; /* Key not found in tree at this level. find right sibling in "lvt" tree with key="arg1" */
lvt = LV_GET_CHILD(node);
*h1 = node;
}
va_end(var);
assert((i != sbscnt) || !found);
if (!found)
{
if (i == sbscnt)
{
assert(!found);
parent = *(h1 - 1);
assert(NULL != parent);
lvt = LV_GET_CHILD(parent);
if (lvt)
{
found = TRUE;
nullsubsnode = TREF(local_collseq_stdnull)
? lvAvlTreeLookupStr(lvt, (treeKeySubscr *)&literal_null, &nullsubsparent) : NULL;
node = (NULL == nullsubsnode) ? lvAvlTreeFirst(lvt) : nullsubsnode;
assert(NULL != node);
*h1 = node;
} else
--h1;
} else
{ /* Need to find right sibling. "lvt" is tree to search in and "arg1" is key to search for. */
node = lvAvlTreeKeyCollatedNext(lvt, arg1);
if (NULL != node)
{
*h1 = node;
found = TRUE;
} else /* if "node" is still NULL, need to start searching for right siblings at the parent level. */
h1--;
}
}
if (!found) /* separate if needed because "found" could change after the previous "if" but before this "if" */
{
for ( ; ; --h1)
{
assert(h1 >= &history[0]);
if (h1 == &history[0])
{
*dst = literal_null;
return;
}
node = *h1;
assert(NULL != node);
/* Find the right sibling (next) subscript */
node = lvAvlTreeNodeCollatedNext(node);
if (NULL != node)
{
*h1 = node;
break;
}
}
}
/* Saved last query result is irrelevant now */
TREF(last_fnquery_return_subcnt) = 0;
(TREF(last_fnquery_return_varname)).str.len = 0;
/* Go down leftmost subtree path (potentially > 1 avl trees) starting from "node" until you find the first DEFINED mval */
while (!LV_IS_VAL_DEFINED(node))
{
lvt = LV_GET_CHILD(node);
assert(NULL != lvt); /* there cannot be an undefined lv node with no children dangling around */
nullsubsnode = TREF(local_collseq_stdnull)
? lvAvlTreeLookupStr(lvt, (treeKeySubscr *)&literal_null, &nullsubsparent) : NULL;
node = (NULL == nullsubsnode) ? lvAvlTreeFirst(lvt) : nullsubsnode;
assert(NULL != node);
*++h1 = node;
}
/* Before we start formatting for output, decide whether we will be saving mvals of our subscripts
* as we format. We only do this if the last subscript is a null. Bypassing it otherwise is a time saver.
*/
last_sub_null = LV_NODE_KEY_IS_NULL_SUBS(node);
/* format the output string */
ENSURE_STP_FREE_SPACE(varname->str.len + 1);
PUSH_MV_STENT(MVST_MVAL);
v1 = &mv_chain->mv_st_cont.mvs_mval;
v1->mvtype = MV_STR;
v1->str.len = 0;
v1->str.addr = (char *)stringpool.free;
PUSH_MV_STENT(MVST_MVAL);
v2 = &mv_chain->mv_st_cont.mvs_mval;
v2->mvtype = 0; /* initialize it to 0 to avoid "stp_gcol" from getting confused if it gets invoked before v2 has been
* completely setup. */
memcpy(stringpool.free, varname->str.addr, varname->str.len);
if (last_sub_null)
{
(TREF(last_fnquery_return_varname)).str.addr = (char *)stringpool.free;
(TREF(last_fnquery_return_varname)).str.len += varname->str.len;
(TREF(last_fnquery_return_varname)).mvtype = MV_STR;
}
stringpool.free += varname->str.len;
*stringpool.free++ = '(';
for (h2 = &history[1]; h2 <= h1; h2++)
{
node = *h2;
assert(!LV_IS_BASE_VAR(node)); /* guarantees to us that "node" is a "lvTreeNode *" and not "lv_val *" */
mv = &tmpmv;
LV_NODE_GET_KEY(node, mv); /* Get node key into "mv" depending on the structure type of "node" */
if (MV_IS_NUMERIC(mv))
{ /* number */
if (!IS_STP_SPACE_AVAILABLE(MAX_NUM_SIZE))
{
v1->str.len = INTCAST((char *)stringpool.free - v1->str.addr);
INVOKE_STP_GCOL(MAX_NUM_SIZE);
assert(IS_AT_END_OF_STRINGPOOL(v1->str.addr, v1->str.len));
}
*v2 = *mv;
/* Now that we have ensured enough space in the stringpool, we dont expect any more
* garbage collections or expansions until we are done with the n2s.
*/
DBG_MARK_STRINGPOOL_UNEXPANDABLE;
n2s(v2);
/* Now that we are done with any stringpool.free usages, mark as free for expansion */
DBG_MARK_STRINGPOOL_EXPANDABLE;
if (last_sub_null)
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))++) = *v2;
} else
{ /* string */
assert(MV_IS_STRING(mv));
v1->str.len = INTCAST((char *)stringpool.free - v1->str.addr);
v2->mvtype = 0; /* initialize it to 0 to avoid "stp_gcol" from getting confused
* if it gets invoked before v2 has been completely setup.
*/
if (TREF(local_collseq))
{
ALLOC_XFORM_BUFF(mv->str.len);
assert(NULL != TREF(lcl_coll_xform_buff));
tmp_sbs.str.addr = TREF(lcl_coll_xform_buff);
tmp_sbs.str.len = TREF(max_lcl_coll_xform_bufsiz);
do_xform(TREF(local_collseq), XBACK, &mv->str, &tmp_sbs.str, &length);
tmp_sbs.str.len = length;
v2->str = tmp_sbs.str;
} else
v2->str = mv->str;
/* Now that v2->str has been initialized, initialize mvtype as well (doing this in the other
* order could cause "stp_gcol" (if invoked in between) to get confused since v2->str is
* not yet initialized with current subscript (in the M-stack).
*/
v2->mvtype = MV_STR;
assert(MAX_STRLEN >= v2->str.len); /* check in op_putindx should assure this */
mval_lex(v2, &format_out);
if (format_out.addr != (char *)stringpool.free) /* BYPASSOK */
{ /* We must put the string on the string pool ourself - mval_lex didn't do it
* because v2 is a canonical numeric string. It is canonical but has too many
* digits to be treated as a number. It must be output as a quoted string. */
if (!IS_STP_SPACE_AVAILABLE(v2->str.len + 2))
{
v1->str.len = INTCAST((char *)stringpool.free - v1->str.addr);
INVOKE_STP_GCOL(v2->str.len + 2);
assert((char *)stringpool.free - v1->str.addr == v1->str.len);
}
*stringpool.free++ = '\"';
memcpy(stringpool.free, v2->str.addr, v2->str.len);
if (last_sub_null)
{
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))).mvtype = MV_STR;
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))).str.addr =
(char *)stringpool.free;
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))++).str.len = v2->str.len;
}
stringpool.free += v2->str.len;
*stringpool.free++ = '\"';
} else
{
if (last_sub_null)
{
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))).mvtype = MV_STR;
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))).str.addr =
(char *)stringpool.free;
TAREF1(last_fnquery_return_sub,(TREF(last_fnquery_return_subcnt))++).str.len =
format_out.len;
}
stringpool.free += format_out.len;
}
}
if (!IS_STP_SPACE_AVAILABLE(1))
{
v1->str.len = INTCAST((char *)stringpool.free - v1->str.addr);
INVOKE_STP_GCOL(1);
assert(IS_AT_END_OF_STRINGPOOL(v1->str.addr, v1->str.len));
}
*stringpool.free++ = (h2 < h1 ? ',' : ')');
}
dst->mvtype = MV_STR;
dst->str.len = INTCAST((char *)stringpool.free - v1->str.addr);
dst->str.addr = v1->str.addr;
POP_MV_STENT(); /* v2 */
POP_MV_STENT(); /* v1 */
}
|