A bounded queue is a queue with an upper bound. Bounded queues are described in section 5.14.1, in the last bullet item: A queue declared with a right bound [$:N] shall be limited to the indexes 0 through N (its maximum size will be N+1). An index that lies outside these limits shall be invalid; therefore, a write operation past the end of the queue shall be ignored and issue a warning. The warning can be issued at either compile time or run time, as soon as it is possible to determine that the index lies outside the queue limit. The unstated intent is that a bounded queue can be synthesized - sans the warnings. Arturo -----Original Message----- From: owner-sv-ec@eda.org [mailto:owner-sv-ec@eda.org] On Behalf Of Bresticker, Shalom Sent: Thursday, January 26, 2006 5:07 AM To: sv-ec@eda.org Subject: [sv-ec] bounded queues Hi, 1.2 says, "SystemVerilog adds extended and new constructs to Verilog, including the following: - Extensions to data types for better encapsulation and compactness of code and for tighter specification - C data types: int, typedef, struct, union, enum - Other data types: bounded queues, logic (0, 1, X, Z) and bit (0, 1), tagged unions for safety - Dynamic data types: string, classes, dynamic queues, dynamic arrays, associative arrays including automatic memory management freeing users from deallocation issues" What are "bounded queues" doing there in the third item? "Dynamic queues" are mentioned in the next item? Outside of that, "bounded queues" are mentioned only in the context of mailboxes. Shalom Shalom Bresticker Intel Jerusalem LAD DA +972 2 589-6852 +972 54 721-1033 I don't represent IntelReceived on Thu Jan 26 11:50:08 2006
This archive was generated by hypermail 2.1.8 : Thu Jan 26 2006 - 11:50:31 PST