![]() The idea is to keep a list of bursts we generate. Now we can start randomizing memory bursts. Protected rand int unsigned bursts_num_bytes īursts. We need to model an AHB transaction and the constraints on its fields: Since I wasn't smart enough to do the math, I decided to take the engineering approach and write a program that would count for me.Ĭounting how many AHB bursts are required is something we could model as a constraint problem. I tried to figure it out on paper using combinatorics, but this turned out to be pretty complicated. This got me interested as to how many there are exactly. The main point to take away from this paragraph is that there are a lot of possible ways to transfer 16 bytes. We don't even need to start bursts of the same widths we could send two HALFWORDS, followed by four BYTES, followed by two WORDS. Even within these four WORD bursts of length 1, we could send some of them as SINGLE bursts and some as INCR of length 1. We could also represent the INCR4 burst as a four individual SINGLE WORD bursts (and do the same for the HALFWORD and BYTE bursts). We could also swap out the fixed INCR* bursts for INCR of non-fixed length and send the appropriate number of transfers. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |