blob: 27dee4584061ffc918f1d9450262e7124ab8fee6 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
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 *
Russ Anderson913e4a72006-02-03 14:47:15 -06006 * Copyright (c) 2000-2006 Silicon Graphics, Inc. All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 */
8
Linus Torvalds1da177e2005-04-16 15:20:36 -07009#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
Jack Steiner7e95b9d62005-08-11 10:27:00 -070031#define MAX_NODES_TO_TRY 2
Linus Torvalds1da177e2005-04-16 15:20:36 -070032
33static struct bteinfo_s *bte_if_on_node(nasid_t nasid, int interface)
34{
35 nodepda_t *tmp_nodepda;
36
Jack Steiner7e95b9d62005-08-11 10:27:00 -070037 if (nasid_to_cnodeid(nasid) == -1)
Alexey Dobriyan53b35312006-03-24 03:16:13 -080038 return (struct bteinfo_s *)NULL;
Jack Steiner7e95b9d62005-08-11 10:27:00 -070039
Linus Torvalds1da177e2005-04-16 15:20:36 -070040 tmp_nodepda = NODEPDA(nasid_to_cnodeid(nasid));
41 return &tmp_nodepda->bte_if[interface];
42
43}
44
Jack Steiner7e95b9d62005-08-11 10:27:00 -070045static 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
Linus Torvalds1da177e2005-04-16 15:20:36 -070055/************************************************************************
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 *
66 * Paramaters:
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 */
79bte_result_t bte_copy(u64 src, u64 dest, u64 len, u64 mode, void *notification)
80{
81 u64 transfer_size;
82 u64 transfer_stat;
Jack Steiner7e95b9d62005-08-11 10:27:00 -070083 u64 notif_phys_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -070084 struct bteinfo_s *bte;
85 bte_result_t bte_status;
86 unsigned long irq_flags;
87 unsigned long itc_end = 0;
Jack Steiner7e95b9d62005-08-11 10:27:00 -070088 int nasid_to_try[MAX_NODES_TO_TRY];
Russ Andersone7f98db2005-10-25 17:34:19 -050089 int my_nasid = cpuid_to_nasid(raw_smp_processor_id());
Jack Steiner7e95b9d62005-08-11 10:27:00 -070090 int bte_if_index, nasid_index;
91 int bte_first, btes_per_node = BTES_PER_NODE;
Linus Torvalds1da177e2005-04-16 15:20:36 -070092
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
100 BUG_ON((len & L1_CACHE_MASK) ||
101 (src & L1_CACHE_MASK) || (dest & L1_CACHE_MASK));
102 BUG_ON(!(len < ((BTE_LEN_MASK + 1) << L1_CACHE_SHIFT)));
103
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700104 /*
105 * Start with interface corresponding to cpu number
106 */
Russ Andersond1e079b2005-08-15 14:46:00 -0700107 bte_first = raw_smp_processor_id() % btes_per_node;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700108
109 if (mode & BTE_USE_DEST) {
110 /* try remote then local */
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700111 nasid_to_try[0] = NASID_GET(dest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700112 if (mode & BTE_USE_ANY) {
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700113 nasid_to_try[1] = my_nasid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114 } else {
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700115 nasid_to_try[1] = (int)NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116 }
117 } else {
118 /* try local then remote */
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700119 nasid_to_try[0] = my_nasid;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120 if (mode & BTE_USE_ANY) {
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700121 nasid_to_try[1] = NASID_GET(dest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700122 } else {
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700123 nasid_to_try[1] = (int)NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124 }
125 }
126
127retry_bteop:
128 do {
129 local_irq_save(irq_flags);
130
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700131 bte_if_index = bte_first;
132 nasid_index = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133
134 /* Attempt to lock one of the BTE interfaces. */
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700135 while (nasid_index < MAX_NODES_TO_TRY) {
136 bte = bte_if_on_node(nasid_to_try[nasid_index],bte_if_index);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137
138 if (bte == NULL) {
Russ Andersonab2ff462005-11-11 16:52:02 -0600139 nasid_index++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700140 continue;
141 }
142
143 if (spin_trylock(&bte->spinlock)) {
144 if (!(*bte->most_rcnt_na & BTE_WORD_AVAILABLE) ||
145 (BTE_LNSTAT_LOAD(bte) & BTE_ACTIVE)) {
146 /* Got the lock but BTE still busy */
147 spin_unlock(&bte->spinlock);
148 } else {
149 /* we got the lock and it's not busy */
150 break;
151 }
152 }
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700153
154 bte_if_index = (bte_if_index + 1) % btes_per_node; /* Next interface */
155 if (bte_if_index == bte_first) {
156 /*
157 * We've tried all interfaces on this node
158 */
159 nasid_index++;
160 }
161
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162 bte = NULL;
163 }
164
165 if (bte != NULL) {
166 break;
167 }
168
169 local_irq_restore(irq_flags);
170
171 if (!(mode & BTE_WACQUIRE)) {
172 return BTEFAIL_NOTAVAIL;
173 }
174 } while (1);
175
176 if (notification == NULL) {
177 /* User does not want to be notified. */
178 bte->most_rcnt_na = &bte->notify;
179 } else {
180 bte->most_rcnt_na = notification;
181 }
182
183 /* Calculate the number of cache lines to transfer. */
184 transfer_size = ((len >> L1_CACHE_SHIFT) & BTE_LEN_MASK);
185
186 /* Initialize the notification to a known value. */
187 *bte->most_rcnt_na = BTE_WORD_BUSY;
Russ Anderson913e4a72006-02-03 14:47:15 -0600188 notif_phys_addr = (u64)bte->most_rcnt_na;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700189
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190 /* Set the source and destination registers */
Russ Anderson913e4a72006-02-03 14:47:15 -0600191 BTE_PRINTKV(("IBSA = 0x%lx)\n", src));
192 BTE_SRC_STORE(bte, src);
193 BTE_PRINTKV(("IBDA = 0x%lx)\n", dest));
194 BTE_DEST_STORE(bte, dest);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195
196 /* Set the notification register */
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700197 BTE_PRINTKV(("IBNA = 0x%lx)\n", notif_phys_addr));
198 BTE_NOTIF_STORE(bte, notif_phys_addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199
200 /* Initiate the transfer */
201 BTE_PRINTK(("IBCT = 0x%lx)\n", BTE_VALID_MODE(mode)));
Jack Steiner7e95b9d62005-08-11 10:27:00 -0700202 bte_start_transfer(bte, transfer_size, BTE_VALID_MODE(mode));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700203
204 itc_end = ia64_get_itc() + (40000000 * local_cpu_data->cyc_per_usec);
205
206 spin_unlock_irqrestore(&bte->spinlock, irq_flags);
207
208 if (notification != NULL) {
209 return BTE_SUCCESS;
210 }
211
212 while ((transfer_stat = *bte->most_rcnt_na) == BTE_WORD_BUSY) {
Jack Steiner68b97532005-08-11 10:28:00 -0700213 cpu_relax();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700214 if (ia64_get_itc() > itc_end) {
215 BTE_PRINTK(("BTE timeout nasid 0x%x bte%d IBLS = 0x%lx na 0x%lx\n",
216 NASID_GET(bte->bte_base_addr), bte->bte_num,
217 BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na) );
218 bte->bte_error_count++;
219 bte->bh_error = IBLS_ERROR;
220 bte_error_handler((unsigned long)NODEPDA(bte->bte_cnode));
221 *bte->most_rcnt_na = BTE_WORD_AVAILABLE;
222 goto retry_bteop;
223 }
224 }
225
226 BTE_PRINTKV((" Delay Done. IBLS = 0x%lx, most_rcnt_na = 0x%lx\n",
227 BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));
228
229 if (transfer_stat & IBLS_ERROR) {
230 bte_status = transfer_stat & ~IBLS_ERROR;
231 } else {
232 bte_status = BTE_SUCCESS;
233 }
234 *bte->most_rcnt_na = BTE_WORD_AVAILABLE;
235
236 BTE_PRINTK(("Returning status is 0x%lx and most_rcnt_na is 0x%lx\n",
237 BTE_LNSTAT_LOAD(bte), *bte->most_rcnt_na));
238
239 return bte_status;
240}
241
242EXPORT_SYMBOL(bte_copy);
243
244/*
245 * bte_unaligned_copy(src, dest, len, mode)
246 *
247 * use the block transfer engine to move kernel
248 * memory from src to dest using the assigned mode.
249 *
250 * Paramaters:
251 * src - physical address of the transfer source.
252 * dest - physical address of the transfer destination.
253 * len - number of bytes to transfer from source to dest.
254 * mode - hardware defined. See reference information
255 * for IBCT0/1 in the SGI documentation.
256 *
257 * NOTE: If the source, dest, and len are all cache line aligned,
258 * then it would be _FAR_ preferrable to use bte_copy instead.
259 */
260bte_result_t bte_unaligned_copy(u64 src, u64 dest, u64 len, u64 mode)
261{
262 int destFirstCacheOffset;
263 u64 headBteSource;
264 u64 headBteLen;
265 u64 headBcopySrcOffset;
266 u64 headBcopyDest;
267 u64 headBcopyLen;
268 u64 footBteSource;
269 u64 footBteLen;
270 u64 footBcopyDest;
271 u64 footBcopyLen;
272 bte_result_t rv;
273 char *bteBlock, *bteBlock_unaligned;
274
275 if (len == 0) {
276 return BTE_SUCCESS;
277 }
278
279 /* temporary buffer used during unaligned transfers */
280 bteBlock_unaligned = kmalloc(len + 3 * L1_CACHE_BYTES,
281 GFP_KERNEL | GFP_DMA);
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
304 * source and destination are not symetrically
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 /*
341 * We have two contigous bcopy
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 /*
379 * The transfer is not symetric, we will
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
385 /* Add the leader from source */
386 headBteLen = len + (src & L1_CACHE_MASK);
387 /* Add the trailing bytes from footer. */
388 headBteLen += L1_CACHE_BYTES - (headBteLen & L1_CACHE_MASK);
389 headBteSource = src & ~L1_CACHE_MASK;
390 headBcopySrcOffset = src & L1_CACHE_MASK;
391 headBcopyDest = dest;
392 headBcopyLen = len;
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
411EXPORT_SYMBOL(bte_unaligned_copy);
412
413/************************************************************************
414 * Block Transfer Engine initialization functions.
415 *
416 ***********************************************************************/
417
418/*
419 * bte_init_node(nodepda, cnode)
420 *
421 * Initialize the nodepda structure with BTE base addresses and
422 * spinlocks.
423 */
424void bte_init_node(nodepda_t * mynodepda, cnodeid_t cnode)
425{
426 int i;
427
428 /*
429 * Indicate that all the block transfer engines on this node
430 * are available.
431 */
432
433 /*
434 * Allocate one bte_recover_t structure per node. It holds
435 * the recovery lock for node. All the bte interface structures
436 * will point at this one bte_recover structure to get the lock.
437 */
438 spin_lock_init(&mynodepda->bte_recovery_lock);
439 init_timer(&mynodepda->bte_recovery_timer);
440 mynodepda->bte_recovery_timer.function = bte_error_handler;
441 mynodepda->bte_recovery_timer.data = (unsigned long)mynodepda;
442
443 for (i = 0; i < BTES_PER_NODE; i++) {
Russ Anderson95ff4392005-04-25 13:19:11 -0700444 u64 *base_addr;
445
Linus Torvalds1da177e2005-04-16 15:20:36 -0700446 /* Which link status register should we use? */
Russ Anderson95ff4392005-04-25 13:19:11 -0700447 base_addr = (u64 *)
448 REMOTE_HUB_ADDR(cnodeid_to_nasid(cnode), BTE_BASE_ADDR(i));
449 mynodepda->bte_if[i].bte_base_addr = base_addr;
450 mynodepda->bte_if[i].bte_source_addr = BTE_SOURCE_ADDR(base_addr);
451 mynodepda->bte_if[i].bte_destination_addr = BTE_DEST_ADDR(base_addr);
452 mynodepda->bte_if[i].bte_control_addr = BTE_CTRL_ADDR(base_addr);
453 mynodepda->bte_if[i].bte_notify_addr = BTE_NOTIF_ADDR(base_addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454
455 /*
456 * Initialize the notification and spinlock
457 * so the first transfer can occur.
458 */
459 mynodepda->bte_if[i].most_rcnt_na =
460 &(mynodepda->bte_if[i].notify);
461 mynodepda->bte_if[i].notify = BTE_WORD_AVAILABLE;
462 spin_lock_init(&mynodepda->bte_if[i].spinlock);
463
464 mynodepda->bte_if[i].bte_cnode = cnode;
465 mynodepda->bte_if[i].bte_error_count = 0;
466 mynodepda->bte_if[i].bte_num = i;
467 mynodepda->bte_if[i].cleanup_active = 0;
468 mynodepda->bte_if[i].bh_error = 0;
469 }
470
471}