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
|
/*
* %CopyrightBegin%
*
* Copyright Ericsson AB 2008-2009. All Rights Reserved.
*
* The contents of this file are subject to the Erlang Public License,
* Version 1.1, (the "License"); you may not use this file except in
* compliance with the License. You should have received a copy of the
* Erlang Public License along with this software. If not, it can be
* retrieved online at http://www.erlang.org/.
*
* Software distributed under the License is distributed on an "AS IS"
* basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
* the License for the specific language governing rights and limitations
* under the License.
*
* %CopyrightEnd%
*/
/* $Id$
* Stack walking helpers for native stack GC procedures.
* Generic RISC version.
*/
#ifndef HIPE_RISC_GC_H
#define HIPE_RISC_GC_H
/* arch wrapper includes hipe_${arch}_asm.h to define NR_ARG_REGS */
struct nstack_walk_state {
const struct sdesc *sdesc0; /* .sdesc0 must be a pointer rvalue */
};
static inline int nstack_walk_init_check(const Process *p)
{
return p->hipe.nra ? 1 : 0;
}
static inline Eterm *nstack_walk_nsp_begin(const Process *p)
{
unsigned int nstkarity = p->hipe.narity - NR_ARG_REGS;
if ((int)nstkarity < 0)
nstkarity = 0;
return p->hipe.nsp + nstkarity;
}
static inline const struct sdesc*
nstack_walk_init_sdesc(const Process *p, struct nstack_walk_state *state)
{
const struct sdesc *sdesc = hipe_find_sdesc((unsigned long)p->hipe.nra);
state->sdesc0 = sdesc;
return sdesc;
}
static inline void nstack_walk_update_trap(Process *p, const struct sdesc *sdesc0)
{
Eterm *nsp = p->hipe.nsp;
p->hipe.nsp = nstack_walk_nsp_begin(p);
hipe_update_stack_trap(p, sdesc0);
p->hipe.nsp = nsp;
}
static inline Eterm *nstack_walk_nsp_end(const Process *p)
{
return p->hipe.nstend - 1;
}
static inline void nstack_walk_kill_trap(Process *p, Eterm *nsp_end)
{
/* remove gray/white boundary trap */
if ((unsigned long)p->hipe.nra == (unsigned long)&nbif_stack_trap_ra) {
p->hipe.nra = p->hipe.ngra;
} else {
for (;;) {
--nsp_end;
if (nsp_end[0] == (unsigned long)&nbif_stack_trap_ra) {
nsp_end[0] = (unsigned long)p->hipe.ngra;
break;
}
}
}
}
static inline int nstack_walk_gray_passed_black(const Eterm *gray, const Eterm *black)
{
return gray > black;
}
static inline int nstack_walk_nsp_reached_end(const Eterm *nsp, const Eterm *nsp_end)
{
return nsp >= nsp_end;
}
static inline unsigned int nstack_walk_frame_size(const struct sdesc *sdesc)
{
return sdesc_fsize(sdesc) + 1 + sdesc_arity(sdesc);
}
static inline Eterm *nstack_walk_frame_index(Eterm *nsp, unsigned int i)
{
return &nsp[i];
}
static inline unsigned long
nstack_walk_frame_ra(const Eterm *nsp, const struct sdesc *sdesc)
{
return nsp[sdesc_fsize(sdesc)];
}
static inline Eterm *nstack_walk_next_frame(Eterm *nsp, unsigned int sdesc_size)
{
return nsp + sdesc_size;
}
#endif /* HIPE_RISC_GC_H */
|
