Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
L
linux
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
linux
Commits
9a2bf4cc
Commit
9a2bf4cc
authored
Apr 28, 2004
by
Russell King
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
[ARM] Fix BE find_*_bit operations
These broke when find_first_bit/find_next_bit was added.
parent
5fdc760e
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
14 additions
and
8 deletions
+14
-8
arch/arm/lib/findbit.S
arch/arm/lib/findbit.S
+14
-8
No files found.
arch/arm/lib/findbit.S
View file @
9a2bf4cc
...
...
@@ -40,7 +40,7 @@ ENTRY(_find_first_zero_bit_le)
*/
ENTRY
(
_find_next_zero_bit_le
)
teq
r1
,
#
0
beq
2
b
beq
3
b
ands
ip
,
r2
,
#
7
beq
1
b
@
If
new
byte
,
goto
old
routine
ldrb
r3
,
[
r0
,
r2
,
lsr
#
3
]
...
...
@@ -74,7 +74,7 @@ ENTRY(_find_first_bit_le)
*/
ENTRY
(
_find_next_bit_le
)
teq
r1
,
#
0
beq
2
b
beq
3
b
ands
ip
,
r2
,
#
7
beq
1
b
@
If
new
byte
,
goto
old
routine
ldrb
r3
,
[
r0
,
r2
,
lsr
#
3
]
...
...
@@ -101,15 +101,18 @@ ENTRY(_find_first_zero_bit_be)
RETINSTR
(
mov
,
pc
,
lr
)
ENTRY
(
_find_next_zero_bit_be
)
teq
r1
,
#
0
beq
3
b
ands
ip
,
r2
,
#
7
beq
1
b
@
If
new
byte
,
goto
old
routine
eor
r3
,
r2
,
#
0x18
@
big
endian
byte
ordering
ldrb
r3
,
[
r0
,
r3
,
lsr
#
3
]
eor
r3
,
r3
,
#
0xff
@
now
looking
for
a
1
bit
movs
r3
,
r3
,
lsr
ip
@
shift
off
unused
bits
orreq
r2
,
r2
,
#
7
@
if
zero
,
then
no
bits
here
addeq
r2
,
r2
,
#
1
@
align
bit
pointer
beq
2
b
@
loop
for
next
bit
bne
.
found
orr
r2
,
r2
,
#
7
@
if
zero
,
then
no
bits
here
add
r2
,
r2
,
#
1
@
align
bit
pointer
b
2
b
@
loop
for
next
bit
ENTRY
(
_find_first_bit_be
)
teq
r1
,
#
0
...
...
@@ -126,14 +129,17 @@ ENTRY(_find_first_bit_be)
RETINSTR
(
mov
,
pc
,
lr
)
ENTRY
(
_find_next_bit_be
)
teq
r1
,
#
0
beq
3
b
ands
ip
,
r2
,
#
7
beq
1
b
@
If
new
byte
,
goto
old
routine
eor
r3
,
r2
,
#
0x18
@
big
endian
byte
ordering
ldrb
r3
,
[
r0
,
r3
,
lsr
#
3
]
movs
r3
,
r3
,
lsr
ip
@
shift
off
unused
bits
orreq
r2
,
r2
,
#
7
@
if
zero
,
then
no
bits
here
addeq
r2
,
r2
,
#
1
@
align
bit
pointer
beq
2
b
@
loop
for
next
bit
bne
.
found
orr
r2
,
r2
,
#
7
@
if
zero
,
then
no
bits
here
add
r2
,
r2
,
#
1
@
align
bit
pointer
b
2
b
@
loop
for
next
bit
#endif
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment