lib/glibc
1
0
Fork 0
mirror of https://sourceware.org/git/glibc.git synced 2025-08-08 17:42:12 +03:00
Code Activity

treewide: fix incorrect spelling of indices in comments

Browse Source 
Replace 'indeces' with 'indices', the most annoying of these typos were
those found in elf.h which is a public header file copied to other
projects.
This commit is contained in:
Dmitry V. Levin
2020-12-11 02:00:00 +00:00
parent 720480934a
commit 14ef9c185b
10 changed files with 13 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
dlfcn/dlfcn.h
View File

@@ -40,7 +40,7 @@
# define RTLD_DEFAULT ((void *) 0) # define RTLD_DEFAULT ((void *) 0)
/* Type for namespace indeces. */ /* Type for namespace indices. */
typedef long int Lmid_t; typedef long int Lmid_t;
/* Special namespace ID values. */ /* Special namespace ID values. */

2
elf/dl-version.c
View File

@@ -247,7 +247,7 @@ _dl_check_map_versions (struct link_map *map, int verbose, int trace_mode)
the maximum index here as well. the maximum index here as well.
XXX We could avoid the loop by just taking the number of definitions XXX We could avoid the loop by just taking the number of definitions
as an upper bound of new indeces. */ as an upper bound of new indices. */
if (def != NULL) if (def != NULL)
{ {
ElfW(Verdef) *ent; ElfW(Verdef) *ent;

4
elf/elf.h
View File

@@ -441,7 +441,7 @@ typedef struct
#define SHT_FINI_ARRAY 15 /* Array of destructors */ #define SHT_FINI_ARRAY 15 /* Array of destructors */
#define SHT_PREINIT_ARRAY 16 /* Array of pre-constructors */ #define SHT_PREINIT_ARRAY 16 /* Array of pre-constructors */
#define SHT_GROUP 17 /* Section group */ #define SHT_GROUP 17 /* Section group */
#define SHT_SYMTAB_SHNDX 18 /* Extended section indeces */ #define SHT_SYMTAB_SHNDX 18 /* Extended section indices */
#define SHT_NUM 19 /* Number of defined types. */ #define SHT_NUM 19 /* Number of defined types. */
#define SHT_LOOS 0x60000000 /* Start OS-specific. */ #define SHT_LOOS 0x60000000 /* Start OS-specific. */
#define SHT_GNU_ATTRIBUTES 0x6ffffff5 /* Object attributes. */ #define SHT_GNU_ATTRIBUTES 0x6ffffff5 /* Object attributes. */
@@ -2141,7 +2141,7 @@ enum
#define EFA_PARISC_1_1 0x0210 /* PA-RISC 1.1 big-endian. */ #define EFA_PARISC_1_1 0x0210 /* PA-RISC 1.1 big-endian. */
#define EFA_PARISC_2_0 0x0214 /* PA-RISC 2.0 big-endian. */ #define EFA_PARISC_2_0 0x0214 /* PA-RISC 2.0 big-endian. */
/* Additional section indeces. */ /* Additional section indices. */
#define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tenatively declared #define SHN_PARISC_ANSI_COMMON 0xff00 /* Section for tenatively declared
symbols in ANSI C. */ symbols in ANSI C. */

4
iconv/gconv_trans.c
View File

@@ -79,8 +79,8 @@ __gconv_transliterate (struct __gconv_step *step,
return (winbuf == winbufend return (winbuf == winbufend
? __GCONV_EMPTY_INPUT : __GCONV_INCOMPLETE_INPUT); ? __GCONV_EMPTY_INPUT : __GCONV_INCOMPLETE_INPUT);
/* The array starting at FROM_IDX contains indeces to the string table /* The array starting at FROM_IDX contains indices to the string table
in FROM_TBL. The indeces are sorted wrt to the strings. I.e., we in FROM_TBL. The indices are sorted wrt to the strings. I.e., we
are doing binary search. */ are doing binary search. */
low = 0; low = 0;
high = size; high = size;

2
iconvdata/jis0208.h
View File

@@ -23,7 +23,7 @@
#include <gconv.h> #include <gconv.h>
#include <stdint.h> #include <stdint.h>
/* Struct for table with indeces in UCS mapping table. */ /* Struct for table with indices in UCS mapping table. */
struct jisx0208_ucs_idx struct jisx0208_ucs_idx
{ {
uint16_t start; uint16_t start;

2
iconvdata/jis0212.h
View File

@@ -25,7 +25,7 @@
#include <stdint.h> #include <stdint.h>
/* Struct for table with indeces in mapping table. */ /* Struct for table with indices in mapping table. */
struct jisx0212_idx struct jisx0212_idx
{ {
uint16_t start; uint16_t start;

4
locale/programs/ld-collate.c
View File

@@ -2039,7 +2039,7 @@ add_to_tablewc (uint32_t ch, struct element_t *runp)
obstack_int32_grow_fast (atwc.extrapool, curp->wcs[i]); obstack_int32_grow_fast (atwc.extrapool, curp->wcs[i]);
/* Now find the end of the consecutive sequence and /* Now find the end of the consecutive sequence and
add all the indeces in the indirect pool. */ add all the indices in the indirect pool. */
do do
{ {
weightidx = output_weightwc (atwc.weightpool, atwc.collate, weightidx = output_weightwc (atwc.weightpool, atwc.collate,
@@ -2255,7 +2255,7 @@ collate_output (struct localedef_t *locale, const struct charmap_t *charmap,
obstack_1grow_fast (&extrapool, curp->mbs[i]); obstack_1grow_fast (&extrapool, curp->mbs[i]);
/* Now find the end of the consecutive sequence and /* Now find the end of the consecutive sequence and
add all the indeces in the indirect pool. */ add all the indices in the indirect pool. */
do do
{ {
weightidx = output_weight (&weightpool, collate, curp); weightidx = output_weight (&weightpool, collate, curp);

2
misc/hsearch_r.c
View File

@@ -181,7 +181,7 @@ __hsearch_r (ENTRY item, ACTION action, ENTRY **retval,
do do
{ {
/* Because SIZE is prime this guarantees to step through all /* Because SIZE is prime this guarantees to step through all
available indeces. */ available indices. */
if (idx <= hval2) if (idx <= hval2)
idx = htab->size + idx - hval2; idx = htab->size + idx - hval2;
else else

2
nptl_db/td_thr_tsd.c
View File

@@ -48,7 +48,7 @@ td_thr_tsd (const td_thrhandle_t *th, const thread_key_t tk, void **data)
if (err != TD_OK) if (err != TD_OK)
return err; return err;
/* Compute the indeces. */ /* Compute the indices. */
pthread_key_2ndlevel_size pthread_key_2ndlevel_size
= DB_DESC_NELEM (th->th_ta_p->ta_field_pthread_key_data_level2_data); = DB_DESC_NELEM (th->th_ta_p->ta_field_pthread_key_data_level2_data);
idx1st = tk / pthread_key_2ndlevel_size; idx1st = tk / pthread_key_2ndlevel_size;

2
string/strxfrm_l.c
View File

@@ -708,7 +708,7 @@ STRXFRM (STRING_TYPE *dest, const STRING_TYPE *src, size_t n, locale_t l)
assert (((uintptr_t) l_data.indirect) % __alignof__ (l_data.indirect[0]) == 0); assert (((uintptr_t) l_data.indirect) % __alignof__ (l_data.indirect[0]) == 0);
/* We need the elements of the string as unsigned values since they /* We need the elements of the string as unsigned values since they
are used as indeces. */ are used as indices. */
const USTRING_TYPE *usrc = (const USTRING_TYPE *) src; const USTRING_TYPE *usrc = (const USTRING_TYPE *) src;
/* Allocate cache for small strings on the stack and fill it with weight and /* Allocate cache for small strings on the stack and fill it with weight and