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
107
108
109
110
111
112
113
114
|
/* Copyright (c) 2000 Shlomi Fish
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
* OTHER DEALINGS IN THE SOFTWARE.
*/
/*
* alloc.h - the Freecell Solver compact allocator. Used to allocate
* columns and other small allocations of a short size. Is able to revert the
* last allocation.
*/
#ifndef FC_SOLVE__ALLOC_H
#define FC_SOLVE__ALLOC_H
#ifdef __cplusplus
extern "C"
{
#endif
#include "state.h"
#include "inline.h"
typedef struct
{
char * * packs;
int num_packs, max_num_packs;
char * max_ptr;
char * ptr;
char * rollback_ptr;
} fcs_compact_allocator_t;
extern void
fc_solve_compact_allocator_init(fcs_compact_allocator_t * allocator);
extern void fc_solve_compact_allocator_extend(
fcs_compact_allocator_t * allocator
);
static GCC_INLINE void * fcs_compact_alloc_ptr(fcs_compact_allocator_t * allocator, int how_much)
{
/* Round ptr to the next pointer boundary */
how_much +=
(
(sizeof(char *)-((how_much)&(sizeof(char *)-1)))&(sizeof(char*)-1)
);
if (allocator->max_ptr - allocator->ptr < how_much)
{
fc_solve_compact_allocator_extend(allocator);
}
else
{
allocator->rollback_ptr = allocator->ptr;
}
allocator->ptr += how_much;
return allocator->rollback_ptr;
}
#define fcs_compact_alloc_release(allocator) \
{ \
(allocator)->ptr = (allocator)->rollback_ptr; \
}
extern void fc_solve_compact_allocator_finish(fcs_compact_allocator_t * allocator);
static GCC_INLINE fcs_collectible_state_t * fcs_state_ia_alloc_into_var(fcs_compact_allocator_t * allocator)
{
{
register fcs_collectible_state_t * ret_helper;
ret_helper =
(fcs_collectible_state_t *)
fcs_compact_alloc_ptr(allocator,
sizeof(*ret_helper)
);
return ret_helper;
}
}
static GCC_INLINE void fc_solve_compact_allocator_recycle(fcs_compact_allocator_t * allocator)
{
allocator->num_packs = 0;
/* Now num_packs will be 1 and a max_ptr and ptr will be set. */
fc_solve_compact_allocator_extend(allocator);
return;
}
#ifdef __cplusplus
};
#endif
#endif
|
