forked from steveicarus/iverilog
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
8 changed files
with
36 additions
and
32 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,5 @@ | ||
/* | ||
* Copyright (c) 1998-2010 Stephen Williams ([email protected]) | ||
* Copyright (c) 1998-2015 Stephen Williams ([email protected]) | ||
* | ||
* This source code is free software; you can redistribute it | ||
* and/or modify it in source code form under the terms of the GNU | ||
|
@@ -32,6 +32,7 @@ Module::Module(LexicalScope*parent, perm_string n) | |
{ | ||
library_flag = false; | ||
is_cell = false; | ||
is_interface = false; | ||
program_block = false; | ||
uc_drive = UCD_NONE; | ||
timescale_warn_done = false; | ||
|
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 |
---|---|---|
@@ -1,3 +1,3 @@ | ||
// These are correct and are used to find the base (zero) pin. | ||
thisSubtraction:netlist.h:4976 | ||
thisSubtraction:netlist.h:4985 | ||
thisSubtraction:netlist.h:4991 | ||
thisSubtraction:netlist.h:5000 |
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
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 |
---|---|---|
@@ -1,5 +1,5 @@ | ||
/* | ||
* Copyright (c) 2000-2013 Stephen Williams ([email protected]) | ||
* Copyright (c) 2000-2015 Stephen Williams ([email protected]) | ||
* | ||
* This source code is free software; you can redistribute it | ||
* and/or modify it in source code form under the terms of the GNU | ||
|
@@ -890,8 +890,8 @@ void Design::add_node(NetNode*net) | |
|
||
void Design::del_node(NetNode*net) | ||
{ | ||
assert(net->design_ == this); | ||
assert(net != 0); | ||
assert(net->design_ == this); | ||
|
||
/* Interact with the Design::functor method by manipulating the | ||
cur and nxt pointers that it is using. */ | ||
|
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 |
---|---|---|
@@ -1,5 +1,5 @@ | ||
/* | ||
* Copyright (c) 2003-2012 Stephen Williams ([email protected]) | ||
* Copyright (c) 2003-2015 Stephen Williams ([email protected]) | ||
* Copyright CERN 2012 / Stephen Williams ([email protected]) | ||
* | ||
* This source code is free software; you can redistribute it | ||
|
@@ -66,6 +66,7 @@ static bool symbol_search(const LineInfo*li, Design*des, NetScope*scope, | |
bool prefix_scope = false; | ||
bool recurse_flag = false; | ||
|
||
assert(li); | ||
ivl_assert(*li, ! path.empty()); | ||
name_component_t path_tail = path.back(); | ||
path.pop_back(); | ||
|
@@ -94,7 +95,7 @@ static bool symbol_search(const LineInfo*li, Design*des, NetScope*scope, | |
scope = recurse.scope; | ||
prefix_scope = true; | ||
|
||
if (scope->is_auto() && li) { | ||
if (scope->is_auto()) { | ||
cerr << li->get_fileline() << ": error: Hierarchical " | ||
"reference to automatically allocated item " | ||
"`" << path_tail.name << "' in path `" << path << "'" << endl; | ||
|
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 |
---|---|---|
@@ -1,5 +1,5 @@ | ||
/* | ||
* Copyright (c) 2009 Stephen Williams ([email protected]) | ||
* Copyright (c) 2009-2015 Stephen Williams ([email protected]) | ||
* | ||
* This source code is free software; you can redistribute it | ||
* and/or modify it in source code form under the terms of the GNU | ||
|
@@ -29,10 +29,10 @@ static void run_string(const char*txt) | |
if (cp[0] == '%' && cp[1] != 0) { | ||
switch (cp[1]) { | ||
case 'M': | ||
fprintf(stdout, "%u", VERSION_MAJOR); | ||
fprintf(stdout, "%d", VERSION_MAJOR); | ||
break; | ||
case 'n': | ||
fprintf(stdout, "%u", VERSION_MINOR); | ||
fprintf(stdout, "%d", VERSION_MINOR); | ||
break; | ||
case 'E': | ||
fprintf(stdout, "%s", VERSION_EXTRA); | ||
|