Home
last modified time | relevance | path

Searched refs:idx (Results 1 – 11 of 11) sorted by relevance

/posix/
A Dtst-glob_lstat_compat.c71 int idx; member
102 while (idx < nfiles && filesystem[idx].level >= level) in find_file()
108 ++idx; in find_file()
111 if (idx == nfiles || filesystem[idx].level < level) in find_file()
128 ++idx; in find_file()
142 if (idx == -1 || filesystem[idx].type != DT_DIR) in my_opendir()
150 dir->idx = idx; in my_opendir()
164 ++dir->idx; in my_readdir()
178 ++dir->idx; in my_readdir()
202 && filesystem[idx].level < filesystem[idx + 1].level in my_stat()
[all …]
A Dbug-glob2.c88 int idx; member
112 while (idx < nfiles && filesystem[idx].level >= level) in find_file()
118 ++idx; in find_file()
121 if (idx == nfiles || filesystem[idx].level < level) in find_file()
128 return idx + 1; in find_file()
138 ++idx; in find_file()
176 dir->idx = idx; in my_opendir()
179 s, filesystem[idx].level, idx); in my_opendir()
198 ++dir->idx; in my_readdir()
218 ++dir->idx; in my_readdir()
[all …]
A Dtst-gnuglob-skeleton.c94 int idx; member
130 while (idx < nfiles && filesystem[idx].level >= level) in find_file()
136 ++idx; in find_file()
139 if (idx == nfiles || filesystem[idx].level < level) in find_file()
156 ++idx; in find_file()
174 if (idx == -1 || filesystem[idx].type != DT_DIR) in my_opendir()
186 dir->idx = idx; in my_opendir()
190 s, filesystem[idx].level, idx); in my_opendir()
210 ++dir->idx; in my_readdir()
234 ++dir->idx; in my_readdir()
[all …]
A Dfnmatch_loop.c362 int32_t idx; in FCT() local
500 idx += 1 + extra[idx]; in FCT()
504 idx += 1 + extra[idx]; in FCT()
506 idx = (idx + 3) & ~3; in FCT()
551 idx += 1 + extra[idx]; in FCT()
553 idx = (idx + 3) & ~3; in FCT()
690 idx += 1 + extra[idx]; in FCT()
694 idx += 1 + extra[idx]; in FCT()
696 idx = (idx + 3) & ~3; in FCT()
728 idx += 1 + extra[idx]; in FCT()
[all …]
A Dbug-regex5.c10 int32_t table_size, idx, i, found; in main() local
44 idx = symb_table[2 * i + 1]; in main()
45 strncpy (elem, (const char *) (extra + idx + 1), extra[idx]); in main()
46 elem[extra[idx]] = '\0'; in main()
A Dtst-rxspencer.c172 check_match (regmatch_t *rm, int idx, const char *string, in check_match() argument
177 if (rm[idx].rm_so == -1 && rm[idx].rm_eo == -1) in check_match()
179 printf ("%s rm[%d] unexpectedly matched\n", fail, idx); in check_match()
183 if (rm[idx].rm_so == -1 || rm[idx].rm_eo == -1) in check_match()
191 if (rm[idx].rm_so != rm[idx].rm_eo) in check_match()
193 printf ("%s rm[%d] not empty\n", fail, idx); in check_match()
199 printf ("%s rm[%d] not matching %s\n", fail, idx, match); in check_match()
205 if (rm[idx].rm_eo - rm[idx].rm_so != strlen (match) in check_match()
206 || strncmp (string + rm[idx].rm_so, match, in check_match()
207 rm[idx].rm_eo - rm[idx].rm_so)) in check_match()
[all …]
A Dregex_internal.h347 Idx idx; /* for BACK_REF */ member
439 ((idx) == (pstr)->valid_len || (pstr)->wcs[idx] != WEOF)
441 ((pstr)->wcs[idx] != WEOF && ((pstr)->valid_len == (idx) + 1 \
447 #define re_string_byte_at(pstr,idx) ((pstr)->mbs[idx]) argument
448 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx)) argument
449 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx)) argument
625 Idx idx; member
802 return (wint_t) pstr->mbs[idx]; in re_string_wchar_at()
803 return (wint_t) pstr->wcs[idx]; in re_string_wchar_at()
826 p = pstr->mbs + idx; in re_string_elem_size_at()
[all …]
A Dregex_internal.c1286 Idx idx; in re_node_set_insert() local
1317 for (idx = set->nelem; idx > 0; idx--) in re_node_set_insert()
1318 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1322 for (idx = set->nelem; set->elems[idx - 1] > elem; idx--) in re_node_set_insert()
1323 set->elems[idx] = set->elems[idx - 1]; in re_node_set_insert()
1384 idx = 0; in re_node_set_contains()
1390 idx = mid + 1; in re_node_set_contains()
1394 return set->elems[idx] == elem ? idx + 1 : 0; in re_node_set_contains()
1400 if (idx < 0 || idx >= set->nelem) in re_node_set_remove_at()
1403 for (; idx < set->nelem; idx++) in re_node_set_remove_at()
[all …]
A Dregcomp.c1297 int idx = node->token.opr.idx; in optimize_subexps() local
1298 node->token.opr.idx = dfa->subexp_map[idx]; in optimize_subexps()
1374 op->token.opr.idx = cls->token.opr.idx = node->token.opr.idx; in lower_subexp()
1598 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()
1632 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()
1638 for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx) in calc_inveclosure()
2853 idx += 1 + extra[idx]; in seek_collating_symbol_entry()
2907 idx += 1 + extra[idx]; in lookup_collation_sequence_value()
2909 idx += 1 + extra[idx]; in lookup_collation_sequence_value()
2911 idx = (idx + 3) & ~3; in lookup_collation_sequence_value()
[all …]
A Dregexec.c1002 Idx idx) in acquire_init_state_context() argument
1384 Idx idx, cur_node; in set_regs() local
1415 for (idx = pmatch[0].rm_so; idx <= pmatch[0].rm_eo ;) in set_regs()
3090 for (idx = 0; idx < cur_nodes->nelem; ++idx) in check_arrival_expand_ecl()
3823 if (idx > 0) in check_node_accept_bytes()
3889 int32_t idx; in find_collation_sequence_value() local
3895 for (idx = 0; idx < extrasize;) in find_collation_sequence_value()
3901 idx = idx + extra[idx] + 1; in find_collation_sequence_value()
3915 idx = (idx + 3) & ~3; in find_collation_sequence_value()
3919 idx = idx + sizeof (uint32_t) * (*(int32_t *) (extra + idx) + 1); in find_collation_sequence_value()
[all …]
A Dtst-regex.input4872 * iconvdata/8bit-gap.c: Use 32 bit type for idx element of struct gap.
6650 * iconvdata/uhc.c (gconv): Remove unused variable idx.

Completed in 46 milliseconds