test-example-projects/c++_projects/280w-mysql-8.0.18/sql/sql_help.cc

/* Copyright (c) 2002, 2019, Oracle and/or its affiliates. All rights reserved.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License, version 2.0,
   as published by the Free Software Foundation.

   This program is also distributed with certain software (including
   but not limited to OpenSSL) that is licensed under separate terms,
   as designated in a particular file or component or in included license
   documentation.  The authors of MySQL hereby grant you an additional
   permission to link the program and your derivative works with the
   separately licensed software that they have included with MySQL.

   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, version 2.0, 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
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301  USA */

#include "sql/sql_help.h"

#include <string.h>
#include <sys/types.h>
#include <algorithm>
#include <atomic>
#include <memory>

#include "m_ctype.h"
#include "m_string.h"
#include "my_alloc.h"
#include "my_base.h"
#include "my_bitmap.h"
#include "my_dbug.h"
#include "my_inttypes.h"
#include "my_macros.h"
#include "my_sys.h"
#include "mysqld_error.h"
#include "sql/debug_sync.h"
#include "sql/field.h"
#include "sql/handler.h"
#include "sql/item.h"
#include "sql/item_cmpfunc.h"  // Item_func_like
#include "sql/key_spec.h"
#include "sql/opt_range.h"  // SQL_SELECT
#include "sql/opt_trace.h"  // Opt_trace_object
#include "sql/protocol.h"
#include "sql/records.h"  // init_table_iterator
#include "sql/row_iterator.h"
#include "sql/sql_base.h"  // REPORT_ALL_ERRORS
#include "sql/sql_bitmap.h"
#include "sql/sql_class.h"
#include "sql/sql_executor.h"  // QEP_TAB
#include "sql/sql_lex.h"
#include "sql/sql_list.h"
#include "sql/sql_table.h"  // primary_key_name
#include "sql/table.h"
#include "sql_string.h"
#include "thr_lock.h"
#include "typelib.h"

struct st_find_field {
  const char *table_name, *field_name;
  Field *field;
};

/* Used fields */

static struct st_find_field init_used_fields[] = {
    {"help_topic", "help_topic_id", 0},
    {"help_topic", "name", 0},
    {"help_topic", "help_category_id", 0},
    {"help_topic", "description", 0},
    {"help_topic", "example", 0},

    {"help_category", "help_category_id", 0},
    {"help_category", "parent_category_id", 0},
    {"help_category", "name", 0},

    {"help_keyword", "help_keyword_id", 0},
    {"help_keyword", "name", 0},

    {"help_relation", "help_topic_id", 0},
    {"help_relation", "help_keyword_id", 0}};

enum enum_used_fields {
  help_topic_help_topic_id = 0,
  help_topic_name,
  help_topic_help_category_id,
  help_topic_description,
  help_topic_example,

  help_category_help_category_id,
  help_category_parent_category_id,
  help_category_name,

  help_keyword_help_keyword_id,
  help_keyword_name,

  help_relation_help_topic_id,
  help_relation_help_keyword_id
};

/*
  Fill st_find_field structure with pointers to fields

  SYNOPSIS
    init_fields()
    thd          Thread handler
    tables       list of all tables for fields
    find_fields  array of structures
    count        size of previous array

  RETURN VALUES
    0           all ok
    1           one of the fileds was not found
*/

static bool init_fields(THD *thd, TABLE_LIST *tables,
                        struct st_find_field *find_fields, uint count) {
  Name_resolution_context *context = &thd->lex->select_lex->context;
  DBUG_TRACE;
  context->resolve_in_table_list_only(tables);
  for (; count--; find_fields++) {
    /* We have to use 'new' here as field will be re_linked on free */
    Item_field *field = new Item_field(
        context, "mysql", find_fields->table_name, find_fields->field_name);
    if (!(find_fields->field = find_field_in_tables(thd, field, tables, NULL, 0,
                                                    REPORT_ALL_ERRORS,
                                                    false,  // No priv checking
                                                    true)))
      return 1;
    find_fields->field->table->pos_in_table_list->select_lex =
        thd->lex->select_lex;
    bitmap_set_bit(find_fields->field->table->read_set,
                   find_fields->field->field_index);
    /* To make life easier when setting values in keys */
    bitmap_set_bit(find_fields->field->table->write_set,
                   find_fields->field->field_index);
  }
  return 0;
}

/*
  Returns variants of found topic for help (if it is just single topic,
    returns description and example, or else returns only names..)

  SYNOPSIS
    memorize_variant_topic()

    thd           Thread handler
    count         number of alredy found topics
    find_fields   Filled array of information for work with fields

  RETURN VALUES
    names         array of names of found topics (out)

    name          name of found topic (out)
    description   description of found topic (out)
    example       example for found topic (out)

  NOTE
    Field 'names' is set only if more than one topic is found.
    Fields 'name', 'description', 'example' are set only if
    found exactly one topic.
*/

static void memorize_variant_topic(THD *thd, int count,
                                   struct st_find_field *find_fields,
                                   List<String> *names, String *name,
                                   String *description, String *example) {
  DBUG_TRACE;
  MEM_ROOT *mem_root = thd->mem_root;
  if (count == 0) {
    get_field(mem_root, find_fields[help_topic_name].field, name);
    get_field(mem_root, find_fields[help_topic_description].field, description);
    get_field(mem_root, find_fields[help_topic_example].field, example);
  } else {
    if (count == 1) names->push_back(name);
    String *new_name = new (thd->mem_root) String;
    get_field(mem_root, find_fields[help_topic_name].field, new_name);
    names->push_back(new_name);
  }
}

/*
  Look for topics by mask

  SYNOPSIS
    search_topics()
    thd 	 Thread handler
    topics	 Table of topics
    find_fields  Filled array of info for fields
    select	 Function to test for matching help topic.
                 Normally 'help_topic.name like 'bit%'

  RETURN VALUES
    #   number of topics found

    names        array of names of found topics (out)
    name         name of found topic (out)
    description  description of found topic (out)
    example      example for found topic (out)

  NOTE
    Field 'names' is set only if more than one topic was found.
    Fields 'name', 'description', 'example' are set only if
    exactly one topic was found.

*/

static int search_topics(THD *thd, QEP_TAB *topics,
                         struct st_find_field *find_fields, List<String> *names,
                         String *name, String *description, String *example) {
  int count = 0;
  DBUG_TRACE;

  unique_ptr_destroy_only<RowIterator> iterator =
      init_table_iterator(thd, NULL, topics, false,
                          /*ignore_not_found_rows=*/false);
  if (iterator == nullptr) return 0;

  while (!iterator->Read()) {
    if (!topics->condition()->val_int())  // Doesn't match like
      continue;
    memorize_variant_topic(thd, count, find_fields, names, name, description,
                           example);
    count++;
  }
  return count;
}

/*
  Look for keyword by mask

  SYNOPSIS
    search_keyword()
    thd          Thread handler
    keywords     Table of keywords
    find_fields  Filled array of info for fields
    select       Function to test for matching keyword.
                 Normally 'help_keyword.name like 'bit%'

    key_id       help_keyword_if of found topics (out)

  RETURN VALUES
    0   didn't find any topics matching the mask
    1   found exactly one topic matching the mask
    2   found more then one topic matching the mask
*/

static int search_keyword(THD *thd, QEP_TAB *keywords,
                          struct st_find_field *find_fields, int *key_id) {
  int count = 0;
  DBUG_TRACE;

  unique_ptr_destroy_only<RowIterator> iterator =
      init_table_iterator(thd, NULL, keywords, false,
                          /*ignore_not_found_rows=*/false);
  if (iterator == nullptr) return 0;

  while (!iterator->Read() && count < 2) {
    if (!keywords->condition()->val_int())  // Dosn't match like
      continue;

    *key_id = (int)find_fields[help_keyword_help_keyword_id].field->val_int();

    count++;
  }
  return count;
}

/*
  Look for all topics with keyword

  SYNOPSIS
    get_topics_for_keyword()
    thd		 Thread handler
    topics	 Table of topics
    relations	 Table of m:m relation "topic/keyword"
    find_fields  Filled array of info for fields
    key_id	 Primary index to use to find for keyword

  RETURN VALUES
    #   number of topics found

    names        array of name of found topics (out)

    name         name of found topic (out)
    description  description of found topic (out)
    example      example for found topic (out)

  NOTE
    Field 'names' is set only if more than one topic was found.
    Fields 'name', 'description', 'example' are set only if
    exactly one topic was found.
*/

static int get_topics_for_keyword(THD *thd, TABLE *topics, TABLE *relations,
                                  struct st_find_field *find_fields,
                                  int16 key_id, List<String> *names,
                                  String *name, String *description,
                                  String *example) {
  uchar buff[8];  // Max int length
  int count = 0;
  int iindex_topic, iindex_relations;
  Field *rtopic_id, *rkey_id;
  DBUG_TRACE;

  if ((iindex_topic = find_type(primary_key_name, &topics->s->keynames,
                                FIND_TYPE_NO_PREFIX) -
                      1) < 0 ||
      (iindex_relations = find_type(primary_key_name, &relations->s->keynames,
                                    FIND_TYPE_NO_PREFIX) -
                          1) < 0) {
    my_error(ER_CORRUPT_HELP_DB, MYF(0));
    return -1;
  }
  rtopic_id = find_fields[help_relation_help_topic_id].field;
  rkey_id = find_fields[help_relation_help_keyword_id].field;

  if (topics->file->ha_index_init(iindex_topic, 1) ||
      relations->file->ha_index_init(iindex_relations, 1)) {
    if (topics->file->inited) topics->file->ha_index_end();
    my_error(ER_CORRUPT_HELP_DB, MYF(0));
    return -1;
  }

  rkey_id->store((longlong)key_id, true);
  rkey_id->get_key_image(buff, rkey_id->pack_length(), Field::itRAW);
  int key_res = relations->file->ha_index_read_map(
      relations->record[0], buff, (key_part_map)1, HA_READ_KEY_EXACT);

  for (; !key_res && key_id == (int16)rkey_id->val_int();
       key_res = relations->file->ha_index_next(relations->record[0])) {
    uchar topic_id_buff[8];
    longlong topic_id = rtopic_id->val_int();
    Field *field = find_fields[help_topic_help_topic_id].field;
    field->store(topic_id, true);
    field->get_key_image(topic_id_buff, field->pack_length(), Field::itRAW);

    if (!topics->file->ha_index_read_map(topics->record[0], topic_id_buff,
                                         (key_part_map)1, HA_READ_KEY_EXACT)) {
      memorize_variant_topic(thd, count, find_fields, names, name, description,
                             example);
      count++;
    }
  }
  topics->file->ha_index_end();
  relations->file->ha_index_end();
  return count;
}

/**
  Look for categories by mask.

  @param thd          THD for init_table_iterator
  @param categories   Table of categories
  @param find_fields  Filled array of info for fields
  @param names        List of found categories names (out)
  @param res_id	      Primary index of found category
                        (only if found exactly one category)

  @return             Number of categories found
 */
static int search_categories(THD *thd, QEP_TAB *categories,
                             struct st_find_field *find_fields,
                             List<String> *names, int16 *res_id) {
  Field *pfname = find_fields[help_category_name].field;
  Field *pcat_id = find_fields[help_category_help_category_id].field;
  int count = 0;

  DBUG_TRACE;

  unique_ptr_destroy_only<RowIterator> iterator =
      init_table_iterator(thd, NULL, categories, false,
                          /*ignore_not_found_rows=*/false);
  if (iterator == nullptr) return 0;

  while (!iterator->Read()) {
    if (categories->condition() && !categories->condition()->val_int())
      continue;
    String *lname = new (thd->mem_root) String;
    get_field(thd->mem_root, pfname, lname);
    if (++count == 1 && res_id) *res_id = (int16)pcat_id->val_int();
    names->push_back(lname);
  }
  return count;
}

/*
  Look for all topics or subcategories of category

  SYNOPSIS
    get_all_items_for_category()
    thd	    Thread handler
    items   Table of items
    pfname  Field "name" in items
    select  "where" part of query..
    res     list of finded names
*/

static void get_all_items_for_category(THD *thd, QEP_TAB *items, Field *pfname,
                                       List<String> *res) {
  DBUG_TRACE;

  unique_ptr_destroy_only<RowIterator> iterator =
      init_table_iterator(thd, NULL, items, false,
                          /*ignore_not_found_rows=*/false);
  if (iterator == nullptr) return;
  while (!iterator->Read()) {
    if (!items->condition()->val_int()) continue;
    String *name = new (thd->mem_root) String();
    get_field(thd->mem_root, pfname, name);
    res->push_back(name);
  }
}

/*
  Send to client answer for help request

  SYNOPSIS
    send_answer_1()
    thd      - THD to get the current protocol from and call
  send_result_metadata protocol - protocol for sending s1 - value of column
  "Name" s2 - value of column "Description" s3 - value of column "Example"

  IMPLEMENTATION
   Format used:
   +----------+------------+------------+
   |name      |description |example     |
   +----------+------------+------------+
   |String(64)|String(1000)|String(1000)|
   +----------+------------+------------+
   with exactly one row!

  RETURN VALUES
    1		Writing of head failed
    -1		Writing of row failed
    0		Successeful send
*/

static int send_answer_1(THD *thd, String *s1, String *s2, String *s3) {
  DBUG_TRACE;
  List<Item> field_list;
  field_list.push_back(new Item_empty_string("name", 64));
  field_list.push_back(new Item_empty_string("description", 1000));
  field_list.push_back(new Item_empty_string("example", 1000));

  if (thd->send_result_metadata(&field_list,
                                Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF))
    return 1;

  thd->get_protocol()->start_row();
  thd->get_protocol()->store(s1);
  thd->get_protocol()->store(s2);
  thd->get_protocol()->store(s3);
  if (thd->get_protocol()->end_row()) return -1;
  return 0;
}

/*
  Send to client help header

  SYNOPSIS
   send_header_2()
    thd            - thread to get the current status from
    is_it_category - need column 'source_category_name'

  IMPLEMENTATION
   +-                    -+
   |+-------------------- | +----------+--------------+
   ||source_category_name | |name      |is_it_category|
   |+-------------------- | +----------+--------------+
   ||String(64)           | |String(64)|String(1)     |
   |+-------------------- | +----------+--------------+
   +-                    -+

  RETURN VALUES
    result of protocol->send_result_set_metadata
*/

static int send_header_2(THD *thd, bool for_category) {
  DBUG_TRACE;
  List<Item> field_list;
  if (for_category)
    field_list.push_back(new Item_empty_string("source_category_name", 64));
  field_list.push_back(new Item_empty_string("name", 64));
  field_list.push_back(new Item_empty_string("is_it_category", 1));
  return thd->send_result_metadata(
      &field_list, Protocol::SEND_NUM_ROWS | Protocol::SEND_EOF);
}

/*
  strcmp for using in qsort

  SYNOPSIS
    strptrcmp()
    ptr1   (const void*)&str1
    ptr2   (const void*)&str2

  RETURN VALUES
    same as strcmp
*/

/*
  Send to client rows in format:
   column1 : <name>
   column2 : <is_it_category>

  SYNOPSIS
    send_variant_2_list()
    protocol     Protocol for sending
    names        List of names
    cat	         Value of the column <is_it_category>
    source_name  name of category for all items..

  RETURN VALUES
    -1 	Writing fail
    0	Data was successefully send
*/

static int send_variant_2_list(MEM_ROOT *mem_root, Protocol *protocol,
                               List<String> *names, const char *cat,
                               String *source_name) {
  DBUG_TRACE;

  String **pointers =
      (String **)mem_root->Alloc(sizeof(String *) * names->elements);
  String **pos;
  String **end = pointers + names->elements;

  List_iterator<String> it(*names);
  for (pos = pointers; pos != end; (*pos++ = it++))
    ;

  std::sort(pointers, pointers + names->elements,
            [](String *str1, String *str2) {
              return strcmp(str1->c_ptr(), str2->c_ptr()) < 0;
            });

  for (pos = pointers; pos != end; pos++) {
    protocol->start_row();
    if (source_name) protocol->store(source_name);
    protocol->store(*pos);
    protocol->store_string(cat, 1, &my_charset_latin1);
    if (protocol->end_row()) return -1;
  }

  return 0;
}

/**
  Prepare access method to do "SELECT * FROM table WHERE <cond>"

  @param thd      Thread handler
  @param cond     WHERE part of select
  @param table    goal table
  @param tab      QEP_TAB

  @returns true if error

  @note Side-effects: 'table', 'cond' and possibly a 'quick' are assigned to
  'tab'
*/

static bool prepare_simple_select(THD *thd, Item *cond, TABLE *table,
                                  QEP_TAB *tab) {
  if (!cond->fixed) cond->fix_fields(thd, &cond);  // can never fail

  // Initialize the cost model that will be used for this table
  table->init_cost_model(thd->cost_model());

  /* Assume that no indexes cover all required fields */
  table->covering_keys.clear_all();

  tab->set_table(table);
  tab->set_condition(cond);

  // Wrapper for correct JSON in optimizer trace
  Opt_trace_object wrapper(&thd->opt_trace);
  Key_map keys_to_use(Key_map::ALL_BITS), needed_reg_dummy;
  QUICK_SELECT_I *qck;
  const bool impossible =
      test_quick_select(thd, keys_to_use, 0, HA_POS_ERROR, false,
                        ORDER_NOT_RELEVANT, tab, cond, &needed_reg_dummy, &qck,
                        tab->table()->force_index) < 0;
  tab->set_quick(qck);

  return impossible || (tab->quick() && tab->quick()->reset());
}

/**
  Prepare access method to do "SELECT * FROM table LIKE mask"

  @param  thd      Thread handler
  @param  mask     mask for compare with name
  @param  mlen     length of mask
  @param  table    goal table
  @param  pfname   field "name" in table
  @param  tab      QEP_TAB

  @returns true if error
  @see prepare_simple_select()
*/

static bool prepare_select_for_name(THD *thd, const char *mask, size_t mlen,
                                    TABLE *table, Field *pfname, QEP_TAB *tab) {
  Item *cond = new Item_func_like(
      new Item_field(pfname), new Item_string(mask, mlen, pfname->charset()),
      new Item_string("\\", 1, &my_charset_latin1), false);
  if (thd->is_fatal_error()) return true; /* purecov: inspected */
  return prepare_simple_select(thd, cond, table, tab);
}

/*
  Server-side function 'help'

  SYNOPSIS
    mysqld_help()
    thd			Thread handler

  RETURN VALUES
    false Success
    true  Error and send_error already commited
*/

bool mysqld_help(THD *thd, const char *mask) {
  Protocol *protocol = thd->get_protocol();
  st_find_field used_fields[array_elements(init_used_fields)];
  List<String> topics_list, categories_list, subcategories_list;
  String name, description, example;
  int count_topics, count_categories;
  size_t mlen = strlen(mask);
  size_t i;
  MEM_ROOT *mem_root = thd->mem_root;
  SELECT_LEX *const select_lex = thd->lex->select_lex;
  DBUG_TRACE;

  TABLE_LIST tables[4] = {TABLE_LIST("mysql", "help_topic", TL_READ),
                          TABLE_LIST("mysql", "help_category", TL_READ),
                          TABLE_LIST("mysql", "help_relation", TL_READ),
                          TABLE_LIST("mysql", "help_keyword", TL_READ)};

  tables[0].next_global = tables[0].next_local =
      tables[0].next_name_resolution_table = &tables[1];
  tables[1].next_global = tables[1].next_local =
      tables[1].next_name_resolution_table = &tables[2];
  tables[2].next_global = tables[2].next_local =
      tables[2].next_name_resolution_table = &tables[3];

  /*
    HELP must be available under LOCK TABLES.
  */
  if (open_trans_system_tables_for_read(thd, tables)) goto error2;

  /*
    Init tables and fields to be usable from items
    tables do not contain VIEWs => we can pass 0 as conds
  */
  select_lex->context.table_list =
      select_lex->context.first_name_resolution_table = &tables[0];
  if (select_lex->setup_tables(thd, tables, false)) goto error;
  memcpy((char *)used_fields, (char *)init_used_fields, sizeof(used_fields));
  if (init_fields(thd, tables, used_fields, array_elements(used_fields)))
    goto error;
  for (i = 0; i < sizeof(tables) / sizeof(TABLE_LIST); i++)
    tables[i].table->file->init_table_handle_for_HANDLER();

  {
    QEP_TAB_standalone qep_tab_st;
    QEP_TAB &tab = qep_tab_st.as_QEP_TAB();
    if (prepare_select_for_name(thd, mask, mlen, tables[0].table,
                                used_fields[help_topic_name].field, &tab))
      goto error;

    count_topics = search_topics(thd, &tab, used_fields, &topics_list, &name,
                                 &description, &example);
  }

  if (count_topics == 0) {
    int key_id = 0;
    QEP_TAB_standalone qep_tab_st;
    QEP_TAB &tab = qep_tab_st.as_QEP_TAB();

    if (prepare_select_for_name(thd, mask, mlen, tables[3].table,
                                used_fields[help_keyword_name].field, &tab))
      goto error;

    count_topics = search_keyword(thd, &tab, used_fields, &key_id);
    count_topics =
        (count_topics != 1)
            ? 0
            : get_topics_for_keyword(thd, tables[0].table, tables[2].table,
                                     used_fields, key_id, &topics_list, &name,
                                     &description, &example);
  }

  if (count_topics == 0) {
    int16 category_id;
    Field *cat_cat_id = used_fields[help_category_parent_category_id].field;
    {
      QEP_TAB_standalone qep_tab_st;
      QEP_TAB &tab = qep_tab_st.as_QEP_TAB();

      if (prepare_select_for_name(thd, mask, mlen, tables[1].table,
                                  used_fields[help_category_name].field, &tab))
        goto error;

      DEBUG_SYNC(thd, "before_help_record_read");

      count_categories = search_categories(thd, &tab, used_fields,
                                           &categories_list, &category_id);
    }
    if (!count_categories) {
      if (send_header_2(thd, false)) goto error;
    } else if (count_categories > 1) {
      if (send_header_2(thd, false) ||
          send_variant_2_list(mem_root, protocol, &categories_list, "Y", 0))
        goto error;
    } else {
      Field *topic_cat_id = used_fields[help_topic_help_category_id].field;
      Item *cond_topic_by_cat = new Item_func_equal(
          new Item_field(topic_cat_id), new Item_int((int32)category_id));
      Item *cond_cat_by_cat = new Item_func_equal(
          new Item_field(cat_cat_id), new Item_int((int32)category_id));

      {
        QEP_TAB_standalone qep_tab_st;
        QEP_TAB &tab = qep_tab_st.as_QEP_TAB();

        if (prepare_simple_select(thd, cond_topic_by_cat, tables[0].table,
                                  &tab))
          goto error;
        get_all_items_for_category(
            thd, &tab, used_fields[help_topic_name].field, &topics_list);
      }
      {
        QEP_TAB_standalone qep_tab_st;
        QEP_TAB &tab = qep_tab_st.as_QEP_TAB();

        if (prepare_simple_select(thd, cond_cat_by_cat, tables[1].table, &tab))
          goto error;
        get_all_items_for_category(thd, &tab,
                                   used_fields[help_category_name].field,
                                   &subcategories_list);
      }
      String *cat = categories_list.head();
      if (send_header_2(thd, true) ||
          send_variant_2_list(mem_root, protocol, &topics_list, "N", cat) ||
          send_variant_2_list(mem_root, protocol, &subcategories_list, "Y",
                              cat))
        goto error;
    }
  } else if (count_topics == 1) {
    if (send_answer_1(thd, &name, &description, &example)) goto error;
  } else {
    /* First send header and functions */
    if (send_header_2(thd, false) ||
        send_variant_2_list(mem_root, protocol, &topics_list, "N", 0))
      goto error;

    QEP_TAB_standalone qep_tab_st;
    QEP_TAB &tab = qep_tab_st.as_QEP_TAB();

    if (prepare_select_for_name(thd, mask, mlen, tables[1].table,
                                used_fields[help_category_name].field, &tab))
      goto error;
    search_categories(thd, &tab, used_fields, &categories_list, 0);
    /* Then send categories */
    if (send_variant_2_list(mem_root, protocol, &categories_list, "Y", 0))
      goto error;
  }

  if (thd->killed) goto error;

  my_eof(thd);

  close_trans_system_tables(thd);
  return false;

error:
  close_trans_system_tables(thd);

error2:
  return true;
}