1*4882a593Smuzhiyun /*
2*4882a593Smuzhiyun * Copyright (c) 2009 QLogic Corporation. All rights reserved.
3*4882a593Smuzhiyun *
4*4882a593Smuzhiyun * This software is available to you under a choice of one of two
5*4882a593Smuzhiyun * licenses. You may choose to be licensed under the terms of the GNU
6*4882a593Smuzhiyun * General Public License (GPL) Version 2, available from the file
7*4882a593Smuzhiyun * COPYING in the main directory of this source tree, or the
8*4882a593Smuzhiyun * OpenIB.org BSD license below:
9*4882a593Smuzhiyun *
10*4882a593Smuzhiyun * Redistribution and use in source and binary forms, with or
11*4882a593Smuzhiyun * without modification, are permitted provided that the following
12*4882a593Smuzhiyun * conditions are met:
13*4882a593Smuzhiyun *
14*4882a593Smuzhiyun * - Redistributions of source code must retain the above
15*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
16*4882a593Smuzhiyun * disclaimer.
17*4882a593Smuzhiyun *
18*4882a593Smuzhiyun * - Redistributions in binary form must reproduce the above
19*4882a593Smuzhiyun * copyright notice, this list of conditions and the following
20*4882a593Smuzhiyun * disclaimer in the documentation and/or other materials
21*4882a593Smuzhiyun * provided with the distribution.
22*4882a593Smuzhiyun *
23*4882a593Smuzhiyun * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24*4882a593Smuzhiyun * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25*4882a593Smuzhiyun * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26*4882a593Smuzhiyun * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27*4882a593Smuzhiyun * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28*4882a593Smuzhiyun * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29*4882a593Smuzhiyun * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
30*4882a593Smuzhiyun * SOFTWARE.
31*4882a593Smuzhiyun */
32*4882a593Smuzhiyun
33*4882a593Smuzhiyun #include "qib.h"
34*4882a593Smuzhiyun
35*4882a593Smuzhiyun /**
36*4882a593Smuzhiyun * qib_pio_copy - copy data to MMIO space, in multiples of 32-bits
37*4882a593Smuzhiyun * @to: destination, in MMIO space (must be 64-bit aligned)
38*4882a593Smuzhiyun * @from: source (must be 64-bit aligned)
39*4882a593Smuzhiyun * @count: number of 32-bit quantities to copy
40*4882a593Smuzhiyun *
41*4882a593Smuzhiyun * Copy data from kernel space to MMIO space, in multiples of 32 bits at a
42*4882a593Smuzhiyun * time. Order of access is not guaranteed, nor is a memory barrier
43*4882a593Smuzhiyun * performed afterwards.
44*4882a593Smuzhiyun */
qib_pio_copy(void __iomem * to,const void * from,size_t count)45*4882a593Smuzhiyun void qib_pio_copy(void __iomem *to, const void *from, size_t count)
46*4882a593Smuzhiyun {
47*4882a593Smuzhiyun #ifdef CONFIG_64BIT
48*4882a593Smuzhiyun u64 __iomem *dst = to;
49*4882a593Smuzhiyun const u64 *src = from;
50*4882a593Smuzhiyun const u64 *end = src + (count >> 1);
51*4882a593Smuzhiyun
52*4882a593Smuzhiyun while (src < end)
53*4882a593Smuzhiyun __raw_writeq(*src++, dst++);
54*4882a593Smuzhiyun if (count & 1)
55*4882a593Smuzhiyun __raw_writel(*(const u32 *)src, dst);
56*4882a593Smuzhiyun #else
57*4882a593Smuzhiyun u32 __iomem *dst = to;
58*4882a593Smuzhiyun const u32 *src = from;
59*4882a593Smuzhiyun const u32 *end = src + count;
60*4882a593Smuzhiyun
61*4882a593Smuzhiyun while (src < end)
62*4882a593Smuzhiyun __raw_writel(*src++, dst++);
63*4882a593Smuzhiyun #endif
64*4882a593Smuzhiyun }
65