Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
R
relibc
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
redox-os
relibc
Commits
b0f8e31b
Commit
b0f8e31b
authored
7 years ago
by
Tom Almeida
Browse files
Options
Downloads
Patches
Plain Diff
ran fmt.sh
parent
87ec6dfa
No related branches found
No related tags found
1 merge request
!61
Add implementations of strspn, strcspn and strchr
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/string/src/lib.rs
+14
-8
14 additions, 8 deletions
src/string/src/lib.rs
with
14 additions
and
8 deletions
src/string/src/lib.rs
+
14
−
8
View file @
b0f8e31b
...
@@ -125,20 +125,23 @@ pub unsafe extern "C" fn strcspn(s1: *const c_char, s2: *const c_char) -> c_ulon
...
@@ -125,20 +125,23 @@ pub unsafe extern "C" fn strcspn(s1: *const c_char, s2: *const c_char) -> c_ulon
let
s1
=
s1
as
*
const
u8
;
let
s1
=
s1
as
*
const
u8
;
let
s2
=
s2
as
*
const
u8
;
let
s2
=
s2
as
*
const
u8
;
// The below logic is effectively ripped from the musl implementation
// The below logic is effectively ripped from the musl implementation
let
mut
byteset
=
[
0u8
;
32
/
mem
::
size_of
::
<
usize
>
()];
let
mut
byteset
=
[
0u8
;
32
/
mem
::
size_of
::
<
usize
>
()];
let
mut
i
=
0
;
let
mut
i
=
0
;
while
*
s2
.offset
(
i
)
!=
0
{
while
*
s2
.offset
(
i
)
!=
0
{
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
|
=
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()));
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
|
=
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()));
i
+=
1
;
i
+=
1
;
}
}
i
=
0
;
// reset
i
=
0
;
// reset
while
*
s2
.offset
(
i
)
!=
0
{
while
*
s2
.offset
(
i
)
!=
0
{
if
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
&
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()))
>
0
{
if
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
&
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()))
>
0
{
break
;
break
;
}
}
i
+=
1
;
i
+=
1
;
...
@@ -265,20 +268,23 @@ pub unsafe extern "C" fn strspn(s1: *const c_char, s2: *const c_char) -> c_ulong
...
@@ -265,20 +268,23 @@ pub unsafe extern "C" fn strspn(s1: *const c_char, s2: *const c_char) -> c_ulong
let
s1
=
s1
as
*
const
u8
;
let
s1
=
s1
as
*
const
u8
;
let
s2
=
s2
as
*
const
u8
;
let
s2
=
s2
as
*
const
u8
;
// The below logic is effectively ripped from the musl implementation
// The below logic is effectively ripped from the musl implementation
let
mut
byteset
=
[
0u8
;
32
/
mem
::
size_of
::
<
usize
>
()];
let
mut
byteset
=
[
0u8
;
32
/
mem
::
size_of
::
<
usize
>
()];
let
mut
i
=
0
;
let
mut
i
=
0
;
while
*
s2
.offset
(
i
)
!=
0
{
while
*
s2
.offset
(
i
)
!=
0
{
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
|
=
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()));
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
|
=
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()));
i
+=
1
;
i
+=
1
;
}
}
i
=
0
;
// reset
i
=
0
;
// reset
while
*
s2
.offset
(
i
)
!=
0
{
while
*
s2
.offset
(
i
)
!=
0
{
if
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
&
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()))
<
1
{
if
byteset
[(
*
s2
.offset
(
i
)
as
usize
)
/
(
8
*
mem
::
size_of
::
<
usize
>
())]
&
1
<<
(
*
s2
.offset
(
i
)
as
usize
%
(
8
*
mem
::
size_of
::
<
usize
>
()))
<
1
{
break
;
break
;
}
}
i
+=
1
;
i
+=
1
;
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment