1
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
2
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
4
#ifndef XIDS_INTERNAL_H
5
#define XIDS_INTERNAL_H
9
COPYING CONDITIONS NOTICE:
11
This program is free software; you can redistribute it and/or modify
12
it under the terms of version 2 of the GNU General Public License as
13
published by the Free Software Foundation, and provided that the
14
following conditions are met:
16
* Redistributions of source code must retain this COPYING
17
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
18
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
19
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
22
* Redistributions in binary form must reproduce this COPYING
23
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
24
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
25
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
26
GRANT (below) in the documentation and/or other materials
27
provided with the distribution.
29
You should have received a copy of the GNU General Public License
30
along with this program; if not, write to the Free Software
31
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
36
TokuDB, Tokutek Fractal Tree Indexing Library.
37
Copyright (C) 2007-2013 Tokutek, Inc.
41
This program is distributed in the hope that it will be useful, but
42
WITHOUT ANY WARRANTY; without even the implied warranty of
43
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
44
General Public License for more details.
46
UNIVERSITY PATENT NOTICE:
48
The technology is licensed by the Massachusetts Institute of
49
Technology, Rutgers State University of New Jersey, and the Research
50
Foundation of State University of New York at Stony Brook under
51
United States of America Serial No. 11/760379 and to the patents
52
and/or patent applications resulting from it.
54
PATENT MARKING NOTICE:
56
This software is covered by US Patent No. 8,185,551.
57
This software is covered by US Patent No. 8,489,638.
61
"THIS IMPLEMENTATION" means the copyrightable works distributed by
62
Tokutek as part of the Fractal Tree project.
64
"PATENT CLAIMS" means the claims of patents that are owned or
65
licensable by Tokutek, both currently or in the future; and that in
66
the absence of this license would be infringed by THIS
67
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
69
"PATENT CHALLENGE" shall mean a challenge to the validity,
70
patentability, enforceability and/or non-infringement of any of the
71
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
73
Tokutek hereby grants to you, for the term and geographical scope of
74
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
75
irrevocable (except as stated in this section) patent license to
76
make, have made, use, offer to sell, sell, import, transfer, and
77
otherwise run, modify, and propagate the contents of THIS
78
IMPLEMENTATION, where such license applies only to the PATENT
79
CLAIMS. This grant does not include claims that would be infringed
80
only as a consequence of further modifications of THIS
81
IMPLEMENTATION. If you or your agent or licensee institute or order
82
or agree to the institution of patent litigation against any entity
83
(including a cross-claim or counterclaim in a lawsuit) alleging that
84
THIS IMPLEMENTATION constitutes direct or contributory patent
85
infringement, or inducement of patent infringement, then any rights
86
granted to you under this License shall terminate as of the date
87
such litigation is filed. If you or your agent or exclusive
88
licensee institute or order or agree to the institution of a PATENT
89
CHALLENGE, then Tokutek may terminate any rights granted to you
93
#ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved."
94
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
97
// Variable size list of transaction ids (known in design doc as xids<>).
98
// ids[0] is the outermost transaction.
99
// ids[num_xids - 1] is the innermost transaction.
100
// Should only be accessed by accessor functions xids_xxx, not directly.
102
// If the xids struct is unpacked, the compiler aligns the ids[] and we waste a lot of space
104
#pragma pack(push, 1)
107
typedef struct __attribute__((__packed__)) xids_t {
108
uint8_t num_xids; // maximum value of MAX_TRANSACTION_RECORDS - 1 ...
109
// ... because transaction 0 is implicit