Function handle_match

strings/json_lib.c:1420–1501

Current step of the patch matches the JSON construction. Now we should either stop the search or go to the next step of the path. */

  step of the path.
*/
static int handle_match(json_engine_t *je, json_path_t *p,
                        json_path_step_t **p_cur_step,
                        MEM_ROOT_DYNAMIC_ARRAY *array_counters)
{
  json_path_step_t *initial_step=
                      (json_path_step_t*)(p->steps.buffer),
                   *next_step= NULL,
                   *last_step=
                       (json_path_step_t*)(p->steps.buffer) + p->last_step_idx;
  int value= 0;
  size_t idx= 0;

  idx= *p_cur_step - initial_step;
  next_step=
         (json_path_step_t*)(p->steps.buffer)+(idx+1);

  DBUG_ASSERT(*p_cur_step < last_step);

  if (json_read_value(je))
    return 1;

  if (json_value_scalar(je))
  {
    while (next_step->type == JSON_PATH_ARRAY && next_step->n_item == 0)
    {
      next_step++;
      if (next_step > last_step)
      {
        je->s.c_str= je->value_begin;
        return 1;
      }
    }
    return 0;
  }

  if (next_step->type == JSON_PATH_ARRAY && next_step->n_item == 0 &&
      je->value_type & JSON_VALUE_OBJECT)
  {
    do
    {
      int val= SKIPPED_STEP_MARK;
      int idx= (int)(next_step-initial_step);

      set_json_array_value_ptr(idx, array_counters->max_element, array_counters, val);

      next_step++;
      if (next_step > last_step)
      {
        je->s.c_str= je->value_begin;
        je->stack_p--;
        return 1;
      }
    } while (next_step->type == JSON_PATH_ARRAY && next_step->n_item == 0);
  }

  if ((int) je->value_type !=
      (int) (next_step->type & JSON_PATH_KEY_OR_ARRAY))
    return json_skip_level(je);