This commit is contained in:
Wilson Snyder 2019-11-07 22:41:34 -05:00
parent 5811ec07e6
commit 2eda38c4d1
10 changed files with 18 additions and 18 deletions

View File

@ -7,7 +7,7 @@ image::https://www.veripool.org/img/verilator_256_200_min.png[Logo,256,200,role=
== Introduction == Introduction
This discusses how to install Verilator. For more general information This discusses how to install Verilator. For more general information
please see http://verilator.org[verilator.org]. please see https://verilator.org[verilator.org].
== Quick-start == Quick-start
@ -34,7 +34,7 @@ brief:
#sudo apt-get install libfl2 # Ubuntu only (ignore if gives error) #sudo apt-get install libfl2 # Ubuntu only (ignore if gives error)
#sudo apt-get install libfl-dev # Ubuntu only (ignore if gives error) #sudo apt-get install libfl-dev # Ubuntu only (ignore if gives error)
git clone http://git.veripool.org/git/verilator # Only first time git clone https://git.veripool.org/git/verilator # Only first time
## Note the URL above is not a page you can see with a browser, it's for git only ## Note the URL above is not a page you can see with a browser, it's for git only
# Every time you need to build: # Every time you need to build:
@ -117,7 +117,7 @@ Downloads]; we presume you know how to use it, and is not described here.)
Get the sources from the repository: (You need do this only once, ever.) Get the sources from the repository: (You need do this only once, ever.)
git clone http://git.veripool.org/git/verilator # Only first time git clone https://git.veripool.org/git/verilator # Only first time
## Note the URL above is not a page you can see with a browser, it's for git only ## Note the URL above is not a page you can see with a browser, it's for git only
Enter the checkout and determine what version/branch to use: Enter the checkout and determine what version/branch to use:
@ -254,8 +254,8 @@ set in your environment; it is built into the executable.
== Announcements == Announcements
To get notified of new releases, login to To get notified of new releases, login to
http://www.veripool.org[Veripool], and click the "watch" button near the https://www.veripool.org[Veripool], and click the "watch" button near the
top right under http://www.veripool.org/projects/verilator/news[Verilator top right under https://www.veripool.org/projects/verilator/news[Verilator
News]. News].
== Directory Structure == Directory Structure

View File

@ -103,7 +103,7 @@ the pass.
A number of passes use graph algorithms, and the class `V3Graph` is A number of passes use graph algorithms, and the class `V3Graph` is
provided to represent those graphs. Graphs are directed, and algorithms are provided to represent those graphs. Graphs are directed, and algorithms are
provided to manipulate the graphs and to output them in provided to manipulate the graphs and to output them in
http://www.graphviz.org[GraphViz] dot format. `V3Graph.h` provides https://www.graphviz.org[GraphViz] dot format. `V3Graph.h` provides
documentation of this class. documentation of this class.
==== `V3GraphVertex` ==== `V3GraphVertex`
@ -744,7 +744,7 @@ into the obj_dir, .tree and .dot files.
=== .dot Output === .dot Output
Dot files are dumps of internal graphs in Dot files are dumps of internal graphs in
http://www.graphviz.org[Graphviz] dot format. When a dot file is dumped, https://www.graphviz.org[Graphviz] dot format. When a dot file is dumped,
Verilator will also print a line on stdout that can be used to format the Verilator will also print a line on stdout that can be used to format the
output, for example: output, for example:

View File

@ -228,7 +228,7 @@ void V3Error::v3errorEnd(std::ostringstream& sstr, const string& locationStr) {
if (!inFatal) { if (!inFatal) {
inFatal = true; inFatal = true;
if (s_tellManual==1) { if (s_tellManual==1) {
std::cerr<<warnMore()<<"... See the manual and http://www.veripool.org/verilator for more assistance."<<endl; std::cerr<<warnMore()<<"... See the manual and https://verilator.org for more assistance."<<endl;
s_tellManual = 2; s_tellManual = 2;
} }
#ifndef _V3ERROR_NO_GLOBAL_ #ifndef _V3ERROR_NO_GLOBAL_

View File

@ -281,7 +281,7 @@ void V3Graph::loopsVertexCb(V3GraphVertex* vertexp) {
} }
void V3Graph::dump(std::ostream& os) { void V3Graph::dump(std::ostream& os) {
// This generates a file used by graphviz, http://www.graphviz.org // This generates a file used by graphviz, https://www.graphviz.org
os<<" Graph:\n"; os<<" Graph:\n";
// Print vertices // Print vertices
for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp=vertexp->verticesNextp()) { for (V3GraphVertex* vertexp = verticesBeginp(); vertexp; vertexp=vertexp->verticesNextp()) {
@ -322,7 +322,7 @@ void V3Graph::dumpDotFilePrefixedAlways(const string& nameComment, bool colorAsS
} }
void V3Graph::dumpDotFile(const string& filename, bool colorAsSubgraph) const { void V3Graph::dumpDotFile(const string& filename, bool colorAsSubgraph) const {
// This generates a file used by graphviz, http://www.graphviz.org // This generates a file used by graphviz, https://www.graphviz.org
// "hardcoded" parameters: // "hardcoded" parameters:
const vl_unique_ptr<std::ofstream> logp (V3File::new_ofstream(filename)); const vl_unique_ptr<std::ofstream> logp (V3File::new_ofstream(filename));
if (logp->fail()) v3fatal("Can't write "<<filename); if (logp->fail()) v3fatal("Can't write "<<filename);

View File

@ -1401,7 +1401,7 @@ void V3Options::showVersion(bool verbose) {
cout << "License Version 2.0.\n"; cout << "License Version 2.0.\n";
cout <<endl; cout <<endl;
cout << "See http://www.veripool.org/verilator for documentation\n"; cout << "See https://verilator.org for documentation\n";
cout <<endl; cout <<endl;
cout << "Summary of configuration:\n"; cout << "Summary of configuration:\n";

View File

@ -139,7 +139,7 @@ void VlcOptions::showVersion(bool verbose) {
cout << "License Version 2.0.\n"; cout << "License Version 2.0.\n";
cout <<endl; cout <<endl;
cout << "See http://www.veripool.org/verilator for documentation\n"; cout << "See https://verilator.org for documentation\n";
} }
//###################################################################### //######################################################################

View File

@ -568,9 +568,9 @@ Specify the name of the bison executable, defaults to "bison."
=head1 DISTRIBUTION =head1 DISTRIBUTION
This is part of the L<http://www.veripool.org/> free Verilog EDA software This is part of the L<https://www.veripool.org/> free Verilog EDA software
tool suite. The latest version is available from CPAN and from tool suite. The latest version is available from CPAN and from
L<http://www.veripool.org/>. L<https://www.veripool.org/>.
Copyright 2008-2019 by Wilson Snyder. This package is free software; you Copyright 2008-2019 by Wilson Snyder. This package is free software; you
can redistribute it and/or modify it under the terms of either the GNU can redistribute it and/or modify it under the terms of either the GNU

View File

@ -216,9 +216,9 @@ Print the version number and exit.
=head1 DISTRIBUTION =head1 DISTRIBUTION
This is part of the L<http://www.veripool.org/> free Verilog EDA software This is part of the L<https://www.veripool.org/> free Verilog EDA software
tool suite. The latest version is available from CPAN and from tool suite. The latest version is available from CPAN and from
L<http://www.veripool.org/>. L<https://www.veripool.org/>.
Copyright 2014-2019 by Wilson Snyder. This package is free software; you Copyright 2014-2019 by Wilson Snyder. This package is free software; you
can redistribute it and/or modify it under the terms of either the GNU can redistribute it and/or modify it under the terms of either the GNU

View File

@ -6,4 +6,4 @@
: ... In instance t : ... In instance t
j.e(0), j.e(0),
^ ^
... See the manual and http://www.veripool.org/verilator for more assistance. ... See the manual and https://verilator.org for more assistance.

View File

@ -6,4 +6,4 @@
: ... In instance t : ... In instance t
tri g=g.and.g; tri g=g.and.g;
^~~ ^~~
... See the manual and http://www.veripool.org/verilator for more assistance. ... See the manual and https://verilator.org for more assistance.