Lines Matching refs:idx
39 static unsigned int re_string_context_at (const re_string_t *input, Idx idx,
579 re_string_reconstruct (re_string_t *pstr, Idx idx, int eflags) in re_string_reconstruct() argument
583 if (__glibc_unlikely (pstr->raw_mbs_idx <= idx)) in re_string_reconstruct()
584 offset = idx - pstr->raw_mbs_idx; in re_string_reconstruct()
602 offset = idx; in re_string_reconstruct()
649 pstr->len = pstr->raw_len - idx + offset; in re_string_reconstruct()
650 pstr->stop = pstr->raw_stop - idx + offset; in re_string_reconstruct()
700 pstr->len = pstr->raw_len - idx + offset; in re_string_reconstruct()
701 pstr->stop = pstr->raw_stop - idx + offset; in re_string_reconstruct()
769 pstr->valid_len = re_string_skip_chars (pstr, idx, &wc) - idx; in re_string_reconstruct()
805 pstr->raw_mbs_idx = idx; in re_string_reconstruct()
840 re_string_peek_byte_case (const re_string_t *pstr, Idx idx) in re_string_peek_byte_case() argument
847 return re_string_peek_byte (pstr, idx); in re_string_peek_byte_case()
851 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx)) in re_string_peek_byte_case()
852 return re_string_peek_byte (pstr, idx); in re_string_peek_byte_case()
855 off = pstr->cur_idx + idx; in re_string_peek_byte_case()
869 return re_string_peek_byte (pstr, idx); in re_string_peek_byte_case()
926 re_string_context_at (const re_string_t *input, Idx idx, int eflags) in re_string_context_at() argument
929 if (__glibc_unlikely (idx < 0)) in re_string_context_at()
933 if (__glibc_unlikely (idx == input->len)) in re_string_context_at()
940 Idx wc_idx = idx; in re_string_context_at()
958 c = re_string_byte_at (input, idx); in re_string_context_at()
1286 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()
1324 DEBUG_ASSERT (set->elems[idx - 1] < elem); in re_node_set_insert()
1328 set->elems[idx] = elem; in re_node_set_insert()
1379 __re_size_t idx, right, mid; in re_node_set_contains() local
1384 idx = 0; in re_node_set_contains()
1386 while (idx < right) in re_node_set_contains()
1388 mid = (idx + right) / 2; 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()
1398 re_node_set_remove_at (re_node_set *set, Idx idx) in re_node_set_remove_at() argument
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()
1404 set->elems[idx] = set->elems[idx + 1]; in re_node_set_remove_at()