AuroraMiddleware/glibc
1
0
Fork 0
mirror of https://sourceware.org/git/glibc.git synced 2024-11-09 23:00:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update.

Browse Source 
2000-10-29  Greg Louis  <glouis@dynamicro.on.ca>

	* posix/regex.h (__restrict_arr): Move definition out of #ifndef block.
	Required because egcs-2.91.66 (aka 1.1.2) defines __restrict, but
	doesn't define __restrict_arr.

	* manual/search.texi: Correct description if VISIT values.
	Patch by Ben Collins <bcollins@debian.org>.
This commit is contained in:
Ulrich Drepper 2000-10-30 04:18:33 +00:00
parent 9c3b1ceba8
commit da2a3ca6e2
5 changed files with 25 additions and 2073 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
ChangeLog
View File

@ -1,5 +1,14 @@
2000-10-29 Greg Louis <glouis@dynamicro.on.ca>
* posix/regex.h (__restrict_arr): Move definition out of #ifndef block.
Required because egcs-2.91.66 (aka 1.1.2) defines __restrict, but
doesn't define __restrict_arr.
2000-10-29 Ulrich Drepper <drepper@redhat.com>
* manual/search.texi: Correct description if VISIT values.
Patch by Ben Collins <bcollins@debian.org>.
* string/bits/string2.h (strspn): Evaluate first argument if
second is "".
(strpbrk): Likewise.

5
localedata/ChangeLog
View File

@ -1,3 +1,8 @@
2000-10-29 Ulrich Drepper <drepper@redhat.com>
* locales/mk_MK: Use iso14651_t1 file.
Patch by Damjan <arhiv@freemail.org.mk>.
2000-10-27 Ulrich Drepper <drepper@redhat.com>
* charmaps/VISCII: New file.

2068
localedata/locales/mk_MK
View File

File diff suppressed because it is too large Load Diff

12
manual/search.texi
View File

@ -529,10 +529,10 @@ three methods of tree traversal (or even a combination of them).
@item preorder
The current node is an internal node and the function is called before
the first child was processed.
@item endorder
@item postorder
The current node is an internal node and the function is called after
the first child was processed.
@item postorder
@item endorder
The current node is an internal node and the function is called after
the second child was processed.
@item leaf
@ -543,7 +543,7 @@ The current node is a leaf.
@comment search.h
@comment SVID
@deftypefun void twalk (const void *@var{root}, __action_fn_t @var{action})
For each node in the tree with a node pointed to by @var{root} the
For each node in the tree with a node pointed to by @var{root}, the
@code{twalk} function calls the function provided by the parameter
@var{action}. For leaf nodes the function is called exactly once with
@var{value} set to @code{leaf}. For internal nodes the function is
@ -554,8 +554,8 @@ by one for the descend to a child, starting with the value @math{0} for
the root node.
Since the functions used for the @var{action} parameter to @code{twalk}
must not modify the tree data it is safe to run @code{twalk} is more
than one thread at the same time working on the same tree. It is also
must not modify the tree data, it is safe to run @code{twalk} in more
than one thread at the same time, working on the same tree. It is also
safe to call @code{tfind} in parallel. Functions which modify the tree
must not be used. Otherwise the behaviour is undefined.
must not be used, otherwise the behaviour is undefined.
@end deftypefun

4
posix/regex.h
View File

@ -523,11 +523,11 @@ extern int re_exec _RE_ARGS ((const char *));
# define __restrict
# endif
# endif
#endif
/* For now unconditionally define __restrict_arr to expand to nothing.
Ideally we would have a test for the compiler which allows defining
it to restrict. */
# define __restrict_arr
#endif
#define __restrict_arr
/* POSIX compatibility. */
extern int regcomp _RE_ARGS ((regex_t *__restrict __preg,