dict0crea.h

Go to the documentation of this file.

/*****************************************************************************

Copyright (c) 1996, 2014, 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 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 Foundation, Inc.,
51 Franklin Street, Suite 500, Boston, MA 02110-1335 USA

*****************************************************************************/

/**************************************************/
#ifndef dict0crea_h
#define dict0crea_h

#include "univ.i"
#include "dict0types.h"
#include "dict0dict.h"
#include "que0types.h"
#include "row0types.h"
#include "mtr0mtr.h"

/*********************************************************************/
UNIV_INTERN
tab_node_t*
tab_create_graph_create(
/*====================*/
        dict_table_t*   table,  
        mem_heap_t*     heap,   
        bool            commit);
/*********************************************************************/
UNIV_INTERN
ind_node_t*
ind_create_graph_create(
/*====================*/
        dict_index_t*   index,  
        mem_heap_t*     heap,   
        bool            commit);
/***********************************************************/
UNIV_INTERN
que_thr_t*
dict_create_table_step(
/*===================*/
        que_thr_t*      thr);   
/***********************************************************/
UNIV_INTERN
que_thr_t*
dict_create_index_step(
/*===================*/
        que_thr_t*      thr);   
/*******************************************************************/
UNIV_INTERN
ulint
dict_truncate_index_tree(
/*=====================*/
        dict_table_t*   table,  
        ulint           space,  
        btr_pcur_t*     pcur,   
        mtr_t*          mtr);   
/*******************************************************************/
UNIV_INTERN
void
dict_drop_index_tree(
/*=================*/
        rec_t*  rec,    
        mtr_t*  mtr);   
/****************************************************************/
UNIV_INTERN
dberr_t
dict_create_or_check_foreign_constraint_tables(void);
/*================================================*/
/********************************************************************/
UNIV_INLINE
dberr_t
dict_create_add_foreign_id(
/*=======================*/
        ulint*          id_nr,  
        const char*     name,   
        dict_foreign_t* foreign)
        __attribute__((nonnull));

UNIV_INTERN
dberr_t
dict_create_add_foreigns_to_dictionary(
/*===================================*/
        const dict_foreign_set& local_fk_set,
        const dict_table_t*     table,
        trx_t*                  trx)
        __attribute__((nonnull, warn_unused_result));
/****************************************************************/
UNIV_INTERN
dberr_t
dict_create_or_check_sys_tablespace(void);
/*=====================================*/
/********************************************************************/
UNIV_INTERN
dberr_t
dict_create_add_tablespace_to_dictionary(
/*=====================================*/
        ulint           space,          
        const char*     name,           
        ulint           flags,          
        const char*     path,           
        trx_t*          trx,            
        bool            commit);        
/********************************************************************/
UNIV_INTERN
dberr_t
dict_create_add_foreign_to_dictionary(
/*==================================*/
        const char*             name,   
        const dict_foreign_t*   foreign,
        trx_t*                  trx)    
        __attribute__((nonnull, warn_unused_result));

/* Table create node structure */
struct tab_node_t{
        que_common_t    common; 
        dict_table_t*   table;  
        ins_node_t*     tab_def; /* child node which does the insert of
                                the table definition; the row to be inserted
                                is built by the parent node  */
        ins_node_t*     col_def; /* child node which does the inserts of
                                the column definitions; the row to be inserted
                                is built by the parent node  */
        commit_node_t*  commit_node;
                                /* child node which performs a commit after
                                a successful table creation */
        /*----------------------*/
        /* Local storage for this graph node */
        ulint           state;  
        ulint           col_no; 
        mem_heap_t*     heap;   
};

/* Table create node states */
#define TABLE_BUILD_TABLE_DEF   1
#define TABLE_BUILD_COL_DEF     2
#define TABLE_COMMIT_WORK       3
#define TABLE_ADD_TO_CACHE      4
#define TABLE_COMPLETED         5

/* Index create node struct */

struct ind_node_t{
        que_common_t    common; 
        dict_index_t*   index;  
        ins_node_t*     ind_def; /* child node which does the insert of
                                the index definition; the row to be inserted
                                is built by the parent node  */
        ins_node_t*     field_def; /* child node which does the inserts of
                                the field definitions; the row to be inserted
                                is built by the parent node  */
        commit_node_t*  commit_node;
                                /* child node which performs a commit after
                                a successful index creation */
        /*----------------------*/
        /* Local storage for this graph node */
        ulint           state;  
        ulint           page_no;/* root page number of the index */
        dict_table_t*   table;  
        dtuple_t*       ind_row;/* index definition row built */
        ulint           field_no;/* next field definition to insert */
        mem_heap_t*     heap;   
};

/* Index create node states */
#define INDEX_BUILD_INDEX_DEF   1
#define INDEX_BUILD_FIELD_DEF   2
#define INDEX_CREATE_INDEX_TREE 3
#define INDEX_COMMIT_WORK       4
#define INDEX_ADD_TO_CACHE      5

#ifndef UNIV_NONINL
#include "dict0crea.ic"
#endif

#endif