Jump to content

worma

Members
  • Content Count

    5
  • Joined

  • Last visited

Everything posted by worma

  1. Hello experts, I am trying to use the uvm_in_order_comparator, inside the scoreboard and looks like the transaction class should have a comp method. Is this comp same as compare?? Any clue how to implement this CLASS: uvm_in_order_comparator #(T,comp_type,convert,pair_type) // // Compares two streams of data objects of type T, a parameter to this class. // These transactions may either be classes or built-in types. To be // successfully compared, the two streams of data must be in the same order. // Apart from that, there are no assumptions made about the relative timing of // the two streams of data. // // Type parameters // // T - Specifies the type of transactions to be compared. // // comp - The type of the comparator to be used to compare the two // transaction streams. // When T is a class, T must implement comp and convert2string, and you must // specify class-based policy classes for comp_type, convert, and pair_type. // In most cases, you can use the convenient subtype, // uvm_in_order_class_comparator #(T).
  2. For a testbench env, in which i need to run a predetermined set of directed transactions[to configure the dut] followed by any number of sequences randomly with the constraint to pick from a selected set of sequences how do i do it?? any ideas are welcome
  3. for an int dynamic array it is `uvm_field_array_int , somethimg like that `uvm_field_array_real doesnt exist fro real dynamic array.. Can someone let me know
  4. In vmm scenario class, i can write constraints on individual item as well as an items queue, equivalent to which i don't find in VMM for eg, my 8th item could be predicted looking at the second one or vice versa, how can such a thing be achieved in uvm. I am looking for a equivalent of the following in uvm :-
  5. I was looking for an equivalent sequence in uvm, one way i did was split it into three sequences and then call them in the body of my_seq. Please let me know if there is an efficient way to do so
×