/* -*- C -*- */
/*
 * Copyright (c) 2003 Jindrich Novy (jnovy@users.sf.net)
 *
 * 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
 *
 */

void X(execute_plan)( X(plan) *p ) {
	assert( p->ds && p->k && p->ord && p->d && p->ksample );
	
/*	{
		int kp;
		for ( p->n=0., kp=p->ord-1; kp>=p->ord>>1; kp-- ) p->n += p->k[kp];
	}*/
	
#	ifdef FCE_COMPILING_I8
		switch ( p->ds ) {
			case 1:
				X(convolve_1d_mult_lookup)(p->a1, p->a2, p->d[0], p->k, p->ord, p->n);
				break;
			case 2:
				X(convolve_2d_mult_lookup)(p->a1, p->a2, NULL, p->d[0], p->d[1], p->k, p->ord, p->n);
				break;
			case 3:
				X(convolve_3d_mult_lookup)(p->a1, p->a2, NULL, p->d[0], p->d[1], p->d[2], p->k, p->ord, p->n);
				break;
		}
#	else
		switch ( p->ds ) {
			case 1:
				X(convolve_1d)(p->a1, p->a2, p->d[0], p->k, p->ord, p->n);
				break;
			case 2:
				X(convolve_2d)(p->a1, p->a2, NULL, p->d[0], p->d[1], p->k, p->ord, p->n);
				break;
			case 3:
				X(convolve_3d)(p->a1, p->a2, NULL, p->d[0], p->d[1], p->d[2], p->k, p->ord, p->n);
				break;
		}
#	endif
}