Mercurial > pygar

view core/sim/bdir_dut/SFIFO.bi @ 2:996f1d6cd010 pygar svn.3

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[svn r3] added pseudo code for Mixer, and defined Samples and VoiceID in PathTypes.
author rlm
date Wed, 14 Apr 2010 15:02:32 -0400
parents 91a1f76ddd62
children
line wrap: on
line source
     1 signature SFIFO where {



     2 import ¶ConfigReg®¶;



     3 		   



     4 import ¶FIFOF_®¶;



     5 		



     6 import ¶FIFOF®¶;



     7 	       



     8 import ¶FIFO®¶;



     9 	      



    10 import ¶List®¶;



    11 	      



    12 import ¶Monad®¶;



    13 	       



    14 import ¶RWire®¶;



    15 	       



    16 interface (SFIFO.SFIFO :: * -> * -> *) alpha_T search_T = {



    17     SFIFO.enq :: alpha_T -> ¶Prelude®¶.¶Action®¶ {-# arg_names = [x] #-};



    18     SFIFO.deq :: ¶Prelude®¶.¶Action®¶ {-# arg_names = [] #-};



    19     SFIFO.first :: alpha_T {-# arg_names = [] #-};



    20     SFIFO.clear :: ¶Prelude®¶.¶Action®¶ {-# arg_names = [] #-};



    21     SFIFO.find :: search_T -> ¶Prelude®¶.¶Bool®¶ {-# arg_names = [x] #-};



    22     SFIFO.find2 :: search_T -> ¶Prelude®¶.¶Bool®¶ {-# arg_names = [x] #-}



    23 };



    24  



    25 instance SFIFO (¶Prelude®¶.¶PrimMakeUndefined®¶ alpha_T) =>



    26 	       ¶Prelude®¶.¶PrimMakeUndefined®¶ (SFIFO.SFIFO alpha_T search_T);



    27 									     



    28 instance SFIFO (¶Prelude®¶.¶PrimDeepSeqCond®¶ alpha_T) =>



    29 	       ¶Prelude®¶.¶PrimDeepSeqCond®¶ (SFIFO.SFIFO alpha_T search_T);



    30 									   



    31 instance SFIFO (¶Prelude®¶.¶PrimMakeUninitialized®¶ alpha_T) =>



    32 	       ¶Prelude®¶.¶PrimMakeUninitialized®¶ (SFIFO.SFIFO alpha_T search_T);



    33 										 



    34 SFIFO.mkSFIFO :: (¶Prelude®¶.¶Bits®¶ alpha_T asz, ¶Prelude®¶.¶IsModule®¶ _m__ _c__) =>



    35 		 (search_T -> alpha_T -> ¶Prelude®¶.¶Bool®¶) -> _m__ (SFIFO.SFIFO alpha_T search_T);



    36 												   



    37 SFIFO.mkSFIFO1 :: (¶Prelude®¶.¶Eq®¶ alpha_T,



    38 		   ¶Prelude®¶.¶Bits®¶ alpha_T asz,



    39 		   ¶Prelude®¶.¶IsModule®¶ _m__ _c__) =>



    40 		  (search_T -> alpha_T -> ¶Prelude®¶.¶Bool®¶) -> _m__ (SFIFO.SFIFO alpha_T search_T);



    41 												    



    42 SFIFO.mkSizedSFIFOInternal :: (¶Prelude®¶.¶Bits®¶ alpha_T alpha_SZ,



    43 			       ¶Prelude®¶.¶IsModule®¶ _m__ _c__) =>



    44 			      ¶Prelude®¶.¶Integer®¶ ->



    45 			      (search_T -> alpha_T -> ¶Prelude®¶.¶Bool®¶) ->



    46 			      (search_T -> alpha_T -> ¶Prelude®¶.¶Bool®¶) -> _m__ (SFIFO.SFIFO alpha_T search_T);



    47 														



    48 SFIFO.mkSizedSFIFO :: (¶Prelude®¶.¶Bits®¶ alpha_T asz, ¶Prelude®¶.¶IsModule®¶ _m__ _c__) =>



    49 		      ¶Prelude®¶.¶Integer®¶ ->



    50 		      (search_T -> alpha_T -> ¶Prelude®¶.¶Bool®¶) -> _m__ (SFIFO.SFIFO alpha_T search_T)



    51 }