~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to plugin/innobase/include/dict0mem.ic

  • Committer: lbieber
  • Date: 2010-10-01 13:06:31 UTC
  • mfrom: (1802.2.2 drizzle-bug-651948)
  • mto: This revision was merged to the branch mainline in revision 1805.
  • Revision ID: lbieber@orisndriz08-20101001130631-xubscnhmj7r5dn6g
Merge Andrew - Fix bug 651948 - Index lengths not retrieved using drizzledump

Show diffs side-by-side

added added

removed removed

Lines of Context:
1
 
/*****************************************************************************
2
 
 
3
 
Copyright (C) 1996, 2009, Innobase Oy. All Rights Reserved.
4
 
 
5
 
This program is free software; you can redistribute it and/or modify it under
6
 
the terms of the GNU General Public License as published by the Free Software
7
 
Foundation; version 2 of the License.
8
 
 
9
 
This program is distributed in the hope that it will be useful, but WITHOUT
10
 
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
11
 
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
12
 
 
13
 
You should have received a copy of the GNU General Public License along with
14
 
this program; if not, write to the Free Software Foundation, Inc., 51 Franklin
15
 
St, Fifth Floor, Boston, MA 02110-1301 USA
16
 
 
17
 
*****************************************************************************/
18
 
 
19
 
/******************************************************************//**
20
 
@file include/dict0mem.ic
21
 
Data dictionary memory object creation
22
 
 
23
 
Created 1/8/1996 Heikki Tuuri
24
 
***********************************************************************/
25
 
 
26
 
#include "data0type.h"
27
 
#include "dict0mem.h"
28
 
#include "fil0fil.h"
29
 
 
30
 
/**********************************************************************//**
31
 
This function poplulates a dict_index_t index memory structure with
32
 
supplied information. */
33
 
UNIV_INLINE
34
 
void
35
 
dict_mem_fill_index_struct(
36
 
/*=======================*/
37
 
        dict_index_t*   index,          /*!< out: index to be filled */
38
 
        mem_heap_t*     heap,           /*!< in: memory heap */
39
 
        const char*     table_name,     /*!< in: table name */
40
 
        const char*     index_name,     /*!< in: index name */
41
 
        ulint           space,          /*!< in: space where the index tree is
42
 
                                        placed, ignored if the index is of
43
 
                                        the clustered type */
44
 
        ulint           type,           /*!< in: DICT_UNIQUE,
45
 
                                        DICT_CLUSTERED, ... ORed */
46
 
        ulint           n_fields)       /*!< in: number of fields */
47
 
{
48
 
 
49
 
        if (heap) {
50
 
                index->heap = heap;
51
 
                index->name = mem_heap_strdup(heap, index_name);
52
 
                index->fields = (dict_field_t*) mem_heap_alloc(
53
 
                        heap, 1 + n_fields * sizeof(dict_field_t));
54
 
        } else {
55
 
                index->name = index_name;
56
 
                index->heap = NULL;
57
 
                index->fields = NULL;
58
 
        }
59
 
 
60
 
        index->type = type;
61
 
#ifndef UNIV_HOTBACKUP
62
 
        index->space = (unsigned int) space;
63
 
        index->page = FIL_NULL;
64
 
#endif /* !UNIV_HOTBACKUP */
65
 
        index->table_name = table_name;
66
 
        index->n_fields = (unsigned int) n_fields;
67
 
        /* The '1 +' above prevents allocation
68
 
        of an empty mem block */
69
 
#ifdef UNIV_DEBUG
70
 
        index->magic_n = DICT_INDEX_MAGIC_N;
71
 
#endif /* UNIV_DEBUG */
72
 
}