]> sigrok.org Git - libsigrok.git/blame_incremental - datastore.c
Make DATASTORE_CHUNKSIZE private.
[libsigrok.git] / datastore.c
... / ...
CommitLineData
1/*
2 * This file is part of the sigrok project.
3 *
4 * Copyright (C) 2010 Bert Vermeulen <bert@biot.com>
5 *
6 * This program is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 */
19
20#include <stdlib.h>
21#include <stdint.h>
22#include <string.h>
23#include <glib.h>
24#include <sigrok.h>
25#include <sigrok-internal.h>
26
27static gpointer new_chunk(struct sr_datastore **ds);
28
29int sr_datastore_new(int unitsize, struct sr_datastore **ds)
30{
31 if (!ds)
32 return SR_ERR;
33
34 if (unitsize <= 0)
35 return SR_ERR; /* TODO: Different error? */
36
37 if (!(*ds = g_malloc(sizeof(struct sr_datastore))))
38 return SR_ERR_MALLOC;
39
40 (*ds)->ds_unitsize = unitsize;
41 (*ds)->num_units = 0;
42 (*ds)->chunklist = NULL;
43
44 return SR_OK;
45}
46
47int sr_datastore_destroy(struct sr_datastore *ds)
48{
49 GSList *chunk;
50
51 if (!ds)
52 return SR_ERR;
53
54 for (chunk = ds->chunklist; chunk; chunk = chunk->next)
55 g_free(chunk->data);
56 g_slist_free(ds->chunklist);
57 g_free(ds);
58
59 return SR_OK;
60}
61
62void sr_datastore_put(struct sr_datastore *ds, void *data, unsigned int length,
63 int in_unitsize, int *probelist)
64{
65 unsigned int stored;
66 int capacity, size, num_chunks, chunk_bytes_free, chunk_offset;
67 gpointer chunk;
68
69 /* Avoid compiler warnings. */
70 in_unitsize = in_unitsize;
71 probelist = probelist;
72
73 if (ds->chunklist == NULL)
74 chunk = new_chunk(&ds);
75 else
76 chunk = g_slist_last(ds->chunklist)->data;
77
78 num_chunks = g_slist_length(ds->chunklist);
79 capacity = (num_chunks * DATASTORE_CHUNKSIZE);
80 chunk_bytes_free = capacity - (ds->ds_unitsize * ds->num_units);
81 chunk_offset = capacity - (DATASTORE_CHUNKSIZE * (num_chunks - 1))
82 - chunk_bytes_free;
83 stored = 0;
84 while (stored < length) {
85 if (chunk_bytes_free == 0) {
86 chunk = new_chunk(&ds);
87 chunk_bytes_free = DATASTORE_CHUNKSIZE;
88 chunk_offset = 0;
89 }
90
91 if (length - stored > (unsigned int)chunk_bytes_free)
92 size = chunk_bytes_free;
93 else
94 /* Last part, won't fill up this chunk. */
95 size = length - stored;
96
97 memcpy(chunk + chunk_offset, data + stored, size);
98 chunk_bytes_free -= size;
99 stored += size;
100 }
101 ds->num_units += stored / ds->ds_unitsize;
102}
103
104static gpointer new_chunk(struct sr_datastore **ds)
105{
106 gpointer chunk;
107
108 if (!(chunk = malloc(DATASTORE_CHUNKSIZE * (*ds)->ds_unitsize)))
109 return NULL;
110
111 (*ds)->chunklist = g_slist_append((*ds)->chunklist, chunk);
112
113 return chunk;
114}