]>
Commit | Line | Data |
---|---|---|
75f9527c | 1 | /* Copyright (C) 2009-2013 Free Software Foundation, Inc. |
0a35513e AH |
2 | Contributed by Richard Henderson <rth@redhat.com>. |
3 | ||
4 | This file is part of the GNU Transactional Memory Library (libitm). | |
5 | ||
6 | Libitm is free software; you can redistribute it and/or modify it | |
7 | 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 | Libitm is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS | |
13 | FOR A PARTICULAR PURPOSE. See the GNU General Public License for | |
14 | more details. | |
15 | ||
16 | Under Section 7 of GPL version 3, you are granted additional | |
17 | permissions described in the GCC Runtime Library Exception, version | |
18 | 3.1, as published by the Free Software Foundation. | |
19 | ||
20 | You should have received a copy of the GNU General Public License and | |
21 | a copy of the GCC Runtime Library Exception along with this program; | |
22 | see the files COPYING3 and COPYING.RUNTIME respectively. If not, see | |
23 | <http://www.gnu.org/licenses/>. */ | |
24 | ||
25 | #ifndef LIBITM_ALPHA_CACHELINE_H | |
26 | #define LIBITM_ALPHA_CACHELINE_H 1 | |
27 | ||
28 | // A cacheline is the smallest unit with which locks are associated. | |
29 | // The current implementation of the _ITM_[RW] barriers assumes that | |
30 | // all data types can fit (aligned) within a cachline, which means | |
31 | // in practice sizeof(complex long double) is the smallest cacheline size. | |
32 | // It ought to be small enough for efficient manipulation of the | |
33 | // modification mask, below. | |
34 | #define CACHELINE_SIZE 64 | |
35 | ||
79b1edb6 | 36 | #include "config/generic/cacheline.h" |
0a35513e | 37 | |
0a35513e | 38 | #endif // LIBITM_ALPHA_CACHELINE_H |