Searched refs:cur_idx (Results 1 - 6 of 6) sorted by relevance

/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Dvirtual_memory.cpp32 uint32 cur_idx; local
46 for (left_len = len, cur_idx = 0; left_len > 0 && vec_count > 0
47 && cur_idx < max_entries;) {
54 SHOW_FLOW( 3, "left_len=%d, vec_count=%d, cur_idx=%" B_PRIu32,
55 (int)left_len, (int)vec_count, cur_idx );
66 cur_num_entries = max_entries - cur_idx;
68 &map[cur_idx], &cur_num_entries)) != B_OK) {
76 for (tmp_idx = cur_idx; tmp_idx < cur_idx + cur_num_entries; ++tmp_idx)
81 B_PRIu32 "/%" B_PRIu32, (int)left_len, cur_idx, max_entrie
[all...]
H A Dscatter_gather.cpp59 for (uint32 cur_idx = 0; cur_idx < num_entries; ++cur_idx) {
64 (temp_sg[cur_idx].address & dma_boundary);
70 B_PRIu32, temp_sg[cur_idx].address, temp_sg[cur_idx].size,
71 max_len, cur_idx, num_entries);
73 if (max_len < temp_sg[cur_idx].size) {
78 memmove(&temp_sg[cur_idx + 1], &temp_sg[cur_idx],
[all...]
H A Ddma_buffer.cpp45 uint32 cur_idx; local
58 for (cur_idx = sg_count; cur_idx >= 1; --cur_idx, ++sg_list) {
312 uint32 cur_idx; local
316 for (cur_idx = sg_list_count; cur_idx >= 1; --cur_idx, ++sg_list) {
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.h345 int cur_idx; member in struct:re_string_t
405 ((pstr)->mbs[(pstr)->cur_idx + offset])
407 ((pstr)->mbs[(pstr)->cur_idx++])
413 #define re_string_eoi(pstr) ((pstr)->stop <= (pstr)->cur_idx)
414 #define re_string_cur_idx(pstr) ((pstr)->cur_idx)
418 #define re_string_skip_bytes(pstr,idx) ((pstr)->cur_idx += (idx))
419 #define re_string_set_index(pstr,idx) ((pstr)->cur_idx = (idx))
H A Dregexec.c64 int cur_idx, int nmatch) internal_function;
1521 regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch)
1531 pmatch[reg_num].rm_so = cur_idx;
1541 if (pmatch[reg_num].rm_so < cur_idx)
1543 pmatch[reg_num].rm_eo = cur_idx;
1561 pmatch[reg_num].rm_eo = cur_idx;
2314 int cur_idx = re_string_cur_idx (&mctx->input);
2316 if (cur_idx > mctx->state_log_top)
2318 mctx->state_log[cur_idx] = next_state;
2319 mctx->state_log_top = cur_idx;
1517 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) argument
2310 int cur_idx = re_string_cur_idx (&mctx->input); local
3039 int cur_idx; local
[all...]
H A Dregex_internal.c818 pstr->cur_idx = 0;
834 && ! re_string_is_single_byte_char (pstr, pstr->cur_idx + idx))
838 off = pstr->cur_idx + idx;
850 since peek_byte_case doesn't advance cur_idx in any way. */
877 if (!re_string_first_byte (pstr, pstr->cur_idx))
880 off = pstr->offsets[pstr->cur_idx];
887 re_string_char_size_at (pstr, pstr->cur_idx));
892 return pstr->raw_mbs[pstr->raw_mbs_idx + pstr->cur_idx++];

Completed in 245 milliseconds