Subject: $sv-ec SVTestbench questions/comments.
From: Adam Krolnik (krolnik@lsil.com)
Date: Wed Nov 20 2002 - 08:55:55 PST
Good afternoon;
I have a few questions about the testbench features.
Section 1. Introduction.
You introduce,
"built in types, string, associative array (hash), dynamic array."
"built in synchronization primitives , semaphore, mailbox."
And in section 16 you talk about linked lists. Why are linked lists
not a build in (first class) type like the above elements?
Surely a list is as useful or more than several of the above.
Section 4.7 Associative array (hash) methods
Why follow the STL model, which is reference/pointer based to access elements
of a hash (table?) Why not utilize a perl model which returns a list of
elements and provides foreach() for iteration through such lists.
This is a cleaner and simpler model to use in a language that does not rely
on pointers (references) as a fundamental basis.
Section 8.2 Wild equality/inequality.
Why do you choose the casex semantics for these new operators.
There are papers written about the pitfalls of using casex.
Instead they recommend usage of casez semantics which excludes
the value X as a matching value.
Section 8.3 Side effecting operators (pre/post inc/dec)
Does the value of these operators justify the exacting definitions
that are required. The efficiency of coding using these operators
is not very large given the forms that can cause confusion in the code.
Thanks.
Adam Krolnik
Verification Mgr.
LSI Logic Corp.
Plano TX. 75074
This archive was generated by hypermail 2b28 : Wed Nov 20 2002 - 08:57:09 PST