1
/* Copyright (C) 2009 Canonical Ltd
3
* This program is free software; you can redistribute it and/or modify
4
* it under the terms of the GNU General Public License as published by
5
* the Free Software Foundation; either version 2 of the License, or
6
* (at your option) any later version.
8
* This program is distributed in the hope that it will be useful,
9
* but WITHOUT ANY WARRANTY; without even the implied warranty of
10
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11
* GNU General Public License for more details.
13
* You should have received a copy of the GNU General Public License
14
* along with this program; if not, write to the Free Software
15
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
18
#ifndef _STATIC_TUPLE_H_
19
#define _STATIC_TUPLE_H_
23
#define STATIC_TUPLE_HAS_HASH 0
24
/* Caching the hash adds memory, but allows us to save a little time during
25
* lookups. TIMEIT hash(key) shows it as
28
* Note that the entries themselves are strings, which already cache their
29
* hashes. So while there is a 1.5:1 difference in the time for hash(), it is
30
* already a function which is quite fast. Probably the only reason we might
31
* want to do so, is if we implement a KeyIntern dict that assumes it is
32
* available, and can then drop the 'hash' value from the item pointers. Then
33
* again, if Key_hash() is fast enough, we may not even care about that.
36
/* This defines a single variable-width key.
37
* It is basically the same as a tuple, but
38
* 1) Lighter weight in memory
39
* 2) Only supports strings.
40
* It is mostly used as a helper. Note that Keys() is a similar structure for
41
* lists of Key objects. Its main advantage, though, is that it inlines all of
42
* the Key objects so that you have 1 python object overhead for N Keys, rather
46
#define STATIC_TUPLE_INTERNED_FLAG 0x01
47
#define STATIC_TUPLE_ALL_STRING 0x02
48
#define STATIC_TUPLE_DID_HASH 0x04
53
unsigned char _unused0;
54
unsigned char _unused1;
55
// Note that on 64-bit, we actually have 4-more unused bytes
56
// because items will always be aligned to a 64-bit boundary
57
#if STATIC_TUPLE_HAS_HASH
62
extern PyTypeObject StaticTuple_Type;
69
#define StaticTuple_SET_ITEM(key, offset, val) \
70
((((StaticTuple*)(key))->items[(offset)]) = ((PyObject *)(val)))
71
#define StaticTuple_GET_ITEM(key, offset) (((StaticTuple*)key)->items[offset])
74
#ifdef STATIC_TUPLE_MODULE
75
/* Used when compiling _static_tuple_c.c */
77
static StaticTuple * StaticTuple_New(Py_ssize_t);
78
static StaticTuple * StaticTuple_Intern(StaticTuple *self);
79
#define StaticTuple_CheckExact(op) (Py_TYPE(op) == &StaticTuple_Type)
82
/* Used as the foreign api */
84
#include "_import_c_api.h"
86
static StaticTuple *(*StaticTuple_New)(Py_ssize_t);
87
static StaticTuple *(*StaticTuple_Intern)(StaticTuple *);
88
static PyTypeObject *_p_StaticTuple_Type;
90
#define StaticTuple_CheckExact(op) (Py_TYPE(op) == _p_StaticTuple_Type)
91
static int (*_StaticTuple_CheckExact)(PyObject *);
94
/* Return -1 and set exception on error, 0 on success */
96
import_static_tuple_c(void)
98
struct function_description functions[] = {
99
{"StaticTuple_New", (void **)&StaticTuple_New,
100
"StaticTuple *(Py_ssize_t)"},
101
{"StaticTuple_Intern", (void **)&StaticTuple_Intern,
102
"StaticTuple *(StaticTuple *)"},
103
{"_StaticTuple_CheckExact", (void **)&_StaticTuple_CheckExact,
106
struct type_description types[] = {
107
{"StaticTuple", &_p_StaticTuple_Type},
109
return _import_extension_module("bzrlib._static_tuple_c",
113
#endif // !STATIC_TUPLE_MODULE
114
#endif // !_STATIC_TUPLE_H_