diff options
| -rw-r--r-- | dlfcn/dlfcn.h | 2 | ||||
| -rw-r--r-- | elf/dl-version.c | 2 | ||||
| -rw-r--r-- | elf/elf.h | 4 | ||||
| -rw-r--r-- | iconv/gconv_trans.c | 4 | ||||
| -rw-r--r-- | iconvdata/jis0208.h | 2 | ||||
| -rw-r--r-- | iconvdata/jis0212.h | 2 | ||||
| -rw-r--r-- | locale/programs/ld-collate.c | 4 | ||||
| -rw-r--r-- | misc/hsearch_r.c | 2 | ||||
| -rw-r--r-- | nptl_db/td_thr_tsd.c | 2 | ||||
| -rw-r--r-- | string/strxfrm_l.c | 2 |
10 files changed, 13 insertions, 13 deletions
diff --git a/dlfcn/dlfcn.h b/dlfcn/dlfcn.h index c629fc7f42..d4a8d5ac01 100644 --- a/dlfcn/dlfcn.h +++ b/dlfcn/dlfcn.h @@ -40,7 +40,7 @@ # define RTLD_DEFAULT ((void *) 0) -/* Type for namespace indeces. */ +/* Type for namespace indices. */ typedef long int Lmid_t; /* Special namespace ID values. */ diff --git a/elf/dl-version.c b/elf/dl-version.c index 0f8bdcdb53..6e28221c9d 100644 --- a/elf/dl-version.c +++ b/elf/dl-version.c @@ -247,7 +247,7 @@ _dl_check_map_versions (struct link_map *map, int verbose, int trace_mode) the maximum index here as well. 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) { ElfW(Verdef) *ent; @@ -441,7 +441,7 @@ typedef struct #define SHT_FINI_ARRAY 15 /* Array of destructors */ #define SHT_PREINIT_ARRAY 16 /* Array of pre-constructors */ #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_LOOS 0x60000000 /* Start OS-specific. */ #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_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 symbols in ANSI C. */ diff --git a/iconv/gconv_trans.c b/iconv/gconv_trans.c index ea02c95e84..a6e468e248 100644 --- a/iconv/gconv_trans.c +++ b/iconv/gconv_trans.c @@ -79,8 +79,8 @@ __gconv_transliterate (struct __gconv_step *step, return (winbuf == winbufend ? __GCONV_EMPTY_INPUT : __GCONV_INCOMPLETE_INPUT); - /* The array starting at FROM_IDX contains indeces to the string table - in FROM_TBL. The indeces are sorted wrt to the strings. I.e., we + /* The array starting at FROM_IDX contains indices to the string table + in FROM_TBL. The indices are sorted wrt to the strings. I.e., we are doing binary search. */ low = 0; high = size; diff --git a/iconvdata/jis0208.h b/iconvdata/jis0208.h index 1de69fc041..65bb8907e4 100644 --- a/iconvdata/jis0208.h +++ b/iconvdata/jis0208.h @@ -23,7 +23,7 @@ #include <gconv.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 { uint16_t start; diff --git a/iconvdata/jis0212.h b/iconvdata/jis0212.h index d4164d8da9..f22ac24b6f 100644 --- a/iconvdata/jis0212.h +++ b/iconvdata/jis0212.h @@ -25,7 +25,7 @@ #include <stdint.h> -/* Struct for table with indeces in mapping table. */ +/* Struct for table with indices in mapping table. */ struct jisx0212_idx { uint16_t start; diff --git a/locale/programs/ld-collate.c b/locale/programs/ld-collate.c index feb1a11258..cff0c11bec 100644 --- a/locale/programs/ld-collate.c +++ b/locale/programs/ld-collate.c @@ -2039,7 +2039,7 @@ add_to_tablewc (uint32_t ch, struct element_t *runp) obstack_int32_grow_fast (atwc.extrapool, curp->wcs[i]); /* 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 { 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]); /* 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 { weightidx = output_weight (&weightpool, collate, curp); diff --git a/misc/hsearch_r.c b/misc/hsearch_r.c index a9905de2d5..7fafc2cf69 100644 --- a/misc/hsearch_r.c +++ b/misc/hsearch_r.c @@ -181,7 +181,7 @@ __hsearch_r (ENTRY item, ACTION action, ENTRY **retval, do { /* Because SIZE is prime this guarantees to step through all - available indeces. */ + available indices. */ if (idx <= hval2) idx = htab->size + idx - hval2; else diff --git a/nptl_db/td_thr_tsd.c b/nptl_db/td_thr_tsd.c index 4c9c45e055..f1b4684ba9 100644 --- a/nptl_db/td_thr_tsd.c +++ b/nptl_db/td_thr_tsd.c @@ -48,7 +48,7 @@ td_thr_tsd (const td_thrhandle_t *th, const thread_key_t tk, void **data) if (err != TD_OK) return err; - /* Compute the indeces. */ + /* Compute the indices. */ pthread_key_2ndlevel_size = DB_DESC_NELEM (th->th_ta_p->ta_field_pthread_key_data_level2_data); idx1st = tk / pthread_key_2ndlevel_size; diff --git a/string/strxfrm_l.c b/string/strxfrm_l.c index 530a8d388d..96a7ef2d36 100644 --- a/string/strxfrm_l.c +++ b/string/strxfrm_l.c @@ -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); /* 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; /* Allocate cache for small strings on the stack and fill it with weight and |