cl_syoscb_compare_io.svh

00001 /// Class which implements the in order compare algorithm
00002 class cl_syoscb_compare_io extends cl_syoscb_compare_base;
00003   //-------------------------------------
00004   // UVM Macros
00005   //-------------------------------------
00006   `uvm_object_utils(cl_syoscb_compare_io)
00007 
00008   //-------------------------------------
00009   // Constructor
00010   //-------------------------------------
00011   extern function new(string name = "cl_syoscb_compare_io");
00012 
00013   //-------------------------------------
00014   // Compare API
00015   //-------------------------------------
00016   extern virtual function void compare();
00017   extern function void compare_do();
00018 endclass: cl_syoscb_compare_io
00019 
00020 function cl_syoscb_compare_io::new(string name = "cl_syoscb_compare_io");
00021   super.new(name);
00022 endfunction: new
00023 
00024 /// <b>Compare API</b>: Mandatory overwriting of the base class' compare method.
00025 /// Currently, this just calls do_copy() blindly 
00026 function void cl_syoscb_compare_io::compare();
00027   // Here any state variables should be queried
00028   // to compute if the compare should be done or not
00029   this.compare_do();
00030 endfunction: compare
00031 
00032 /// <b>Compare API</b>: Mandatory overwriting of the base class' do_compare method.
00033 /// Here the actual in order compare is implemented.
00034 ///
00035 /// The algorithm gets the primary queue and then loops over all other queues to see if
00036 /// it can find primary item as the first item in all of the other queues. If so then the items
00037 /// are removed from all queues. If not then a UVM error is issued.
00038 function void cl_syoscb_compare_io::compare_do();
00039   string primary_queue_name;
00040   cl_syoscb_queue primary_queue;
00041   cl_syoscb_queue_iterator_base primary_queue_iter;
00042   string queue_names[];
00043   int unsigned secondary_item_found[string];
00044   bit compare_continue = 1'b1;
00045   bit compare_result = 1'b0;
00046   cl_syoscb_item primary_item;
00047 
00048   // Initialize state variables
00049   primary_queue_name = this.get_primary_queue_name();
00050   this.cfg.get_queues(queue_names);
00051 
00052   primary_queue = this.cfg.get_queue(primary_queue_name);
00053   if(primary_queue == null) begin
00054     `uvm_fatal("QUEUE_ERROR", "Unable to retrieve primary queue handle");
00055   end
00056 
00057   primary_queue_iter = primary_queue.create_iterator();
00058 
00059   `uvm_info("DEBUG", $sformatf("cmp-io: primary queue: %s", primary_queue_name), UVM_FULL);
00060   `uvm_info("DEBUG", $sformatf("cmp-io: number of queues: %0d", queue_names.size()), UVM_FULL);
00061 
00062   // Outer loop loops through all
00063   while(!primary_queue_iter.is_done()) begin
00064     primary_item = primary_queue_iter.get_item();
00065 
00066     // Inner loop through all queues
00067     foreach(queue_names[i]) begin
00068       `uvm_info("DEBUG", $sformatf("Looking at queue: %s", queue_names[i]), UVM_FULL);
00069 
00070       if(queue_names[i] != primary_queue_name) begin
00071         cl_syoscb_queue secondary_queue;
00072         cl_syoscb_queue_iterator_base secondary_queue_iter;
00073         cl_syoscb_item sih;
00074 
00075         `uvm_info("DEBUG", $sformatf("%s is a secondary queue - now comparing", queue_names[i]), UVM_FULL);
00076 
00077    // Get the secondary queue
00078         secondary_queue = this.cfg.get_queue(queue_names[i]);
00079 
00080         if(secondary_queue == null) begin
00081           `uvm_fatal("QUEUE_ERROR", "Unable to retrieve secondary queue handle");
00082         end
00083 
00084    // Get an iterator for the secondary queue
00085         secondary_queue_iter = secondary_queue.create_iterator();
00086 
00087         // Only do the compare if there are actually an item in the secondary queue
00088         if(!secondary_queue_iter.is_done()) begin
00089           // Get the first item from the secondary queue       
00090           sih = secondary_queue_iter.get_item();
00091 
00092           if(sih.compare(primary_item) == 1'b1) begin
00093             secondary_item_found[queue_names[i]] = secondary_queue_iter.get_idx();
00094             `uvm_info("DEBUG", $sformatf("Secondary item found at index: %0d", secondary_queue_iter.get_idx()), UVM_FULL);
00095           end else begin
00096             `uvm_error("COMPARE_ERROR", $sformatf("Item:\n%s\nfrom primary queue: %s not found in secondary queue: %s. Found this item in %s instead:\n%s", primary_item.sprint(), primary_queue_name, queue_names[i], queue_names[i], sih.sprint()))
00097           end
00098         end
00099 
00100         if(!secondary_queue.delete_iterator(secondary_queue_iter)) begin
00101           `uvm_fatal("QUEUE_ERROR", $sformatf("Unable to delete iterator from secondaery queue: %s", queue_names[i]));
00102         end
00103       end else begin
00104         `uvm_info("DEBUG", $sformatf("%s is the primary queue - skipping", queue_names[i]), UVM_FULL);
00105       end
00106     end
00107 
00108     // Only start to remove items if all slave items are found (One from each slave queue)
00109     if(secondary_item_found.size() == queue_names.size()-1) begin
00110       string queue_name;
00111       cl_syoscb_item pih;
00112 
00113       // Get the item from the primary queue
00114       pih = primary_queue_iter.get_item();
00115 
00116       `uvm_info("DEBUG", $sformatf("Found match for primary queue item : %s",
00117                                    pih.sprint()), UVM_FULL);
00118 
00119       // Remove from primary
00120       if(!primary_queue.delete_item(primary_queue_iter.get_idx())) begin
00121         `uvm_error("QUEUE_ERROR", $sformatf("Unable to delete item idx %0d from queue %s",
00122                                             primary_queue_iter.get_idx(), primary_queue.get_name()));
00123       end
00124 
00125       // Remove from all secondaries
00126       while(secondary_item_found.next(queue_name)) begin
00127         cl_syoscb_queue secondary_queue;
00128 
00129    // Get the secondary queue
00130         secondary_queue = this.cfg.get_queue(queue_name);
00131 
00132         if(secondary_queue == null) begin
00133           `uvm_fatal("QUEUE_ERROR", "Unable to retrieve secondary queue handle");
00134         end
00135 
00136         if(!secondary_queue.delete_item(secondary_item_found[queue_name])) begin
00137           `uvm_error("QUEUE_ERROR", $sformatf("Unable to delete item idx %0d from queue %s",
00138                                               secondary_item_found[queue_name], secondary_queue.get_name()));
00139         end
00140       end
00141     end
00142 
00143     // Call .next() blindly since we do not care about the
00144     // return value, since we might be at the end of the queue.
00145     // Thus, .next() will return 1'b0 at the end of the queue
00146     void'(primary_queue_iter.next());
00147   end
00148 
00149   if(!primary_queue.delete_iterator(primary_queue_iter)) begin
00150     `uvm_fatal("QUEUE_ERROR", $sformatf("Unable to delete iterator from primary queue: %s", primary_queue_name));
00151   end
00152 endfunction: compare_do
 All Classes Functions Variables

Project: SyoSil ApS UVM Scoreboard, Revision: 1.0.2.1

Copyright 2014-2015 SyoSil ApS
All Rights Reserved Worldwide

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
doxygen
Doxygen Version: 1.6.1
IDV SV Filter Version: 2.6.2
Thu Jun 4 23:02:22 2015
Find a documentation bug? Report bugs to: bugs.intelligentdv.com Project: DoxygenFilterSV