[net-next-2.6.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/bootmem.h>
#include <linux/string.h>
#include <linux/sched.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] = (int)NULL;
		}
	} 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] = (int)NULL;
		}
	}

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((unsigned long)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.
 *
 ***********************************************************************/

/*
 * 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);
	init_timer(&mynodepda->bte_recovery_timer);
	mynodepda->bte_recovery_timer.function = bte_error_handler;
	mynodepda->bte_recovery_timer.data = (unsigned long)mynodepda;

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