# vl2mv arbiter_bug.v # version: 0.2 # date: 15:54:13 11/04/96 (PST) .model main # I/O ports .outputs ackA .outputs ackB .outputs ackC .mv sel 4 A B C X # assign active = pass_tokenA || pass_tokenB || pass_tokenC # pass_tokenA || pass_tokenB .names pass_tokenA pass_tokenB _n1 .def 1 0 0 0 # pass_tokenA || pass_tokenB || pass_tokenC .names _n1 pass_tokenC _n2 .def 1 0 0 0 .names _n2 active$raw_n0 - =_n2 .mv _n3 4 A B C X .names _n3 A .subckt controller controllerA req=reqA ack=ackA sel=sel pass_token=pass_tokenA id=_n3 .mv _n4 4 A B C X .names _n4 B .subckt controller controllerB req=reqB ack=ackB sel=sel pass_token=pass_tokenB id=_n4 .mv _n5 4 A B C X .names _n5 C .subckt controller controllerC req=reqC ack=ackC sel=sel pass_token=pass_tokenC id=_n5 .subckt arbiter arbiter sel=sel active=active .subckt client clientA req=reqA ack=ackA .subckt client clientB req=reqB ack=ackB .subckt client clientC req=reqC ack=ackC # conflict arbitrators .names active$raw_n0 active 0 0 1 1 # non-blocking assignments # latches # quasi-continuous assignment .end .model controller # I/O ports .inputs sel .inputs req .outputs pass_token .outputs ack .inputs id .mv sel 4 A B C X .mv state 3 IDLE READY BUSY .mv id 4 A B C X # state = 0 .mv state$raw_n6 3 IDLE READY BUSY .names state$raw_n6 IDLE # non-blocking assignments for initial # ack = 0 .names ack$raw_n7 0 # non-blocking assignments for initial # pass_token = 1 .names pass_token$raw_n8 1 # non-blocking assignments for initial # assign is_selected = (sel == id ) # sel == id .names sel id _na .def 0 - =sel 1 .names _na is_selected$raw_n9 - =_na .mv _nd 3 IDLE READY BUSY .names _nd IDLE .names state _nd _nc .def 0 - =state 1 .names _nc _nb 1 1 0 0 .names is_selected _ne - =is_selected .names req _nf - =req # state = 1 .mv state$req_n10$true 3 IDLE READY BUSY .names state$req_n10$true READY # pass_token = 0 .names pass_token$req_n11$true 0 # pass_token = 1 .names pass_token$req_n12$false 1 # if/else (req ) .names pass_token$req_n11$true pass_token$req_n12$false req pass_token$req$raw_n15 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$req$raw_n19 3 IDLE READY BUSY .names state$req_n10$true state req state$req$raw_n19 - - 0 =state - - 1 =state$req_n10$true # pass_token = 0 .names pass_token$is_selected_n1b$false 0 # if/else (is_selected ) .names pass_token$req$raw_n15 pass_token$is_selected_n1b$false is_selected pass_token$is_selected$raw_n1f 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$is_selected$raw_n21 3 IDLE READY BUSY .names state$req$raw_n19 state is_selected state$is_selected$raw_n21 - - 0 =state - - 1 =state$req$raw_n19 .mv _n26 3 IDLE READY BUSY .names _n26 READY .names state _n26 _n25 .def 0 - =state 1 .names _n25 _n24 1 1 0 0 # state = 2 .mv state$_n24_n27$true 3 IDLE READY BUSY .names state$_n24_n27$true BUSY # ack = 1 .names ack$_n24_n28$true 1 .mv _n2b 3 IDLE READY BUSY .names _n2b BUSY .names state _n2b _n2a .def 0 - =state 1 .names _n2a _n29 1 1 0 0 .names req _n2c 0 1 1 0 .names _n2c _n2d - =_n2c # state = 0 .mv state$_n2c_n2e$true 3 IDLE READY BUSY .names state$_n2c_n2e$true IDLE # ack = 0 .names ack$_n2c_n2f$true 0 # pass_token = 1 .names pass_token$_n2c_n30$true 1 # if/else (!req ) .names pass_token$_n2c_n30$true pass_token _n2c pass_token$_n2c$raw_n37 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$_n2c$raw_n39 3 IDLE READY BUSY .names state$_n2c_n2e$true state _n2c state$_n2c$raw_n39 - - 0 =state - - 1 =state$_n2c_n2e$true .names ack$_n2c_n2f$true ack _n2c ack$_n2c$raw_n3a 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 # case (state ) .mv state$_n29$raw_n42 3 IDLE READY BUSY .names state$_n2c$raw_n39 state _n29 state$_n29$raw_n42 - - 0 =state - - 1 =state$_n2c$raw_n39 .names pass_token$_n2c$raw_n37 pass_token _n29 pass_token$_n29$raw_n43 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .names ack$_n2c$raw_n3a ack _n29 ack$_n29$raw_n45 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$_n24$raw_n47 3 IDLE READY BUSY .names state$_n24_n27$true state$_n29$raw_n42 _n24 state$_n24$raw_n47 - - 0 =state$_n29$raw_n42 - - 1 =state$_n24_n27$true .names ack$_n24_n28$true ack$_n29$raw_n45 _n24 ack$_n24$raw_n48 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .names pass_token pass_token$_n29$raw_n43 _n24 pass_token$_n24$raw_n4f 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$_nb$raw_n52 3 IDLE READY BUSY .names state$is_selected$raw_n21 state$_n24$raw_n47 _nb state$_nb$raw_n52 - - 0 =state$_n24$raw_n47 - - 1 =state$is_selected$raw_n21 .names pass_token$is_selected$raw_n1f pass_token$_n24$raw_n4f _nb pass_token$_nb$raw_n53 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .names ack ack$_n24$raw_n48 _nb ack$_nb$raw_n5b 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 # conflict arbitrators .names is_selected$raw_n9 is_selected 0 0 1 1 .names _nb _ne _nf _n24 _n29 _n2d _n5d .def 0 1 1 1 - - - 1 0 - - 1 - - 1 0 - - 0 1 1 1 .mv _n5e 3 IDLE READY BUSY .names _n5d state$_nb$raw_n52 state _n5e 1 - - =state$_nb$raw_n52 0 - - =state .names _nb _ne _nf _n24 _n29 _n2d _n62 .def 0 1 1 1 - - - 1 1 1 0 - - - 1 1 0 - - - - 1 0 - - 0 1 1 1 .names _n62 pass_token$_nb$raw_n53 pass_token _n63 1 0 - 0 1 1 - 1 0 - 0 0 0 - 1 1 .names _nb _n24 _n29 _n2d _n64 .def 0 0 1 - - 1 0 0 1 1 1 .names _n64 ack$_nb$raw_n5b ack _n65 1 0 - 0 1 1 - 1 0 - 0 0 0 - 1 1 # non-blocking assignments # latches .r pass_token$raw_n8 pass_token 0 0 1 1 .latch _n63 pass_token .r state$raw_n6 state - =state$raw_n6 .latch _n5e state .r ack$raw_n7 ack 0 0 1 1 .latch _n65 ack # quasi-continuous assignment .end .model arbiter # I/O ports .outputs sel .inputs active .mv sel 4 A B C X .mv state 4 A B C X # state = 0 .mv state$raw_n66 4 A B C X .names state$raw_n66 A # non-blocking assignments for initial # assign sel = active ? state : 3 .mv sel$raw_n67 4 A B C X .mv _n68 4 A B C X .names _n68 X # active ? state : 3 .mv _n69 4 A B C X .names state _n68 active _n69 - - 0 =_n68 - - 1 =state .names _n69 sel$raw_n67 - =_n69 .mv _n6c 4 A B C X .names _n6c A .names state _n6c _n6b .def 0 - =state 1 .names _n6b _n6a 1 1 0 0 # state = 1 .mv state$_n6a_n6d$true 4 A B C X .names state$_n6a_n6d$true B .mv _n70 4 A B C X .names _n70 B .names state _n70 _n6f .def 0 - =state 1 .names _n6f _n6e 1 1 0 0 # state = 2 .mv state$_n6e_n71$true 4 A B C X .names state$_n6e_n71$true C .mv _n74 4 A B C X .names _n74 C .names state _n74 _n73 .def 0 - =state 1 .names _n73 _n72 1 1 0 0 # state = 0 .mv state$_n72_n75$true 4 A B C X .names state$_n72_n75$true A # case (state ) .mv state$_n72$raw_n78 4 A B C X .names state$_n72_n75$true state _n72 state$_n72$raw_n78 - - 0 =state - - 1 =state$_n72_n75$true .mv state$_n6e$raw_n79 4 A B C X .names state$_n6e_n71$true state$_n72$raw_n78 _n6e state$_n6e$raw_n79 - - 0 =state$_n72$raw_n78 - - 1 =state$_n6e_n71$true .mv state$_n6a$raw_n7d 4 A B C X .names state$_n6a_n6d$true state$_n6e$raw_n79 _n6a state$_n6a$raw_n7d - - 0 =state$_n6e$raw_n79 - - 1 =state$_n6a_n6d$true # conflict arbitrators .names sel$raw_n67 sel - =sel$raw_n67 .names _n6a _n6e _n72 _n81 .def 0 1 - - 1 0 1 - 1 0 0 1 1 .mv _n82 4 A B C X .names _n81 state$_n6a$raw_n7d state _n82 1 - - =state$_n6a$raw_n7d 0 - - =state # non-blocking assignments # latches .r state$raw_n66 state - =state$raw_n66 .latch _n82 state # quasi-continuous assignment .end .model client # I/O ports .outputs req .inputs ack .mv state 3 NO_REQ REQ HAVE_TOKEN # req = 0 .names req$raw_n85 0 # non-blocking assignments for initial # state = 0 .mv state$raw_n86 3 NO_REQ REQ HAVE_TOKEN .names state$raw_n86 NO_REQ # non-blocking assignments for initial # assign rand_choice = $NDset ( 0,1 ) .names rand_choice 0 1 .mv _n8b 3 NO_REQ REQ HAVE_TOKEN .names _n8b NO_REQ .names state _n8b _n8a .def 0 - =state 1 .names _n8a _n89 1 1 0 0 .names rand_choice _n8c - =rand_choice # req = 1 .names req$rand_choice_n8d$true 1 # state = 1 .mv state$rand_choice_n8e$true 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice_n8e$true REQ # if/else (rand_choice ) .names req$rand_choice_n8d$true req rand_choice req$rand_choice$raw_n93 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$rand_choice$raw_n95 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice_n8e$true state rand_choice state$rand_choice$raw_n95 - - 0 =state - - 1 =state$rand_choice_n8e$true .mv _n98 3 NO_REQ REQ HAVE_TOKEN .names _n98 REQ .names state _n98 _n97 .def 0 - =state 1 .names _n97 _n96 1 1 0 0 .names ack _n99 - =ack # state = 2 .mv state$ack_n9a$true 3 NO_REQ REQ HAVE_TOKEN .names state$ack_n9a$true HAVE_TOKEN # if/else (ack ) .mv state$ack$raw_n9d 3 NO_REQ REQ HAVE_TOKEN .names state$ack_n9a$true state ack state$ack$raw_n9d - - 0 =state - - 1 =state$ack_n9a$true .mv _na0 3 NO_REQ REQ HAVE_TOKEN .names _na0 HAVE_TOKEN .names state _na0 _n9f .def 0 - =state 1 .names _n9f _n9e 1 1 0 0 .names rand_choice _na1 - =rand_choice # req = 0 .names req$rand_choice_na2$true 0 # state = 0 .mv state$rand_choice_na3$true 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice_na3$true NO_REQ # if/else (rand_choice ) .names req$rand_choice_na2$true req rand_choice req$rand_choice$raw_na8 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$rand_choice$raw_naa 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice_na3$true state rand_choice state$rand_choice$raw_naa - - 0 =state - - 1 =state$rand_choice_na3$true # case (state ) .names req$rand_choice$raw_na8 req _n9e req$_n9e$raw_naf 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$_n9e$raw_nb1 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice$raw_naa state _n9e state$_n9e$raw_nb1 - - 0 =state - - 1 =state$rand_choice$raw_naa .mv state$_n96$raw_nb2 3 NO_REQ REQ HAVE_TOKEN .names state$ack$raw_n9d state$_n9e$raw_nb1 _n96 state$_n96$raw_nb2 - - 0 =state$_n9e$raw_nb1 - - 1 =state$ack$raw_n9d .names req req$_n9e$raw_naf _n96 req$_n96$raw_nb5 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .names req$rand_choice$raw_n93 req$_n96$raw_nb5 _n89 req$_n89$raw_nb8 0 - 1 0 1 - 1 1 - 0 0 0 - 1 0 1 .mv state$_n89$raw_nba 3 NO_REQ REQ HAVE_TOKEN .names state$rand_choice$raw_n95 state$_n96$raw_nb2 _n89 state$_n89$raw_nba - - 0 =state$_n96$raw_nb2 - - 1 =state$rand_choice$raw_n95 # conflict arbitrators .names _n89 _n8c _n96 _n9e _na1 _nc1 .def 0 1 1 - - - 1 0 - 0 1 1 1 .names _nc1 req$_n89$raw_nb8 req _nc2 1 0 - 0 1 1 - 1 0 - 0 0 0 - 1 1 .names _n89 _n8c _n96 _n99 _n9e _na1 _nc3 .def 0 1 1 - - - - 1 0 - 1 1 - - 1 0 - 0 - 1 1 1 .mv _nc4 3 NO_REQ REQ HAVE_TOKEN .names _nc3 state$_n89$raw_nba state _nc4 1 - - =state$_n89$raw_nba 0 - - =state # non-blocking assignments # latches .r req$raw_n85 req 0 0 1 1 .latch _nc2 req .r state$raw_n86 state - =state$raw_n86 .latch _nc4 state # quasi-continuous assignment .end