Function json_normalize_sort

strings/json_normalize.c:354–431

The function is an iterative DFS, walks the entire json and sorts the key-value iteratively. Arrays are only traversed, only objects are sorted. */

  objects are sorted.
*/
static void json_normalize_sort(struct json_norm_value *root)
{
  DYNAMIC_ARRAY stack;
  struct json_norm_frame frame, child;
  struct json_norm_value *val;
  size_t i;

  if (json_norm_init_dynamic_array(sizeof(struct json_norm_frame), &stack))
    return;

  frame.val= root;
  frame.index= 0;
  frame.visited= UNPROCESSED;
  push_dynamic(&stack, &frame);

  do
  {
    frame= *(struct json_norm_frame *)pop_dynamic(&stack);
    val= frame.val;

    if (!val)
      continue;

    if (frame.visited > UNPROCESSED)
    {
      if (val->type == JSON_VALUE_OBJECT)
      {
        my_qsort(dynamic_element(&val->value.object.kv_pairs, 0,
                 struct json_norm_kv*), val->value.object.kv_pairs.elements,
                 sizeof(struct json_norm_kv), json_norm_kv_comp);
      }
      continue;
    }

    frame.visited= CLOSE_NON_SCALAR;
    push_dynamic(&stack, &frame);

    switch (val->type)
    {
      case JSON_VALUE_OBJECT:
      {
        DYNAMIC_ARRAY *pairs= &val->value.object.kv_pairs;
        for (i= pairs->elements; i > 0; i--)
        {
          struct json_norm_kv *kv=
                dynamic_element(pairs, i-1, struct json_norm_kv*);
          child.val= &kv->value;
          child.index= 0;
          child.visited= UNPROCESSED;
          push_dynamic(&stack, &child);
        }
        break;
      }

      case JSON_VALUE_ARRAY:
      {
        DYNAMIC_ARRAY *values= &val->value.array.values;
        for (i= values->elements; i > 0; i--)