~bzr-pqm/bzr/bzr.dev

3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
1
# Copyright (C) 2008 Canonical Ltd
2
#
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.
7
#
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.
12
#
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
4183.7.1 by Sabin Iacob
update FSF mailing address
15
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
3641.3.29 by John Arbash Meinel
Cleanup the copyright headers
16
#
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
17
18
"""Pyrex extensions to btree node parsing."""
19
3731.1.1 by Robert Collins
* The C extensions now build on python 2.4 (Robert Collins, #271939)
20
#python2.4 support
21
cdef extern from "python-compat.h":
22
    pass
23
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
24
cdef extern from "stdlib.h":
25
    ctypedef unsigned size_t
26
27
cdef extern from "Python.h":
3641.3.32 by John Arbash Meinel
PQM's pyrex version requires Py_ssize_t to be manually defined
28
    ctypedef int Py_ssize_t # Required for older pyrex versions
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
29
    ctypedef struct PyObject:
30
        pass
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
31
    int PyList_Append(object lst, object item) except -1
32
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
33
    char *PyString_AsString(object p) except NULL
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
34
    object PyString_FromStringAndSize(char *, Py_ssize_t)
4075.3.1 by John Arbash Meinel
Use PyString_InternInPlace to intern() the various parts of keys that are processed.
35
    PyObject *PyString_FromStringAndSize_ptr "PyString_FromStringAndSize" (char *, Py_ssize_t)
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
36
    int PyString_CheckExact(object s)
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
37
    int PyString_CheckExact_ptr "PyString_CheckExact" (PyObject *)
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
38
    Py_ssize_t PyString_Size(object p)
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
39
    Py_ssize_t PyString_GET_SIZE_ptr "PyString_GET_SIZE" (PyObject *)
40
    char * PyString_AS_STRING_ptr "PyString_AS_STRING" (PyObject *)
41
    int PyString_AsStringAndSize_ptr(PyObject *, char **buf, Py_ssize_t *len)
4075.3.1 by John Arbash Meinel
Use PyString_InternInPlace to intern() the various parts of keys that are processed.
42
    void PyString_InternInPlace(PyObject **)
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
43
    int PyTuple_CheckExact(object t)
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
44
    Py_ssize_t PyTuple_GET_SIZE(object t)
45
    PyObject *PyTuple_GET_ITEM_ptr_object "PyTuple_GET_ITEM" (object tpl, int index)
4075.3.1 by John Arbash Meinel
Use PyString_InternInPlace to intern() the various parts of keys that are processed.
46
    void Py_DECREF_ptr "Py_DECREF" (PyObject *)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
47
48
cdef extern from "string.h":
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
49
    void *memcpy(void *dest, void *src, size_t n)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
50
    void *memchr(void *s, int c, size_t n)
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
51
    # GNU extension
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
52
    # void *memrchr(void *s, int c, size_t n)
53
    int strncmp(char *s1, char *s2, size_t n)
54
55
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
56
# TODO: Find some way to import this from _dirstate_helpers
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
57
cdef void* _my_memrchr(void *s, int c, size_t n):
58
    # memrchr seems to be a GNU extension, so we have to implement it ourselves
59
    # It is not present in any win32 standard library
60
    cdef char *pos
61
    cdef char *start
62
63
    start = <char*>s
64
    pos = start + n - 1
65
    while pos >= start:
66
        if pos[0] == c:
67
            return <void*>pos
68
        pos = pos - 1
69
    return NULL
70
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
71
# TODO: Import this from _dirstate_helpers when it is merged
72
cdef object safe_string_from_size(char *s, Py_ssize_t size):
73
    if size < 0:
74
        raise AssertionError(
75
            'tried to create a string with an invalid size: %d @0x%x'
76
            % (size, <int>s))
77
    return PyString_FromStringAndSize(s, size)
78
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
79
4075.3.1 by John Arbash Meinel
Use PyString_InternInPlace to intern() the various parts of keys that are processed.
80
cdef object safe_interned_string_from_size(char *s, Py_ssize_t size):
81
    cdef PyObject *py_str
82
    if size < 0:
83
        raise AssertionError(
84
            'tried to create a string with an invalid size: %d @0x%x'
85
            % (size, <int>s))
86
    py_str = PyString_FromStringAndSize_ptr(s, size)
87
    PyString_InternInPlace(&py_str)
88
    result = <object>py_str
89
    # Casting a PyObject* to an <object> triggers an INCREF from Pyrex, so we
90
    # DECREF it to avoid geting immortal strings
91
    Py_DECREF_ptr(py_str)
92
    return result
93
94
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
95
cdef class BTreeLeafParser:
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
96
    """Parse the leaf nodes of a BTree index.
97
98
    :ivar bytes: The PyString object containing the uncompressed text for the
99
        node.
100
    :ivar key_length: An integer describing how many pieces the keys have for
101
        this index.
102
    :ivar ref_list_length: An integer describing how many references this index
103
        contains.
104
    :ivar keys: A PyList of keys found in this node.
105
106
    :ivar _cur_str: A pointer to the start of the next line to parse
107
    :ivar _end_str: A pointer to the end of bytes
108
    :ivar _start: Pointer to the location within the current line while
109
        parsing.
110
    :ivar _header_found: True when we have parsed the header for this node
111
    """
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
112
113
    cdef object bytes
114
    cdef int key_length
115
    cdef int ref_list_length
116
    cdef object keys
117
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
118
    cdef char * _cur_str
119
    cdef char * _end_str
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
120
    # The current start point for parsing
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
121
    cdef char * _start
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
122
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
123
    cdef int _header_found
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
124
125
    def __init__(self, bytes, key_length, ref_list_length):
126
        self.bytes = bytes
127
        self.key_length = key_length
128
        self.ref_list_length = ref_list_length
129
        self.keys = []
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
130
        self._cur_str = NULL
131
        self._end_str = NULL
132
        self._header_found = 0
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
133
134
    cdef extract_key(self, char * last):
135
        """Extract a key.
136
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
137
        :param last: points at the byte after the last byte permitted for the
138
            key.
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
139
        """
140
        cdef char *temp_ptr
141
        cdef int loop_counter
142
        # keys are tuples
143
        loop_counter = 0
144
        key_segments = []
145
        while loop_counter < self.key_length:
146
            loop_counter = loop_counter + 1
147
            # grab a key segment
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
148
            temp_ptr = <char*>memchr(self._start, c'\0', last - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
149
            if temp_ptr == NULL:
150
                if loop_counter == self.key_length:
151
                    # capture to last
152
                    temp_ptr = last
153
                else:
154
                    # Invalid line
155
                    failure_string = ("invalid key, wanted segment from " +
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
156
                        repr(safe_string_from_size(self._start,
157
                                                   last - self._start)))
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
158
                    raise AssertionError(failure_string)
159
            # capture the key string
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
160
            # TODO: Consider using PyIntern_FromString, the only caveat is that
161
            # it assumes a NULL-terminated string, so we have to check if
162
            # temp_ptr[0] == c'\0' or some other char.
4075.3.1 by John Arbash Meinel
Use PyString_InternInPlace to intern() the various parts of keys that are processed.
163
            key_element = safe_interned_string_from_size(self._start,
164
                                                         temp_ptr - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
165
            # advance our pointer
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
166
            self._start = temp_ptr + 1
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
167
            PyList_Append(key_segments, key_element)
168
        return tuple(key_segments)
169
170
    cdef int process_line(self) except -1:
171
        """Process a line in the bytes."""
172
        cdef char *last
173
        cdef char *temp_ptr
174
        cdef char *ref_ptr
175
        cdef char *next_start
176
        cdef int loop_counter
177
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
178
        self._start = self._cur_str
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
179
        # Find the next newline
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
180
        last = <char*>memchr(self._start, c'\n', self._end_str - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
181
        if last == NULL:
182
            # Process until the end of the file
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
183
            last = self._end_str
184
            self._cur_str = self._end_str
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
185
        else:
186
            # And the next string is right after it
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
187
            self._cur_str = last + 1
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
188
            # The last character is right before the '\n'
189
            last = last
190
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
191
        if last == self._start:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
192
            # parsed it all.
193
            return 0
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
194
        if last < self._start:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
195
            # Unexpected error condition - fail
196
            return -1
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
197
        if 0 == self._header_found:
198
            # The first line in a leaf node is the header "type=leaf\n"
199
            if strncmp("type=leaf", self._start, last - self._start) == 0:
200
                self._header_found = 1
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
201
                return 0
202
            else:
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
203
                raise AssertionError('Node did not start with "type=leaf": %r'
204
                    % (safe_string_from_size(self._start, last - self._start)))
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
205
                return -1
206
207
        key = self.extract_key(last)
208
        # find the value area
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
209
        temp_ptr = <char*>_my_memrchr(self._start, c'\0', last - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
210
        if temp_ptr == NULL:
211
            # Invalid line
212
            return -1
213
        else:
214
            # capture the value string
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
215
            value = safe_string_from_size(temp_ptr + 1, last - temp_ptr - 1)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
216
            # shrink the references end point
217
            last = temp_ptr
218
        if self.ref_list_length:
219
            ref_lists = []
220
            loop_counter = 0
221
            while loop_counter < self.ref_list_length:
222
                ref_list = []
223
                # extract a reference list
224
                loop_counter = loop_counter + 1
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
225
                if last < self._start:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
226
                    return -1
227
                # find the next reference list end point:
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
228
                temp_ptr = <char*>memchr(self._start, c'\t', last - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
229
                if temp_ptr == NULL:
230
                    # Only valid for the last list
231
                    if loop_counter != self.ref_list_length:
232
                        # Invalid line
233
                        return -1
234
                        raise AssertionError("invalid key")
235
                    else:
236
                        # scan to the end of the ref list area
237
                        ref_ptr = last
238
                        next_start = last
239
                else:
240
                    # scan to the end of this ref list
241
                    ref_ptr = temp_ptr
242
                    next_start = temp_ptr + 1
243
                # Now, there may be multiple keys in the ref list.
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
244
                while self._start < ref_ptr:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
245
                    # loop finding keys and extracting them
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
246
                    temp_ptr = <char*>memchr(self._start, c'\r',
247
                                             ref_ptr - self._start)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
248
                    if temp_ptr == NULL:
249
                        # key runs to the end
250
                        temp_ptr = ref_ptr
251
                    PyList_Append(ref_list, self.extract_key(temp_ptr))
252
                PyList_Append(ref_lists, tuple(ref_list))
253
                # prepare for the next reference list
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
254
                self._start = next_start
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
255
            ref_lists = tuple(ref_lists)
256
            node_value = (value, ref_lists)
257
        else:
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
258
            if last != self._start:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
259
                # unexpected reference data present
260
                return -1
261
            node_value = (value, ())
262
        PyList_Append(self.keys, (key, node_value))
263
        return 0
264
265
    def parse(self):
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
266
        cdef Py_ssize_t byte_count
267
        if not PyString_CheckExact(self.bytes):
268
            raise AssertionError('self.bytes is not a string.')
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
269
        byte_count = PyString_Size(self.bytes)
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
270
        self._cur_str = PyString_AsString(self.bytes)
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
271
        # This points to the last character in the string
3641.3.2 by John Arbash Meinel
Clean up some variable names, add some documentation.
272
        self._end_str = self._cur_str + byte_count
273
        while self._cur_str < self._end_str:
3641.3.1 by John Arbash Meinel
Bring in the btree_index and chunk_writer code and their tests.
274
            self.process_line()
275
        return self.keys
276
277
278
def _parse_leaf_lines(bytes, key_length, ref_list_length):
279
    parser = BTreeLeafParser(bytes, key_length, ref_list_length)
280
    return parser.parse()
3641.3.18 by John Arbash Meinel
Start working on a compiled function for transforming
281
282
283
def _flatten_node(node, reference_lists):
284
    """Convert a node into the serialized form.
285
286
    :param node: A tuple representing a node:
287
        (index, key_tuple, value, references)
288
    :param reference_lists: Does this index have reference lists?
289
    :return: (string_key, flattened)
290
        string_key  The serialized key for referencing this node
291
        flattened   A string with the serialized form for the contents
292
    """
3641.3.26 by John Arbash Meinel
A couple small tweaks.
293
    cdef int have_reference_lists
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
294
    cdef Py_ssize_t flat_len
295
    cdef Py_ssize_t key_len
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
296
    cdef Py_ssize_t node_len
297
    cdef PyObject * val
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
298
    cdef char * value
299
    cdef Py_ssize_t value_len
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
300
    cdef char * out
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
301
    cdef Py_ssize_t refs_len
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
302
    cdef Py_ssize_t next_len
3641.3.21 by John Arbash Meinel
Flatten the outermost str.join() into memcpy's
303
    cdef int first_ref_list
3641.3.22 by John Arbash Meinel
flatten the next level
304
    cdef int first_reference
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
305
    cdef int i
306
    cdef PyObject *ref_bit
307
    cdef Py_ssize_t ref_bit_len
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
308
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
309
    if not PyTuple_CheckExact(node):
310
        raise TypeError('We expected a tuple() for node not: %s'
311
            % type(node))
312
    node_len = PyTuple_GET_SIZE(node)
3641.3.26 by John Arbash Meinel
A couple small tweaks.
313
    have_reference_lists = reference_lists
314
    if have_reference_lists:
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
315
        if node_len != 4:
316
            raise ValueError('With ref_lists, we expected 4 entries not: %s'
317
                % len(node))
318
    elif node_len < 3:
319
        raise ValueError('Without ref_lists, we need at least 3 entries not: %s'
320
            % len(node))
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
321
    # I don't expect that we can do faster than string.join()
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
322
    string_key = '\0'.join(<object>PyTuple_GET_ITEM_ptr_object(node, 1))
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
323
3641.3.18 by John Arbash Meinel
Start working on a compiled function for transforming
324
    # TODO: instead of using string joins, precompute the final string length,
325
    #       and then malloc a single string and copy everything in.
3641.3.19 by John Arbash Meinel
The flatten code now handles the no-ref-list case.
326
327
    # TODO: We probably want to use PySequenceFast, because we have lists and
328
    #       tuples, but we aren't sure which we will get.
329
330
    # line := string_key NULL flat_refs NULL value LF
331
    # string_key := BYTES (NULL BYTES)*
332
    # flat_refs := ref_list (TAB ref_list)*
333
    # ref_list := ref (CR ref)*
334
    # ref := BYTES (NULL BYTES)*
335
    # value := BYTES
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
336
    refs_len = 0
3641.3.26 by John Arbash Meinel
A couple small tweaks.
337
    if have_reference_lists:
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
338
        # Figure out how many bytes it will take to store the references
3641.3.26 by John Arbash Meinel
A couple small tweaks.
339
        ref_lists = <object>PyTuple_GET_ITEM_ptr_object(node, 3)
3641.3.24 by John Arbash Meinel
Use the compiled flatten function.
340
        next_len = len(ref_lists) # TODO: use a Py function
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
341
        if next_len > 0:
342
            # If there are no nodes, we don't need to do any work
343
            # Otherwise we will need (len - 1) '\t' characters to separate
344
            # the reference lists
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
345
            refs_len = refs_len + (next_len - 1)
3641.3.24 by John Arbash Meinel
Use the compiled flatten function.
346
            for ref_list in ref_lists:
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
347
                next_len = len(ref_list)
348
                if next_len > 0:
349
                    # We will need (len - 1) '\r' characters to separate the
350
                    # references
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
351
                    refs_len = refs_len + (next_len - 1)
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
352
                    for reference in ref_list:
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
353
                        if not PyTuple_CheckExact(reference):
354
                            raise TypeError(
355
                                'We expect references to be tuples not: %s'
356
                                % type(reference))
357
                        next_len = PyTuple_GET_SIZE(reference)
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
358
                        if next_len > 0:
359
                            # We will need (len - 1) '\x00' characters to
360
                            # separate the reference key
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
361
                            refs_len = refs_len + (next_len - 1)
362
                            for i from 0 <= i < next_len:
363
                                ref_bit = PyTuple_GET_ITEM_ptr_object(reference, i)
3641.3.26 by John Arbash Meinel
A couple small tweaks.
364
                                if not PyString_CheckExact_ptr(ref_bit):
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
365
                                    raise TypeError('We expect reference bits'
366
                                        ' to be strings not: %s'
367
                                        % type(<object>ref_bit))
368
                                refs_len = refs_len + PyString_GET_SIZE_ptr(ref_bit)
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
369
370
    # So we have the (key NULL refs NULL value LF)
371
    key_len = PyString_Size(string_key)
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
372
    val = PyTuple_GET_ITEM_ptr_object(node, 2)
3641.3.26 by John Arbash Meinel
A couple small tweaks.
373
    if not PyString_CheckExact_ptr(val):
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
374
        raise TypeError('Expected a plain str for value not: %s'
375
                        % type(<object>val))
376
    value = PyString_AS_STRING_ptr(val)
377
    value_len = PyString_GET_SIZE_ptr(val)
378
    flat_len = (key_len + 1 + refs_len + 1 + value_len + 1)
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
379
    line = PyString_FromStringAndSize(NULL, flat_len)
380
    # Get a pointer to the new buffer
381
    out = PyString_AsString(line)
382
    memcpy(out, PyString_AsString(string_key), key_len)
383
    out = out + key_len
384
    out[0] = c'\0'
385
    out = out + 1
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
386
    if refs_len > 0:
3641.3.21 by John Arbash Meinel
Flatten the outermost str.join() into memcpy's
387
        first_ref_list = 1
3641.3.24 by John Arbash Meinel
Use the compiled flatten function.
388
        for ref_list in ref_lists:
3641.3.21 by John Arbash Meinel
Flatten the outermost str.join() into memcpy's
389
            if first_ref_list == 0:
390
                out[0] = c'\t'
391
                out = out + 1
392
            first_ref_list = 0
3641.3.22 by John Arbash Meinel
flatten the next level
393
            first_reference = 1
3641.3.21 by John Arbash Meinel
Flatten the outermost str.join() into memcpy's
394
            for reference in ref_list:
3641.3.22 by John Arbash Meinel
flatten the next level
395
                if first_reference == 0:
396
                    out[0] = c'\r'
397
                    out = out + 1
398
                first_reference = 0
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
399
                next_len = PyTuple_GET_SIZE(reference)
400
                for i from 0 <= i < next_len:
401
                    if i != 0:
3641.3.23 by John Arbash Meinel
Flattened all the way down the stack.
402
                        out[0] = c'\x00'
403
                        out = out + 1
3641.3.25 by John Arbash Meinel
Shave off some more time by using exact accessors.
404
                    ref_bit = PyTuple_GET_ITEM_ptr_object(reference, i)
405
                    ref_bit_len = PyString_GET_SIZE_ptr(ref_bit)
406
                    memcpy(out, PyString_AS_STRING_ptr(ref_bit), ref_bit_len)
407
                    out = out + ref_bit_len
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
408
    out[0] = c'\0'
3641.3.22 by John Arbash Meinel
flatten the next level
409
    out = out  + 1
3641.3.20 by John Arbash Meinel
We have a single malloc for the final output.
410
    memcpy(out, value, value_len)
411
    out = out + value_len
412
    out[0] = c'\n'
3641.3.18 by John Arbash Meinel
Start working on a compiled function for transforming
413
    return string_key, line