1996-05-29 04:48:04 +00:00
|
|
|
Open jobs for finishing GNU libc:
|
|
|
|
|
---------------------------------
|
2001-02-11 19:15:00 +00:00
|
|
|
Status: February 2001
|
1996-05-29 04:48:04 +00:00
|
|
|
|
|
|
|
|
If you have time and talent to take over any of the jobs below please
|
1998-03-04 17:14:36 +00:00
|
|
|
contact <bug-glibc@gnu.org>.
|
1996-05-29 04:48:04 +00:00
|
|
|
|
|
|
|
|
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
|
|
|
|
|
|
|
|
|
[ 1] Port to new platforms or test current version on formerly supported
|
|
|
|
|
platforms.
|
|
|
|
|
|
1997-01-24 02:23:54 +00:00
|
|
|
**** See http://www.gnu.org/software/libc/porting.html for more details.
|
|
|
|
|
|
1996-05-29 04:48:04 +00:00
|
|
|
|
|
|
|
|
[ 2] Test compliance with standards. If you have access to recent
|
|
|
|
|
standards (IEEE, ISO, ANSI, X/Open, ...) and/or test suites you
|
|
|
|
|
could do some checks as the goal is to be compliant with all
|
|
|
|
|
standards if they do not contradict each other.
|
|
|
|
|
|
|
|
|
|
|
1997-03-25 02:25:35 +00:00
|
|
|
[ 3] The IMHO opinion most important task is to write a more complete
|
|
|
|
|
test suite. We cannot get too many people working on this. It is
|
|
|
|
|
not difficult to write a test, find a definition of the function
|
|
|
|
|
which I normally can provide, if necessary, and start writing tests
|
|
|
|
|
to test for compliance. Beside this, take a look at the sources
|
|
|
|
|
and write tests which in total test as many paths of execution as
|
|
|
|
|
possible.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
[ 4] Write translations for the GNU libc message for the so far
|
1996-05-29 04:48:04 +00:00
|
|
|
unsupported languages. GNU libc is fully internationalized and
|
|
|
|
|
users can immediately benefit from this.
|
|
|
|
|
|
|
|
|
|
Take a look at the matrix in
|
1998-03-04 17:14:36 +00:00
|
|
|
ftp://ftp.gnu.org/pub/gnu/ABOUT-NLS
|
|
|
|
|
for the current status (of course better use a mirror of ftp.gnu.org).
|
1996-05-29 04:48:04 +00:00
|
|
|
|
|
|
|
|
|
2001-02-20 17:40:18 +00:00
|
|
|
[ 6] Write `long double' versions of the math functions.
|
1996-05-29 04:48:04 +00:00
|
|
|
|
1998-12-05 09:18:32 +00:00
|
|
|
The libm is in fact fdlibm (not the same as in Linux libc 5).
|
1996-05-29 04:48:04 +00:00
|
|
|
|
1996-10-02 01:40:17 +00:00
|
|
|
**** Partly done. But we need someone with numerical experiences for
|
|
|
|
|
the rest.
|
1996-06-22 15:00:08 +00:00
|
|
|
|
1996-05-29 04:48:04 +00:00
|
|
|
|
1997-03-25 02:25:35 +00:00
|
|
|
[ 7] Several math functions have to be written:
|
|
|
|
|
|
|
|
|
|
- exp2
|
|
|
|
|
|
1998-04-08 20:27:31 +00:00
|
|
|
with long double arguments.
|
1997-03-25 02:25:35 +00:00
|
|
|
|
|
|
|
|
Beside this most of the complex math functions which are new in
|
1999-10-31 17:37:43 +00:00
|
|
|
ISO C99 should be improved. Writing some of them in assembler is
|
1997-04-12 23:59:36 +00:00
|
|
|
useful to exploit the parallelism which often is available.
|
1997-03-25 02:25:35 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
[ 8] If you enjoy assembler programming (as I do --drepper :-) you might
|
1996-05-29 04:48:04 +00:00
|
|
|
be interested in writing optimized versions for some functions.
|
|
|
|
|
Especially the string handling functions can be optimized a lot.
|
|
|
|
|
|
|
|
|
|
Take a look at
|
|
|
|
|
|
|
|
|
|
Faster String Functions
|
|
|
|
|
Henry Spencer, University of Toronto
|
|
|
|
|
Usenix Winter '92, pp. 419--428
|
|
|
|
|
|
1996-10-13 21:35:39 +00:00
|
|
|
or just ask. Currently mostly i?86 and Alpha optimized versions
|
|
|
|
|
exist. Please ask before working on this to avoid duplicate
|
|
|
|
|
work.
|
1996-05-29 04:48:04 +00:00
|
|
|
|
|
|
|
|
|
1997-03-29 17:32:35 +00:00
|
|
|
[10] Extend regex and/or rx to work with wide characters and complete
|
1996-10-13 21:35:39 +00:00
|
|
|
implementation of character class and collation class handling.
|
|
|
|
|
|
1998-01-30 15:24:38 +00:00
|
|
|
It is planned to do a complete rewrite.
|
1996-05-29 04:48:04 +00:00
|
|
|
|
2001-02-11 19:53:15 +00:00
|
|
|
*** We have now multibyte character support. But a rewrite is still
|
2001-02-11 19:15:00 +00:00
|
|
|
necessary.
|
|
|
|
|
|
1996-05-29 04:48:04 +00:00
|
|
|
|
1997-03-29 17:32:35 +00:00
|
|
|
[11] Write access function for netmasks, bootparams, and automount
|
1996-11-14 02:04:07 +00:00
|
|
|
databases for nss_files and nss_db module.
|
1996-06-22 15:00:08 +00:00
|
|
|
The functions should be embedded in the nss scheme. This is not
|
|
|
|
|
hard and not all services must be supported at once.
|
1996-10-13 21:35:39 +00:00
|
|
|
|
|
|
|
|
|
1997-04-05 01:26:47 +00:00
|
|
|
[15] Cleaning up the header files. Ideally, each header style should
|
|
|
|
|
follow the "good examples". Each variable and function should have
|
|
|
|
|
a short description of the function and its parameters. The prototypes
|
|
|
|
|
should always contain variable names which can help to identify their
|
|
|
|
|
meaning; better than
|
|
|
|
|
|
2001-02-11 19:15:00 +00:00
|
|
|
int foo (int, int, int, int);
|
1997-04-05 01:26:47 +00:00
|
|
|
|
|
|
|
|
Blargh!
|
1998-04-08 20:27:31 +00:00
|
|
|
|
2001-02-11 19:15:00 +00:00
|
|
|
*** The conformtest.pl tool helps cleaning the namespace. As far as
|
|
|
|
|
known the prototypes all contain parameter names. But maybe some
|
|
|
|
|
comments can be improved.
|
|
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-04-08 20:27:31 +00:00
|
|
|
[16] The libio stream file functions should be extended in a way to use
|
|
|
|
|
mmap to map the file and use it as the buffer to user sees. For
|
|
|
|
|
read-only streams this should be rather easy and it avoids all read()
|
|
|
|
|
calls.
|
|
|
|
|
|
|
|
|
|
A more sophisticated solution would use mmap also for writing. The
|
|
|
|
|
standards do not demand that the file on the disk is always in the
|
|
|
|
|
correct form so it would be possible to enlarge it always according
|
|
|
|
|
to the page size and install the correct length only for fclose() and
|
|
|
|
|
fflush() calls.
|
1998-05-14 19:14:48 +00:00
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-05-14 19:14:48 +00:00
|
|
|
[18] Based on the sprof program we need tools to analyze the output. The
|
|
|
|
|
result should be a link map which specifies in which order the .o
|
|
|
|
|
files are placed in the shared object. This should help to improve
|
|
|
|
|
code locality and result in a smaller foorprint (in code and data
|
|
|
|
|
memory) since less pages are only used in small parts.
|
|
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-05-14 19:14:48 +00:00
|
|
|
[19] A user-level STREAMS implementation should be available if the
|
|
|
|
|
kernel does not provide the support.
|
|
|
|
|
|
2001-02-20 17:40:18 +00:00
|
|
|
*** This is a much lower priority job now that STREAMS are optional in
|
|
|
|
|
XPG.
|
|
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-05-14 19:14:48 +00:00
|
|
|
[20] More conversion modules for iconv(3). Existing modules should be
|
|
|
|
|
extended to do things like transliteration if this is wanted.
|
|
|
|
|
For often used conversion a direct conversion function should be
|
|
|
|
|
available.
|
|
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-05-14 19:14:48 +00:00
|
|
|
[21] The nscd program and the stubs in the libc should be changed so
|
|
|
|
|
that each program uses only one socket connect. Take a look at
|
|
|
|
|
http://www.cygnus.com/~drepper/nscd.html
|
1998-07-10 21:11:01 +00:00
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
An alternative approach is to use an mmap()ed file. The idea is
|
|
|
|
|
the following:
|
|
|
|
|
- the nscd creates the hash tables and the information it stores
|
|
|
|
|
in it in a mmap()ed region. This means no pointers must be
|
|
|
|
|
used, only offsets.
|
2001-02-20 09:00:41 +00:00
|
|
|
OR
|
|
|
|
|
if POSIX shared memory is available use a named shared memory
|
2001-02-20 17:40:18 +00:00
|
|
|
region to put the data in
|
1998-12-05 09:12:01 +00:00
|
|
|
- each program using NSS functionality tries to open the file
|
|
|
|
|
with the data.
|
2001-02-20 17:40:18 +00:00
|
|
|
- by checking some timestamp (which the nscd renews frequently)
|
1998-12-05 09:12:01 +00:00
|
|
|
the programs can test whether the file is still valid
|
|
|
|
|
- if the file is valid look through the nscd and locate the
|
|
|
|
|
appropriate hash table for the database and lookup the data.
|
|
|
|
|
If it is included we are set.
|
|
|
|
|
- if the data is not yet in the database we contact the nscd using
|
|
|
|
|
the currently implemented methods.
|
|
|
|
|
|
|
|
|
|
|
1998-07-10 21:11:01 +00:00
|
|
|
[22] It should be possible to have the information gconv-modules in
|
2001-02-20 17:40:18 +00:00
|
|
|
a simple cache which is faster to access. Using libdb is probably
|
1998-07-10 21:11:01 +00:00
|
|
|
overkill and loading it would probably be slower than reading the
|
|
|
|
|
plain text file. But a file format with a simple hash table and
|
|
|
|
|
some data it points to should be fine. Probably it should be
|
|
|
|
|
two tables, one for the aliases, one for the mappings. The code
|
|
|
|
|
should start similar to this:
|
|
|
|
|
|
|
|
|
|
if (stat ("gconv-modules", &stp) == 0
|
1998-12-05 09:12:01 +00:00
|
|
|
&& stat ("gconv-modules.db", &std) == 0
|
1998-07-10 21:11:01 +00:00
|
|
|
&& stp.st_mtime < std.st_mtime)
|
|
|
|
|
{
|
2001-02-20 17:40:18 +00:00
|
|
|
... use the cache ...
|
1998-07-10 21:11:01 +00:00
|
|
|
{
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
... use the plain file if it exists, otherwise the db ...
|
|
|
|
|
}
|
1998-10-18 15:16:22 +00:00
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
1998-10-18 15:16:22 +00:00
|
|
|
[23] The `strptime' function needs to be completed. This includes among
|
|
|
|
|
other things that it must get teached about timezones. The solution
|
|
|
|
|
envisioned is to extract the timezones from the ADO timezone
|
|
|
|
|
specifications. Special care must be given names which are used
|
|
|
|
|
multiple times. Here the precedence should (probably) be according
|
|
|
|
|
to the geograhical distance. E.g., the timezone EST should be
|
|
|
|
|
treated as the `Eastern Australia Time' instead of the US `Eastern
|
|
|
|
|
Standard Time' if the current TZ variable is set to, say,
|
|
|
|
|
Australia/Canberra or if the current locale is en_AU.
|
1998-11-18 14:46:49 +00:00
|
|
|
|
1998-12-05 09:12:01 +00:00
|
|
|
|
|
|
|
|
[25] Sun's nscd version implements a feature where the nscd keeps N entries
|
|
|
|
|
for each database current. I.e., if an entries lifespan is over and
|
|
|
|
|
it is one of the N entries to be kept the nscd updates the information
|
|
|
|
|
instead of removing the entry.
|
|
|
|
|
|
|
|
|
|
How to decide about which N entries to keep has to be examined.
|
|
|
|
|
Factors should be number of uses (of course), influenced by aging.
|
|
|
|
|
Just imagine a computer used by several people. The IDs of the current
|
|
|
|
|
user should be preferred even if the last user spent more time.
|
1998-12-05 09:18:32 +00:00
|
|
|
|
|
|
|
|
|
2001-02-11 19:15:00 +00:00
|
|
|
[26] ...done
|