Lines Matching refs:cur_idx
32 uint32 cur_idx;
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_entries);
83 "idx=%" B_PRIu32 "/%" B_PRIu32, (int)left_len, cur_idx,
92 if (cur_num_entries > 0 && cur_idx > 0
93 && map[cur_idx].address
94 == map[cur_idx - 1].address + map[cur_idx - 1].size) {
96 map[cur_idx - 1].size += map[cur_idx].size;
97 memcpy(&map[cur_idx], &map[cur_idx + 1],
102 cur_idx += cur_num_entries;
112 *num_entries = cur_idx;