RE: [sv-ac] rules for concurrent assertion clock in procedural code - tasks

As somebody mentioned the main reason of the clock inference rules is not to infer the reset instead of the clock to preserve synthesis "semantics". When you have tasks in your always procedure then either they are not relevant for synthesis like $display, or the whole thing is "non-synthesizable". In this case the exact clock inference convention does not really matter, it just needs to be well-defined.

Dmitry

-----Original Message-----
From: owner-sv-ac@server.eda.org [mailto:owner-sv-ac@server.eda.org] On Behalf Of Daniel Mlynek
Sent: Thursday, July 02, 2009 10:29 AM
To: sv-ac@server.eda.org
Subject: [sv-ac] rules for concurrent assertion clock in procedural code - tasks


There is one more ambiguity in the description which imho need to be
addresed - how all those rules for clock inference should work when tasks
are used inside always/initial procedure.
Compiler should check what is inside a task to see which rule should apply
or finish checking rules on task call assuming that there is nothing
interesting inside  a task?

DANiel


--
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.

---------------------------------------------------------------------
Intel Israel (74) Limited

This e-mail and any attachments may contain confidential material for
the sole use of the intended recipient(s). Any review or distribution
by others is strictly prohibited. If you are not the intended
recipient, please contact the sender and delete all copies.


-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.