1
/* Copyright (c) 2007 Dmitry Xmelkov
4
Redistribution and use in source and binary forms, with or without
5
modification, are permitted provided that the following conditions are met:
7
* Redistributions of source code must retain the above copyright
8
notice, this list of conditions and the following disclaimer.
9
* Redistributions in binary form must reproduce the above copyright
10
notice, this list of conditions and the following disclaimer in
11
the documentation and/or other materials provided with the
13
* Neither the name of the copyright holders nor the names of
14
contributors may be used to endorse or promote products derived
15
from this software without specific prior written permission.
17
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27
POSSIBILITY OF SUCH DAMAGE. */
29
/* $Id: strspn.S,v 1.1.2.1 2007/03/31 13:23:16 dmix Exp $ */
32
/** \ingroup avr_string
33
\fn size_t strspn(const char *s, const char *accept)
35
The strspn() function calculates the length of the initial segment
36
of \p s which consists entirely of characters in \p accept.
38
\return The strspn() function returns the number of characters in
39
the initial segment of \p s which consist only of characters from \p
40
accept. The terminating zero is not considered as a part of string. */
51
#define chs r21 /* char from s[] */
53
/* This realization is compact, but is not very fast: an accept string
58
.type _U(strspn), @function
62
; get next symbol from s[]
72
breq 1b ; branch if chs is present in accept[]
73
; end of scanning: chs is not found or end of s[] is reached
74
; Return: X - 1 - str == X + ~str
81
.size _U(strspn), . - _U(strspn)
82
#endif /* !__DOXYGEN__ */