Searched refs:algorithm (Results 1 – 25 of 30) sorted by relevance
12
| /glibc-2.36/elf/ |
| D | dl-sort-maps.c | 282 int32_t algorithm = TUNABLE_GET (glibc, rtld, dynamic_sort, int32_t, NULL); in _dl_sort_maps_init() local
283 GLRO(dl_dso_sort_algo) = algorithm == 1 ? dso_sort_algorithm_original in _dl_sort_maps_init()
|
| D | dso-sort-tests-1.def | 59 # The older dynamic_sort=1 algorithm does not achieve this, while the DFS-based
60 # dynamic_sort=2 algorithm does, although it is still arguable whether going
|
| /glibc-2.36/posix/ |
| D | sched_primax.c | 24 __sched_get_priority_max (int algorithm) in __sched_get_priority_max() argument
|
| D | sched_primin.c | 24 __sched_get_priority_min (int algorithm) in __sched_get_priority_min() argument
|
| D | BOOST.tests | 651 ; again but with slower algorithm variant:
|
| D | tst-regex.input | 416 off-by-one in wordwrap algorithm when there' a space at the
7614 (parse_param): Adjusted field-splitting algorithm so that there is
9008 algorithm for very large/very small arguments.
9010 correct algorithm for very large/very small arguments; adjust for
|
| /glibc-2.36/localedata/locales/ |
| D | fa_IR | 208 % The following positioning is based on Unicode 3.0 bidirectional algorithm,
216 % The following positioning is based on Unicode 3.0 bidirectional algorithm,
|
| D | da_DK | 26 % The ordering algorithm is in accordance
|
| D | sl_SI | 57 % Ordering algorithm:
|
| /glibc-2.36/manual/ |
| D | tunables.texi | 330 Sets the algorithm to use for DSO sorting, valid values are @samp{1} and
331 @samp{2}. For value of @samp{1}, an older O(n^3) algorithm is used, which is
334 value of @samp{2}, a different algorithm is used, which implements a
|
| D | search.texi | 146 using the binary search algorithm.
181 of those objects because the sorting algorithm may swap around objects
200 originally implemented using the ``quick sort'' algorithm.
|
| D | maint.texi | 494 The algorithm used to pick the list of directories is simple:
|
| D | string.texi | 1338 The comparison algorithm which the @code{strverscmp} function implements
1474 to compare them. The actual sort algorithm is not written here; it
2447 (This is the Fisher-Yates algorithm for unbiased shuffling.)
|
| D | charset.texi | 2266 algorithm suitable for search for the best path in such a graph and so
|
| /glibc-2.36/ |
| D | NEWS | 124 [28868] dynamic-link: Dynamic loader DFS algorithm segfaults on
245 * A new DSO sorting algorithm has been added in the dynamic linker that uses
247 of the existing sorting algorithm when encountering particular circular
252 new DFS-based algorithm. The setting '1' switches to the old
253 algorithm used in glibc 2.33 and earlier.
3189 Dekker's mutual exclusion algorithm).
3719 scalable algorithm primarily through not using a critical section anymore to
4662 * A new semaphore algorithm has been implemented in generic C code for all
4666 The new semaphore algorithm is used by sem_init, sem_open, sem_post,
4887 stack or buffer overflow. This is now fixed to use a slower algorithm
[all …]
|
| D | CONTRIBUTED-BY | 2714 Based on an algorithm by Stephen L. Moshier <moshier@world.std.com>.
6102 This version is developed using the same algorithm as the fast C
6125 This version is developed using the same algorithm as the fast C
8683 This version is developed using the same algorithm as the fast C
8967 This version is developed using the same algorithm as the fast C
9137 This version is developed using the same algorithm as the fast C
|
| /glibc-2.36/ChangeLog.old/ |
| D | ChangeLog.3 | 576 * time/difftime.c (difftime): Use hairy rounding algorithm from
|
| D | ChangeLog.24 | 5348 elf: Use new dependency sorting algorithm by default
5548 math: Use an improved algorithm for hypotl (ldbl-128)
5561 math: Use an improved algorithm for hypotl (ldbl-96)
5583 math: Use an improved algorithm for hypot (dbl-64)
|
| D | ChangeLog.7 | 10312 * sysdeps/libm-ieee754/s_remquo.c: Change algorithm, although
10431 * sysdeps/libm-ieee754/s_remquo.c: Change algorithm, although
10644 algorithm.
10649 with new algorithm.
10999 * misc/tsearch.c: Rewritten to use Red-Black-Tree algorithm by
|
| D | ChangeLog.1 | 1462 Now uses Steele & White's "Dragon4" algorithm to do things right.
|
| D | ChangeLog.8 | 416 off-by-one in wordwrap algorithm when there' a space at the
7614 (parse_param): Adjusted field-splitting algorithm so that there is
9008 algorithm for very large/very small arguments.
9010 correct algorithm for very large/very small arguments; adjust for
|
| D | ChangeLog.5 | 3900 time_t values. Use old algorithm until a year is reached that
9237 * stdlib/random.c (__srandom): Change algorithm used to populate
9239 (randtbl): Recomputed with new algorithm.
|
| D | ChangeLog.10 | 2396 * locale/programs/ld-ctype.c (allocate_arrays): Change algorithm to
5819 simple algorithm.
|
| D | ChangeLog.13 | 1843 * sysdeps/x86_64/fpu/s_copysign.S: Fix algorithm.
12316 * sysdeps/ieee754/ldbl-96/s_cbrtl.c (__cbrtl): Fix algorithm.
|
| /glibc-2.36/timezone/ |
| D | asia | 1715 # know when this was started, or what algorithm is used (most likely the
|
12