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
|
/*
* Copyright (c) 2003, 2007-8 Matteo Frigo
* Copyright (c) 2003, 2007-8 Massachusetts Institute of Technology
*
* This program is free software; you can redistribute it and/or modify
* it 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; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#include "ifftw.h"
#include "simd.h"
#if HAVE_SIMD || HAVE_CELL
R *X(taint)(R *p, INT s)
{
if (((unsigned)s * sizeof(R)) % ALIGNMENT)
p = (R *) (PTRINT(p) | TAINT_BIT);
if (((unsigned)s * sizeof(R)) % ALIGNMENTA)
p = (R *) (PTRINT(p) | TAINT_BITA);
return p;
}
/* join the taint of two pointers that are supposed to be
the same modulo the taint */
R *X(join_taint)(R *p1, R *p2)
{
A(UNTAINT(p1) == UNTAINT(p2));
return (R *)(PTRINT(p1) | PTRINT(p2));
}
#endif
|
