1 Open jobs for finishing GNU libc:
2 ---------------------------------
5 If you have time and talent to take over any of the jobs below please
6 contact <bug-glibc@prep.ai.mit.edu>
8 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
10 [ 1] Port to new platforms or test current version on formerly supported
14 [ 2] Test compliance with standards. If you have access to recent
15 standards (IEEE, ISO, ANSI, X/Open, ...) and/or test suites you
16 could do some checks as the goal is to be compliant with all
17 standards if they do not contradict each other.
20 [ 3] Write translations for the GNU libc message for the so far
21 unsupported languages. GNU libc is fully internationalized and
22 users can immediately benefit from this.
24 Take a look at the matrix in
25 ftp://prep.ai.mit.edu/pub/gnu/ABOUT-NLS
26 for the current status (of course better use a mirror of prep).
29 [ 4] Write wordexp() function; this is described in POSIX.2, The
30 header <wordexp.h> already exists.
32 Implementation idea: use some functions from bash.
35 [ 5] Write reentrent versions of crypt() et.al.
37 Implementation idea: Define in <crypt.h>
41 <... all the needed data ...>
44 and define additional functions
46 char *crypt_r (__const char *__key, __const char *__salt,
47 struct crypt_data *__data);
49 void setkey_r (__const char *__key, struct crypt_data *__data);
51 void encrypt_r (char *__block, int __edflag,
52 struct crypt_data *__data);
54 If possible the non-reentrent functions should use the reentrent
57 Because of the US export restrictions it might be a good idea if
58 some non-american person does this job.
61 [ 6] Write `long double' versions of the math functions. This should be
62 done in collaboration with the NetBSD and FreeBSD people.
64 The libm is in fact fdlibm (not the same as in Linux libc).
67 [ 7] If you enjoy assembler programming (as I do --drepper :-) you might
68 be interested in writing optimized versions for some functions.
69 Especially the string handling functions can be optimized a lot.
73 Faster String Functions
74 Henry Spencer, University of Toronto
75 Usenix Winter '92, pp. 419--428
77 or just ask. Currently mostly i?86 optimized versions exist.
80 [ 8] Write nftw() function. Perhaps it might be good to reimplement the
81 ftw() function as well to share most of the code.
84 [ 9] Write AVL-tree based tsearch() et.al. functions. Currently only
85 a very simple algorithm is used.
88 [10] Extend regex and/or rx to work with wide characters.
91 [11] Add mmap() support to malloc().
92 Doug Lea's malloc implementation might give some ideas. Perhaps
93 switching completly to his implementation is an option if it
94 a) can work without mmap() support (not all system GNU libc
95 is running on have mmap)
96 b) is without mmap support at least as fast as the current
98 c) will be extended with the current hooks and additional functions