[people/ms/linux.git] / arch / ia64 / sn / kernel / bte.c

/*
 * This file is subject to the terms and conditions of the GNU General Public
 * License.  See the file "COPYING" in the main directory of this archive
 * for more details.
 *
 * Copyright (c) 2000-2007 Silicon Graphics, Inc.  All Rights Reserved.
 */

#include <linux/module.h>
#include <asm/sn/nodepda.h>
#include <asm/sn/addrs.h>
#include <asm/sn/arch.h>
#include <asm/sn/sn_cpuid.h>
#include <asm/sn/pda.h>
#include <asm/sn/shubio.h>
#include <asm/nodedata.h>
#include <asm/delay.h>

#include <linux/memblock.h>
#include <linux/string.h>
#include <linux/sched.h>
#include <linux/slab.h>

#include <asm/sn/bte.h>

#ifndef L1_CACHE_MASK
#define L1_CACHE_MASK (L1_CACHE_BYTES - 1)
#endif

/* two interfaces on two btes */
#define MAX_INTERFACES_TO_TRY		4
#define MAX_NODES_TO_TRY		2

static struct bteinfo_s *bte_if_on_node(nasid_t nasid, int interface)
{
	nodepda_t *tmp_nodepda;

	if (nasid_to_cnodeid(nasid) == -1)
		return (struct bteinfo_s *)NULL;

	tmp_nodepda = NODEPDA(nasid_to_cnodeid(nasid));
	return &tmp_nodepda->bte_if[interface];

}

static inline void bte_start_transfer(struct bteinfo_s *bte, u64 len, u64 mode)
{
	if (is_shub2()) {
		BTE_CTRL_STORE(bte, (IBLS_BUSY | ((len) | (mode) << 24)));
	} else {
		BTE_LNSTAT_STORE(bte, len);
		BTE_CTRL_STORE(bte, mode);
	}
}

/************************************************************************
 * Block Transfer Engine copy related functions.
 *
 ***********************************************************************/

/*
 * bte_copy(src, dest, len, mode, notification)
 *
 * Use the block transfer engine to move kernel memory from src to dest
 * using the assigned mode.
 *
 * Parameters:
 *   src - physical address of the transfer source.
 *   dest - physical address of the transfer destination.
 *   len - number of bytes to transfer from source to dest.
 *   mode - hardware defined.  See reference information
 *          for IBCT0/1 in the SHUB Programmers Reference
 *   notification - kernel virtual address of the notification cache
 *                  line.  If NULL, the default is used and
 *                  the bte_copy is synchronous.
 *
 * NOTE:  This function requires src, dest, and len to
 * be cacheline aligned.
 */
bte_result_t bte_copy(u64 src, u64 dest, u64 len, u64 mode, void *notification)
{
	u64 transfer_size;
	u64 transfer_stat;
	u64 notif_phys_addr;
	struct bteinfo_s *bte;
	bte_result_t bte_status;
	unsigned long irq_flags;
	unsigned long itc_end = 0;
	int nasid_to_try[MAX_NODES_TO_TRY];
	int my_nasid = cpuid_to_nasid(raw_smp_processor_id());
	int bte_if_index, nasid_index;
	int bte_first, btes_per_node = BTES_PER_NODE;

	BTE_PRINTK(("bte_copy(0x%lx, 0x%lx, 0x%lx, 0x%lx, 0x%p)\n",
		    src, dest, len, mode, notification));

	if (len == 0) {
		return BTE_SUCCESS;
	}

	BUG_ON(len & L1_CACHE_MASK);
	BUG_ON(src & L1_CACHE_MASK);
	BUG_ON(dest & L1_CACHE_MASK);
	BUG_ON(len > BTE_MAX_XFER);

	/*
	 * Start with interface corresponding to cpu number
	 */
	bte_first = raw_smp_processor_id() % btes_per_node;

	if (mode & BTE_USE_DEST) {
		/* try remote then local */
		nasid_to_try[0] = NASID_GET(dest);
		if (mode & BTE_USE_ANY) {
			nasid_to_try[1] = my_nasid;
		} else {
			nasid_to_try[1] = 0;
		}
	} else {
		/* try local then remote */
		nasid_to_try[0] = my_nasid;
		if (mode & BTE_USE_ANY) {
			nasid_to_try[1] = NASID_GET(dest);
		} else {
			nasid_to_try[1] = 0;
		}
	}

retry_bteop:
	do {
		local_irq_save(irq_flags);

		bte_if_index = bte_first;
		nasid_index = 0;

		/* Attempt to lock one of the BTE interfaces. */
		while (nasid_index < MAX_NODES_TO_TRY) {
			bte = bte_if_on_node(nasid_to_try[nasid_index],bte_if_index);

			if (bte == NULL) {
				nasid_index++;
				continue;
			}

			if (spin_trylock(&bte->spinlock)) {
				if (!(*bte->most_rcnt_na & BTE_WORD_AVAILABLE) ||
				    (BTE_LNSTAT_LOAD(bte) & BTE_ACTIVE)) {
					/* Got the lock but BTE still busy */
					spin_unlock(&bte->spinlock);
				} else {
					/* we got the lock and it's not busy */
					break;
				}
			}

			bte_if_index = (bte_if_index + 1) % btes_per_node; /* Next interface */
			if (bte_if_index == bte_first) {
				/*
				 * We've tried all interfaces on this node
				 */
				nasid_index++;
			}

			bte = NULL;
		}

		if (bte != NULL) {
			break;
		}

		local_irq_restore(irq_flags);

		if (!(mode & BTE_WACQUIRE)) {
			return BTEFAIL_NOTAVAIL;
		}
	} while (1);

	if (notification == NULL) {
		/* User does not want to be notified. */
		bte->most_rcnt_na = &bte->notify;
	} else {
		bte->most_rcnt_na = notification;
	}

	/* Calculate the number of cache lines to transfer. */
	transfer_size = ((len >> L1_CACHE_SHIFT) & BTE_LEN_MASK);

	/* Initialize the notification to a known value. */
	*bte->most_rcnt_na = BTE_WORD_BUSY;
	notif_phys_addr = (u64)bte->most_rcnt_na;

	/* Set the source and destination registers */
	BTE_PRINTKV(("IBSA = 0x%lx)\n", src));
	BTE_SRC_STORE(bte, src);
	BTE_PRINTKV(("IBDA = 0x%lx)\n", dest));
	BTE_DEST_STORE(bte, dest);

	/* Set the notification register */
	BTE_PRINTKV(("IBNA = 0x%lx)\n", notif_phys_addr));
	BTE_NOTIF_STORE(bte, notif_phys_addr);

	/* Initiate the transfer */
	BTE_PRINTK(("IBCT = 0x%lx)\n", BTE_VALID_MODE(mode)));
	bte_start_transfer(bte, transfer_size, BTE_VALID_MODE(mode));

	itc_end = ia64_get_itc() + (40000000 * local_cpu_data->cyc_per_usec);

	spin_unlock_irqrestore(&bte->spinlock, irq_flags);

	if (notification != NULL) {
		return BTE_SUCCESS;
	}

	while ((transfer_stat = *bte->most_rcnt_na) == BTE_WORD_BUSY) {
		cpu_relax();
		if (ia64_get_itc() > itc_end) {
			BTE_PRINTK(("BTE timeout nasid 0x%x bte%d IBLS = 0x%lx na 0x%lx\n",
				NASID_GET(bte->bte_base_addr), bte->bte_num,
				BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na) );
			bte->bte_error_count++;
			bte->bh_error = IBLS_ERROR;
			bte_error_handler(NODEPDA(bte->bte_cnode));
			*bte->most_rcnt_na = BTE_WORD_AVAILABLE;
			goto retry_bteop;
		}
	}

	BTE_PRINTKV((" Delay Done.  IBLS = 0x%lx, most_rcnt_na = 0x%lx\n",
		     BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));

	if (transfer_stat & IBLS_ERROR) {
		bte_status = BTE_GET_ERROR_STATUS(transfer_stat);
	} else {
		bte_status = BTE_SUCCESS;
	}
	*bte->most_rcnt_na = BTE_WORD_AVAILABLE;

	BTE_PRINTK(("Returning status is 0x%lx and most_rcnt_na is 0x%lx\n",
		    BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));

	return bte_status;
}

EXPORT_SYMBOL(bte_copy);

/*
 * bte_unaligned_copy(src, dest, len, mode)
 *
 * use the block transfer engine to move kernel
 * memory from src to dest using the assigned mode.
 *
 * Parameters:
 *   src - physical address of the transfer source.
 *   dest - physical address of the transfer destination.
 *   len - number of bytes to transfer from source to dest.
 *   mode - hardware defined.  See reference information
 *          for IBCT0/1 in the SGI documentation.
 *
 * NOTE: If the source, dest, and len are all cache line aligned,
 * then it would be _FAR_ preferable to use bte_copy instead.
 */
bte_result_t bte_unaligned_copy(u64 src, u64 dest, u64 len, u64 mode)
{
	int destFirstCacheOffset;
	u64 headBteSource;
	u64 headBteLen;
	u64 headBcopySrcOffset;
	u64 headBcopyDest;
	u64 headBcopyLen;
	u64 footBteSource;
	u64 footBteLen;
	u64 footBcopyDest;
	u64 footBcopyLen;
	bte_result_t rv;
	char *bteBlock, *bteBlock_unaligned;

	if (len == 0) {
		return BTE_SUCCESS;
	}

	/* temporary buffer used during unaligned transfers */
	bteBlock_unaligned = kmalloc(len + 3 * L1_CACHE_BYTES, GFP_KERNEL);
	if (bteBlock_unaligned == NULL) {
		return BTEFAIL_NOTAVAIL;
	}
	bteBlock = (char *)L1_CACHE_ALIGN((u64) bteBlock_unaligned);

	headBcopySrcOffset = src & L1_CACHE_MASK;
	destFirstCacheOffset = dest & L1_CACHE_MASK;

	/*
	 * At this point, the transfer is broken into
	 * (up to) three sections.  The first section is
	 * from the start address to the first physical
	 * cache line, the second is from the first physical
	 * cache line to the last complete cache line,
	 * and the third is from the last cache line to the
	 * end of the buffer.  The first and third sections
	 * are handled by bte copying into a temporary buffer
	 * and then bcopy'ing the necessary section into the
	 * final location.  The middle section is handled with
	 * a standard bte copy.
	 *
	 * One nasty exception to the above rule is when the
	 * source and destination are not symmetrically
	 * mis-aligned.  If the source offset from the first
	 * cache line is different from the destination offset,
	 * we make the first section be the entire transfer
	 * and the bcopy the entire block into place.
	 */
	if (headBcopySrcOffset == destFirstCacheOffset) {

		/*
		 * Both the source and destination are the same
		 * distance from a cache line boundary so we can
		 * use the bte to transfer the bulk of the
		 * data.
		 */
		headBteSource = src & ~L1_CACHE_MASK;
		headBcopyDest = dest;
		if (headBcopySrcOffset) {
			headBcopyLen =
			    (len >
			     (L1_CACHE_BYTES -
			      headBcopySrcOffset) ? L1_CACHE_BYTES
			     - headBcopySrcOffset : len);
			headBteLen = L1_CACHE_BYTES;
		} else {
			headBcopyLen = 0;
			headBteLen = 0;
		}

		if (len > headBcopyLen) {
			footBcopyLen = (len - headBcopyLen) & L1_CACHE_MASK;
			footBteLen = L1_CACHE_BYTES;

			footBteSource = src + len - footBcopyLen;
			footBcopyDest = dest + len - footBcopyLen;

			if (footBcopyDest == (headBcopyDest + headBcopyLen)) {
				/*
				 * We have two contiguous bcopy
				 * blocks.  Merge them.
				 */
				headBcopyLen += footBcopyLen;
				headBteLen += footBteLen;
			} else if (footBcopyLen > 0) {
				rv = bte_copy(footBteSource,
					      ia64_tpa((unsigned long)bteBlock),
					      footBteLen, mode, NULL);
				if (rv != BTE_SUCCESS) {
					kfree(bteBlock_unaligned);
					return rv;
				}

				memcpy(__va(footBcopyDest),
				       (char *)bteBlock, footBcopyLen);
			}
		} else {
			footBcopyLen = 0;
			footBteLen = 0;
		}

		if (len > (headBcopyLen + footBcopyLen)) {
			/* now transfer the middle. */
			rv = bte_copy((src + headBcopyLen),
				      (dest +
				       headBcopyLen),
				      (len - headBcopyLen -
				       footBcopyLen), mode, NULL);
			if (rv != BTE_SUCCESS) {
				kfree(bteBlock_unaligned);
				return rv;
			}

		}
	} else {

		/*
		 * The transfer is not symmetric, we will
		 * allocate a buffer large enough for all the
		 * data, bte_copy into that buffer and then
		 * bcopy to the destination.
		 */

		headBcopySrcOffset = src & L1_CACHE_MASK;
		headBcopyDest = dest;
		headBcopyLen = len;

		headBteSource = src - headBcopySrcOffset;
		/* Add the leading and trailing bytes from source */
		headBteLen = L1_CACHE_ALIGN(len + headBcopySrcOffset);
	}

	if (headBcopyLen > 0) {
		rv = bte_copy(headBteSource,
			      ia64_tpa((unsigned long)bteBlock), headBteLen,
			      mode, NULL);
		if (rv != BTE_SUCCESS) {
			kfree(bteBlock_unaligned);
			return rv;
		}

		memcpy(__va(headBcopyDest), ((char *)bteBlock +
					     headBcopySrcOffset), headBcopyLen);
	}
	kfree(bteBlock_unaligned);
	return BTE_SUCCESS;
}

EXPORT_SYMBOL(bte_unaligned_copy);

/************************************************************************
 * Block Transfer Engine initialization functions.
 *
 ***********************************************************************/
static void bte_recovery_timeout(struct timer_list *t)
{
	struct nodepda_s *nodepda = from_timer(nodepda, t, bte_recovery_timer);

	bte_error_handler(nodepda);
}

/*
 * bte_init_node(nodepda, cnode)
 *
 * Initialize the nodepda structure with BTE base addresses and
 * spinlocks.
 */
void bte_init_node(nodepda_t * mynodepda, cnodeid_t cnode)
{
	int i;

	/*
	 * Indicate that all the block transfer engines on this node
	 * are available.
	 */

	/*
	 * Allocate one bte_recover_t structure per node.  It holds
	 * the recovery lock for node.  All the bte interface structures
	 * will point at this one bte_recover structure to get the lock.
	 */
	spin_lock_init(&mynodepda->bte_recovery_lock);
	timer_setup(&mynodepda->bte_recovery_timer, bte_recovery_timeout, 0);

	for (i = 0; i < BTES_PER_NODE; i++) {
		u64 *base_addr;

		/* Which link status register should we use? */
		base_addr = (u64 *)
		    REMOTE_HUB_ADDR(cnodeid_to_nasid(cnode), BTE_BASE_ADDR(i));
		mynodepda->bte_if[i].bte_base_addr = base_addr;
		mynodepda->bte_if[i].bte_source_addr = BTE_SOURCE_ADDR(base_addr);
		mynodepda->bte_if[i].bte_destination_addr = BTE_DEST_ADDR(base_addr);
		mynodepda->bte_if[i].bte_control_addr = BTE_CTRL_ADDR(base_addr);
		mynodepda->bte_if[i].bte_notify_addr = BTE_NOTIF_ADDR(base_addr);

		/*
		 * Initialize the notification and spinlock
		 * so the first transfer can occur.
		 */
		mynodepda->bte_if[i].most_rcnt_na =
		    &(mynodepda->bte_if[i].notify);
		mynodepda->bte_if[i].notify = BTE_WORD_AVAILABLE;
		spin_lock_init(&mynodepda->bte_if[i].spinlock);

		mynodepda->bte_if[i].bte_cnode = cnode;
		mynodepda->bte_if[i].bte_error_count = 0;
		mynodepda->bte_if[i].bte_num = i;
		mynodepda->bte_if[i].cleanup_active = 0;
		mynodepda->bte_if[i].bh_error = 0;
	}

}
Commit	Line	Data
1da177e4 LT	1	/*
	2	* This file is subject to the terms and conditions of the GNU General Public
	3	* License. See the file "COPYING" in the main directory of this archive
	4	* for more details.
	5	*
64135fa9	6	* Copyright (c) 2000-2007 Silicon Graphics, Inc. All Rights Reserved.
1da177e4 LT	7	*/
1da177e4 LT	8
1da177e4 LT	9	#include <linux/module.h>
	10	#include <asm/sn/nodepda.h>
	11	#include <asm/sn/addrs.h>
	12	#include <asm/sn/arch.h>
	13	#include <asm/sn/sn_cpuid.h>
	14	#include <asm/sn/pda.h>
	15	#include <asm/sn/shubio.h>
	16	#include <asm/nodedata.h>
	17	#include <asm/delay.h>
	18
57c8a661	19	#include <linux/memblock.h>
1da177e4 LT	20	#include <linux/string.h>
1da177e4 LT	21	#include <linux/sched.h>
5a0e3ad6	22	#include <linux/slab.h>
1da177e4 LT	23
	24	#include <asm/sn/bte.h>
	25
	26	#ifndef L1_CACHE_MASK
	27	#define L1_CACHE_MASK (L1_CACHE_BYTES - 1)
	28	#endif
	29
	30	/* two interfaces on two btes */
	31	#define MAX_INTERFACES_TO_TRY 4
7e95b9d6	32	#define MAX_NODES_TO_TRY 2
1da177e4 LT	33
	34	static struct bteinfo_s *bte_if_on_node(nasid_t nasid, int interface)
	35	{
	36	nodepda_t *tmp_nodepda;
	37
7e95b9d6	38	if (nasid_to_cnodeid(nasid) == -1)
53b3531b	39	return (struct bteinfo_s *)NULL;
7e95b9d6	40
1da177e4 LT	41	tmp_nodepda = NODEPDA(nasid_to_cnodeid(nasid));
	42	return &tmp_nodepda->bte_if[interface];
	43
	44	}
	45
7e95b9d6 JS	46	static inline void bte_start_transfer(struct bteinfo_s *bte, u64 len, u64 mode)
	47	{
	48	if (is_shub2()) {
	49	BTE_CTRL_STORE(bte, (IBLS_BUSY \| ((len) \| (mode) << 24)));
	50	} else {
	51	BTE_LNSTAT_STORE(bte, len);
	52	BTE_CTRL_STORE(bte, mode);
	53	}
	54	}
	55
1da177e4 LT	56	/************************************************************************
	57	* Block Transfer Engine copy related functions.
	58	*
	59	***********************************************************************/
	60
	61	/*
	62	* bte_copy(src, dest, len, mode, notification)
	63	*
	64	* Use the block transfer engine to move kernel memory from src to dest
	65	* using the assigned mode.
	66	*
72fdbdce	67	* Parameters:
1da177e4 LT	68	* src - physical address of the transfer source.
	69	* dest - physical address of the transfer destination.
	70	* len - number of bytes to transfer from source to dest.
	71	* mode - hardware defined. See reference information
	72	* for IBCT0/1 in the SHUB Programmers Reference
	73	* notification - kernel virtual address of the notification cache
	74	* line. If NULL, the default is used and
	75	* the bte_copy is synchronous.
	76	*
	77	* NOTE: This function requires src, dest, and len to
	78	* be cacheline aligned.
	79	*/
	80	bte_result_t bte_copy(u64 src, u64 dest, u64 len, u64 mode, void *notification)
	81	{
	82	u64 transfer_size;
	83	u64 transfer_stat;
7e95b9d6	84	u64 notif_phys_addr;
1da177e4 LT	85	struct bteinfo_s *bte;
	86	bte_result_t bte_status;
	87	unsigned long irq_flags;
	88	unsigned long itc_end = 0;
7e95b9d6	89	int nasid_to_try[MAX_NODES_TO_TRY];
e7f98dbb	90	int my_nasid = cpuid_to_nasid(raw_smp_processor_id());
7e95b9d6 JS	91	int bte_if_index, nasid_index;
7e95b9d6 JS	92	int bte_first, btes_per_node = BTES_PER_NODE;
1da177e4 LT	93
	94	BTE_PRINTK(("bte_copy(0x%lx, 0x%lx, 0x%lx, 0x%lx, 0x%p)\n",
	95	src, dest, len, mode, notification));
	96
	97	if (len == 0) {
	98	return BTE_SUCCESS;
	99	}
	100
39d481cb RH	101	BUG_ON(len & L1_CACHE_MASK);
	102	BUG_ON(src & L1_CACHE_MASK);
	103	BUG_ON(dest & L1_CACHE_MASK);
	104	BUG_ON(len > BTE_MAX_XFER);
1da177e4	105
7e95b9d6 JS	106	/*
	107	* Start with interface corresponding to cpu number
	108	*/
d1e079b3	109	bte_first = raw_smp_processor_id() % btes_per_node;
1da177e4 LT	110
	111	if (mode & BTE_USE_DEST) {
	112	/* try remote then local */
7e95b9d6	113	nasid_to_try[0] = NASID_GET(dest);
1da177e4	114	if (mode & BTE_USE_ANY) {
7e95b9d6	115	nasid_to_try[1] = my_nasid;
1da177e4	116	} else {
6b15075c	117	nasid_to_try[1] = 0;
1da177e4 LT	118	}
	119	} else {
	120	/* try local then remote */
7e95b9d6	121	nasid_to_try[0] = my_nasid;
1da177e4	122	if (mode & BTE_USE_ANY) {
7e95b9d6	123	nasid_to_try[1] = NASID_GET(dest);
1da177e4	124	} else {
6b15075c	125	nasid_to_try[1] = 0;
1da177e4 LT	126	}
	127	}
	128
	129	retry_bteop:
	130	do {
	131	local_irq_save(irq_flags);
	132
7e95b9d6 JS	133	bte_if_index = bte_first;
7e95b9d6 JS	134	nasid_index = 0;
1da177e4 LT	135
1da177e4 LT	136	/* Attempt to lock one of the BTE interfaces. */
7e95b9d6 JS	137	while (nasid_index < MAX_NODES_TO_TRY) {
7e95b9d6 JS	138	bte = bte_if_on_node(nasid_to_try[nasid_index],bte_if_index);
1da177e4 LT	139
1da177e4 LT	140	if (bte == NULL) {
ab2ff46a	141	nasid_index++;
1da177e4 LT	142	continue;
	143	}
	144
	145	if (spin_trylock(&bte->spinlock)) {
	146	if (!(*bte->most_rcnt_na & BTE_WORD_AVAILABLE) \|\|
	147	(BTE_LNSTAT_LOAD(bte) & BTE_ACTIVE)) {
	148	/* Got the lock but BTE still busy */
	149	spin_unlock(&bte->spinlock);
	150	} else {
	151	/* we got the lock and it's not busy */
	152	break;
	153	}
	154	}
7e95b9d6 JS	155
	156	bte_if_index = (bte_if_index + 1) % btes_per_node; /* Next interface */
	157	if (bte_if_index == bte_first) {
	158	/*
	159	* We've tried all interfaces on this node
	160	*/
	161	nasid_index++;
	162	}
	163
1da177e4 LT	164	bte = NULL;
	165	}
	166
	167	if (bte != NULL) {
	168	break;
	169	}
	170
	171	local_irq_restore(irq_flags);
	172
	173	if (!(mode & BTE_WACQUIRE)) {
	174	return BTEFAIL_NOTAVAIL;
	175	}
	176	} while (1);
	177
	178	if (notification == NULL) {
	179	/* User does not want to be notified. */
	180	bte->most_rcnt_na = &bte->notify;
	181	} else {
	182	bte->most_rcnt_na = notification;
	183	}
	184
	185	/* Calculate the number of cache lines to transfer. */
	186	transfer_size = ((len >> L1_CACHE_SHIFT) & BTE_LEN_MASK);
	187
	188	/* Initialize the notification to a known value. */
	189	*bte->most_rcnt_na = BTE_WORD_BUSY;
913e4a75	190	notif_phys_addr = (u64)bte->most_rcnt_na;
1da177e4	191
1da177e4	192	/* Set the source and destination registers */
913e4a75 RA	193	BTE_PRINTKV(("IBSA = 0x%lx)\n", src));
	194	BTE_SRC_STORE(bte, src);
	195	BTE_PRINTKV(("IBDA = 0x%lx)\n", dest));
	196	BTE_DEST_STORE(bte, dest);
1da177e4 LT	197
1da177e4 LT	198	/* Set the notification register */
7e95b9d6 JS	199	BTE_PRINTKV(("IBNA = 0x%lx)\n", notif_phys_addr));
7e95b9d6 JS	200	BTE_NOTIF_STORE(bte, notif_phys_addr);
1da177e4 LT	201
	202	/* Initiate the transfer */
	203	BTE_PRINTK(("IBCT = 0x%lx)\n", BTE_VALID_MODE(mode)));
7e95b9d6	204	bte_start_transfer(bte, transfer_size, BTE_VALID_MODE(mode));
1da177e4 LT	205
	206	itc_end = ia64_get_itc() + (40000000 * local_cpu_data->cyc_per_usec);
	207
	208	spin_unlock_irqrestore(&bte->spinlock, irq_flags);
	209
	210	if (notification != NULL) {
	211	return BTE_SUCCESS;
	212	}
	213
	214	while ((transfer_stat = *bte->most_rcnt_na) == BTE_WORD_BUSY) {
68b9753f	215	cpu_relax();
1da177e4 LT	216	if (ia64_get_itc() > itc_end) {
	217	BTE_PRINTK(("BTE timeout nasid 0x%x bte%d IBLS = 0x%lx na 0x%lx\n",
	218	NASID_GET(bte->bte_base_addr), bte->bte_num,
	219	BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na) );
	220	bte->bte_error_count++;
	221	bte->bh_error = IBLS_ERROR;
2c513d4f	222	bte_error_handler(NODEPDA(bte->bte_cnode));
1da177e4 LT	223	*bte->most_rcnt_na = BTE_WORD_AVAILABLE;
	224	goto retry_bteop;
	225	}
	226	}
	227
	228	BTE_PRINTKV((" Delay Done. IBLS = 0x%lx, most_rcnt_na = 0x%lx\n",
	229	BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));
	230
	231	if (transfer_stat & IBLS_ERROR) {
64135fa9	232	bte_status = BTE_GET_ERROR_STATUS(transfer_stat);
1da177e4 LT	233	} else {
	234	bte_status = BTE_SUCCESS;
	235	}
	236	*bte->most_rcnt_na = BTE_WORD_AVAILABLE;
	237
	238	BTE_PRINTK(("Returning status is 0x%lx and most_rcnt_na is 0x%lx\n",
	239	BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));
	240
	241	return bte_status;
	242	}
	243
	244	EXPORT_SYMBOL(bte_copy);
	245
	246	/*
	247	* bte_unaligned_copy(src, dest, len, mode)
	248	*
	249	* use the block transfer engine to move kernel
	250	* memory from src to dest using the assigned mode.
	251	*
72fdbdce	252	* Parameters:
1da177e4 LT	253	* src - physical address of the transfer source.
	254	* dest - physical address of the transfer destination.
	255	* len - number of bytes to transfer from source to dest.
	256	* mode - hardware defined. See reference information
	257	* for IBCT0/1 in the SGI documentation.
	258	*
	259	* NOTE: If the source, dest, and len are all cache line aligned,
72fdbdce	260	* then it would be _FAR_ preferable to use bte_copy instead.
1da177e4 LT	261	*/
	262	bte_result_t bte_unaligned_copy(u64 src, u64 dest, u64 len, u64 mode)
	263	{
	264	int destFirstCacheOffset;
	265	u64 headBteSource;
	266	u64 headBteLen;
	267	u64 headBcopySrcOffset;
	268	u64 headBcopyDest;
	269	u64 headBcopyLen;
	270	u64 footBteSource;
	271	u64 footBteLen;
	272	u64 footBcopyDest;
	273	u64 footBcopyLen;
	274	bte_result_t rv;
	275	char bteBlock, bteBlock_unaligned;
	276
	277	if (len == 0) {
	278	return BTE_SUCCESS;
	279	}
	280
	281	/* temporary buffer used during unaligned transfers */
fd1dfc6f	282	bteBlock_unaligned = kmalloc(len + 3 * L1_CACHE_BYTES, GFP_KERNEL);
1da177e4 LT	283	if (bteBlock_unaligned == NULL) {
	284	return BTEFAIL_NOTAVAIL;
	285	}
	286	bteBlock = (char *)L1_CACHE_ALIGN((u64) bteBlock_unaligned);
	287
	288	headBcopySrcOffset = src & L1_CACHE_MASK;
	289	destFirstCacheOffset = dest & L1_CACHE_MASK;
	290
	291	/*
	292	* At this point, the transfer is broken into
	293	* (up to) three sections. The first section is
	294	* from the start address to the first physical
	295	* cache line, the second is from the first physical
	296	* cache line to the last complete cache line,
	297	* and the third is from the last cache line to the
	298	* end of the buffer. The first and third sections
	299	* are handled by bte copying into a temporary buffer
	300	* and then bcopy'ing the necessary section into the
	301	* final location. The middle section is handled with
	302	* a standard bte copy.
	303	*
	304	* One nasty exception to the above rule is when the
72fdbdce	305	* source and destination are not symmetrically
1da177e4 LT	306	* mis-aligned. If the source offset from the first
	307	* cache line is different from the destination offset,
	308	* we make the first section be the entire transfer
	309	* and the bcopy the entire block into place.
	310	*/
	311	if (headBcopySrcOffset == destFirstCacheOffset) {
	312
	313	/*
	314	* Both the source and destination are the same
	315	* distance from a cache line boundary so we can
	316	* use the bte to transfer the bulk of the
	317	* data.
	318	*/
	319	headBteSource = src & ~L1_CACHE_MASK;
	320	headBcopyDest = dest;
	321	if (headBcopySrcOffset) {
	322	headBcopyLen =
	323	(len >
	324	(L1_CACHE_BYTES -
	325	headBcopySrcOffset) ? L1_CACHE_BYTES
	326	- headBcopySrcOffset : len);
	327	headBteLen = L1_CACHE_BYTES;
	328	} else {
	329	headBcopyLen = 0;
	330	headBteLen = 0;
	331	}
	332
	333	if (len > headBcopyLen) {
	334	footBcopyLen = (len - headBcopyLen) & L1_CACHE_MASK;
	335	footBteLen = L1_CACHE_BYTES;
	336
	337	footBteSource = src + len - footBcopyLen;
	338	footBcopyDest = dest + len - footBcopyLen;
	339
	340	if (footBcopyDest == (headBcopyDest + headBcopyLen)) {
	341	/*
72fdbdce	342	* We have two contiguous bcopy
1da177e4 LT	343	* blocks. Merge them.
	344	*/
	345	headBcopyLen += footBcopyLen;
	346	headBteLen += footBteLen;
	347	} else if (footBcopyLen > 0) {
	348	rv = bte_copy(footBteSource,
	349	ia64_tpa((unsigned long)bteBlock),
	350	footBteLen, mode, NULL);
	351	if (rv != BTE_SUCCESS) {
	352	kfree(bteBlock_unaligned);
	353	return rv;
	354	}
	355
	356	memcpy(__va(footBcopyDest),
	357	(char *)bteBlock, footBcopyLen);
	358	}
	359	} else {
	360	footBcopyLen = 0;
	361	footBteLen = 0;
	362	}
	363
	364	if (len > (headBcopyLen + footBcopyLen)) {
	365	/* now transfer the middle. */
	366	rv = bte_copy((src + headBcopyLen),
	367	(dest +
	368	headBcopyLen),
	369	(len - headBcopyLen -
	370	footBcopyLen), mode, NULL);
	371	if (rv != BTE_SUCCESS) {
	372	kfree(bteBlock_unaligned);
	373	return rv;
	374	}
	375
	376	}
	377	} else {
	378
	379	/*
72fdbdce	380	* The transfer is not symmetric, we will
1da177e4 LT	381	* allocate a buffer large enough for all the
	382	* data, bte_copy into that buffer and then
	383	* bcopy to the destination.
	384	*/
	385
1da177e4 LT	386	headBcopySrcOffset = src & L1_CACHE_MASK;
	387	headBcopyDest = dest;
	388	headBcopyLen = len;
cbf093e8 RH	389
	390	headBteSource = src - headBcopySrcOffset;
	391	/* Add the leading and trailing bytes from source */
	392	headBteLen = L1_CACHE_ALIGN(len + headBcopySrcOffset);
1da177e4 LT	393	}
	394
	395	if (headBcopyLen > 0) {
	396	rv = bte_copy(headBteSource,
	397	ia64_tpa((unsigned long)bteBlock), headBteLen,
	398	mode, NULL);
	399	if (rv != BTE_SUCCESS) {
	400	kfree(bteBlock_unaligned);
	401	return rv;
	402	}
	403
	404	memcpy(__va(headBcopyDest), ((char *)bteBlock +
	405	headBcopySrcOffset), headBcopyLen);
	406	}
	407	kfree(bteBlock_unaligned);
	408	return BTE_SUCCESS;
	409	}
	410
	411	EXPORT_SYMBOL(bte_unaligned_copy);
	412
	413	/************************************************************************
	414	* Block Transfer Engine initialization functions.
	415	*
	416	***********************************************************************/
2c513d4f KC	417	static void bte_recovery_timeout(struct timer_list *t)
	418	{
	419	struct nodepda_s *nodepda = from_timer(nodepda, t, bte_recovery_timer);
	420
	421	bte_error_handler(nodepda);
	422	}
1da177e4 LT	423
	424	/*
	425	* bte_init_node(nodepda, cnode)
	426	*
	427	* Initialize the nodepda structure with BTE base addresses and
	428	* spinlocks.
	429	*/
	430	void bte_init_node(nodepda_t * mynodepda, cnodeid_t cnode)
	431	{
	432	int i;
	433
	434	/*
	435	* Indicate that all the block transfer engines on this node
	436	* are available.
	437	*/
	438
	439	/*
	440	* Allocate one bte_recover_t structure per node. It holds
	441	* the recovery lock for node. All the bte interface structures
	442	* will point at this one bte_recover structure to get the lock.
	443	*/
	444	spin_lock_init(&mynodepda->bte_recovery_lock);
2c513d4f	445	timer_setup(&mynodepda->bte_recovery_timer, bte_recovery_timeout, 0);
1da177e4 LT	446
1da177e4 LT	447	for (i = 0; i < BTES_PER_NODE; i++) {
95ff439a RA	448	u64 *base_addr;
95ff439a RA	449
1da177e4	450	/* Which link status register should we use? */
95ff439a RA	451	base_addr = (u64 *)
	452	REMOTE_HUB_ADDR(cnodeid_to_nasid(cnode), BTE_BASE_ADDR(i));
	453	mynodepda->bte_if[i].bte_base_addr = base_addr;
	454	mynodepda->bte_if[i].bte_source_addr = BTE_SOURCE_ADDR(base_addr);
	455	mynodepda->bte_if[i].bte_destination_addr = BTE_DEST_ADDR(base_addr);
	456	mynodepda->bte_if[i].bte_control_addr = BTE_CTRL_ADDR(base_addr);
	457	mynodepda->bte_if[i].bte_notify_addr = BTE_NOTIF_ADDR(base_addr);
1da177e4 LT	458
	459	/*
	460	* Initialize the notification and spinlock
	461	* so the first transfer can occur.
	462	*/
	463	mynodepda->bte_if[i].most_rcnt_na =
	464	&(mynodepda->bte_if[i].notify);
	465	mynodepda->bte_if[i].notify = BTE_WORD_AVAILABLE;
	466	spin_lock_init(&mynodepda->bte_if[i].spinlock);
	467
	468	mynodepda->bte_if[i].bte_cnode = cnode;
	469	mynodepda->bte_if[i].bte_error_count = 0;
	470	mynodepda->bte_if[i].bte_num = i;
	471	mynodepda->bte_if[i].cleanup_active = 0;
	472	mynodepda->bte_if[i].bh_error = 0;
	473	}
	474
	475	}