-
Notifications
You must be signed in to change notification settings - Fork 521
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Check lvalue of procedural continuous assign (PR#29)
- Loading branch information
steve
committed
Dec 6, 2000
1 parent
e027247
commit f6507cb
Showing
5 changed files
with
182 additions
and
9 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,155 @@ | ||
| /* | ||
| * Copyright (c) 2000 Stephen Williams (steve@icarus.com.com) | ||
| * | ||
| * This source code is free software; you can redistribute it | ||
| * and/or modify it in source code form under the terms of the GNU | ||
| * General Public License as published by the Free Software | ||
| * Foundation; either version 2 of the License, or (at your option) | ||
| * any later version. | ||
| * | ||
| * This program is distributed in the hope that it will be useful, | ||
| * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
| * GNU General Public License for more details. | ||
| * | ||
| * You should have received a copy of the GNU General Public License | ||
| * along with this program; if not, write to the Free Software | ||
| * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA | ||
| */ | ||
| #if !defined(WINNT) && !defined(macintosh) | ||
| #ident "$Id: elab_anet.cc,v 1.1 2000/12/06 06:31:09 steve Exp $" | ||
| #endif | ||
|
|
||
| /* | ||
| * The elaborate_anet methods elaborate expressions that are intended | ||
| * to be the left side of procedural continuous assignments. | ||
| */ | ||
|
|
||
| # include "PExpr.h" | ||
| # include "netlist.h" | ||
| # include <iostream> | ||
|
|
||
| NetNet* PExpr::elaborate_anet(Design*des, NetScope*scope) const | ||
| { | ||
| cerr << get_line() << ": error: Invalid expression on left side " | ||
| << "of precedural continuous asignment." << endl; | ||
| return 0; | ||
| } | ||
|
|
||
|
|
||
| NetNet* PEConcat::elaborate_anet(Design*des, NetScope*scope) const | ||
| { | ||
| if (repeat_) { | ||
| cerr << get_line() << ": error: Repeat concatenations make " | ||
| "no sense in l-value expressions. I refuse." << endl; | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| svector<NetNet*>nets (parms_.count()); | ||
| unsigned pins = 0; | ||
| unsigned errors = 0; | ||
|
|
||
| for (unsigned idx = 0 ; idx < nets.count() ; idx += 1) { | ||
|
|
||
| if (parms_[idx] == 0) { | ||
| cerr << get_line() << ": error: Empty expressions " | ||
| << "not allowed in concatenations." << endl; | ||
| errors += 1; | ||
| continue; | ||
| } | ||
|
|
||
| nets[idx] = parms_[idx]->elaborate_anet(des, scope); | ||
| if (nets[idx] == 0) | ||
| errors += 1; | ||
| else | ||
| pins += nets[idx]->pin_count(); | ||
| } | ||
|
|
||
| /* If any of the sub expressions failed to elaborate, then | ||
| delete all those that did and abort myself. */ | ||
| if (errors) { | ||
| for (unsigned idx = 0 ; idx < nets.count() ; idx += 1) { | ||
| if (nets[idx]) delete nets[idx]; | ||
| } | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| /* Make the temporary signal that connects to all the | ||
| operands, and connect it up. Scan the operands of the | ||
| concat operator from least significant to most significant, | ||
| which is opposite from how they are given in the list. | ||
| Allow for a repeat count other then 1 by repeating the | ||
| connect loop as many times as necessary. */ | ||
|
|
||
| NetNet*osig = new NetNet(scope, des->local_symbol(scope->name()), | ||
| NetNet::IMPLICIT_REG, pins); | ||
|
|
||
| pins = 0; | ||
| for (unsigned idx = nets.count() ; idx > 0 ; idx -= 1) { | ||
| NetNet*cur = nets[idx-1]; | ||
| for (unsigned pin = 0; pin < cur->pin_count(); pin += 1) { | ||
| connect(osig->pin(pins), cur->pin(pin)); | ||
| pins += 1; | ||
| } | ||
| } | ||
|
|
||
| osig->local_flag(true); | ||
| return osig; | ||
| } | ||
|
|
||
| NetNet* PEIdent::elaborate_anet(Design*des, NetScope*scope) const | ||
| { | ||
| NetNet*sig = des->find_signal(scope, text_); | ||
|
|
||
| if (sig == 0) { | ||
| if (NetMemory*mem = des->find_memory(scope, text_)) { | ||
| cerr << get_line() << ": error: memories not allowed " | ||
| << "on left side of procedural continuous " | ||
| << "asignment." << endl; | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| cerr << get_line() << ": error: reg ``" << text_ << "'' " | ||
| << "is undefined in this scope." << endl; | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| switch (sig->type()) { | ||
| case NetNet::REG: | ||
| case NetNet::IMPLICIT_REG: | ||
| case NetNet::INTEGER: | ||
| break; | ||
|
|
||
| default: | ||
| cerr << get_line() << ": error: " << text_ << " is not " | ||
| << "a reg in this context." << endl; | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| assert(sig); | ||
|
|
||
| if (msb_ || lsb_) { | ||
|
|
||
| cerr << get_line() << ": error: bit/part selects not allowed " | ||
| << "on left side of procedural continuous asignment." | ||
| << endl; | ||
| des->errors += 1; | ||
| return 0; | ||
| } | ||
|
|
||
| return sig; | ||
| } | ||
|
|
||
| /* | ||
| * $Log: elab_anet.cc,v $ | ||
| * Revision 1.1 2000/12/06 06:31:09 steve | ||
| * Check lvalue of procedural continuous assign (PR#29) | ||
| * | ||
| */ | ||
|
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters