← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

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

  • Committer: Lee Bieber
  • Date: 2010-11-14 23:15:42 UTC
  • mfrom: (1929.1.42 warning-stack-frame)
  • Revision ID: kalebral@gmail.com-20101114231542-fnnu6ydd2p17n582
Merge Monty - fix bug 672372: some functions use > 32k stack

Show diffs side-by-side

added added

removed removed

Lines of Context:
plugin/innobase/include/dict0mem.ic
1
1
/*****************************************************************************
2
2
 
3
 
Copyright (C) 1996, 2009, Innobase Oy. All Rights Reserved.
 
3
Copyright (c) 1996, 2009, Innobase Oy. All Rights Reserved.
4
4
 
5
5
This program is free software; you can redistribute it and/or modify it under
6
6
the terms of the GNU General Public License as published by the Free Software
23
23
Created 1/8/1996 Heikki Tuuri
24
24
***********************************************************************/
25
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
 
}
 
26