/* Copyright (c) 2016, 2022, MariaDB Corporation. This program is free software ; you can redistribute it and / or modify it under the terms of the GNU General Public License as published by the Free Software Foundation ; version 2 of the License . This program is distributed in the hope that it will be useful , but WITHOUT ANY WARRANTY ; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the GNU General Public License for more details . You should have received a copy of the GNU General Public License along with this program ; if not , write to the Free Software #include "mariadb.h" #include "mysqld.h" #include "sql_priv.h" #include "sql_class.h" #include "item.h" #include "sql_parse.h" // For check_stack_overrun #include "json_schema_helper.h" static bool get_current_value(json_engine_t *, const uchar *&, size_t &);static int check_overlaps(json_engine_t *, json_engine_t *, bool , MEM_ROOT*, json_engine_t *temp_je, MEM_ROOT_DYNAMIC_ARRAY *stack);static int json_find_overlap_with_object(json_engine_t *,bool , MEM_ROOT*,static bool handle_nested_value(json_engine_t *je);#ifndef DBUG_OFFint dbug_json_check_min_stack_requirement()return 1 ;#endif extern void pause_execution(THD *thd, double timeout);/* Allocating memory and * also * using it ( reading and writing from it ) because some build instructions cause compiler to optimize out stack_used_up . Since alloca ( ) here depends on stack_used_up , it doesnt get executed correctly and causes json_debug_nonembedded to fail ( - - error ER_STACK_OVERRUN_NEED_MORE does not occur ) . #define JSON_DO_PAUSE_EXECUTION(A, B) do \"json_pause_execution" , \while (0 )/* Compare ASCII string against the string with the specified character set . Only compares the equality , case insensitive . static bool eq_ascii_string(const CHARSET_INFO *cs,const char *ascii,const char *s, uint32 s_len)const char *s_end= s + s_len;while (*ascii && s < s_end)int wc_len;if (wc_len <= 0 || (wc | 0 x20) != (my_wc_t) *ascii)return 0 ;return *ascii == 0 && s >= s_end;static bool __attribute__((warn_unused_result))const char *a, size_t a_len)if (!s->realloc_with_extra_if_needed(s->length() + a_len))return FALSE ;return TRUE ;static inline bool __attribute__((warn_unused_result))const uchar *a, size_t a_len)return append_simple(s, (const char *) a, a_len);/* Appends JSON string to the String object taking charsets in consideration . bool st_append_json(String *s,const uchar *js, uint js_len)int str_len= js_len * s->charset()->mbmaxlen;if (s->reserve(str_len, 1024 ))0 ), str_len);return false ;if (str_len > 0 )if (str_len >= 0 )return false ;if (current_thd)if (str_len == JSON_ERROR_OUT_OF_SPACE)0 ), str_len);else if (str_len == JSON_ERROR_ILLEGAL_SYMBOL)0 , "st_append_json" , 0 );return true ;/* Appends arbitrary String to the JSON string taking charsets in consideration . int st_append_escaped(String *s, const String *a)/* In the worst case one character from the ' a ' string turns into ' \ uXXXX \ uXXXX ' which is 12 . int str_len= a->length() * 12 * s->charset()->mbmaxlen /if (!s->reserve(str_len, 1024 ) &&0 )return 0 ;return a->length();static const int TAB_SIZE_LIMIT= 8 ;static const char tab_arr[TAB_SIZE_LIMIT+1 ]= " " ;static int append_tab(String *js, int depth, int tab_size)if (js->append('\n' ))return 1 ;for (int i=0 ; i<depth; i++)if (js->append(tab_arr, tab_size))return 1 ;return 0 ;int json_path_parts_compare(const MEM_ROOT_DYNAMIC_ARRAY *a_arr,const json_path_step_t *a,const json_path_step_t *a_end,const MEM_ROOT_DYNAMIC_ARRAY *b_arr,const json_path_step_t *b,const json_path_step_t *b_end,enum json_value_types vt,int res, res2;const json_path_step_t *temp_b= b;"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;while (a <= a_end)if (b > b_end)while (vt != JSON_VALUE_ARRAY &&0 )if (++a > a_end)return 0 ;return -2 ;0 );if (a->type & JSON_PATH_ARRAY)if (b->type & JSON_PATH_ARRAY)int res = 0 ;if (a->type & JSON_PATH_WILD)1 ;else if (a->type & JSON_PATH_ARRAY_RANGE && array_sizes)int start = (a->n_item >= 0 ) ? a->n_itemint *)(array_sizes->buffer)+(b - temp_b)) + a->n_item;int end = (a->n_item_end >= 0 ) ? a->n_item_endint *)(array_sizes->buffer)+(b - temp_b)) + a->n_item_end;else if (a->n_item >= 0 )else if (a->n_item < 0 && array_sizes)int *)(array_sizes->buffer)+(b - temp_b)));if (res)goto step_fits;goto step_failed;if ((a->type & JSON_PATH_WILD) == 0 && a->n_item == 0 )goto step_fits_autowrap;goto step_failed;else /* JSON_PATH_KEY */ if (!(b->type & JSON_PATH_KEY))goto step_failed;if (!(a->type & JSON_PATH_WILD) &&0 ))goto step_failed;goto step_fits;if (!(a->type & JSON_PATH_DOUBLE_WILD))return -1 ;continue ;if (!(a->type & JSON_PATH_DOUBLE_WILD))continue ;/* Double wild handling needs recursions. */ 1 , a_end, b_arr, b, b_end,if (res == 0 )return 0 ;return (res2 >= 0 ) ? res2 : res;if (!(a->type & JSON_PATH_DOUBLE_WILD))continue ;/* Double wild handling needs recursions. */ 1 , a_end, b_arr, b+1 , b_end, vt,if (res == 0 )return 0 ;1 , b_end, vt,return (res2 >= 0 ) ? res2 : res;return b <= b_end;int json_path_compare(const json_path_t *a, const json_path_t *b,enum json_value_types vt,return 1 ,1 ,static int json_nice(json_engine_t *je, String *nice_js,int tab_size=4 )int depth= 0 ;static const char *comma= ", " , *colon= "\" : "; int first_value= 1 ;int value_size = 0 ;int curr_state= -1 ;0 ;0 );if (nice_js->alloc(je->s.str_end - je->s.c_str + 32 ))goto error;0 && tab_size <= TAB_SIZE_LIMIT));if (mode == Item_func_json_format::LOOSE)2 ;3 ;else if (mode == Item_func_json_format::DETAILED)1 ;3 ;else 1 ;2 ;do switch (je->state)case JST_KEY:const uchar *key_start= je->s.c_str;const uchar *key_end;do while (json_read_keyname_chr(je) == 0 );if (unlikely(je->s.error))goto error;if (!first_value)if (mode == Item_func_json_format::DETAILED &&goto error;'"' );if (append_simple(nice_js, key_start, key_end - key_start))goto error;/* now we have key value to handle, so no 'break'. */ goto handle_value;case JST_VALUE:if (!first_value)if (mode == Item_func_json_format::DETAILED &&0 &&goto error;if (json_read_value(je))goto error;if (json_value_scalar(je))if (append_simple(nice_js, je->value_begin,goto error;const char *)je->value_begin,0 ;if (value_size != -1 )else if (mode == Item_func_json_format::DETAILED &&0 && !(curr_state != JST_KEY) &&goto error;"{" : "[" , 1 );1 ;1 : 0 ;break ;case JST_OBJ_END:case JST_ARRAY_END:if (mode == Item_func_json_format::DETAILED && (value_size > 1 || value_size == -1 ) &&goto error;if (mode == Item_func_json_format::DETAILED && 1 && je->state != JST_OBJ_END)for (auto i = 0 ; i < (depth + 1 ) * tab_size + 1 ; i++)"}" : "]" , 1 );0 ;1 ;break ;default :break ;while (json_scan_next(je) == 0 );return je->s.error;return 1 ;#define report_path_error(js, je, n_param) \#define report_json_error(js, je, n_param) \void report_json_error_ex(const char *js, json_engine_t *je,const char *fname, int n_param,int position= (int )((const char *) je->s.c_str - js);switch (je->s.error)case JE_BAD_CHR:break ;case JE_NOT_JSON_CHR:break ;case JE_EOS:break ;case JE_SYN:case JE_STRING_CONST:break ;case JE_ESCAPING:break ;case JE_DEPTH:if (lv == Sql_condition::WARN_LEVEL_ERROR)0 ), JSON_DEPTH_LIMIT, n_param, fname, position);else return ;case JE_KILLED:return ;default :return ;if (lv == Sql_condition::WARN_LEVEL_ERROR)0 ), n_param, fname, position);else #define NO_WILDCARD_ALLOWED 1 #define SHOULD_END_WITH_ARRAY 2 #define TRIVIAL_PATH_NOT_ALLOWED 3 void report_path_error_ex(const char *ps, json_path_t *p,const char *fname, int n_param,int position= (int )((const char *) p->s.c_str - ps + 1 );switch (p->s.error)case JE_BAD_CHR:case JE_NOT_JSON_CHR:case JE_SYN:break ;case JE_EOS:break ;case JE_DEPTH:if (lv == Sql_condition::WARN_LEVEL_ERROR)0 ), JSON_DEPTH_LIMIT, n_param, fname, position);else return ;case NO_WILDCARD_ALLOWED:break ;case TRIVIAL_PATH_NOT_ALLOWED:break ;default :return ;if (lv == Sql_condition::WARN_LEVEL_ERROR)0 ), n_param, fname, position);else /* Checks if the path has ' . * ' ' [ * ] ' or ' * * ' constructions and sets the NO_WILDCARD_ALLOWED error if the case . static int path_setup_nwc(json_path_t *p, CHARSET_INFO *i_cs,const uchar *str, const uchar *end)if (!json_path_setup(p, i_cs, str, end))if ((p->types_used & (JSON_PATH_WILD | JSON_PATH_DOUBLE_WILD |0 )return 0 ;return 1 ;static inline if (cs) return cs;if (alt) return alt;return &my_charset_utf8mb4_bin;bool Item_func_json_valid::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));if (Item_bool_func::fix_length_and_dec(thd))return TRUE ;return FALSE ;bool Item_func_json_valid::val_bool()0 ]->val_json(&tmp_value);if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );if (json_valid(js->ptr(), js->length(), js->charset(), &je))return true ;/* Sql_condition::WARN_LEVEL_WARN becomes an error in check constraints */ 0 , Sql_condition::WARN_LEVEL_NOTE);return false ;bool Item_func_json_equals::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));sizeof (struct json_norm_value*), NULL,0 ));if (Item_bool_func::fix_length_and_dec(thd))return TRUE ;return FALSE ;bool Item_func_json_equals::val_bool()0 ;int arg_num= 0 ;0 ]->val_json(&a_tmp);if ((null_value= a == nullptr || args[0 ]->null_value))return 1 ;1 ]->val_json(&b_tmp);if ((null_value= b == nullptr || args[1 ]->null_value))return 1 ;if (init_dynamic_string(&a_res, NULL, 0 , 0 ))1 ;return 1 ;if (init_dynamic_string(&b_res, NULL, 0 , 0 ))1 ;return 1 ;0 .0002 );if (json_normalize(&a_res, a->ptr(), a->length(),goto return_null;if (json_normalize(&b_res, b->ptr(), b->length(),goto return_null;0 : 1 ;goto end;1 ;if (temp_je.s.error)/* looks convoluted, but report_json_error is a macro */ if (arg_num != 0 )return result;bool Item_func_json_exists::fix_length_and_dec(THD *thd)if (Item_bool_func::fix_length_and_dec(thd))return TRUE ;1 ]->const_item());sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));return FALSE ;bool Item_func_json_exists::val_bool()0 .0002 );0 ]->val_json(&tmp_js);if (!path.parsed)1 ]->val_str(&tmp_path);if (s_p &&const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto err_return;if ((null_value= args[0 ]->null_value || args[1 ]->null_value))1 ;return 0 ;0 ;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_find_path(&je, &path.p, &(tmp_ptr), &json_depth_array))if (je.s.error)goto js_error;return 0 ;return 1 ;0 );1 ;return 0 ;bool Item_func_json_value::fix_length_and_dec(THD *thd)"json_value" ) };0 ]->collation);0 ]->max_length;1 ]->const_item());sizeof (int ), NULL,0 ));return FALSE ;0 ],1 ],false );return null_value ? NULL : to;bool Item_func_json_query::fix_length_and_dec(THD *thd)"json_query" ) };0 ]->collation);0 ]->max_length;1 ]->const_item());sizeof (int ), NULL,0 ));return FALSE ;0 ],1 ],true );return null_value ? NULL : to;void Json_path_extractor::init_json_engine_stack(MEM_ROOT *current_mem_root)sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));bool Json_path_extractor::extract(MEM_ROOT *mem_root, String *str,const char *func_name, bool allow_wildcard)int error= 0 ;if (!parsed)if (!s_p)return true ;if (allow_wildcard)if (!s_p->charset() ||const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))true ;else if (path_setup_nwc(&p, def_path_charset(s_p->charset(), cs),const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))true ;if (error)1 ,return true ;if (item_js->null_value || item_jp->null_value)return true ;const uchar*)js->ptr(),const uchar*)js->end());0 );if (json_find_path(&je, &p, &tmp_ptr, array_counters))goto error_return;if (json_read_value(&je))goto error_return;if (je.value_type == JSON_VALUE_NULL)goto error_return;if (unlikely(check_and_get_value(&je, str, &error)))if (error)goto error_return;goto continue_search;return false ;0 ,return true ;bool Json_engine_scan::check_and_get_value_scalar(String *res, int *error)const uchar *js;if (!json_value_scalar(this ))/* We only look for scalar values! */ if (json_skip_level(this ) || json_scan_next(this ))1 ;return true ;if (value_type == JSON_VALUE_TRUE ||const uchar *) ((value_type == JSON_VALUE_TRUE) ? "1" : "0" );1 ;else if (st_append_json(res, json_cs, js, js_len))1 ;return true ;return false ;bool Json_engine_scan::check_and_get_value_complex(String *res, int *error,if (json_value_scalar(this ))/* We skip scalar values. */ if (json_scan_next(this ))1 ;return true ;const uchar *tmp_value= value;if (json_skip_level(this ))1 ;return true ;if (cur_value_type != JSON_VALUE_UNINITIALIZED &&1 ;return true ;const char *) value, (uint32)(s.c_str - tmp_value), s.cs);return false ;bool Item_func_json_quote::fix_length_and_dec(THD *thd)/* Odd but realistic worst case is when all characters of the argument turn into ' \ uXXXX \ uXXXX ' , which is 12 . 0 ]->max_char_length() * 12 + 2 );return FALSE ;0 ]->val_str(&tmp_s);if ((null_value= (args[0 ]->null_value ||0 ]->result_type() != STRING_RESULT)))return NULL;0 );if (str->append('"' ) ||'"' ))/* Report an error. */ 1 ;return 0 ;return str;bool Item_func_json_unquote::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));0 ]->max_char_length() * collation.collation->mbmaxlen;return FALSE ;0 ]->val_json(&tmp_s);if ((null_value= args[0 ]->null_value))return 0 ;/* no json_scan_next called so not interuptable */ const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_read_value(je))goto error;return js;if (je->value_type == JSON_VALUE_STRING)0 );return js;int c_len= JSON_ERROR_OUT_OF_SPACE;if (!(js= read_json(&je)))return NULL;if (unlikely(je.s.error) || je.value_type != JSON_VALUE_STRING)return js;int buf_len= je.value_len;if (js->charset()->cset != my_charset_utf8mb4_bin.cset)/* json_unquote ( ) will be transcoding between charsets . We don ' t know how much buffer space we ' ll need . Assume that each byte in the source will require mbmaxlen bytes in the output . 0 );if (str->realloc_with_extra_if_needed(buf_len) ||0 )goto error;return str;if (current_thd)if (c_len == JSON_ERROR_OUT_OF_SPACE)0 ), buf_len);else if (c_len == JSON_ERROR_ILLEGAL_SYMBOL)0 , "unquote" , 0 );return js;static int alloc_tmp_paths(uint n_paths,if (n_paths > 0 )if (*tmp_paths == 0 )sizeof (json_path_with_flags) * n_paths);new (root) String[n_paths];if (*paths == 0 || *tmp_paths == 0 )return 1 ;for (uint c_path=0 ; c_path < n_paths; c_path++)return 0 ;/* n_paths == 0 */ 0 ;0 ;return 0 ;static void mark_constant_paths(json_path_with_flags *p,for (n= 0 ; n < n_args; n++)if (tmp_paths)for (uint i= n_paths; i>0 ; i--)1 ].free();bool Item_json_str_multipath::fix_fields(THD *thd, Item **ref)if (!tmp_paths)/* Remember the number of paths and allocate required memory on first time the method fix_fields ( ) is invoked . For prepared statements the method fix_fields can be called several times for the same item because its clean up is performed every item a prepared statement finishing its execution . In result , the data member fixed is reset and the method fix_field ( ) is invoked on next time the same prepared statement be executed . On the other side , any memory allocations on behalf of the prepared statement must be performed only once on its first execution . The data member tmp_path is kind a guard to do these activities only once on first time the method fix_field ( ) is called . if (alloc_tmp_paths(n_paths, &paths, &tmp_paths))return true ;#ifdef PROTECT_STATEMENT_MEMROOT/* Check that the number of paths remembered on first run of a statement never changed later . #endif return Item_str_func::fix_fields(thd, ref);bool Item_json_str_multipath::fix_length_and_dec(THD *thd)return false ;bool Item_func_json_extract::fix_length_and_dec(THD *thd)0 ]->collation);/* *2 accounts for LOOSE json_nice() formatting (spaces after : and ,). */ 0 ]->max_char_length() * (arg_count - 1 ) * 2 ;if (arg_count > 2 )/* Multiple paths: result is wrapped as [val1, val2, ...]. */ 2 + (arg_count - 2 ) * 2 ;1 , arg_count-1 );sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));for (uint n_arg=1 ; n_arg < arg_count; n_arg++)1 ;sizeof (json_path_step_t),0 ));sizeof (json_path_step_t), NULL,0 ));return FALSE ;static int path_exact(const json_path_with_flags *paths_list, int n_paths,const json_path_t *p, json_value_types vt,int count_path= 0 ;for (; n_paths > 0 ; n_paths--, paths_list++)if (json_path_compare(&paths_list->p, p, vt, array_size_counter) == 0 )return count_path;static bool path_ok(const json_path_with_flags *paths_list, int n_paths,const json_path_t *p, json_value_types vt,for (; n_paths > 0 ; n_paths--, paths_list++)if (json_path_compare(&paths_list->p, p, vt, array_size_counter) >= 0 )return TRUE ;return FALSE ;char **out_val, int *value_len)0 ]->val_json(&tmp_js);const uchar *value;int not_first_value= 0 , count_path= 0 ;int possible_multiple_values;0 ;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );for (n_arg=1 ; n_arg < arg_count; n_arg++)1 ;if (!c_path->parsed)1 ));if (s_p)if (json_path_setup(&c_path->p,s_p->charset(),(const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto return_null;if (args[n_arg]->null_value)goto return_null;2 ||0 ].p.types_used & (JSON_PATH_WILD | JSON_PATH_DOUBLE_WILD |if (str)0 );if (possible_multiple_values && str->append('[' ))goto error;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length(), &p);while (json_get_path_next(&je, &p) == 0 )int tmp= 0 ;if (has_negative_path && je.value_type == JSON_VALUE_ARRAY &&goto error;if (!(count_path= path_exact(paths, arg_count-1 , &p, je.value_type,continue ;if (*type == JSON_VALUE_NULL)char *) je.value;if (!str)/* If str is NULL, we only care about the first found value. */ goto return_ok;if (json_value_scalar(&je))else if (possible_multiple_values)if (json_skip_level(&je))goto error;if (possible_multiple_values)if ((not_first_value && str->append(", " , 2 )))goto error;while (count_path)if (str->append((const char *) value, v_len))goto error;if (count_path)if (str->append(", " , 2 ))goto error;1 ;if (!possible_multiple_values)/* Loop to the end of the JSON just to make sure it's valid. */ while (json_scan_next(&je) == 0 ) {}break ;if (unlikely(je.s.error))goto error;if (!not_first_value)/* Nothing was found. */ goto return_null;if (possible_multiple_values && str->append(']' ))goto error; /* Out of memory. */ const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_nice(&je, &tmp_js, Item_func_json_format::LOOSE))goto error;return &tmp_js;0 );1 ;return 0 ;char *value;int value_len;return read_json(str, &type, &value, &value_len);char *value;int value_len;0 ;if (read_json(NULL, &type, &value, &value_len) != NULL)switch (type)case JSON_VALUE_NUMBER:case JSON_VALUE_STRING:char *end;int err;10 , &end, &err);break ;case JSON_VALUE_TRUE:1 ;break ;default :0 ;break ;return i;double Item_func_json_extract::val_real()char *value;int value_len;double d= 0 .0 ;if (read_json(NULL, &type, &value, &value_len) != NULL)switch (type)case JSON_VALUE_STRING:case JSON_VALUE_NUMBER:char *end;int err;break ;case JSON_VALUE_TRUE:1 .0 ;break ;default :break ;return d;char *value;int value_len;if (read_json(NULL, &type, &value, &value_len) != NULL)switch (type)case JSON_VALUE_STRING:case JSON_VALUE_NUMBER:return res;case JSON_VALUE_TRUE:1 , false /*unsigned_flag*/, to); return to;case JSON_VALUE_OBJECT:case JSON_VALUE_ARRAY:case JSON_VALUE_FALSE:case JSON_VALUE_UNINITIALIZED:case JSON_VALUE_NULL:0 , false /*unsigned_flag*/, to); return to;return 0 ;bool Item_func_json_extract::val_bool()char *value;int value_len;0 ;if (read_json(NULL, &type, &value, &value_len) != NULL)switch (type)case JSON_VALUE_NUMBER:case JSON_VALUE_STRING:char *end;int err;10 , &end, &err);break ;case JSON_VALUE_TRUE:1 ;break ;default :0 ;break ;return i != 0 ;bool Item_func_json_contains::fix_length_and_dec(THD *thd)1 ]->const_item();FALSE ;if (arg_count > 2 )2 ]->const_item());sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));return Item_bool_func::fix_length_and_dec(thd);static int find_key_in_object(json_engine_t *j, json_string_t *key)const uchar *c_str= key->c_str;while (json_scan_next(j) == 0 && j->state != JST_OBJ_END)if (json_key_matches(j, key))return TRUE ;if (json_skip_key(j))return FALSE ;return FALSE ;int Item_func_json_contains::check_contains(json_engine_t *js,bool set_js;ER_USED,sizeof (int ), &loc_js_stack_buffer,0 ));"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;switch (js->value_type)case JSON_VALUE_OBJECT:if (value->value_type != JSON_VALUE_OBJECT)return FALSE ;FALSE ;while (json_scan_next(value) == 0 && value->state != JST_OBJ_END)const uchar *k_start, *k_end;do while (json_read_keyname_chr(value) == 0 );if (unlikely(value->s.error) || json_read_value(value))return FALSE ;if (set_js)else TRUE ;if (!find_key_in_object(js, &key_name) ||return FALSE ;return value->state == JST_OBJ_END && !json_skip_level(js);case JSON_VALUE_ARRAY:if (value->value_type != JSON_VALUE_ARRAY)FALSE ;while (json_scan_next(js) == 0 && js->state != JST_ARRAY_END)int c_level, v_scalar;if (json_read_value(js))return FALSE ;if (!(v_scalar= json_value_scalar(js)))if (set_js)else TRUE ;if (check_contains(js, value))if (json_skip_level(js))return FALSE ;return TRUE ;if (unlikely(value->s.error) || unlikely(js->s.error) ||return FALSE ;return FALSE ;/* else */ FALSE ;while (json_scan_next(value) == 0 && value->state != JST_ARRAY_END)if (json_read_value(value))return FALSE ;if (set_js)else TRUE ;if (!check_contains(js, value))return FALSE ;return value->state == JST_ARRAY_END;case JSON_VALUE_STRING:if (value->value_type != JSON_VALUE_STRING)return FALSE ;return json_string_compare(js->s.cs,0 ;case JSON_VALUE_NUMBER:if (value->value_type == JSON_VALUE_NUMBER)double d_j, d_v;char *end;int err;char *) js->value, js->value_len, &end, &err);;char *) value->value, value->value_len, &end, &err);;return (fabs(d_j - d_v) < 1 e-12 );else return FALSE ;default :break ;/* We have these not mentioned in the ' switch ' above : case JSON_VALUE_TRUE : case JSON_VALUE_FALSE : case JSON_VALUE_NULL : return value->value_type == js->value_type;bool Item_func_json_contains::val_bool()0 ]->val_json(&tmp_js);int result;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );if (!a2_parsed)1 ]->val_json(&tmp_val);if (val == 0 )1 ;return 0 ;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (arg_count>2 ) /* Path specified. */ if (!path.parsed)2 ]->val_str(&tmp_path);if (!s_p)goto return_null;if (path_setup_nwc(&path.p,const uchar *) s_p->ptr(),const uchar *) s_p->end()))2 );goto return_null;if (args[2 ]->null_value)goto return_null;if (json_find_path(&je, &path.p,if (je.s.error)0 ;goto error;return FALSE ;const uchar *) val->ptr(),const uchar *) val->end());if (json_read_value(&je) || json_read_value(&ve))goto error;if (unlikely(je.s.error || ve.s.error))goto error;return result;if (je.s.error)0 );if (ve.s.error)1 );1 ;return 0 ;bool Item_func_json_contains_path::fix_fields(THD *thd, Item **ref)/* See comments on Item_json_str_multipath : : fix_fields regarding the aim of the condition ' if ( ! tmp_paths ) ' . if (!tmp_paths)if (alloc_tmp_paths(arg_count-2 , &paths, &tmp_paths) ||bool *)2 )*sizeof (bool ))) == NULL)return true ;return Item_int_func::fix_fields(thd, ref);bool Item_func_json_contains_path::fix_length_and_dec(THD *thd)1 ]->const_item();FALSE ;2 , arg_count-2 );sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));for (uint n_arg=2 ; n_arg < arg_count; n_arg++)2 ;sizeof (json_path_step_t), NULL,0 ));return Item_bool_func::fix_length_and_dec(thd);if (tmp_paths)for (uint i= arg_count-2 ; i>0 ; i--)1 ].free();0 ;static int parse_one_or_all(const Item_func *f, Item *ooa_arg,bool *ooa_parsed, bool ooa_constant, bool *mode_one)if (!*ooa_parsed)char buff[20 ];sizeof (buff), &my_charset_bin);if ((res= ooa_arg->val_str(&tmp)) == NULL)return TRUE ;"one" ,if (!*mode_one)if (!eq_ascii_string(res->charset(), "all" , res->ptr(), res->length()))TRUE ;return TRUE ;return FALSE ;#ifdef DUMMY0 ]->val_json(&tmp_js);if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );if (parse_one_or_all(this , args[1 ], &ooa_parsed, ooa_constant, &mode_one))goto return_null;for (n_arg=2 ; n_arg < arg_count; n_arg++)2 ;if (!c_path->parsed)2 ));if (s_p)if (json_path_setup(&c_path->p,s_p->charset(),(const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto null_return;if (args[n_arg]->null_value)goto return_null;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_find_path(&je, &c_path->p, &c_path->cur_step, array_counters))/* Path wasn't found. */ if (je.s.error)goto js_error;if (!mode_one)0 ;break ;else if (mode_one)1 ;break ;return result;0 );1 ;return 0 ;#endif /*DUMMY*/ bool Item_func_json_contains_path::val_bool()0 ]->val_json(&tmp_js);/* Initialization force not required after gcc 13 . 3 where it correctly sees that an uninitialized read of n_found doesn ' t occur with mode_one being true . int UNINIT_VAR(n_found);0 ;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );if (parse_one_or_all(this , args[1 ], &ooa_parsed, ooa_constant, &mode_one))goto null_return;;for (n_arg=2 ; n_arg < arg_count; n_arg++)2 ;if (!c_path->parsed)2 ));if (s_p)if (json_path_setup(&c_path->p,s_p->charset(),(const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto null_return;if (args[n_arg]->null_value)goto null_return;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length(), &p);if (!mode_one)2 ) * sizeof (bool ));2 ;0 ;while (json_get_path_next(&je, &p) == 0 )int n_path= arg_count - 2 , value= 0 , *value_ptr= NULL;int *)(json_depth_array.buffer)+(p.last_step_idx);if (has_negative_path && je.value_type == JSON_VALUE_ARRAY &&1 ;break ;for (; n_path > 0 ; n_path--, c_path++)if (json_path_compare(&c_path->p, &p, je.value_type,0 )if (mode_one)1 ;break ;/* mode_all */ if (p_found[n_path-1 ])continue ; /* already found */ if (--n_found == 0 )1 ;break ;1 ]= TRUE ;if (likely(je.s.error == 0 ))return result;0 );1 ;return 0 ;/* This reproduces behavior according to the former Item_func_conv_charset : : is_json_type ( ) which returned args [ 0 ] - > is_json_type ( ) . JSON functions with multiple string input with different character sets wrap some arguments into Item_func_conv_charset . So the former Item_func_conv_charset : : is_json_type ( ) took the JSON properly from args [ 0 ] , i . e . from the original argument before the conversion . This is probably not always correct because an * explicit * ` CONVERT ( arg USING charset ) ` is actually a general purpose string expression , not a JSON expression . bool is_json_type(const Item *item)for ( ; ; )if (Type_handler_json_common::is_json_type_handler(item->type_handler()))return true ;const Item_func_conv_charset *func;if (!(func= dynamic_cast <const Item_func_conv_charset*>(item->real_item())))return false ;0 ];return false ;static int append_json_value(String *str, Item *item, String *tmp_val)if (item->type_handler()->is_bool_type())const char *t_f;int t_f_len;if (item->null_value)goto append_null;if (v_int)"true" ;4 ;else "false" ;5 ;return str->append(t_f, t_f_len);if (item->null_value)goto append_null;if (is_json_type(item))return str->append(sv->ptr(), sv->length());if (item->result_type() == STRING_RESULT)return str->append('"' ) ||'"' );return st_append_escaped(str, sv);return str->append(STRING_WITH_LEN("null" ));static int append_json_value_from_field(String *str,const uchar *key, size_t offset, String *tmp_val)if (i->type_handler()->is_bool_type())const char *t_f;int t_f_len;if (f->is_null_in_record(key))goto append_null;if (v_int)"true" ;4 ;else "false" ;5 ;return str->append(t_f, t_f_len);if (f->is_null_in_record(key))goto append_null;if (is_json_type(i))return str->append(sv->ptr(), sv->length());if (i->result_type() == STRING_RESULT)return str->append('"' ) ||'"' );return st_append_escaped(str, sv);return str->append(STRING_WITH_LEN("null" ));static int append_json_keyname(String *str, Item *item, String *tmp_val)if (item->null_value)goto append_null;return str->append('"' ) ||"\" : ", 3); return str->append("\" \": " , 4 );bool Item_func_json_array::fix_length_and_dec(THD *thd)2 ;sizeof (int ), NULL,0 ));if (arg_count == 0 )2 ;return FALSE ;0 ;if (agg_arg_charsets_for_string_result(collation, args, arg_count))return TRUE ;for (n_arg=0 ; n_arg < arg_count ; n_arg++)if (arg->result_type() == STRING_RESULT &&2 ; /*escaping possible */ else if (arg->type_handler()->is_bool_type())5 ;else if (arg_length < 4 )4 ; /* can be 'null' */ 4 ;return FALSE ;0 );if (str->append('[' ) ||0 ) && append_json_value(str, args[0 ], &tmp_val)))goto err_return;for (n_arg=1 ; n_arg < arg_count; n_arg++)if (str->append(", " , 2 ) ||goto err_return;if (str->append(']' ))goto err_return;if (result_limit == 0 )if (str->length() <= result_limit)return str;/*TODO: Launch out of memory error. */ 1 ;return NULL;bool Item_func_json_array_append::fix_length_and_dec(THD *thd)0 .0002 );0 ]->collation);0 ]->max_char_length();for (n_arg= 1 ; n_arg < arg_count; n_arg+= 2 )2 ].set_constant_flag(args[n_arg]->const_item());static_cast <ulonglong>(args[n_arg+1 ]->max_char_length()) + 4 ;sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));for (uint n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg+=2 , n_path++)sizeof (json_path_step_t), NULL,0 ));return FALSE ;0 ]->val_json(&tmp_js);const uchar *ar_end;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );for (n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg+=2 , n_path++)if (!c_path->parsed)if (!s_p)goto return_null;if (path_setup_nwc(&c_path->p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto return_null;if (args[n_arg]->null_value)goto return_null;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_find_path(&je, &c_path->p,if (je.s.error)goto js_error;goto return_null;if (json_read_value(&je))goto js_error;0 );if (str->reserve(js->length() + 8 , 1024 ))goto return_null; /* Out of memory. */ if (je.value_type == JSON_VALUE_ARRAY)int n_items;if (json_skip_level_and_count(&je, &n_items))goto js_error;const uchar *) js->ptr());const uchar *) js->ptr());if (n_items)", " , 2 );if (append_json_value(str, args[n_arg+1 ], &tmp_val))goto return_null; /* Out of memory. */ if (str->reserve(str_rest_len, 1024 ))goto return_null; /* Out of memory. */ const char *) ar_end, str_rest_len);else const uchar *c_from, *c_to;/* Wrap as an array. */ const char *) je.value_begin - js->ptr());if (je.value_type == JSON_VALUE_OBJECT)if (json_skip_level(&je))goto js_error;else if (str->append('[' ) ||const char *) c_from, c_to - c_from) ||", " , 2 ) ||1 ], &tmp_val) ||']' ) ||const char *) je.s.c_str,const char *) je.s.c_str))goto return_null; /* Out of memory. */ /* Swap str and js. */ if (str == &tmp_js)else const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto js_error;return str;0 );1 ;return 0 ;0 ]->val_str(&tmp_js);if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );for (n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg+=2 , n_path++)const char *item_pos;int n_item, corrected_n_item;if (!c_path->parsed)if (!s_p)goto return_null;if (!s_p->charset())goto path_err;if (path_setup_nwc(&c_path->p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()) ||1 ) < ((json_path_step_t*)(c_path->p.steps.buffer)) ||ATH_ARRAY)if (c_path->p.s.error == 0 )goto return_null;if (args[n_arg]->null_value)goto return_null;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_find_path(&je, &c_path->p, &tmp_step, &json_depth_array))if (je.s.error)goto js_error;/* Can't find the array to insert. */ continue ;if (json_read_value(&je))goto js_error;if (je.value_type != JSON_VALUE_ARRAY)/* Must be an array. */ continue ;0 ;0 ;_idx))[1 ].n_item;if (corrected_n_item < 0 )int array_size;if (json_skip_array_and_count(&je, &array_size))goto js_error;1 ;while (json_scan_next(&je) == 0 && je.state != JST_ARRAY_END)if (n_item == corrected_n_item)const char *) je.s.c_str;break ;if (json_read_value(&je) ||goto js_error;if (unlikely(je.s.error || *je.killed_ptr))goto js_error;0 );if (item_pos)if (append_simple(str, js->ptr(), size))0 ), (int ) size);goto return_null; /* Out of memory. */ if (n_item > 0 && str->append(" " , 1 ))0 ), 1 );goto return_null; /* Out of memory. */ if (append_json_value(str, args[n_arg+1 ], &tmp_val))0 ), tmp_val.length());goto return_null; /* Out of memory. */ if (str->append("," , 1 ))0 ), 1 );goto return_null; /* Out of memory. */ if (n_item == 0 && str->append(" " , 1 ))0 ), 1 );goto return_null; /* Out of memory. */ if (append_simple(str, item_pos, size))0 ), (int ) size);goto return_null; /* Out of memory. */ else /* Insert position wasn't found - append to the array. */ const char *) (je.s.c_str - je.sav_c_len);if (append_simple(str, js->ptr(), size))0 ), (int ) size);goto return_null; /* Out of memory. */ if (n_item > 0 && str->append(", " , 2 ))0 ), 2 );goto return_null; /* Out of memory. */ if (append_json_value(str, args[n_arg+1 ], &tmp_val))0 ), tmp_val.length());goto return_null; /* Out of memory. */ if (append_simple(str, item_pos, size))0 ), (int ) size);goto return_null; /* Out of memory. */ /* Swap str and js. */ if (str == &tmp_js)else const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto js_error;return str;0 );// to get the error message right 1 ;return 0 ;0 );if (str->append('{' ) ||0 &&0 ], &tmp_val) ||1 ], &tmp_val))))goto err_return;for (n_arg=2 ; n_arg < arg_count; n_arg+=2 )if (str->append(", " , 2 ) ||1 ], &tmp_val))goto err_return;if (str->append('}' ))goto err_return;if (result_limit == 0 )if (str->length() <= result_limit)return str;/*TODO: Launch out of memory error. */ 1 ;return NULL;static int do_merge(String *str, json_engine_t *je1, json_engine_t *je2)"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;if (json_read_value(je1) || json_read_value(je2))return 1 ;if (je1->value_type == JSON_VALUE_OBJECT &&int first_key= 1 ;if (str->append('{' ))return 3 ;while (json_scan_next(je1) == 0 &&const uchar *key_start, *key_end;/* Loop through the Json_1 keys and compare with the Json_2 keys. */ do while (json_read_keyname_chr(je1) == 0 );if (unlikely(je1->s.error))return 1 ;if (first_key)0 ;else if (str->append(", " , 2 ))return 3 ;if (str->append('"' ) ||"\" :", 2)) return 3 ;while (json_scan_next(je2) == 0 &&int ires;if (!json_key_matches(je2, &key_name))if (je2->s.error || json_skip_key(je2))return 2 ;continue ;/* Json_2 has same key as Json_1. Merge them. */ if ((ires= do_merge(str, je1, je2)))return ires;goto merged_j1;if (unlikely(je2->s.error))return 2 ;/* Just append the Json_1 key value. */ if (json_skip_key(je1))return 1 ;if (append_simple(str, key_start, je1->s.c_str - key_start))return 3 ;continue ;/* Now loop through the Json_2 keys . Skip if there is same key in Json_1 while (json_scan_next(je2) == 0 &&const uchar *key_start, *key_end;do while (json_read_keyname_chr(je2) == 0 );if (unlikely(je2->s.error))return 1 ;while (json_scan_next(je1) == 0 &&if (!json_key_matches(je1, &key_name))if (unlikely(je1->s.error || json_skip_key(je1)))return 2 ;continue ;if (json_skip_key(je2) || json_skip_level(je1))return 1 ;goto continue_j2;if (unlikely(je1->s.error))return 2 ;if (first_key)0 ;else if (str->append(", " , 2 ))return 3 ;if (json_skip_key(je2))return 1 ;if (str->append('"' ) ||return 3 ;continue ;if (str->append('}' ))return 3 ;else const uchar *end1, *beg1, *end2, *beg2;int n_items1=1 , n_items2= 1 ;/* Merge as a single array. */ if (je1->value_type == JSON_VALUE_ARRAY)if (json_skip_level_and_count(je1, &n_items1))return 1 ;else if (str->append('[' ))return 3 ;if (je1->value_type == JSON_VALUE_OBJECT)if (json_skip_level(je1))return 1 ;else if (str->append((const char *) beg1, end1 - beg1))return 3 ;if (json_value_scalar(je2))else if (je2->value_type == JSON_VALUE_OBJECT)if (json_skip_level(je2))return 2 ;else if (json_skip_level_and_count(je2, &n_items2))return 2 ;if ((n_items1 && n_items2 && str->append(", " , 2 )) ||const char *) beg2, end2 - beg2))return 3 ;if (je2->value_type != JSON_VALUE_ARRAY &&']' ))return 3 ;return 0 ;bool Item_func_json_merge::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));return Item_func_json_array::fix_length_and_dec(thd);0 ]->val_json(&tmp_js1), *js2=NULL;if (args[0 ]->null_value)goto null_return;0 .0002 );for (n_arg=1 ; n_arg < arg_count; n_arg++)0 );if (args[n_arg]->null_value)goto null_return;const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());const uchar *) js2->ptr(),const uchar *) js2->ptr() + js2->length());if (do_merge(str, &je, &je2))goto error_return;/* Swap str and js1. */ if (str == &tmp_js1)else const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto error_return;0 ;return str;if (je.s.error)0 );if (je2.s.error)1 ;return NULL;static int copy_value_patch(String *str, json_engine_t *je)int first_key= 1 ;"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;if (je->value_type != JSON_VALUE_OBJECT)const uchar *beg, *end;if (!json_value_scalar(je))if (json_skip_level(je))return 1 ;else if (append_simple(str, beg, end-beg))return 1 ;return 0 ;/* JSON_VALUE_OBJECT */ if (str->append('{' ))return 1 ;while (json_scan_next(je) == 0 && je->state != JST_OBJ_END)const uchar *key_start;/* Loop through the Json_1 keys and compare with the Json_2 keys. */ if (json_read_value(je))return 1 ;if (je->value_type == JSON_VALUE_NULL)continue ;if (!first_key)if (str->append(", " , 2 ))return 3 ;else 0 ;if (str->append('"' ) ||return 1 ;if (str->append('}' ))return 1 ;return 0 ;static int do_merge_patch(String *str, json_engine_t *je1, json_engine_t *je2,bool *empty_result)"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;if (json_read_value(je1) || json_read_value(je2))return 1 ;if (je1->value_type == JSON_VALUE_OBJECT &&int first_key= 1 ;bool mrg_empty;FALSE ;if (str->append('{' ))return 3 ;while (json_scan_next(je1) == 0 &&const uchar *key_start, *key_end;/* Loop through the Json_1 keys and compare with the Json_2 keys. */ do while (json_read_keyname_chr(je1) == 0 );if (je1->s.error)return 1 ;if (!first_key)if (str->append(", " , 2 ))return 3 ;if (str->append('"' ) ||"\" :", 2)) return 3 ;while (json_scan_next(je2) == 0 &&int ires;if (!json_key_matches(je2, &key_name))if (je2->s.error || json_skip_key(je2))return 2 ;continue ;/* Json_2 has same key as Json_1. Merge them. */ if ((ires= do_merge_patch(str, je1, je2, &mrg_empty)))return ires;if (mrg_empty)else 0 ;goto merged_j1;if (je2->s.error)return 2 ;/* Just append the Json_1 key value. */ if (json_skip_key(je1))return 1 ;if (append_simple(str, key_start, je1->s.c_str - key_start))return 3 ;0 ;continue ;/* Now loop through the Json_2 keys . Skip if there is same key in Json_1 while (json_scan_next(je2) == 0 &&const uchar *key_start, *key_end;do while (json_read_keyname_chr(je2) == 0 );if (je2->s.error)return 1 ;while (json_scan_next(je1) == 0 &&if (!json_key_matches(je1, &key_name))if (je1->s.error || json_skip_key(je1))return 2 ;continue ;if (json_skip_key(je2) ||return 1 ;goto continue_j2;if (je1->s.error)return 2 ;if (!first_key && str->append(", " , 2 ))return 3 ;if (str->append('"' ) ||"\" :", 2)) return 3 ;if (json_read_value(je2))return 1 ;if (je2->value_type == JSON_VALUE_NULL)else if (copy_value_patch(str, je2))return 1 ;0 ;continue ;if (str->append('}' ))return 3 ;else if (!json_value_scalar(je1) && json_skip_level(je1))return 1 ;if (!(*empty_result) && copy_value_patch(str, je2))return 1 ;return 0 ;0 ]->val_json(&tmp_js1), *js2=NULL;bool empty_result, merge_to_null;0 .0002 );/* To report errors properly if some JSON is invalid. */ 0 ;0 ]->null_value;for (n_arg=1 ; n_arg < arg_count; n_arg++)if (args[n_arg]->null_value)true ;goto cont_point;const uchar *) js2->ptr(),const uchar *) js2->ptr() + js2->length());if (merge_to_null)if (json_read_value(&je2))goto error_return;if (je2.value_type == JSON_VALUE_OBJECT)goto cont_point;false ;goto cont_point;0 );const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());if (do_merge_patch(str, &je, &je2, &empty_result))goto error_return;if (empty_result)"null" ));/* Swap str and js1. */ if (str == &tmp_js1)else if (merge_to_null)goto null_return;const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto error_return;0 ;return str;if (je.s.error)0 );if (je2.s.error)1 ;return NULL;bool Item_func_json_length::fix_length_and_dec(THD *thd)if (arg_count > 1 )1 ]->const_item());10 ;sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));return FALSE ;0 ]->val_json(&tmp_js);0 ;int err;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (arg_count > 1 )/* Path specified - let's apply it. */ if (!path.parsed)1 ]->val_str(&tmp_path);if (!s_p)goto null_return;if (path_setup_nwc(&path.p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))1 );goto null_return;if (args[1 ]->null_value)goto null_return;if (json_find_path(&je, &path.p, &tmp_ptr, &json_depth_array))if (je.s.error)goto err_return;goto null_return;if (json_read_value(&je))goto err_return;if (json_value_scalar(&je))return 1 ;while (!(err= json_scan_next(&je)) &&switch (je.state)case JST_VALUE:case JST_KEY:break ;case JST_OBJ_START:case JST_ARRAY_START:if (json_skip_level(&je))goto err_return;break ;default :break ;if (!err)/* Parse to the end of the JSON just to check it's valid. */ while (json_scan_next(&je) == 0 ) {}if (likely(!je.s.error))return length;0 );1 ;return 0 ;bool Item_func_json_depth::fix_length_and_dec(THD *thd)10 ;sizeof (int ), NULL,0 ));return false ;0 ]->val_json(&tmp_js);0 , c_depth= 0 ;bool inc_depth= TRUE ;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());do switch (je.state)case JST_VALUE:case JST_KEY:if (inc_depth)FALSE ;if (c_depth > depth)break ;case JST_OBJ_START:case JST_ARRAY_START:TRUE ;break ;case JST_OBJ_END:case JST_ARRAY_END:if (!inc_depth)FALSE ;break ;default :break ;while (json_scan_next(&je) == 0 );if (likely(!je.s.error))return depth;0 );1 ;return 0 ;bool Item_func_json_type::fix_length_and_dec(THD *thd)12 * collation.collation->mbmaxlen;sizeof (int ), NULL,0 ));return FALSE ;0 ]->val_json(&tmp_js);const char *type;if ((null_value= args[0 ]->null_value))return 0 ;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_read_value(&je))goto error;switch (je.value_type)case JSON_VALUE_OBJECT:"OBJECT" ;break ;case JSON_VALUE_ARRAY:"ARRAY" ;break ;case JSON_VALUE_STRING:"STRING" ;break ;case JSON_VALUE_NUMBER:"DOUBLE" : "INTEGER" ;break ;case JSON_VALUE_TRUE:case JSON_VALUE_FALSE:"BOOLEAN" ;break ;default :"NULL" ;break ;/* ensure the json is at least valid. */ while (json_scan_next(&je) == 0 ) {}if (je.s.error)goto error;return str;0 );1 ;return 0 ;bool Item_func_json_insert::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));0 ]->collation);0 ]->max_char_length();for (uint n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg+=2 , n_path++)sizeof (json_path_step_t),0 ));for (n_arg= 1 ; n_arg < arg_count; n_arg+= 2 )2 ].set_constant_flag(args[n_arg]->const_item());/* In the resulting JSON we can insert the property name from the path , and the value itself . 2 ]->max_char_length() + 6 ;2 +1 ]->max_char_length() + 4 ;return FALSE ;0 ]->val_json(&tmp_js);if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );for (n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg+=2 , n_path++)const char *v_to;int corrected_n_item;if (!c_path->parsed)if (s_p)if (path_setup_nwc(&c_path->p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto return_null;/* We search to the last step. */ else goto return_null;if (args[n_arg]->null_value)goto return_null;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (c_path->p.last_step_idx < 0 )1 ;else if (last_step < initial_step)goto v_found;if (last_step >= initial_step &&if (je.s.error)goto js_error;continue ;if (json_read_value(&je))goto js_error;1 );if (lp->type & JSON_PATH_ARRAY)int n_item= 0 ;if (je.value_type != JSON_VALUE_ARRAY)const uchar *v_from= je.value_begin;int do_array_autowrap;if (mode_insert)if (mode_replace)0 ;else if (lp->n_item == 0 )continue ;1 ;else if (lp->n_item)continue ;0 ;0 );/* Wrap the value as an array. */ if (append_simple(str, js->ptr(), (const char *) v_from - js->ptr()) ||'[' )))goto js_error; /* Out of memory. */ if (je.value_type == JSON_VALUE_OBJECT)if (json_skip_level(&je))goto js_error;if ((do_array_autowrap &&", " , 2 ))) ||1 ], &tmp_val) ||']' )) ||const char *) je.s.c_str))goto js_error; /* Out of memory. */ goto continue_point;if (corrected_n_item < 0 )int array_size;if (json_skip_array_and_count(&je, &array_size))goto js_error;while (json_scan_next(&je) == 0 && je.state != JST_ARRAY_END)switch (je.state)case JST_VALUE:if (n_item == corrected_n_item)goto v_found;if (json_skip_array_item(&je))goto js_error;break ;default :break ;if (unlikely(je.s.error))goto js_error;if (!mode_insert)continue ;const char *) (je.s.c_str - je.sav_c_len);0 );if (append_simple(str, js->ptr(), v_to - js->ptr()) ||0 && str->append(", " , 2 )) ||1 ], &tmp_val) ||goto js_error; /* Out of memory. */ else /*JSON_PATH_KEY*/ 0 ;if (je.value_type != JSON_VALUE_OBJECT)continue ;while (json_scan_next(&je) == 0 && je.state != JST_OBJ_END)switch (je.state)case JST_KEY:if (json_key_matches(&je, &key_name))goto v_found;if (json_skip_key(&je))goto js_error;break ;default :break ;if (unlikely(je.s.error))goto js_error;if (!mode_insert)continue ;const char *) (je.s.c_str - je.sav_c_len);0 );if (append_simple(str, js->ptr(), v_to - js->ptr()) ||0 && str->append(", " , 2 )) ||'"' ) ||"\" :", 2) || 1 ], &tmp_val) ||goto js_error; /* Out of memory. */ goto continue_point;if (!mode_replace)continue ;if (json_read_value(&je))goto js_error;const char *) je.value_begin;0 );if (!json_value_scalar(&je))if (json_skip_level(&je))goto js_error;if (append_simple(str, js->ptr(), v_to - js->ptr()) ||1 ], &tmp_val) ||const char *) je.s.c_str))goto js_error; /* Out of memory. */ /* Swap str and js. */ if (str == &tmp_js)else const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto js_error;return str;0 );1 ;return 0 ;bool Item_func_json_remove::fix_length_and_dec(THD *thd)0 ]->collation);0 ]->max_length;sizeof (int ), NULL,0 ));for (uint n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg++, n_path++)sizeof (json_path_step_t),0 ));sizeof (int ), NULL,0 ));1 , arg_count-1 );return FALSE ;0 ]->val_json(&tmp_js);if (!js || args[0 ]->null_value)goto null_return;0 .0002 );for (n_arg=1 , n_path=0 ; n_arg < arg_count; n_arg++, n_path++)const char *rem_start= 0 , *rem_end;int n_item= 0 ;if (!c_path->parsed)if (s_p)if (path_setup_nwc(&c_path->p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto null_return;/* We search to the last step. */ if (c_path->p.last_step_idx < 0 )1 ;else if (last_step < initial_step)goto null_return;else goto null_return;if (args[n_arg]->null_value)goto null_return;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_find_path(&je, &c_path->p, &tmp_ptr, &json_depth_array))if (je.s.error)goto js_error;continue ;if (json_read_value(&je))goto js_error;1 );if (lp->type & JSON_PATH_ARRAY)int corrected_n_item;if (je.value_type != JSON_VALUE_ARRAY)continue ;if (corrected_n_item < 0 )int array_size;if (json_skip_array_and_count(&je, &array_size))goto js_error;while (json_scan_next(&je) == 0 && je.state != JST_ARRAY_END)switch (je.state)case JST_VALUE:if (n_item == corrected_n_item)const char *) (je.s.c_str -0 ));goto v_found;if (json_skip_array_item(&je))goto js_error;break ;default :break ;if (unlikely(je.s.error))goto js_error;continue ;else /*JSON_PATH_KEY*/ if (je.value_type != JSON_VALUE_OBJECT)continue ;while (json_scan_next(&je) == 0 && je.state != JST_OBJ_END)switch (je.state)case JST_KEY:if (n_item == 0 )const char *) (je.s.c_str - je.sav_c_len);if (json_key_matches(&je, &key_name))goto v_found;if (json_skip_key(&je))goto js_error;const char *) je.s.c_str;break ;default :break ;if (unlikely(je.s.error))goto js_error;continue ;if (json_skip_key(&je) || json_scan_next(&je))goto js_error;0 ) ? const char *) je.s.c_str : (const char *) (je.s.c_str - je.sav_c_len);0 );if (append_simple(str, js->ptr(), rem_start - js->ptr()) ||0 && str->append("," , 1 )) ||goto js_error; /* Out of memory. */ /* Swap str and js. */ if (str == &tmp_js)else const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto js_error;0 ;return str;0 );1 ;return 0 ;bool Item_func_json_keys::fix_length_and_dec(THD *thd)0 ]->collation);0 ]->max_length;sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));if (arg_count > 1 )1 ]->const_item());return FALSE ;/* That function is for Item_func_json_keys : : val_str exclusively . It utilizes the fact the resulting string is in specific format : [ " key1 " , " key2 " . . . ] static int check_key_in_list(String *res,const uchar *key, int key_len)const uchar *c= (const uchar *) res->ptr() + 2 ; /* beginning '["' */ const uchar *end= (const uchar *) res->end() - 1 ; /* ending '"' */ while (c < end)int n_char;for (n_char=0 ; c[n_char] != '"' && n_char < key_len; n_char++)if (c[n_char] != key[n_char])break ;if (c[n_char] == '"' )if (n_char == key_len)return 1 ;else while (c[n_char] != '"' )4 ; /* skip ', "' */ return 0 ;0 ]->val_json(&tmp_js);0 ;if ((args[0 ]->null_value))goto null_return;0 .0002 );const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (arg_count < 2 )goto skip_search;if (!path.parsed)1 ]->val_str(&tmp_path);if (!s_p)goto null_return;if (path_setup_nwc(&path.p,const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))1 );goto null_return;if (args[1 ]->null_value)goto null_return;if (json_find_path(&je, &path.p,if (je.s.error)goto err_return;goto null_return;if (json_read_value(&je))goto err_return;if (je.value_type != JSON_VALUE_OBJECT)goto null_return;0 );if (str->append('[' ))goto err_return; /* Out of memory. */ /* Parse the OBJECT collecting the keys. */ while (json_scan_next(&je) == 0 && je.state != JST_OBJ_END)const uchar *key_start, *key_end;int key_len;switch (je.state)case JST_KEY:do while (json_read_keyname_chr(&je) == 0 );if (unlikely(je.s.error))goto err_return;int )(key_end - key_start);if (!check_key_in_list(str, key_start, key_len))if ((n_keys > 0 && str->append(", " , 2 )) ||'"' ) ||'"' ))goto err_return;break ;case JST_OBJ_START:case JST_ARRAY_START:if (json_skip_level(&je))break ;break ;default :break ;if (unlikely(je.s.error || str->append(']' )))goto err_return;0 ;return str;0 );1 ;return 0 ;bool Item_func_json_search::fix_fields(THD *thd, Item **ref)if (Item_json_str_multipath::fix_fields(thd, ref))return TRUE ;if (arg_count < 4 )'\\' ;return FALSE ;return fix_escape_item(thd, args[3 ], &tmp_js, true ,0 ]->collation.collation, &escape);static const uint SQR_MAX_BLOB_WIDTH= (uint) sqrt(MAX_BLOB_WIDTH);bool Item_func_json_search::fix_length_and_dec(THD *thd)0 ]->collation);/* It ' s rather difficult to estimate the length of the result . I believe arglen ^ 2 is the reasonable upper limit . if (args[0 ]->max_length > SQR_MAX_BLOB_WIDTH)else 0 ]->max_length;1 ]->const_item();FALSE ;if (arg_count > 4 )4 , arg_count-4 );sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));for (uint n_arg=4 ; n_arg < arg_count; n_arg++)4 ;sizeof (json_path_step_t), NULL,0 ));return FALSE ;int Item_func_json_search::compare_json_value_wild(json_engine_t *je,const String *cmp_str)if (je->value_type != JSON_VALUE_STRING || !je->value_escaped)return collation.collation->wildcmp(const char *) je->value, (const char *) (je->value + je->value_len),0 : 1 ;int esc_len;if (esc_value.alloced_length() < (uint) je->value_len &&1024 + 1 ) * 1024 ))return 0 ;if (esc_len <= 0 )if (current_thd)if (esc_len == JSON_ERROR_OUT_OF_SPACE)0 ), je->value_len);else if (esc_len == JSON_ERROR_ILLEGAL_SYMBOL)0 , "comparison" ,int )(je->s.c_str - je->value));return 0 ;return collation.collation->wildcmp(0 : 1 ;static int append_json_path(String *str, const json_path_t *p)if (str->append("\" $", 2)) return TRUE ;for (c= step+1 ; c <= last_step; c++)if (c->type & JSON_PATH_KEY)if (str->append("." , 1 ) ||return TRUE ;else /*JSON_PATH_ARRAY*/ if (str->append('[' ) ||']' ))return TRUE ;return str->append('"' );0 ]->val_json(&tmp_js);2 ]->val_str(&tmp_path);0 ;bool has_multi_value= false ;0 );if (!js || !js->length())goto null_return;if (args[0 ]->null_value || args[2 ]->null_value)goto null_return;if (parse_one_or_all(this , args[1 ], &ooa_parsed, ooa_constant, &mode_one))goto null_return;0 ;0 );for (n_arg=4 ; n_arg < arg_count; n_arg++)4 ;if (!c_path->parsed)4 ));if (s_p)if (json_path_setup(&c_path->p,s_p->charset(),(const uchar *) s_p->ptr(),const uchar *) s_p->ptr() + s_p->length()))goto null_return;if (args[n_arg]->null_value)goto null_return;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length(), &p);while (json_get_path_next(&je, &p) == 0 )int value= 0 ;if (has_negative_path && je.value_type == JSON_VALUE_ARRAY &&goto js_error;if (json_value_scalar(&je))if ((arg_count < 5 ||4 , &p, je.value_type, &json_depth_array)) &&0 )if (n_path_found == 1 )if (append_json_path(&temp, &p))goto js_error;else true ;if (temp.append(", " , 2 ) || append_json_path(&temp, &p))goto js_error;if (mode_one)goto end;if (unlikely(je.s.error))goto js_error;if (n_path_found == 0 )goto null_return;if (has_multi_value)'[' );']' );else 0 ;return str;0 );1 ;return 0 ;const switch (fmt)case COMPACT:return { STRING_WITH_LEN("json_compact" ) };case LOOSE:return { STRING_WITH_LEN("json_loose" ) };case DETAILED:return { STRING_WITH_LEN("json_detailed" ) };default :0 );return NULL_clex_str;bool Item_func_json_format::fix_length_and_dec(THD *thd)0 ;0 ]->collation);switch (fmt)case COMPACT:0 ]->max_length;break ;case LOOSE:0 ]->max_length * 2 ;break ;case DETAILED:break ;default :0 );sizeof (int ), NULL,0 ));return FALSE ;0 ]->val_json(&tmp_js);int tab_size= 4 ;if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );if (fmt == DETAILED)if (arg_count > 1 )int )args[1 ]->val_int();if (args[1 ]->null_value)1 ;return 0 ;if (tab_size < 0 )0 ;else if (tab_size > TAB_SIZE_LIMIT)const uchar *) js->ptr(),const uchar *) js->ptr()+js->length());if (json_nice(&je, str, fmt, tab_size))1 ;0 );return 0 ;return str;0 ]->val_json(&tmp_js);if ((null_value= args[0 ]->null_value))return 0 ;return js;int Arg_comparator::compare_json_str_basic(Item *j, Item *s)int c_len;sizeof (int ), NULL,0 ));if ((js= j->val_str(&value1)))/* doesn't appear to json_scan_next so not interuptable */ const uchar *) js->ptr(),const uchar *) js->ptr()+js->length());if (json_read_value(&je))goto error;if (je.value_type == JSON_VALUE_STRING)if (value2.realloc_with_extra_if_needed(je.value_len))0 ), je.value_len);goto error;if ((c_len= json_unescape(js->charset(), je.value,0 )if (current_thd)if (c_len == JSON_ERROR_OUT_OF_SPACE)0 ), je.value_len);else if (c_len == JSON_ERROR_ILLEGAL_SYMBOL)0 , "comparison" , (int )((const char *) je.s.c_str - js->ptr()));goto error;else if ((str= s->val_str(str)))if (set_null)0 ;return sortcmp(js, str, compare_collation());if (set_null)1 ;return -1 ;int Arg_comparator::compare_e_json_str_basic(Item *j, Item *s)char *value;int value_len, c_len;if (!res1 || !res2)return MY_TEST(res1 == res2);if (type == JSON_VALUE_STRING)if (value1.realloc_with_extra_if_needed(value_len))0 ), value_len);return 1 ;if ((c_len= json_unescape(value1.charset(), (uchar *) value,0 )if (current_thd)if (c_len == JSON_ERROR_OUT_OF_SPACE)0 ), value_len);else if (c_len == JSON_ERROR_ILLEGAL_SYMBOL)0 , "equality comparison" , 0 );return 1 ;return MY_TEST(sortcmp(res1, res2, compare_collation()) == 0 );bool Item_func_json_arrayagg::fix_fields(THD *thd, Item **ref)bool res= Item_func_group_concat::fix_fields(thd, ref);/* account for opening and closing brackets */ 2 *collation.collation->mbminlen, UINT_MAX32);return res;0 );if (append_json_value(&m_tmp_json, i, tmp))return NULL;return &m_tmp_json;const uchar *key, size_t offset)0 );if (append_json_value_from_field(&m_tmp_json, i, f, key, offset, tmp))return NULL;return &m_tmp_json;void Item_func_json_arrayagg::cut_max_length(String *result,const if (result->length() == 0 )return ;if (result->end()[-1 ] != '"' || old_length == max_length)return ;1 );'"' );return new (thd->mem_root) Item_func_json_arrayagg(thd, this );if ((str= Item_func_group_concat::val_str(str)))'[' );']' );return str;FALSE ;'{' );bool /* for loop variable */ 0 );sizeof (Item*) * arg_count);if (init_sum_func_check(thd))return TRUE ;/* Fix fields for select list and ORDER clause for (i=0 ; i < arg_count ; i++)if (args[i]->fix_fields_if_needed_for_scalar(thd, &args[i]))return TRUE ;/* skip charset aggregation for order columns */ if (agg_arg_charsets_for_string_result(collation, args, arg_count))return 1 ;0 ;1 ;if (fix_filter(thd))return TRUE ;if (check_sum_func(thd, ref))return TRUE ;return FALSE ;void Item_func_json_objectagg::cleanup()"Item_func_json_objectagg::cleanup" );1 );return new (thd->mem_root) Item_func_json_objectagg(thd, this );void Item_func_json_objectagg::clear()1 );1 ;bool Item_func_json_objectagg::add()0 ]->val_str(&buf);if (args[0 ]->is_null() || !filter_passed())return 0 ;0 ;if (result.length() > 1 )", " ));'"' );"\" :")); 0 );1 ], &buf);return 0 ;if (null_value)return 0 ;'}' );return &result;0 ]->val_str(&tmp);0 ]->null_value;if (null_value)return NULL;if (init_dynamic_string(&normalized_json, NULL, 0 , 0 ))1 ;return NULL;0 .0002 );if (json_normalize(&normalized_json,goto null_return;0 );if (buf->append(normalized_json.str, normalized_json.length))goto null_return;goto end;1 ;if (temp_je.s.error)0 );return null_value ? NULL : buf;bool Item_func_json_normalize::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));sizeof (struct json_norm_value*), NULL,0 ));sizeof (int ), NULL,0 ));/* 0 becomes 0.0E0, thus one character becomes 5 chars */ 0 ]->max_char_length() * 5 );return FALSE ;/* When the two values match or don ' t match we need to return true or false . But we can have some more elements in the array left or some more keys left in the object that we no longer want to compare . In this case , we want to skip the current item . static void json_skip_current_level(json_engine_t *js, json_engine_t *value)/* At least one of the two arguments is a scalar. */ static bool json_find_overlap_with_scalar(json_engine_t *js, json_engine_t *value)if (json_value_scalar(value))if (js->value_type == value->value_type)if (js->value_type == JSON_VALUE_NUMBER)double d_j, d_v;char *end;int err;char *) js->value, js->value_len, &end, &err);char *) value->value, value->value_len,return (fabs(d_j - d_v) < 1 e-12 );else if (js->value_type == JSON_VALUE_STRING)return json_string_compare(js->s.cs,0 ;return value->value_type == js->value_type;else if (value->value_type == JSON_VALUE_ARRAY)while (json_scan_next(value) == 0 && value->state == JST_VALUE)if (json_read_value(value))return FALSE ;if (js->value_type == value->value_type)int res1= json_find_overlap_with_scalar(js, value);if (res1)return TRUE ;if (!json_value_scalar(value))return FALSE ;/* Compare when one is object and other is array . This means we are looking for the object in the array . Hence , when value type of an element of the array is object , then compare the two objects entirely . If they are equal return true else return false . static bool json_compare_arr_and_obj(json_engine_t *js, json_engine_t *value,while (json_scan_next(js) == 0 && js->state == JST_VALUE)if (json_read_value(js))return FALSE ;if (js->value_type == JSON_VALUE_OBJECT)int res1= json_find_overlap_with_object(js, value, true ,if (res1)return TRUE ;if (js->value_type == JSON_VALUE_ARRAY)return FALSE ;bool json_compare_arrays_in_order(json_engine_t *js, json_engine_t *value,bool res= false ;while (json_scan_next(js) == 0 && json_scan_next(value) == 0 &&if (json_read_value(js) || json_read_value(value))return FALSE ;if (js->value_type != value->value_type)return FALSE ;true , current_mem_root, temp_je, stack);if (!res)return FALSE ;TRUE : FALSE );return res;static int json_find_overlap_with_array(json_engine_t *js, json_engine_t *value,bool compare_whole,if (value->value_type == JSON_VALUE_ARRAY)if (compare_whole)return json_compare_arrays_in_order(js, value, current_mem_root, temp_je, stack);while (json_scan_next(js) == 0 && js->state == JST_VALUE)if (json_read_value(js))return FALSE ;while (json_scan_next(value) == 0 && value->state == JST_VALUE)if (json_read_value(value))return FALSE ;if (js->value_type == value->value_type)int res1= check_overlaps(js, value, true , current_mem_root, temp_je, stack);if (res1)return TRUE ;else if (!json_value_scalar(value))if (!json_value_scalar(js))return FALSE ;else if (value->value_type == JSON_VALUE_OBJECT)if (compare_whole)return FALSE ;return json_compare_arr_and_obj(js, value, current_mem_root, temp_je, stack);else return json_find_overlap_with_scalar(value, js);int compare_nested_object(json_engine_t *js, json_engine_t *value,int result= 0 ;const char *value_begin= (const char *)value->s.c_str-1 ;const char *js_begin= (const char *)js->s.c_str-1 ;const char *value_end= (const char *)value->s.c_str;const char *js_end= (const char *)js->s.c_str;if (init_dynamic_string(&a_res, NULL, BLOCK_SIZE_JSON_DYN_ARRAY, 1024 ) ||1024 ))goto error;if (json_normalize(&a_res, a.ptr(), a.length(), value->s.cs,goto error;if (json_normalize(&b_res, b.ptr(), b.length(), value->s.cs,goto error;0 : 1 ;return MY_TEST(result);static int json_find_overlap_with_object(json_engine_t *js,bool compare_whole,if (value->value_type == JSON_VALUE_OBJECT)if (compare_whole)return compare_nested_object(js, value, current_mem_root, temp_je, stack);else /* Find at least one common key-value pair */ bool found_key= false , found_value= false ;const uchar *k_start, *k_end;while (json_scan_next(value) == 0 && value->state == JST_KEY)do while (json_read_keyname_chr(value) == 0 );if (unlikely(value->s.error))return FALSE ;0 ;if (found_key)if (json_read_value(js) || json_read_value(value))return FALSE ;/* The value of key - value pair can be an be anything . If it is an object then we need to compare the whole value and if it is an array then we need to compare the elements in that order . So set compare_whole to true . if (js->value_type == value->value_type)true , current_mem_root, temp_je, stack);if (found_value)/* We have found at least one common key - value pair now . No need to check for more key - value pairs . So skip remaining jsons and return TRUE . return TRUE ;else /* Key is found but value is not found . We have already exhausted both values for current key . Hence " reset " only js ( first argument i . e json document ) and continue . continue ;else /* key is not found . So no need to check for value for that key . Read the value anyway so we get the " type " of json value . If is is non - scalar then skip the entire value ( scalar values get exhausted while reading so no need to skip them ) . Then reset the json doc again . if (json_read_value(value))return FALSE ;if (!json_value_scalar(value))/* At this point we have already returned true if any intersection exists . So skip jsons if not exhausted and return false . return FALSE ;else if (value->value_type == JSON_VALUE_ARRAY)if (compare_whole)return FALSE ;return json_compare_arr_and_obj(value, js, current_mem_root, temp_je, stack);return FALSE ;/* Find if two json documents overlap SYNOPSIS check_overlaps ( ) js - json document value - value compare_whole - If true then find full overlap with the document in case of object and comparing in - order in case of array . Else find at least one match between two objects or array . IMPLEMENTATION We can compare two json datatypes if they are of same type to check if they are equal . When comparing between a json document and json value , there can be following cases : 1 ) When at least one of the two json documents is of scalar type : 1 . a ) If value and json document both are scalar , then return true if they have same type and value . 1 . b ) If json document is scalar but other is array ( or vice versa ) , then return true if array has at least one element of same type and value as scalar . 1 . c ) If one is scalar and other is object , then return false because it can ' t be compared . 2 ) When both arguments are of non - scalar type : 2 . a ) If both arguments are arrays : Iterate over the value and json document . If there exists at least one element in other array of same type and value as that of element in value , then return true else return false . 2 . b ) If both arguments are objects : Iterate over value and json document and if there exists at least one key - value pair common between two objects , then return true , else return false . 2 . c ) If either of json document or value is array and other is object : Iterate over the array , if an element of type object is found , then compare it with the object ( which is the other argument ) . If the entire object matches i . e all they key value pairs match , then return true else return false . When we are comparing an object which is nested in other object or nested in an array , we need to compare all the key - value pairs , irrespective of what order they are in as opposed to non - nested where we return true if at least one match is found . However , if we have an array nested in another array , then we compare two arrays in that order i . e we compare i - th element of array 1 with i - th element of array 2 . RETURN FALSE - If two json documents do not overlap TRUE - if two json documents overlap static int check_overlaps(json_engine_t *js, json_engine_t *value,bool compare_whole, MEM_ROOT *current_mem_root,"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return 1 ;switch (js->value_type)case JSON_VALUE_OBJECT:return json_find_overlap_with_object(js, value, compare_whole,case JSON_VALUE_ARRAY:return json_find_overlap_with_array(js, value, compare_whole,default :return json_find_overlap_with_scalar(js, value);bool Item_func_json_overlaps::val_bool()0 ]->val_json(&tmp_js);int result;if ((null_value= (js == nullptr) || args[0 ]->null_value))return 0 ;0 .0002 );if (!a2_parsed)1 ]->val_json(&tmp_val);if (val == 0 )1 ;return 0 ;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());const uchar *) val->ptr(),const uchar *) val->end());if (json_read_value(&je) || json_read_value(&ve))goto error;false , current_thd->mem_root, &temp_je, &stack);if (unlikely(je.s.error || ve.s.error))goto error;return result;if (je.s.error)0 );if (ve.s.error)1 );return 0 ;bool Item_func_json_overlaps::fix_length_and_dec(THD *thd)1 ]->const_item();FALSE ;sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (struct json_norm_value*), NULL,0 ));return Item_bool_func::fix_length_and_dec(thd);bool Item_func_json_schema_valid::val_bool()int is_valid= 1 ;if (!schema_parsed)1 ;return 0 ;1 ]->val_json(&tmp_val);if (!val)1 ;return 0 ;0 ;if (!val->length())return 1 ;const uchar *) val->ptr(),const uchar *) val->end());0 .0002 );if (json_read_value(&ve))goto end;if (!keyword_list.is_empty())while ((curr_keyword=it++))if (curr_keyword->validate(&ve, current_thd->mem_root, NULL, NULL))0 ;break ;if (is_valid && !ve.s.error && !json_scan_ended(&ve))while (json_scan_next(&ve) == 0 ) /* no-op */; if (unlikely(ve.s.error))0 ;1 );return is_valid;/*Idea behind implementation : JSON schema basically has same structure as that of json object , consisting of key - value pairs . So it can be parsed in the same manner as any json object . However , none of the keywords are mandatory , so making guess about the json value type based only on the keywords would be incorrect . Hence we need separate objects denoting each keyword . So during create_object_and_handle_keyword ( ) we create appropriate objects based on the keywords and validate each of them individually on the json document by calling respective validate ( ) function if the type matches . If any of them fails , return false , else return true . bool Item_func_json_schema_valid::fix_length_and_dec(THD *thd)bool res= 0 , is_schema_constant= args[0 ]->const_item();sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));if (!is_schema_constant)0 ));1 ;return 0 ;0 ]->null_value;0 ]->val_json(&tmp_js);if (!js)1 ;return 0 ;const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());if (!create_object_and_handle_keyword(thd, current_thd->mem_root, &je,true ;else false ;/* create_object_and_handle_keyword fails when either the json value for keyword is invalid or when there is syntax error . Return NULL in both these cases . if (!schema_parsed)if (je.s.error)0 );return res || Item_bool_func::fix_length_and_dec(thd);void Item_func_json_schema_valid::cleanup()"Item_func_json_schema_valid::cleanup" );while ((curr_schema= it2++))delete curr_schema;bool Item_func_json_key_value::get_key_value(json_engine_t *je, String *str)int level= je->stack_p;if (str->append('[' ))goto error_return;while (json_scan_next(je) == 0 && je->stack_p >= level)const uchar *key_start, *key_end, *value_begin;switch (je->state)case JST_KEY:do while (json_read_keyname_chr(je) == 0 );if (unlikely(je->s.error))goto error_return;if (json_read_value(je))goto error_return;if (json_value_scalar(je))else if (json_skip_level(je))goto error_return;if (str->append('{' ) ||'"' ) || str->append("key" , 3 ) || str->append('"' ) ||": " , 2 ) ||'"' ) || str->append((const char *)key_start, key_len) || str->append('"' ) ||", " ,2 ) ||'"' ) || str->append("value" , 5 ) || str->append('"' ) ||": " , 2 ) ||const char *)value_begin, v_len) ||'}' ) ||", " , 2 ))goto error_return;if (je->s.error)goto error_return;if (str->length() > 1 )/* remove the last comma and space. */ /* close the array */ if (str->append(']' ))goto error_return;return false ;0 );return true ;if ((null_value= args[0 ]->null_value || args[1 ]->null_value))return NULL;0 ], args[1 ],true );if (null_value)return NULL;const uchar *) tmp_str.ptr(),const uchar *) tmp_str.ptr() + tmp_str.length());if (json_read_value(&je))goto return_error;0 );if (get_key_value(&je, str))goto return_error;return str;0 );1 ;return NULL;bool Item_func_json_key_value::fix_length_and_dec(THD *thd)"json_key_value" ) };0 ]->collation);"" , 0 , collation.collation);0 ]->max_length*2 ;1 ]->const_item());sizeof (int ), NULL,0 ));sizeof (json_path_step_t), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));return FALSE ;static bool create_hash(json_engine_t *value, HASH *items,bool &item_hash_inited,int level= value->stack_p;if (my_hash_init(PSI_INSTRUMENT_ME, items, value->s.cs, 0 , 0 , 0 ,0 ))return true ;true ;while (json_scan_next(value) == 0 && value->stack_p >= level)const uchar *value_start= NULL;0 ;if (json_read_value(value) ||0 , 0 ))return true ;if (json_normalize(&norm_val, (const char *) value_start,return true ;char *new_entry= (char *)alloc_root(hash_root,1 );if (!new_entry)return true ;else '\0' ;if (my_hash_insert(items, (const uchar *) new_entry))return true ;return false ;/* Get the starting pointer and length of the value of the current layer . RETURN FALSE - The function was successfully completed without errors . TRUE - An error occurred while running . static bool get_current_value(json_engine_t *js, const uchar *&value_start,if (json_value_scalar(js))else if (json_skip_level(js))return true ;return false ;static my_bool restore_entry(void *element, void *arg)return my_hash_insert(items, (const uchar*) element);/* If the outermost layer of JSON is an array , the intersection of arrays is independent of order . Create a hash containing all elements in the array , iterate over another array and add the common elements to the result . RETURN FALSE - if two array documents have intersection TRUE - If two array documents do not have intersection bool Item_func_json_array_intersect::bool res= true , has_value= false ;int level= value->stack_p;0 );'[' );while (json_scan_next(value) == 0 && value->stack_p >= level)const uchar *value_start= NULL;0 ;if (json_read_value(value) ||0 , 0 ))goto error;if (json_normalize(&norm_val, (const char *) value_start,goto error;char *new_entry= (char *)malloc(norm_val.length+1 );if (!new_entry)goto error;'\0' ;/* If the same value is found in the hash table , add that value to str . At the same time , update the number of times the value appears in the hash table . if ((found= my_hash_search(items,const uchar *) new_entry,true ;const char *) value_start, value_len);',' );if (my_hash_delete(items, found) || my_hash_insert(seen, (const uchar *)found))goto error;0 ;if (has_value && !res)/* remove last comma because there are no values after that. */ ']' );return res;1 ]->val_json(&tmp_js2), *js1= args[0 ]->val_json(&tmp_js1);if (!js1 || !js2)goto null_return;if (parse_for_each_row)if (args[0 ]->null_value)goto null_return;if (item_hash_inited)if (seen_hash_inited)if (hash_root_inited)0 ));false ;false ;if (!is_array || args[1 ]->null_value)goto null_return;0 );0 .0002 );const uchar *) js2->ptr(),const uchar *) js2->ptr() + js2->length());if (json_read_value(&je2))goto je2_error_return;if (je2.value_type != JSON_VALUE_ARRAY)goto je2_error_return;if (get_intersect_between_arrays(str, &je2, &items, current_thd->mem_root, &temp_je, &stack, &seen))goto error_return;if (str->length())const uchar *) str->ptr(),const uchar *) str->ptr() + str->length());if (json_nice(&res_je, str, Item_func_json_format::LOOSE))goto error_return;0 ;return str;else goto null_return;if (je2.s.error)1 );1 ;return NULL;bool Item_func_json_array_intersect::prepare_json_and_create_hash(json_engine_t *je1, String *js)const uchar *) js->ptr(),const uchar *) js->ptr() + js->length());/* Scan value uses the hash table to get the intersection of two arrays . if (my_hash_init(PSI_INSTRUMENT_ME, &seen, je1->s.cs, 0 , 0 , 0 ,0 ))return true ;true ;if (!hash_root_inited)1024 , 0 , MYF(0 ));true ;if (!json_read_value(je1) && je1->value_type == JSON_VALUE_ARRAY)true ;if (create_hash(je1, &items, item_hash_inited, &hash_root,if (je1->s.error)0 );return false ;bool Item_func_json_array_intersect::fix_length_and_dec(THD *thd)0 ]->val_json(&tmp_js1);;sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (struct json_norm_value*), NULL,0 ));if (!args[0 ]->const_item())if (args[1 ]->const_item())0 ], args[1 ]);else true ;goto end;if (js1 && prepare_json_and_create_hash(&je1, js1))return TRUE ;0 ]->collation);2 * MY_MIN(args[0 ]->max_char_length(),1 ]->max_char_length()));return FALSE ;static bool filter_keys(json_engine_t *je1, String *str, HASH items)int level= je1->stack_p;0 );bool res= true , has_value= false ;'{' );while (json_scan_next(je1)==0 && level <= je1->stack_p)switch (je1->state)case JST_KEY:const uchar *key_start= je1->s.c_str;const uchar *key_end;"" , 0 , je1->s.cs);'"' );do while (json_read_keyname_chr(je1) == 0 );if (unlikely(je1->s.error))goto error;if (json_read_value(je1))goto error;const uchar* value_start= NULL;0 ;if (get_current_value(je1, value_start, value_len))goto error;const char *)key_start, (size_t)(key_end-key_start));'"' );'\0' );char *curr_key= (char *)malloc((size_t)(str.length()+3 ));if (my_hash_search(&items, (const uchar*)curr_key, strlen(curr_key)))true ;'"' );const char *)key_start, (size_t)(key_end-key_start));'"' );':' );const char *)value_start, value_len);',' );false ;if (has_value)'}' );return res;0 ]->val_json(&tmp_js1);if (null_value || args[0 ]->null_value)goto null_return;0 );const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());if (json_read_value(&je1) || je1.value_type != JSON_VALUE_OBJECT)goto error_return;if (filter_keys(&je1, str, items))goto null_return;if (str->length())const uchar *) str->ptr(),const uchar *) str->ptr() + str->length());if (json_nice(&je_res, str, Item_func_json_format::LOOSE))goto error_return;0 ;return str;else goto null_return;if (je1.s.error)0 );1 ;return NULL;bool Item_func_json_object_filter_keys::fix_length_and_dec(THD *thd)1 ]->val_json(&tmp_js2);sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (int ), NULL,0 ));sizeof (struct json_norm_value*), NULL,0 ));if (args[1 ]->null_value)1 ;return FALSE ;const uchar *) js2->ptr(),const uchar *) js2->ptr() + js2->length());if (!hash_root_inited)1024 , 0 , MYF(0 ));true ;if (json_read_value(&temp_je) || temp_je.value_type != JSON_VALUE_ARRAY ||if (temp_je.s.error)0 );1 ;return FALSE ;0 ]->max_length;return FALSE ;static bool convert_to_array(json_engine_t *je, String *str)int level= je->stack_p;0 );'[' );while (json_scan_next(je)==0 && level <= je->stack_p)switch (je->state)case JST_KEY:'[' );const uchar *key_start= je->s.c_str;const uchar *key_end;do while (json_read_keyname_chr(je) == 0 );if (unlikely(je->s.error))return true ;'"' );const char *)key_start, (size_t)(key_end-key_start));'"' );',' );int v_len= 0 ;const uchar *value= NULL;if (json_read_value(je))return true ;if (json_value_scalar(je))int )(je->value_end - value);else if (json_skip_level(je))return true ;int )(je->s.c_str - value);const char *) value, v_len);']' );',' );if (je->s.error)return true ;/* remove the last comma. */ ']' );return false ;0 ]->val_str(&tmp);if (args[0 ]->null_value)goto null_return;0 );0 .0002 );const uchar *) js1->ptr(),const uchar *) js1->ptr() + js1->length());if (json_read_value(&je))goto error_return;if (je.value_type != JSON_VALUE_OBJECT)goto null_return;if (convert_to_array(&je, str))goto error_return;if (str->length())const uchar *) str->ptr(),const uchar *) str->ptr() + str->length());if (json_nice(&je, str, Item_func_json_format::LOOSE))goto error_return;0 ;return str;else goto null_return;if (je.s.error)0 );1 ;return NULL;bool Item_func_json_object_to_array::fix_length_and_dec(THD *thd)0 ]->max_length + (args[0 ]->max_length/2 );sizeof (int ), NULL,0 ));return FALSE ;static bool check_unique_keys(json_engine_t *je)int level= je->stack_p;"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return false ;if (my_hash_init(PSI_INSTRUMENT_ME, &unique_keys, je->s.cs,0 , 0 , 0 , get_key_name, my_free, 0 ))return false ;while (json_scan_next(je) == 0 && je->stack_p >= level)if (je->state == JST_KEY)const uchar *key_start, *key_end;int key_len;do while (json_read_keyname_chr(je) == 0 );if (unlikely(je->s.error))return false ;int )(key_end - key_start);char *curr_key= (char *)my_malloc(PSI_NOT_INSTRUMENTED, key_len + 1 , MYF(0 ));if (!curr_key)return false ;'\0' ;if (my_hash_search(&unique_keys, (const uchar*)curr_key, key_len))return false ;if (my_hash_insert(&unique_keys, (const uchar*)curr_key))return false ;if (json_read_value(je))return false ;// Handle nested structures: delegate to value handler if (!json_value_scalar(je))if (!handle_nested_value(je))return false ;if (je->s.error)return false ;return true ;// Checks type and delegates to appropriate function static bool handle_nested_value(json_engine_t *je)int level= je->stack_p;"json_check_min_stack_requirement" ,return dbug_json_check_min_stack_requirement(););if (check_stack_overrun(current_thd, STACK_MIN_SIZE , NULL))return false ;if (je->value_type == JSON_VALUE_OBJECT)return check_unique_keys(je);if (je->value_type == JSON_VALUE_ARRAY)// If value is an array, iterate through elements and handle each value while (json_scan_next(je) == 0 && je->stack_p >= level)if (je->state == JST_VALUE)if (json_read_value(je))return false ;// Handle nested structures: delegate to value handler recursively if (!json_value_scalar(je))if (!handle_nested_value(je))return false ;if (je->s.error)return false ;return true ;return json_skip_level(je) == 0 ;bool Item_func_is_json::val_bool()bool result= true ;bool unique_keys= true ;0 ]->val_json(&tmp_value);if ((null_value= args[0 ]->null_value))return 0 ;0 .0002 );const uchar*)js->ptr(),const uchar*)js->end());if (json_read_value(&je))goto js_error;switch (type_constraint)case JSON_VALUE_ANY:true ;break ;case JSON_ARRAY:break ;case JSON_OBJECT:break ;case JSON_SCALAR:break ;if (with_unique_keys &&if (je.value_type == JSON_VALUE_OBJECT)else // For arrays, use handle_nested_value which will iterate through elements if (je.s.error)goto js_error;else // verify JSON is well-formed while (json_scan_next(&je) == 0 ) {}if (je.s.error)goto js_error;return negated ? !(result && unique_keys) : (result && unique_keys);if (je.s.error != JE_KILLED)return negated;0 );true ;return 0 ;bool Item_func_is_json::fix_length_and_dec(THD *thd)sizeof (int ), NULL,0 ));if (Item_bool_func::fix_length_and_dec(thd))return TRUE ;return FALSE ;void Item_func_is_json::print(String *str, enum_query_type query_type)0 ]->print_parenthesised(str, query_type, precedence());if (negated)" IS NOT JSON" ));else " IS JSON" ));switch (type_constraint)case JSON_ARRAY:" ARRAY" ));break ;case JSON_OBJECT:" OBJECT" ));break ;case JSON_SCALAR:" SCALAR" ));break ;case JSON_VALUE_ANY:break ;if (with_unique_keys)" WITH UNIQUE KEYS" ));
Messung V0.5 in Prozent C=98 H=75 G=87
¤ Dauer der Verarbeitung: 0.597 Sekunden
(vorverarbeitet am 2026-10-08)
¤ *© Formatika GbR, Deutschland
