Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Minor improvements to axi_rand_master #329

Merged
merged 4 commits into from
May 8, 2024
Merged

Minor improvements to axi_rand_master #329

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
4de9078
`axi_test`: add `clear_memory_regions` to `axi_rand_master`.
luca-valente Jan 15, 2024
210ab39
`axi_rand_master`: prevent stall if `RESP_MIN/MAX_WAIT_CYCLES=0`
luca-valente Jan 15, 2024
6089791
`axi_rand_master`: add `size` input to `add_traffic_shaping`
luca-valente Jan 15, 2024
6d30a5a
Add function `add_traffic_shaping_with_size` to avoid changing
luca-valente Mar 20, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 31 additions & 8 deletions src/axi_test.sv
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -762,6 +762,7 @@ package axi_test;

struct packed {
int unsigned len ;
int unsigned size ;
int unsigned cprob;
} traffic_shape[$];
int unsigned max_cprob;
Expand Down Expand Up @@ -808,15 +809,29 @@ package axi_test;
mem_map.push_back({addr_begin, addr_end, mem_type});
endfunction

function void clear_memory_regions();
mem_map.delete();
endfunction

function void add_traffic_shaping(input int unsigned len, input int unsigned freq);
int unsigned size = -1;
if (traffic_shape.size() == 0)
traffic_shape.push_back({len, freq});
traffic_shape.push_back({len, size, freq});
else
traffic_shape.push_back({len, traffic_shape[$].cprob + freq});
traffic_shape.push_back({len, size, traffic_shape[$].cprob + freq});

max_cprob = traffic_shape[$].cprob;
endfunction : add_traffic_shaping

function void add_traffic_shaping_with_size(input int unsigned len, input int unsigned size, input int unsigned freq);
if (traffic_shape.size() == 0)
traffic_shape.push_back({len, size, freq});
else
traffic_shape.push_back({len, size, traffic_shape[$].cprob + freq});

max_cprob = traffic_shape[$].cprob;
endfunction : add_traffic_shaping_with_size

function ax_beat_t new_rand_burst(input logic is_read);
automatic logic rand_success;
automatic ax_beat_t ax_beat = new;
Expand Down Expand Up @@ -863,6 +878,7 @@ package axi_test;
for (int i = 0; i < traffic_shape.size(); i++)
if (traffic_shape[i].cprob > cprob) begin
len = traffic_shape[i].len;
size = traffic_shape[i].size;
if (ax_beat.ax_burst == BURST_WRAP) begin
assert (len inside {len_t'(1), len_t'(3), len_t'(7), len_t'(15)});
end
Expand All @@ -871,12 +887,17 @@ package axi_test;

// Randomize address. Make sure that the burst does not cross a 4KiB boundary.
forever begin
rand_success = std::randomize(size) with {
2**size <= AXI_STRB_WIDTH;
2**size <= len;
}; assert(rand_success);
ax_beat.ax_size = size;
ax_beat.ax_len = ((len + (1 << size) - 1) >> size) - 1;
if(size==-1) begin
rand_success = std::randomize(size) with {
2**size <= AXI_STRB_WIDTH;
2**size <= len;
}; assert(rand_success);
ax_beat.ax_size = size;
ax_beat.ax_len = ((len + (1 << size) - 1) >> size) - 1;
end else begin
ax_beat.ax_size = size;
ax_beat.ax_len = len;
end

rand_success = std::randomize(addr) with {
addr >= mem_region.addr_begin;
Expand Down Expand Up @@ -1149,6 +1170,8 @@ package axi_test;
end
cnt_sem.put();
end
end else begin
rand_wait(1,1);
end
end
endtask
Expand Down
Loading