diff options
Diffstat (limited to 'arch/s390/lib')
-rw-r--r-- | arch/s390/lib/Makefile | 3 | ||||
-rw-r--r-- | arch/s390/lib/div64.c | 147 | ||||
-rw-r--r-- | arch/s390/lib/mem32.S | 92 | ||||
-rw-r--r-- | arch/s390/lib/qrnnd.S | 78 | ||||
-rw-r--r-- | arch/s390/lib/uaccess.c | 136 | ||||
-rw-r--r-- | arch/s390/lib/ucmpdi2.c | 26 |
6 files changed, 62 insertions, 420 deletions
diff --git a/arch/s390/lib/Makefile b/arch/s390/lib/Makefile index a01df233856f..15536da68e18 100644 --- a/arch/s390/lib/Makefile +++ b/arch/s390/lib/Makefile | |||
@@ -3,8 +3,7 @@ | |||
3 | # | 3 | # |
4 | 4 | ||
5 | lib-y += delay.o string.o uaccess.o find.o | 5 | lib-y += delay.o string.o uaccess.o find.o |
6 | obj-$(CONFIG_32BIT) += div64.o qrnnd.o ucmpdi2.o mem32.o | 6 | obj-y += mem64.o |
7 | obj-$(CONFIG_64BIT) += mem64.o | ||
8 | lib-$(CONFIG_SMP) += spinlock.o | 7 | lib-$(CONFIG_SMP) += spinlock.o |
9 | lib-$(CONFIG_KPROBES) += probes.o | 8 | lib-$(CONFIG_KPROBES) += probes.o |
10 | lib-$(CONFIG_UPROBES) += probes.o | 9 | lib-$(CONFIG_UPROBES) += probes.o |
diff --git a/arch/s390/lib/div64.c b/arch/s390/lib/div64.c deleted file mode 100644 index 261152f83242..000000000000 --- a/arch/s390/lib/div64.c +++ /dev/null | |||
@@ -1,147 +0,0 @@ | |||
1 | /* | ||
2 | * __div64_32 implementation for 31 bit. | ||
3 | * | ||
4 | * Copyright IBM Corp. 2006 | ||
5 | * Author(s): Martin Schwidefsky (schwidefsky@de.ibm.com), | ||
6 | */ | ||
7 | |||
8 | #include <linux/types.h> | ||
9 | #include <linux/module.h> | ||
10 | |||
11 | #ifdef CONFIG_MARCH_G5 | ||
12 | |||
13 | /* | ||
14 | * Function to divide an unsigned 64 bit integer by an unsigned | ||
15 | * 31 bit integer using signed 64/32 bit division. | ||
16 | */ | ||
17 | static uint32_t __div64_31(uint64_t *n, uint32_t base) | ||
18 | { | ||
19 | register uint32_t reg2 asm("2"); | ||
20 | register uint32_t reg3 asm("3"); | ||
21 | uint32_t *words = (uint32_t *) n; | ||
22 | uint32_t tmp; | ||
23 | |||
24 | /* Special case base==1, remainder = 0, quotient = n */ | ||
25 | if (base == 1) | ||
26 | return 0; | ||
27 | /* | ||
28 | * Special case base==0 will cause a fixed point divide exception | ||
29 | * on the dr instruction and may not happen anyway. For the | ||
30 | * following calculation we can assume base > 1. The first | ||
31 | * signed 64 / 32 bit division with an upper half of 0 will | ||
32 | * give the correct upper half of the 64 bit quotient. | ||
33 | */ | ||
34 | reg2 = 0UL; | ||
35 | reg3 = words[0]; | ||
36 | asm volatile( | ||
37 | " dr %0,%2\n" | ||
38 | : "+d" (reg2), "+d" (reg3) : "d" (base) : "cc" ); | ||
39 | words[0] = reg3; | ||
40 | reg3 = words[1]; | ||
41 | /* | ||
42 | * To get the lower half of the 64 bit quotient and the 32 bit | ||
43 | * remainder we have to use a little trick. Since we only have | ||
44 | * a signed division the quotient can get too big. To avoid this | ||
45 | * the 64 bit dividend is halved, then the signed division will | ||
46 | * work. Afterwards the quotient and the remainder are doubled. | ||
47 | * If the last bit of the dividend has been one the remainder | ||
48 | * is increased by one then checked against the base. If the | ||
49 | * remainder has overflown subtract base and increase the | ||
50 | * quotient. Simple, no ? | ||
51 | */ | ||
52 | asm volatile( | ||
53 | " nr %2,%1\n" | ||
54 | " srdl %0,1\n" | ||
55 | " dr %0,%3\n" | ||
56 | " alr %0,%0\n" | ||
57 | " alr %1,%1\n" | ||
58 | " alr %0,%2\n" | ||
59 | " clr %0,%3\n" | ||
60 | " jl 0f\n" | ||
61 | " slr %0,%3\n" | ||
62 | " ahi %1,1\n" | ||
63 | "0:\n" | ||
64 | : "+d" (reg2), "+d" (reg3), "=d" (tmp) | ||
65 | : "d" (base), "2" (1UL) : "cc" ); | ||
66 | words[1] = reg3; | ||
67 | return reg2; | ||
68 | } | ||
69 | |||
70 | /* | ||
71 | * Function to divide an unsigned 64 bit integer by an unsigned | ||
72 | * 32 bit integer using the unsigned 64/31 bit division. | ||
73 | */ | ||
74 | uint32_t __div64_32(uint64_t *n, uint32_t base) | ||
75 | { | ||
76 | uint32_t r; | ||
77 | |||
78 | /* | ||
79 | * If the most significant bit of base is set, divide n by | ||
80 | * (base/2). That allows to use 64/31 bit division and gives a | ||
81 | * good approximation of the result: n = (base/2)*q + r. The | ||
82 | * result needs to be corrected with two simple transformations. | ||
83 | * If base is already < 2^31-1 __div64_31 can be used directly. | ||
84 | */ | ||
85 | r = __div64_31(n, ((signed) base < 0) ? (base/2) : base); | ||
86 | if ((signed) base < 0) { | ||
87 | uint64_t q = *n; | ||
88 | /* | ||
89 | * First transformation: | ||
90 | * n = (base/2)*q + r | ||
91 | * = ((base/2)*2)*(q/2) + ((q&1) ? (base/2) : 0) + r | ||
92 | * Since r < (base/2), r + (base/2) < base. | ||
93 | * With q1 = (q/2) and r1 = r + ((q&1) ? (base/2) : 0) | ||
94 | * n = ((base/2)*2)*q1 + r1 with r1 < base. | ||
95 | */ | ||
96 | if (q & 1) | ||
97 | r += base/2; | ||
98 | q >>= 1; | ||
99 | /* | ||
100 | * Second transformation. ((base/2)*2) could have lost the | ||
101 | * last bit. | ||
102 | * n = ((base/2)*2)*q1 + r1 | ||
103 | * = base*q1 - ((base&1) ? q1 : 0) + r1 | ||
104 | */ | ||
105 | if (base & 1) { | ||
106 | int64_t rx = r - q; | ||
107 | /* | ||
108 | * base is >= 2^31. The worst case for the while | ||
109 | * loop is n=2^64-1 base=2^31+1. That gives a | ||
110 | * maximum for q=(2^64-1)/2^31 = 0x1ffffffff. Since | ||
111 | * base >= 2^31 the loop is finished after a maximum | ||
112 | * of three iterations. | ||
113 | */ | ||
114 | while (rx < 0) { | ||
115 | rx += base; | ||
116 | q--; | ||
117 | } | ||
118 | r = rx; | ||
119 | } | ||
120 | *n = q; | ||
121 | } | ||
122 | return r; | ||
123 | } | ||
124 | |||
125 | #else /* MARCH_G5 */ | ||
126 | |||
127 | uint32_t __div64_32(uint64_t *n, uint32_t base) | ||
128 | { | ||
129 | register uint32_t reg2 asm("2"); | ||
130 | register uint32_t reg3 asm("3"); | ||
131 | uint32_t *words = (uint32_t *) n; | ||
132 | |||
133 | reg2 = 0UL; | ||
134 | reg3 = words[0]; | ||
135 | asm volatile( | ||
136 | " dlr %0,%2\n" | ||
137 | : "+d" (reg2), "+d" (reg3) : "d" (base) : "cc" ); | ||
138 | words[0] = reg3; | ||
139 | reg3 = words[1]; | ||
140 | asm volatile( | ||
141 | " dlr %0,%2\n" | ||
142 | : "+d" (reg2), "+d" (reg3) : "d" (base) : "cc" ); | ||
143 | words[1] = reg3; | ||
144 | return reg2; | ||
145 | } | ||
146 | |||
147 | #endif /* MARCH_G5 */ | ||
diff --git a/arch/s390/lib/mem32.S b/arch/s390/lib/mem32.S deleted file mode 100644 index 14ca9244b615..000000000000 --- a/arch/s390/lib/mem32.S +++ /dev/null | |||
@@ -1,92 +0,0 @@ | |||
1 | /* | ||
2 | * String handling functions. | ||
3 | * | ||
4 | * Copyright IBM Corp. 2012 | ||
5 | */ | ||
6 | |||
7 | #include <linux/linkage.h> | ||
8 | |||
9 | /* | ||
10 | * memset implementation | ||
11 | * | ||
12 | * This code corresponds to the C construct below. We do distinguish | ||
13 | * between clearing (c == 0) and setting a memory array (c != 0) simply | ||
14 | * because nearly all memset invocations in the kernel clear memory and | ||
15 | * the xc instruction is preferred in such cases. | ||
16 | * | ||
17 | * void *memset(void *s, int c, size_t n) | ||
18 | * { | ||
19 | * if (likely(c == 0)) | ||
20 | * return __builtin_memset(s, 0, n); | ||
21 | * return __builtin_memset(s, c, n); | ||
22 | * } | ||
23 | */ | ||
24 | ENTRY(memset) | ||
25 | basr %r5,%r0 | ||
26 | .Lmemset_base: | ||
27 | ltr %r4,%r4 | ||
28 | bzr %r14 | ||
29 | ltr %r3,%r3 | ||
30 | jnz .Lmemset_fill | ||
31 | ahi %r4,-1 | ||
32 | lr %r3,%r4 | ||
33 | srl %r3,8 | ||
34 | ltr %r3,%r3 | ||
35 | lr %r1,%r2 | ||
36 | je .Lmemset_clear_rest | ||
37 | .Lmemset_clear_loop: | ||
38 | xc 0(256,%r1),0(%r1) | ||
39 | la %r1,256(%r1) | ||
40 | brct %r3,.Lmemset_clear_loop | ||
41 | .Lmemset_clear_rest: | ||
42 | ex %r4,.Lmemset_xc-.Lmemset_base(%r5) | ||
43 | br %r14 | ||
44 | .Lmemset_fill: | ||
45 | stc %r3,0(%r2) | ||
46 | chi %r4,1 | ||
47 | lr %r1,%r2 | ||
48 | ber %r14 | ||
49 | ahi %r4,-2 | ||
50 | lr %r3,%r4 | ||
51 | srl %r3,8 | ||
52 | ltr %r3,%r3 | ||
53 | je .Lmemset_fill_rest | ||
54 | .Lmemset_fill_loop: | ||
55 | mvc 1(256,%r1),0(%r1) | ||
56 | la %r1,256(%r1) | ||
57 | brct %r3,.Lmemset_fill_loop | ||
58 | .Lmemset_fill_rest: | ||
59 | ex %r4,.Lmemset_mvc-.Lmemset_base(%r5) | ||
60 | br %r14 | ||
61 | .Lmemset_xc: | ||
62 | xc 0(1,%r1),0(%r1) | ||
63 | .Lmemset_mvc: | ||
64 | mvc 1(1,%r1),0(%r1) | ||
65 | |||
66 | /* | ||
67 | * memcpy implementation | ||
68 | * | ||
69 | * void *memcpy(void *dest, const void *src, size_t n) | ||
70 | */ | ||
71 | ENTRY(memcpy) | ||
72 | basr %r5,%r0 | ||
73 | .Lmemcpy_base: | ||
74 | ltr %r4,%r4 | ||
75 | bzr %r14 | ||
76 | ahi %r4,-1 | ||
77 | lr %r0,%r4 | ||
78 | srl %r0,8 | ||
79 | ltr %r0,%r0 | ||
80 | lr %r1,%r2 | ||
81 | jnz .Lmemcpy_loop | ||
82 | .Lmemcpy_rest: | ||
83 | ex %r4,.Lmemcpy_mvc-.Lmemcpy_base(%r5) | ||
84 | br %r14 | ||
85 | .Lmemcpy_loop: | ||
86 | mvc 0(256,%r1),0(%r3) | ||
87 | la %r1,256(%r1) | ||
88 | la %r3,256(%r3) | ||
89 | brct %r0,.Lmemcpy_loop | ||
90 | j .Lmemcpy_rest | ||
91 | .Lmemcpy_mvc: | ||
92 | mvc 0(1,%r1),0(%r3) | ||
diff --git a/arch/s390/lib/qrnnd.S b/arch/s390/lib/qrnnd.S deleted file mode 100644 index d321329130ec..000000000000 --- a/arch/s390/lib/qrnnd.S +++ /dev/null | |||
@@ -1,78 +0,0 @@ | |||
1 | # S/390 __udiv_qrnnd | ||
2 | |||
3 | #include <linux/linkage.h> | ||
4 | |||
5 | # r2 : &__r | ||
6 | # r3 : upper half of 64 bit word n | ||
7 | # r4 : lower half of 64 bit word n | ||
8 | # r5 : divisor d | ||
9 | # the reminder r of the division is to be stored to &__r and | ||
10 | # the quotient q is to be returned | ||
11 | |||
12 | .text | ||
13 | ENTRY(__udiv_qrnnd) | ||
14 | st %r2,24(%r15) # store pointer to reminder for later | ||
15 | lr %r0,%r3 # reload n | ||
16 | lr %r1,%r4 | ||
17 | ltr %r2,%r5 # reload and test divisor | ||
18 | jp 5f | ||
19 | # divisor >= 0x80000000 | ||
20 | srdl %r0,2 # n/4 | ||
21 | srl %r2,1 # d/2 | ||
22 | slr %r1,%r2 # special case if last bit of d is set | ||
23 | brc 3,0f # (n/4) div (n/2) can overflow by 1 | ||
24 | ahi %r0,-1 # trick: subtract n/2, then divide | ||
25 | 0: dr %r0,%r2 # signed division | ||
26 | ahi %r1,1 # trick part 2: add 1 to the quotient | ||
27 | # now (n >> 2) = (d >> 1) * %r1 + %r0 | ||
28 | lhi %r3,1 | ||
29 | nr %r3,%r1 # test last bit of q | ||
30 | jz 1f | ||
31 | alr %r0,%r2 # add (d>>1) to r | ||
32 | 1: srl %r1,1 # q >>= 1 | ||
33 | # now (n >> 2) = (d&-2) * %r1 + %r0 | ||
34 | lhi %r3,1 | ||
35 | nr %r3,%r5 # test last bit of d | ||
36 | jz 2f | ||
37 | slr %r0,%r1 # r -= q | ||
38 | brc 3,2f # borrow ? | ||
39 | alr %r0,%r5 # r += d | ||
40 | ahi %r1,-1 | ||
41 | 2: # now (n >> 2) = d * %r1 + %r0 | ||
42 | alr %r1,%r1 # q <<= 1 | ||
43 | alr %r0,%r0 # r <<= 1 | ||
44 | brc 12,3f # overflow on r ? | ||
45 | slr %r0,%r5 # r -= d | ||
46 | ahi %r1,1 # q += 1 | ||
47 | 3: lhi %r3,2 | ||
48 | nr %r3,%r4 # test next to last bit of n | ||
49 | jz 4f | ||
50 | ahi %r0,1 # r += 1 | ||
51 | 4: clr %r0,%r5 # r >= d ? | ||
52 | jl 6f | ||
53 | slr %r0,%r5 # r -= d | ||
54 | ahi %r1,1 # q += 1 | ||
55 | # now (n >> 1) = d * %r1 + %r0 | ||
56 | j 6f | ||
57 | 5: # divisor < 0x80000000 | ||
58 | srdl %r0,1 | ||
59 | dr %r0,%r2 # signed division | ||
60 | # now (n >> 1) = d * %r1 + %r0 | ||
61 | 6: alr %r1,%r1 # q <<= 1 | ||
62 | alr %r0,%r0 # r <<= 1 | ||
63 | brc 12,7f # overflow on r ? | ||
64 | slr %r0,%r5 # r -= d | ||
65 | ahi %r1,1 # q += 1 | ||
66 | 7: lhi %r3,1 | ||
67 | nr %r3,%r4 # isolate last bit of n | ||
68 | alr %r0,%r3 # r += (n & 1) | ||
69 | clr %r0,%r5 # r >= d ? | ||
70 | jl 8f | ||
71 | slr %r0,%r5 # r -= d | ||
72 | ahi %r1,1 # q += 1 | ||
73 | 8: # now n = d * %r1 + %r0 | ||
74 | l %r2,24(%r15) | ||
75 | st %r0,0(%r2) | ||
76 | lr %r2,%r1 | ||
77 | br %r14 | ||
78 | .end __udiv_qrnnd | ||
diff --git a/arch/s390/lib/uaccess.c b/arch/s390/lib/uaccess.c index 53dd5d7a0c96..4614d415bb58 100644 --- a/arch/s390/lib/uaccess.c +++ b/arch/s390/lib/uaccess.c | |||
@@ -15,20 +15,6 @@ | |||
15 | #include <asm/mmu_context.h> | 15 | #include <asm/mmu_context.h> |
16 | #include <asm/facility.h> | 16 | #include <asm/facility.h> |
17 | 17 | ||
18 | #ifndef CONFIG_64BIT | ||
19 | #define AHI "ahi" | ||
20 | #define ALR "alr" | ||
21 | #define CLR "clr" | ||
22 | #define LHI "lhi" | ||
23 | #define SLR "slr" | ||
24 | #else | ||
25 | #define AHI "aghi" | ||
26 | #define ALR "algr" | ||
27 | #define CLR "clgr" | ||
28 | #define LHI "lghi" | ||
29 | #define SLR "slgr" | ||
30 | #endif | ||
31 | |||
32 | static struct static_key have_mvcos = STATIC_KEY_INIT_FALSE; | 18 | static struct static_key have_mvcos = STATIC_KEY_INIT_FALSE; |
33 | 19 | ||
34 | static inline unsigned long copy_from_user_mvcos(void *x, const void __user *ptr, | 20 | static inline unsigned long copy_from_user_mvcos(void *x, const void __user *ptr, |
@@ -41,29 +27,29 @@ static inline unsigned long copy_from_user_mvcos(void *x, const void __user *ptr | |||
41 | asm volatile( | 27 | asm volatile( |
42 | "0: .insn ss,0xc80000000000,0(%0,%2),0(%1),0\n" | 28 | "0: .insn ss,0xc80000000000,0(%0,%2),0(%1),0\n" |
43 | "9: jz 7f\n" | 29 | "9: jz 7f\n" |
44 | "1:"ALR" %0,%3\n" | 30 | "1: algr %0,%3\n" |
45 | " "SLR" %1,%3\n" | 31 | " slgr %1,%3\n" |
46 | " "SLR" %2,%3\n" | 32 | " slgr %2,%3\n" |
47 | " j 0b\n" | 33 | " j 0b\n" |
48 | "2: la %4,4095(%1)\n"/* %4 = ptr + 4095 */ | 34 | "2: la %4,4095(%1)\n"/* %4 = ptr + 4095 */ |
49 | " nr %4,%3\n" /* %4 = (ptr + 4095) & -4096 */ | 35 | " nr %4,%3\n" /* %4 = (ptr + 4095) & -4096 */ |
50 | " "SLR" %4,%1\n" | 36 | " slgr %4,%1\n" |
51 | " "CLR" %0,%4\n" /* copy crosses next page boundary? */ | 37 | " clgr %0,%4\n" /* copy crosses next page boundary? */ |
52 | " jnh 4f\n" | 38 | " jnh 4f\n" |
53 | "3: .insn ss,0xc80000000000,0(%4,%2),0(%1),0\n" | 39 | "3: .insn ss,0xc80000000000,0(%4,%2),0(%1),0\n" |
54 | "10:"SLR" %0,%4\n" | 40 | "10:slgr %0,%4\n" |
55 | " "ALR" %2,%4\n" | 41 | " algr %2,%4\n" |
56 | "4:"LHI" %4,-1\n" | 42 | "4: lghi %4,-1\n" |
57 | " "ALR" %4,%0\n" /* copy remaining size, subtract 1 */ | 43 | " algr %4,%0\n" /* copy remaining size, subtract 1 */ |
58 | " bras %3,6f\n" /* memset loop */ | 44 | " bras %3,6f\n" /* memset loop */ |
59 | " xc 0(1,%2),0(%2)\n" | 45 | " xc 0(1,%2),0(%2)\n" |
60 | "5: xc 0(256,%2),0(%2)\n" | 46 | "5: xc 0(256,%2),0(%2)\n" |
61 | " la %2,256(%2)\n" | 47 | " la %2,256(%2)\n" |
62 | "6:"AHI" %4,-256\n" | 48 | "6: aghi %4,-256\n" |
63 | " jnm 5b\n" | 49 | " jnm 5b\n" |
64 | " ex %4,0(%3)\n" | 50 | " ex %4,0(%3)\n" |
65 | " j 8f\n" | 51 | " j 8f\n" |
66 | "7:"SLR" %0,%0\n" | 52 | "7:slgr %0,%0\n" |
67 | "8:\n" | 53 | "8:\n" |
68 | EX_TABLE(0b,2b) EX_TABLE(3b,4b) EX_TABLE(9b,2b) EX_TABLE(10b,4b) | 54 | EX_TABLE(0b,2b) EX_TABLE(3b,4b) EX_TABLE(9b,2b) EX_TABLE(10b,4b) |
69 | : "+a" (size), "+a" (ptr), "+a" (x), "+a" (tmp1), "=a" (tmp2) | 55 | : "+a" (size), "+a" (ptr), "+a" (x), "+a" (tmp1), "=a" (tmp2) |
@@ -82,32 +68,32 @@ static inline unsigned long copy_from_user_mvcp(void *x, const void __user *ptr, | |||
82 | " sacf 0\n" | 68 | " sacf 0\n" |
83 | "0: mvcp 0(%0,%2),0(%1),%3\n" | 69 | "0: mvcp 0(%0,%2),0(%1),%3\n" |
84 | "10:jz 8f\n" | 70 | "10:jz 8f\n" |
85 | "1:"ALR" %0,%3\n" | 71 | "1: algr %0,%3\n" |
86 | " la %1,256(%1)\n" | 72 | " la %1,256(%1)\n" |
87 | " la %2,256(%2)\n" | 73 | " la %2,256(%2)\n" |
88 | "2: mvcp 0(%0,%2),0(%1),%3\n" | 74 | "2: mvcp 0(%0,%2),0(%1),%3\n" |
89 | "11:jnz 1b\n" | 75 | "11:jnz 1b\n" |
90 | " j 8f\n" | 76 | " j 8f\n" |
91 | "3: la %4,255(%1)\n" /* %4 = ptr + 255 */ | 77 | "3: la %4,255(%1)\n" /* %4 = ptr + 255 */ |
92 | " "LHI" %3,-4096\n" | 78 | " lghi %3,-4096\n" |
93 | " nr %4,%3\n" /* %4 = (ptr + 255) & -4096 */ | 79 | " nr %4,%3\n" /* %4 = (ptr + 255) & -4096 */ |
94 | " "SLR" %4,%1\n" | 80 | " slgr %4,%1\n" |
95 | " "CLR" %0,%4\n" /* copy crosses next page boundary? */ | 81 | " clgr %0,%4\n" /* copy crosses next page boundary? */ |
96 | " jnh 5f\n" | 82 | " jnh 5f\n" |
97 | "4: mvcp 0(%4,%2),0(%1),%3\n" | 83 | "4: mvcp 0(%4,%2),0(%1),%3\n" |
98 | "12:"SLR" %0,%4\n" | 84 | "12:slgr %0,%4\n" |
99 | " "ALR" %2,%4\n" | 85 | " algr %2,%4\n" |
100 | "5:"LHI" %4,-1\n" | 86 | "5: lghi %4,-1\n" |
101 | " "ALR" %4,%0\n" /* copy remaining size, subtract 1 */ | 87 | " algr %4,%0\n" /* copy remaining size, subtract 1 */ |
102 | " bras %3,7f\n" /* memset loop */ | 88 | " bras %3,7f\n" /* memset loop */ |
103 | " xc 0(1,%2),0(%2)\n" | 89 | " xc 0(1,%2),0(%2)\n" |
104 | "6: xc 0(256,%2),0(%2)\n" | 90 | "6: xc 0(256,%2),0(%2)\n" |
105 | " la %2,256(%2)\n" | 91 | " la %2,256(%2)\n" |
106 | "7:"AHI" %4,-256\n" | 92 | "7: aghi %4,-256\n" |
107 | " jnm 6b\n" | 93 | " jnm 6b\n" |
108 | " ex %4,0(%3)\n" | 94 | " ex %4,0(%3)\n" |
109 | " j 9f\n" | 95 | " j 9f\n" |
110 | "8:"SLR" %0,%0\n" | 96 | "8:slgr %0,%0\n" |
111 | "9: sacf 768\n" | 97 | "9: sacf 768\n" |
112 | EX_TABLE(0b,3b) EX_TABLE(2b,3b) EX_TABLE(4b,5b) | 98 | EX_TABLE(0b,3b) EX_TABLE(2b,3b) EX_TABLE(4b,5b) |
113 | EX_TABLE(10b,3b) EX_TABLE(11b,3b) EX_TABLE(12b,5b) | 99 | EX_TABLE(10b,3b) EX_TABLE(11b,3b) EX_TABLE(12b,5b) |
@@ -134,19 +120,19 @@ static inline unsigned long copy_to_user_mvcos(void __user *ptr, const void *x, | |||
134 | asm volatile( | 120 | asm volatile( |
135 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%2),0\n" | 121 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%2),0\n" |
136 | "6: jz 4f\n" | 122 | "6: jz 4f\n" |
137 | "1:"ALR" %0,%3\n" | 123 | "1: algr %0,%3\n" |
138 | " "SLR" %1,%3\n" | 124 | " slgr %1,%3\n" |
139 | " "SLR" %2,%3\n" | 125 | " slgr %2,%3\n" |
140 | " j 0b\n" | 126 | " j 0b\n" |
141 | "2: la %4,4095(%1)\n"/* %4 = ptr + 4095 */ | 127 | "2: la %4,4095(%1)\n"/* %4 = ptr + 4095 */ |
142 | " nr %4,%3\n" /* %4 = (ptr + 4095) & -4096 */ | 128 | " nr %4,%3\n" /* %4 = (ptr + 4095) & -4096 */ |
143 | " "SLR" %4,%1\n" | 129 | " slgr %4,%1\n" |
144 | " "CLR" %0,%4\n" /* copy crosses next page boundary? */ | 130 | " clgr %0,%4\n" /* copy crosses next page boundary? */ |
145 | " jnh 5f\n" | 131 | " jnh 5f\n" |
146 | "3: .insn ss,0xc80000000000,0(%4,%1),0(%2),0\n" | 132 | "3: .insn ss,0xc80000000000,0(%4,%1),0(%2),0\n" |
147 | "7:"SLR" %0,%4\n" | 133 | "7: slgr %0,%4\n" |
148 | " j 5f\n" | 134 | " j 5f\n" |
149 | "4:"SLR" %0,%0\n" | 135 | "4: slgr %0,%0\n" |
150 | "5:\n" | 136 | "5:\n" |
151 | EX_TABLE(0b,2b) EX_TABLE(3b,5b) EX_TABLE(6b,2b) EX_TABLE(7b,5b) | 137 | EX_TABLE(0b,2b) EX_TABLE(3b,5b) EX_TABLE(6b,2b) EX_TABLE(7b,5b) |
152 | : "+a" (size), "+a" (ptr), "+a" (x), "+a" (tmp1), "=a" (tmp2) | 138 | : "+a" (size), "+a" (ptr), "+a" (x), "+a" (tmp1), "=a" (tmp2) |
@@ -165,22 +151,22 @@ static inline unsigned long copy_to_user_mvcs(void __user *ptr, const void *x, | |||
165 | " sacf 0\n" | 151 | " sacf 0\n" |
166 | "0: mvcs 0(%0,%1),0(%2),%3\n" | 152 | "0: mvcs 0(%0,%1),0(%2),%3\n" |
167 | "7: jz 5f\n" | 153 | "7: jz 5f\n" |
168 | "1:"ALR" %0,%3\n" | 154 | "1: algr %0,%3\n" |
169 | " la %1,256(%1)\n" | 155 | " la %1,256(%1)\n" |
170 | " la %2,256(%2)\n" | 156 | " la %2,256(%2)\n" |
171 | "2: mvcs 0(%0,%1),0(%2),%3\n" | 157 | "2: mvcs 0(%0,%1),0(%2),%3\n" |
172 | "8: jnz 1b\n" | 158 | "8: jnz 1b\n" |
173 | " j 5f\n" | 159 | " j 5f\n" |
174 | "3: la %4,255(%1)\n" /* %4 = ptr + 255 */ | 160 | "3: la %4,255(%1)\n" /* %4 = ptr + 255 */ |
175 | " "LHI" %3,-4096\n" | 161 | " lghi %3,-4096\n" |
176 | " nr %4,%3\n" /* %4 = (ptr + 255) & -4096 */ | 162 | " nr %4,%3\n" /* %4 = (ptr + 255) & -4096 */ |
177 | " "SLR" %4,%1\n" | 163 | " slgr %4,%1\n" |
178 | " "CLR" %0,%4\n" /* copy crosses next page boundary? */ | 164 | " clgr %0,%4\n" /* copy crosses next page boundary? */ |
179 | " jnh 6f\n" | 165 | " jnh 6f\n" |
180 | "4: mvcs 0(%4,%1),0(%2),%3\n" | 166 | "4: mvcs 0(%4,%1),0(%2),%3\n" |
181 | "9:"SLR" %0,%4\n" | 167 | "9: slgr %0,%4\n" |
182 | " j 6f\n" | 168 | " j 6f\n" |
183 | "5:"SLR" %0,%0\n" | 169 | "5: slgr %0,%0\n" |
184 | "6: sacf 768\n" | 170 | "6: sacf 768\n" |
185 | EX_TABLE(0b,3b) EX_TABLE(2b,3b) EX_TABLE(4b,6b) | 171 | EX_TABLE(0b,3b) EX_TABLE(2b,3b) EX_TABLE(4b,6b) |
186 | EX_TABLE(7b,3b) EX_TABLE(8b,3b) EX_TABLE(9b,6b) | 172 | EX_TABLE(7b,3b) EX_TABLE(8b,3b) EX_TABLE(9b,6b) |
@@ -208,11 +194,11 @@ static inline unsigned long copy_in_user_mvcos(void __user *to, const void __use | |||
208 | asm volatile( | 194 | asm volatile( |
209 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%2),0\n" | 195 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%2),0\n" |
210 | " jz 2f\n" | 196 | " jz 2f\n" |
211 | "1:"ALR" %0,%3\n" | 197 | "1: algr %0,%3\n" |
212 | " "SLR" %1,%3\n" | 198 | " slgr %1,%3\n" |
213 | " "SLR" %2,%3\n" | 199 | " slgr %2,%3\n" |
214 | " j 0b\n" | 200 | " j 0b\n" |
215 | "2:"SLR" %0,%0\n" | 201 | "2:slgr %0,%0\n" |
216 | "3: \n" | 202 | "3: \n" |
217 | EX_TABLE(0b,3b) | 203 | EX_TABLE(0b,3b) |
218 | : "+a" (size), "+a" (to), "+a" (from), "+a" (tmp1), "=a" (tmp2) | 204 | : "+a" (size), "+a" (to), "+a" (from), "+a" (tmp1), "=a" (tmp2) |
@@ -228,23 +214,23 @@ static inline unsigned long copy_in_user_mvc(void __user *to, const void __user | |||
228 | load_kernel_asce(); | 214 | load_kernel_asce(); |
229 | asm volatile( | 215 | asm volatile( |
230 | " sacf 256\n" | 216 | " sacf 256\n" |
231 | " "AHI" %0,-1\n" | 217 | " aghi %0,-1\n" |
232 | " jo 5f\n" | 218 | " jo 5f\n" |
233 | " bras %3,3f\n" | 219 | " bras %3,3f\n" |
234 | "0:"AHI" %0,257\n" | 220 | "0: aghi %0,257\n" |
235 | "1: mvc 0(1,%1),0(%2)\n" | 221 | "1: mvc 0(1,%1),0(%2)\n" |
236 | " la %1,1(%1)\n" | 222 | " la %1,1(%1)\n" |
237 | " la %2,1(%2)\n" | 223 | " la %2,1(%2)\n" |
238 | " "AHI" %0,-1\n" | 224 | " aghi %0,-1\n" |
239 | " jnz 1b\n" | 225 | " jnz 1b\n" |
240 | " j 5f\n" | 226 | " j 5f\n" |
241 | "2: mvc 0(256,%1),0(%2)\n" | 227 | "2: mvc 0(256,%1),0(%2)\n" |
242 | " la %1,256(%1)\n" | 228 | " la %1,256(%1)\n" |
243 | " la %2,256(%2)\n" | 229 | " la %2,256(%2)\n" |
244 | "3:"AHI" %0,-256\n" | 230 | "3: aghi %0,-256\n" |
245 | " jnm 2b\n" | 231 | " jnm 2b\n" |
246 | "4: ex %0,1b-0b(%3)\n" | 232 | "4: ex %0,1b-0b(%3)\n" |
247 | "5: "SLR" %0,%0\n" | 233 | "5: slgr %0,%0\n" |
248 | "6: sacf 768\n" | 234 | "6: sacf 768\n" |
249 | EX_TABLE(1b,6b) EX_TABLE(2b,0b) EX_TABLE(4b,0b) | 235 | EX_TABLE(1b,6b) EX_TABLE(2b,0b) EX_TABLE(4b,0b) |
250 | : "+a" (size), "+a" (to), "+a" (from), "=a" (tmp1) | 236 | : "+a" (size), "+a" (to), "+a" (from), "=a" (tmp1) |
@@ -269,18 +255,18 @@ static inline unsigned long clear_user_mvcos(void __user *to, unsigned long size | |||
269 | asm volatile( | 255 | asm volatile( |
270 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%4),0\n" | 256 | "0: .insn ss,0xc80000000000,0(%0,%1),0(%4),0\n" |
271 | " jz 4f\n" | 257 | " jz 4f\n" |
272 | "1:"ALR" %0,%2\n" | 258 | "1: algr %0,%2\n" |
273 | " "SLR" %1,%2\n" | 259 | " slgr %1,%2\n" |
274 | " j 0b\n" | 260 | " j 0b\n" |
275 | "2: la %3,4095(%1)\n"/* %4 = to + 4095 */ | 261 | "2: la %3,4095(%1)\n"/* %4 = to + 4095 */ |
276 | " nr %3,%2\n" /* %4 = (to + 4095) & -4096 */ | 262 | " nr %3,%2\n" /* %4 = (to + 4095) & -4096 */ |
277 | " "SLR" %3,%1\n" | 263 | " slgr %3,%1\n" |
278 | " "CLR" %0,%3\n" /* copy crosses next page boundary? */ | 264 | " clgr %0,%3\n" /* copy crosses next page boundary? */ |
279 | " jnh 5f\n" | 265 | " jnh 5f\n" |
280 | "3: .insn ss,0xc80000000000,0(%3,%1),0(%4),0\n" | 266 | "3: .insn ss,0xc80000000000,0(%3,%1),0(%4),0\n" |
281 | " "SLR" %0,%3\n" | 267 | " slgr %0,%3\n" |
282 | " j 5f\n" | 268 | " j 5f\n" |
283 | "4:"SLR" %0,%0\n" | 269 | "4:slgr %0,%0\n" |
284 | "5:\n" | 270 | "5:\n" |
285 | EX_TABLE(0b,2b) EX_TABLE(3b,5b) | 271 | EX_TABLE(0b,2b) EX_TABLE(3b,5b) |
286 | : "+a" (size), "+a" (to), "+a" (tmp1), "=a" (tmp2) | 272 | : "+a" (size), "+a" (to), "+a" (tmp1), "=a" (tmp2) |
@@ -295,28 +281,28 @@ static inline unsigned long clear_user_xc(void __user *to, unsigned long size) | |||
295 | load_kernel_asce(); | 281 | load_kernel_asce(); |
296 | asm volatile( | 282 | asm volatile( |
297 | " sacf 256\n" | 283 | " sacf 256\n" |
298 | " "AHI" %0,-1\n" | 284 | " aghi %0,-1\n" |
299 | " jo 5f\n" | 285 | " jo 5f\n" |
300 | " bras %3,3f\n" | 286 | " bras %3,3f\n" |
301 | " xc 0(1,%1),0(%1)\n" | 287 | " xc 0(1,%1),0(%1)\n" |
302 | "0:"AHI" %0,257\n" | 288 | "0: aghi %0,257\n" |
303 | " la %2,255(%1)\n" /* %2 = ptr + 255 */ | 289 | " la %2,255(%1)\n" /* %2 = ptr + 255 */ |
304 | " srl %2,12\n" | 290 | " srl %2,12\n" |
305 | " sll %2,12\n" /* %2 = (ptr + 255) & -4096 */ | 291 | " sll %2,12\n" /* %2 = (ptr + 255) & -4096 */ |
306 | " "SLR" %2,%1\n" | 292 | " slgr %2,%1\n" |
307 | " "CLR" %0,%2\n" /* clear crosses next page boundary? */ | 293 | " clgr %0,%2\n" /* clear crosses next page boundary? */ |
308 | " jnh 5f\n" | 294 | " jnh 5f\n" |
309 | " "AHI" %2,-1\n" | 295 | " aghi %2,-1\n" |
310 | "1: ex %2,0(%3)\n" | 296 | "1: ex %2,0(%3)\n" |
311 | " "AHI" %2,1\n" | 297 | " aghi %2,1\n" |
312 | " "SLR" %0,%2\n" | 298 | " slgr %0,%2\n" |
313 | " j 5f\n" | 299 | " j 5f\n" |
314 | "2: xc 0(256,%1),0(%1)\n" | 300 | "2: xc 0(256,%1),0(%1)\n" |
315 | " la %1,256(%1)\n" | 301 | " la %1,256(%1)\n" |
316 | "3:"AHI" %0,-256\n" | 302 | "3: aghi %0,-256\n" |
317 | " jnm 2b\n" | 303 | " jnm 2b\n" |
318 | "4: ex %0,0(%3)\n" | 304 | "4: ex %0,0(%3)\n" |
319 | "5: "SLR" %0,%0\n" | 305 | "5: slgr %0,%0\n" |
320 | "6: sacf 768\n" | 306 | "6: sacf 768\n" |
321 | EX_TABLE(1b,6b) EX_TABLE(2b,0b) EX_TABLE(4b,0b) | 307 | EX_TABLE(1b,6b) EX_TABLE(2b,0b) EX_TABLE(4b,0b) |
322 | : "+a" (size), "+a" (to), "=a" (tmp1), "=a" (tmp2) | 308 | : "+a" (size), "+a" (to), "=a" (tmp1), "=a" (tmp2) |
@@ -341,12 +327,12 @@ static inline unsigned long strnlen_user_srst(const char __user *src, | |||
341 | asm volatile( | 327 | asm volatile( |
342 | " la %2,0(%1)\n" | 328 | " la %2,0(%1)\n" |
343 | " la %3,0(%0,%1)\n" | 329 | " la %3,0(%0,%1)\n" |
344 | " "SLR" %0,%0\n" | 330 | " slgr %0,%0\n" |
345 | " sacf 256\n" | 331 | " sacf 256\n" |
346 | "0: srst %3,%2\n" | 332 | "0: srst %3,%2\n" |
347 | " jo 0b\n" | 333 | " jo 0b\n" |
348 | " la %0,1(%3)\n" /* strnlen_user results includes \0 */ | 334 | " la %0,1(%3)\n" /* strnlen_user results includes \0 */ |
349 | " "SLR" %0,%1\n" | 335 | " slgr %0,%1\n" |
350 | "1: sacf 768\n" | 336 | "1: sacf 768\n" |
351 | EX_TABLE(0b,1b) | 337 | EX_TABLE(0b,1b) |
352 | : "+a" (size), "+a" (src), "=a" (tmp1), "=a" (tmp2) | 338 | : "+a" (size), "+a" (src), "=a" (tmp1), "=a" (tmp2) |
@@ -399,7 +385,7 @@ early_param("uaccess_primary", parse_uaccess_pt); | |||
399 | 385 | ||
400 | static int __init uaccess_init(void) | 386 | static int __init uaccess_init(void) |
401 | { | 387 | { |
402 | if (IS_ENABLED(CONFIG_64BIT) && !uaccess_primary && test_facility(27)) | 388 | if (!uaccess_primary && test_facility(27)) |
403 | static_key_slow_inc(&have_mvcos); | 389 | static_key_slow_inc(&have_mvcos); |
404 | return 0; | 390 | return 0; |
405 | } | 391 | } |
diff --git a/arch/s390/lib/ucmpdi2.c b/arch/s390/lib/ucmpdi2.c deleted file mode 100644 index 3e05ff532582..000000000000 --- a/arch/s390/lib/ucmpdi2.c +++ /dev/null | |||
@@ -1,26 +0,0 @@ | |||
1 | #include <linux/module.h> | ||
2 | |||
3 | union ull_union { | ||
4 | unsigned long long ull; | ||
5 | struct { | ||
6 | unsigned int high; | ||
7 | unsigned int low; | ||
8 | } ui; | ||
9 | }; | ||
10 | |||
11 | int __ucmpdi2(unsigned long long a, unsigned long long b) | ||
12 | { | ||
13 | union ull_union au = {.ull = a}; | ||
14 | union ull_union bu = {.ull = b}; | ||
15 | |||
16 | if (au.ui.high < bu.ui.high) | ||
17 | return 0; | ||
18 | else if (au.ui.high > bu.ui.high) | ||
19 | return 2; | ||
20 | if (au.ui.low < bu.ui.low) | ||
21 | return 0; | ||
22 | else if (au.ui.low > bu.ui.low) | ||
23 | return 2; | ||
24 | return 1; | ||
25 | } | ||
26 | EXPORT_SYMBOL(__ucmpdi2); | ||