Chris@42: /*
Chris@42:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@42:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@42:  *
Chris@42:  * This program is free software; you can redistribute it and/or modify
Chris@42:  * it under the terms of the GNU General Public License as published by
Chris@42:  * the Free Software Foundation; either version 2 of the License, or
Chris@42:  * (at your option) any later version.
Chris@42:  *
Chris@42:  * This program is distributed in the hope that it will be useful,
Chris@42:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@42:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@42:  * GNU General Public License for more details.
Chris@42:  *
Chris@42:  * You should have received a copy of the GNU General Public License
Chris@42:  * along with this program; if not, write to the Free Software
Chris@42:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@42:  *
Chris@42:  */
Chris@42: 
Chris@42: 
Chris@42: #include "ifftw.h"
Chris@42: #include "simd-common.h"
Chris@42: 
Chris@42: #if HAVE_SIMD
Chris@42: 
Chris@42: R *X(taint)(R *p, INT s)
Chris@42: {
Chris@42:      if (((unsigned)s * sizeof(R)) % ALIGNMENT)
Chris@42: 	  p = (R *) (PTRINT(p) | TAINT_BIT);
Chris@42:      if (((unsigned)s * sizeof(R)) % ALIGNMENTA)
Chris@42: 	  p = (R *) (PTRINT(p) | TAINT_BITA);
Chris@42:      return p;
Chris@42: }
Chris@42: 
Chris@42: /* join the taint of two pointers that are supposed to be
Chris@42:    the same modulo the taint */
Chris@42: R *X(join_taint)(R *p1, R *p2)
Chris@42: {
Chris@42:      A(UNTAINT(p1) == UNTAINT(p2));
Chris@42:      return (R *)(PTRINT(p1) | PTRINT(p2));
Chris@42: }
Chris@42: #endif