aboutsummaryrefslogtreecommitdiffstats
path: root/arch/unicore32/lib
diff options
context:
space:
mode:
Diffstat (limited to 'arch/unicore32/lib')
-rw-r--r--arch/unicore32/lib/Makefile27
-rw-r--r--arch/unicore32/lib/delay.S51
-rw-r--r--arch/unicore32/lib/findbit.S98
3 files changed, 176 insertions, 0 deletions
diff --git a/arch/unicore32/lib/Makefile b/arch/unicore32/lib/Makefile
new file mode 100644
index 000000000000..87229a558b36
--- /dev/null
+++ b/arch/unicore32/lib/Makefile
@@ -0,0 +1,27 @@
1#
2# linux/arch/unicore32/lib/Makefile
3#
4# Copyright (C) 2001-2010 GUAN Xue-tao
5#
6
7lib-y := backtrace.o delay.o findbit.o
8lib-y += strncpy_from_user.o strnlen_user.o
9lib-y += clear_user.o copy_page.o
10lib-y += copy_from_user.o copy_to_user.o
11
12GNU_LIBC_A := $(shell $(CC) $(KBUILD_CFLAGS) -print-file-name=libc.a)
13GNU_LIBC_A_OBJS := memchr.o memcpy.o memmove.o memset.o
14GNU_LIBC_A_OBJS += strchr.o strrchr.o
15GNU_LIBC_A_OBJS += rawmemchr.o # needed by strrchr.o
16
17GNU_LIBGCC_A := $(shell $(CC) $(KBUILD_CFLAGS) -print-file-name=libgcc.a)
18GNU_LIBGCC_A_OBJS := _ashldi3.o _ashrdi3.o _lshrdi3.o
19GNU_LIBGCC_A_OBJS += _divsi3.o _modsi3.o _ucmpdi2.o _umodsi3.o _udivsi3.o
20
21lib-y += $(GNU_LIBC_A_OBJS) $(GNU_LIBGCC_A_OBJS)
22
23$(addprefix $(obj)/, $(GNU_LIBC_A_OBJS)):
24 $(Q)$(AR) p $(GNU_LIBC_A) $(notdir $@) > $@
25
26$(addprefix $(obj)/, $(GNU_LIBGCC_A_OBJS)):
27 $(Q)$(AR) p $(GNU_LIBGCC_A) $(notdir $@) > $@
diff --git a/arch/unicore32/lib/delay.S b/arch/unicore32/lib/delay.S
new file mode 100644
index 000000000000..24664c009e78
--- /dev/null
+++ b/arch/unicore32/lib/delay.S
@@ -0,0 +1,51 @@
1/*
2 * linux/arch/unicore32/lib/delay.S
3 *
4 * Code specific to PKUnity SoC and UniCore ISA
5 *
6 * Copyright (C) 2001-2010 GUAN Xue-tao
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
11 */
12#include <linux/linkage.h>
13#include <asm/assembler.h>
14#include <asm/param.h>
15 .text
16
17.LC0: .word loops_per_jiffy
18.LC1: .word (2199023*HZ)>>11
19
20/*
21 * r0 <= 2000
22 * lpj <= 0x01ffffff (max. 3355 bogomips)
23 * HZ <= 1000
24 */
25
26ENTRY(__udelay)
27 ldw r2, .LC1
28 mul r0, r2, r0
29ENTRY(__const_udelay) @ 0 <= r0 <= 0x7fffff06
30 ldw r2, .LC0
31 ldw r2, [r2] @ max = 0x01ffffff
32 mov r0, r0 >> #14 @ max = 0x0001ffff
33 mov r2, r2 >> #10 @ max = 0x00007fff
34 mul r0, r2, r0 @ max = 2^32-1
35 mov.a r0, r0 >> #6
36 cmoveq pc, lr
37
38/*
39 * loops = r0 * HZ * loops_per_jiffy / 1000000
40 *
41 * Oh, if only we had a cycle counter...
42 */
43
44@ Delay routine
45ENTRY(__delay)
46 sub.a r0, r0, #2
47 bua __delay
48 mov pc, lr
49ENDPROC(__udelay)
50ENDPROC(__const_udelay)
51ENDPROC(__delay)
diff --git a/arch/unicore32/lib/findbit.S b/arch/unicore32/lib/findbit.S
new file mode 100644
index 000000000000..c360ce905d8b
--- /dev/null
+++ b/arch/unicore32/lib/findbit.S
@@ -0,0 +1,98 @@
1/*
2 * linux/arch/unicore32/lib/findbit.S
3 *
4 * Code specific to PKUnity SoC and UniCore ISA
5 *
6 * Copyright (C) 2001-2010 GUAN Xue-tao
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
11 */
12#include <linux/linkage.h>
13#include <asm/assembler.h>
14 .text
15
16/*
17 * Purpose : Find a 'zero' bit
18 * Prototype: int find_first_zero_bit(void *addr, unsigned int maxbit);
19 */
20__uc32_find_first_zero_bit:
21 cxor.a r1, #0
22 beq 3f
23 mov r2, #0
241: ldb r3, [r0+], r2 >> #3
25 xor.a r3, r3, #0xff @ invert bits
26 bne .L_found @ any now set - found zero bit
27 add r2, r2, #8 @ next bit pointer
282: csub.a r2, r1 @ any more?
29 bub 1b
303: mov r0, r1 @ no free bits
31 mov pc, lr
32
33/*
34 * Purpose : Find next 'zero' bit
35 * Prototype: int find_next_zero_bit
36 * (void *addr, unsigned int maxbit, int offset)
37 */
38ENTRY(__uc32_find_next_zero_bit)
39 cxor.a r1, #0
40 beq 3b
41 and.a ip, r2, #7
42 beq 1b @ If new byte, goto old routine
43 ldb r3, [r0+], r2 >> #3
44 xor r3, r3, #0xff @ now looking for a 1 bit
45 mov.a r3, r3 >> ip @ shift off unused bits
46 bne .L_found
47 or r2, r2, #7 @ if zero, then no bits here
48 add r2, r2, #1 @ align bit pointer
49 b 2b @ loop for next bit
50ENDPROC(__uc32_find_next_zero_bit)
51
52/*
53 * Purpose : Find a 'one' bit
54 * Prototype: int find_first_bit
55 * (const unsigned long *addr, unsigned int maxbit);
56 */
57__uc32_find_first_bit:
58 cxor.a r1, #0
59 beq 3f
60 mov r2, #0
611: ldb r3, [r0+], r2 >> #3
62 mov.a r3, r3
63 bne .L_found @ any now set - found zero bit
64 add r2, r2, #8 @ next bit pointer
652: csub.a r2, r1 @ any more?
66 bub 1b
673: mov r0, r1 @ no free bits
68 mov pc, lr
69
70/*
71 * Purpose : Find next 'one' bit
72 * Prototype: int find_next_zero_bit
73 * (void *addr, unsigned int maxbit, int offset)
74 */
75ENTRY(__uc32_find_next_bit)
76 cxor.a r1, #0
77 beq 3b
78 and.a ip, r2, #7
79 beq 1b @ If new byte, goto old routine
80 ldb r3, [r0+], r2 >> #3
81 mov.a r3, r3 >> ip @ shift off unused bits
82 bne .L_found
83 or r2, r2, #7 @ if zero, then no bits here
84 add r2, r2, #1 @ align bit pointer
85 b 2b @ loop for next bit
86ENDPROC(__uc32_find_next_bit)
87
88/*
89 * One or more bits in the LSB of r3 are assumed to be set.
90 */
91.L_found:
92 rsub r1, r3, #0
93 and r3, r3, r1
94 cntlz r3, r3
95 rsub r3, r3, #31
96 add r0, r2, r3
97 mov pc, lr
98
generated by cgit v1.2.2 (git 2.25.0) at 2024-12-20 23:05:34 -0500