1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/* mblock.c -- aligned memory blocks (cache issues)
This file is part of the lzop file compressor.
Copyright (C) 1996-2010 Markus Franz Xaver Johannes Oberhumer
All Rights Reserved.
lzop and the LZO library are free software; you can redistribute them
and/or modify them under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of
the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; see the file COPYING.
If not, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
Markus F.X.J. Oberhumer
<markus@oberhumer.com>
http://www.oberhumer.com/opensource/lzop/
*/
#include "conf.h"
/*************************************************************************
//
**************************************************************************/
static void do_init(mblock_p m, lzo_uint32 size, lzo_uint align)
{
memset(m,0,sizeof(*m));
m->mb_size = size;
m->mb_align = (align > 1) ? align : 1;
assert((m->mb_align & (m->mb_align - 1)) == 0);
m->mb_adler32 = ADLER32_INIT_VALUE;
m->mb_crc32 = CRC32_INIT_VALUE;
}
#if 0
lzo_bool mb_init(mblock_p m, lzo_uint32 size, lzo_uint align,
lzo_voidp heap, lzo_uint32 heap_size)
{
do_init(m,size,align);
if (m->mb_size == 0)
return 1;
if (heap == 0)
return 0;
m->mb_mem_alloc = (lzo_bytep) heap;
m->mb_size_alloc = heap_size;
assert(m->mb_size_alloc >= m->mb_size + m->mb_align - 1);
m->mb_mem = LZO_PTR_ALIGN_UP(m->mb_mem_alloc,m->mb_align);
assert(m->mb_mem >= m->mb_mem_alloc);
assert(m->mb_mem + m->mb_size <= m->mb_mem_alloc + m->mb_size_alloc);
#if 0
printf("m_init: %p %p %8ld %8ld %8ld\n", m->mb_mem_alloc, m->mb_mem,
(long) m->mb_size_alloc, (long) m->mb_size, (long) m->mb_align);
#endif
return 1;
}
#endif
lzo_bool mb_alloc(mblock_p m, lzo_uint32 size, lzo_uint align)
{
do_init(m,size,align);
if (m->mb_size == 0)
return 1;
m->mb_size_alloc = m->mb_size + m->mb_align - 1;
m->mb_mem_alloc = (lzo_bytep) acc_halloc(m->mb_size_alloc);
if (m->mb_mem_alloc == NULL)
return 0;
acc_hmemset(m->mb_mem_alloc, 0, m->mb_size_alloc);
m->mb_mem = LZO_PTR_ALIGN_UP(m->mb_mem_alloc,m->mb_align);
assert(m->mb_mem >= m->mb_mem_alloc);
assert(m->mb_mem + m->mb_size <= m->mb_mem_alloc + m->mb_size_alloc);
#if 0
printf("m_alloc: %p %p %8ld %8ld %8ld\n", m->mb_mem_alloc, m->mb_mem,
(long) m->mb_size_alloc, (long) m->mb_size, (long) m->mb_align);
#endif
return 1;
}
void mb_free(mblock_p m)
{
acc_hfree(m->mb_mem_alloc);
memset(m,0,sizeof(*m));
}
/*
vi:ts=4:et
*/
|
