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
|
/*
* %CopyrightBegin%
*
* Copyright Ericsson AB 2003-2016. All Rights Reserved.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* %CopyrightEnd%
*/
#ifndef HIPE_X86_H
#define HIPE_X86_H
#ifndef __has_builtin
# define __has_builtin(x) 0
#endif
static __inline__ void
hipe_flush_icache_range(void *address, unsigned int nbytes)
{
void* end = (char*)address + nbytes;
#if ERTS_AT_LEAST_GCC_VSN__(4, 3, 0) || __has_builtin(__builtin___clear_cache)
__builtin___clear_cache(address, end);
#elif defined(__clang__)
void __clear_cache(void *start, void *end);
__clear_cache(address, end);
#else
# warning "Don't know how to flush instruction cache"
#endif
}
static __inline__ void hipe_flush_icache_word(void *address)
{
hipe_flush_icache_range(address, sizeof(void*));
}
/* for stack descriptor hash lookup */
#define HIPE_RA_LSR_COUNT 0 /* all bits are significant */
/* for hipe_bifs_{read,write}_{s,u}32 */
static __inline__ int hipe_word32_address_ok(void *address)
{
return 1;
}
/* Native stack growth direction. */
#define HIPE_NSTACK_GROWS_DOWN
#define hipe_arch_name am_x86
extern void nbif_inc_stack_0(void);
#ifndef NO_FPE_SIGNALS
extern void nbif_handle_fp_exception(void);
#endif
#endif /* HIPE_X86_H */
|
