pax_global_header00006660000000000000000000000064142430272420014512gustar00rootroot0000000000000052 comment=b58373b95ae16e8715f85af04f83cc401bf6d7fb speedometer-release-2.9/000077500000000000000000000000001424302724200153165ustar00rootroot00000000000000speedometer-release-2.9/.hgignore000066400000000000000000000000671424302724200171240ustar00rootroot00000000000000urwid throwaway dist Speedometer.egg-info build .*.pyc speedometer-release-2.9/.hgtags000066400000000000000000000002371424302724200165760ustar00rootroot0000000000000049738b2e1d43d2141e04873f7d0c038b58da2e28 release-2.6 607187fa10774014fd94a5ba52dd8528273d926c release-2.7 1ae5148198f5f848037ca63324e42dc983d18bd0 release-2.8 speedometer-release-2.9/CHANGELOG000066400000000000000000000057351424302724200165420ustar00rootroot00000000000000Speedometer 2.9 - 2022-05-24 * Convert to use Python 3, Python 2 support is dropped. * Requires psutil, BSD and macOS X should work now. * New option (-d or via pipe) to display bytes received from running shell command's standard output. Speedometer 2.8 - 2011-12-08 * Added a linear scale option: -l. Best used in combination with -m (and possibly -n) to customize the range to be displayed. Thanks to jukie.net for sponsoring this feature. * Replace silly "curved" reading with a weighted moving average * New option to display all values in bits per second: -s * New options to set minimum (-n) and maximum (-m) values displayed on the graphs in bytes/s. Defaults are -n 32 and -m 2**32 * Accept shortened versions of -rx and -tx: -r and -t My intent is to drop use of the original forms in 3.0 and add --long-versions of all options * Use IEC notation of sizes MiB, GiB etc. * Install script as both speedometer.py and speedometer Speedometer 2.7 - 2010-11-08 * Work better with light, dark and transparent backgrounds * Added monochrome and 88/256 color modes * New option to exit once a monitored download completes * Requires Urwid 0.9.9.1 or later Speedometer 2.6 - 2008-05-30 * Increase scale maximum to > 1GB/s * Hide Python traceback when user presses ^C * Make using plain text mode when Urwid is unavailable the default * Make blocky and smoothed modes look more similar * Fix simulation and file progress bugs Speedometer 2.5 - 2007-10-20 * Use Urwid's raw_display instead of curses_display module * Use regexp instead of find for parsing network information Speedometer 2.4 - 2006-04-09 * New -z option treats files that don't exist as zero length so speedometer will not wait for them to be created at startup. * Multiple file taps may now be used stacked vertically in the same column. Speedometer 2.3 - 2006-03-08 * Graphs may now be displayed with 8 times the resolution of old blocky graphs using a new UTF-8 smoothed display mode. Requires UTF-8 capable terminal in UTF-8 encoding (try uxterm) and Urwid 0.9.1 or later. * Use math.log without base for compatibility with Python 2.1. Speedometer 2.2 - 2005-12-27 * Read network statistics from /proc/net/dev instead of /sbin/ifconfig. Reduces CPU usage by 75% on test machine. Thanks to Don Rozenberg for the patch. Speedometer 2.1 - 2005-11-05 * New simultaneous display of multiple graphs with options for stacking graphs vertically or horizontally * New labels to differentiate each graph * Removed 0-32 B/s from display to make more room for higher speeds * Fixed a wait_creation bug Speedometer 2.0 - 2005-10-21 * New full-console bar graph display based on Urwid 0.8.9 * Realigned graphic scale to more common units Speedometer 1.4 - 2003-07-18 * New average and "smoothed" readings added Speedometer 1.3 - 2003-05-19 * New -i option for changing the refresh interval Speedometer 1.2 - 2003-03-21 * Initial public release speedometer-release-2.9/LICENSE000066400000000000000000000636421424302724200163360ustar00rootroot00000000000000 GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 Free Software Foundation, Inc. 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish); that you receive source code or can get it if you want it; that you can change the software and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and distribute a copy of this License along with the Library. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Library or any portion of it, thus forming a work based on the Library, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Library, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange. If distribution of object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 9. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties with this License. 11. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Library. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply, and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Library specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! speedometer-release-2.9/README.rst000066400000000000000000000024411424302724200170060ustar00rootroot00000000000000Speedometer =========== *Speedometer is looking for a maintainer*. Please open a ticket on github if you believe you could help maintain this project. Measure and display the rate of data across a network connection or data being stored in a file. * `Speedometer Home Page `_ New Changes ------------ 1. Python 3 is required now, mac os x platform is included. 2. Use python `psutil` module, instead of /dev/net for maximal compatibility. 3. New -d options, support to measure data from running external shell standard output. * python speedometer.py -d "ls -lR /" * python speedometer.py -d "curl https://download.site/file.iso --output -" * python speedometer.py -d "curl https://download.site/file.iso --output - | tee newfile.iso" 4. Support data source from `standard input` or `pipe line`, working only for plain text mode. * cat /dev/urandom | python speedometer.py * python speedometer.py < /dev/urandom * curl --output - https://download.site/file.iso 2>/dev/null | python speedometer.py Screen Shots ------------ .. image:: http://excess.org/media/speedometer-transp1.png :alt: speedometer screen shot w/ transparent bg .. image:: http://excess.org/media/speedometer-light16.png :alt: speedometer screen shot w/ multiple graphs speedometer-release-2.9/setup.py000077500000000000000000000036761424302724200170470ustar00rootroot00000000000000#!/usr/bin/env python # # Urwid setup.py exports the useful bits # Copyright (C) 2004-2010 Ian Ward # # This library is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This library 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 # Lesser General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, see . # # Urwid web site: http://excess.org/urwid/ from setuptools import setup import os setup_d = { 'name': "Speedometer", 'version': '2.9', 'author': "Ian Ward", 'author_email': "ian@excess.org", 'url': "http://excess.org/speedometer/", 'scripts': ['speedometer.py'], 'entry_points': { 'console_scripts': ['speedometer = speedometer:console'],}, 'install_requires': ['urwid >= 0.9.9.1', 'psutil'], 'license':"LGPL", 'keywords':"network bandwidth monitor system speed download file progress console", 'platforms':"Linux", 'description':"Console monitor of the rate of data across a network connection or data being stored in a file.", 'classifiers':[ "Development Status :: 4 - Beta", "Environment :: Console", "Environment :: Console :: Curses", "Intended Audience :: Developers", "Intended Audience :: System Administrators", "License :: OSI Approved :: GNU Library or Lesser General Public License (LGPL)", "Operating System :: POSIX :: Linux", "Topic :: System :: Monitoring", "Topic :: System :: Networking :: Monitoring", ], } setup(** setup_d) speedometer-release-2.9/sim_multi.sh000077500000000000000000000013431424302724200176600ustar00rootroot00000000000000#!/bin/sh ./speedometer.py $@ -z -i 2 \ /home/ian/some_file_or_another 33800000 -S \ 0 1000 \ 100000 100000 100000 100000 \ 160000 160000 160000 160000 \ 120000 180000 160000 180000 \ 220000 220000 280000 280000 \ 320000 380000 320000 320000 \ 320000 360000 380000 220000 \ 360000 380000 320000 320000 \ -c \ -rx eth0 -S \ 0 1200 \ 150000 150000 150000 150000 \ 180000 180000 180000 180000 \ 200000 200000 280000 200000 \ 300000 300000 380000 300000 \ 400000 400000 380000 300000 \ 400000 400000 380000 400000 \ 400000 400000 380000 300000 \ -tx eth0 -S \ 150 1800 0 1800 0 1800 0 1800 \ 0 1800 0 2800 0 1800 0 1800 \ 0 1800 0 1800 0 1800 0 1800 \ 0 1800 0 1800 0 1800 0 1800 \ 0 1800 0 2800 0 1800 0 1800 \ 0 1800 0 1800 0 1800 0 1800 \ speedometer-release-2.9/sim_progress.sh000077500000000000000000000011041424302724200203650ustar00rootroot00000000000000#!/bin/sh ./speedometer.py $@ -z -i 2 somefile 35000000 -S \ 0 1000 320000 320000 300000 320000 320000 320000 320000 \ 320000 320000 320000 320000 320000 320000 220000 \ 320000 320000 320000 300000 320000 320000 320000 \ 320000 320000 320000 320000 320000 320000 220000 \ 320000 320000 320000 300000 320000 320000 320000 \ 320000 320000 320000 320000 320000 320000 220000 \ 320000 320000 320000 300000 320000 320000 320000 \ 320000 320000 320000 320000 320000 320000 220000 \ 320000 320000 320000 320000 320000 320000 320000 \ 320000 320000 320000 300000 320000 320000 220000 \ speedometer-release-2.9/sim_speedometer.sh000077500000000000000000000006431424302724200210440ustar00rootroot00000000000000#!/bin/sh ./speedometer.py $@ -i 2 -rx eth0 -S 0 100 500 200 20000 30000 26500 70000 90000 100000 \ 40000 20000 30000 50000 90000 \ 85000 82000 83000 4000 3000 300 0 0 0 \ 5000 10000 40000 100000 400000 800000 800000 5000000 \ 7000000 10000000 11000000 20000000 9000000 15000000 \ 500000 4000 500 0 0 0 400 0 0 0 200 0 0 0 400 0 0 0 500 \ 10000 1000000 1000000 1100000 1000000 1300000 1000000 \ 12000 1000 500 speedometer-release-2.9/speedometer.py000066400000000000000000001217251424302724200202140ustar00rootroot00000000000000#!/usr/bin/python # speedometer.py # Copyright (C) 2001-2012 Ian Ward # # This module is free software; you can redistribute it and/or # modify it under the terms of the GNU Lesser General Public # License as published by the Free Software Foundation; either # version 2.1 of the License, or (at your option) any later version. # # This module 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 # Lesser General Public License for more details. import time import sys import os import string import math import re import psutil import threading import subprocess import select import pkg_resources try: __version__ = pkg_resources.get_distribution('speedometer').version except pkg_resources.DistributionNotFound: # Not installed yet. __version__ = 'develop' __usage__ = """Usage: speedometer [options] tap [[-c] tap]... Monitor network traffic or speed/progress of a file transfer. At least one tap must be entered. -c starts a new column, otherwise taps are piled vertically. Taps: -f filename [size] display download speed [with progress bar] -r network-interface display bytes received on network-interface -t network-interface display bytes transmitted on network-interface -d command display bytes received from running shell command standard output -c start a new column for following tap arguments Options: -b use old blocky display instead of smoothed display even when UTF-8 encoding is detected (use this if you see strange characters) -i interval-in-seconds eg. "5" or "0.25" default: "1" -k (1|16|88|256) set the number of colors this terminal supports (default 16) -l use linear charts instead of logarithmic you will VERY LIKELY want to set -m as well -m chart-maximum set the maximum bytes/second displayed on the chart (default 2^32) -n chart-minimum set the minimum bytes/second displayed on the chart (default 32) -p use original plain-text display (one tap only) default is Yes if data source is from standard input -s use bits/s instead of bytes/s -x exit when files reach their expected size -z report zero size on files that don't exist instead of waiting for them to be created Note: -rx and -tx are accepted as aliases for -r and -t for compatibility with earlier releases of speedometer. -f may be also omitted for similar reasons. """ __urwid_info__ = """ Speedometer requires Urwid 0.9.9.1 or later when not using plain-text display. Urwid may be downloaded from: http://excess.org/urwid/ Urwid may be installed system-wide or in the same directory as speedometer. """ INITIAL_DELAY = 0.5 # seconds INTERVAL_DELAY = 1.0 # seconds VALID_NUM_COLORS = (1, 16, 88, 256) # FIXME: these globals are becoming a pain # time for more encapsulation, maybe even per-chart settings? logarithmic_scale = True units_per_second = 'bytes' chart_minimum = 2**5 chart_maximum = 2**32 graph_scale = None def update_scale(): """ parse_args has set chart min/max, units_per_second and logarithmic_scale use those settings to generate a scale of values for the LHS of the graph """ global graph_scale if logarithmic_scale: # be lazy and just use the same scale we always have predefined = { 'bytes': [ (2**10, ' 1KiB\n /s'), (2**15, '32KiB\n /s'), (2**20, ' 1MiB\n /s'), (2**25, '32MiB\n /s'), (2**30, ' 1GiB\n /s'), ], 'bits': [ (2**7, ' 1Kib\n /s'), (2**12, '32Kib\n /s'), (2**17, ' 1Mib\n /s'), (2**22, '32Mib\n /s'), (2**27, ' 1Gib\n /s'), ]} graph_scale = [(s, label) for s, label in predefined[units_per_second] if chart_minimum < s < chart_maximum] return # linear, we need to generate one granularity = math.log(graph_range(), 2) granularity -= 2 # magic number, creates at least 4 lines on the scale granularity = 2**int(granularity) # only want proper powers of two n, r = divmod(chart_minimum, granularity) n = n * granularity + (granularity if r else 0) graph_scale = [] while n < chart_maximum: graph_scale.append((n, readable_speed(n))) n += granularity def graph_min(): return math.log(chart_minimum,2) if logarithmic_scale else chart_minimum def graph_max(): return math.log(chart_maximum,2) if logarithmic_scale else chart_maximum def graph_range(): return graph_max() - graph_min() def graph_lines_captions(): s = graph_scale if logarithmic_scale: s = [(math.log(x, 2), cap) for x, cap in s] # XXX: quick hack to make this work like it used to delta = graph_min() s = [(x - delta, cap) for x, cap in s] return list(reversed(s)) def graph_lines(): return [x[0] for x in graph_lines_captions()] URWID_IMPORTED = False URWID_UTF8 = False try: import urwid if urwid.VERSION >= (0, 9, 9, 1): URWID_IMPORTED = True URWID_UTF8 = urwid.get_encoding_mode() == "utf8" except (ImportError, AttributeError): pass class Speedometer: def __init__(self,maxlog=5): """speedometer(maxlog=5) maxlog is the number of readings that will be stored""" self.log = [] self.start = None self.maxlog = maxlog def get_log(self): return self.log def update(self, bytes): """update(bytes) => None add a byte reading to the log""" t = time.time() reading = (t,bytes) if not self.start: self.start = reading self.log.append(reading) self.log = self.log[ - (self.maxlog+1):] def delta(self, readings=0, skip=0): """delta(readings=0) -> time passed, byte increase if readings is 0, time since start is given don't include the last 'skip' readings None is returned if not enough data available""" assert readings >= 0 assert readings <= self.maxlog, "Log is not long enough to satisfy request" assert skip >= 0 if skip > 0: assert readings > 0, "Can't skip when reading all" if skip > len(self.log)-1: return # not enough data current = self.log[-1 -skip] target = None if readings == 0: target = self.start elif len(self.log) > readings+skip: target = self.log[-(readings+skip+1)] if not target: return # not enough data if target == current: return byte_increase = current[1]-target[1] time_passed = current[0]-target[0] return time_passed, byte_increase def speed(self, *l, **d): d = self.delta(*l, **d) if d: return delta_to_speed(d) class EndOfData(Exception): pass class MultiGraphDisplay(object): def __init__(self, cols, urwid_ui, exit_on_complete, shiny_colors): smoothed = urwid_ui == "smoothed" self.displays = [] l = [] for c in cols: a = [] for tap in c: if tap.ftype == 'file_exp': d = GraphDisplayProgress(tap, smoothed) else: d = GraphDisplay(tap, smoothed) if shiny_colors: d = ShinyMap(d, shiny_colors) a.append(d) self.displays.append(d) l.append(a) graphs = urwid.Columns([urwid.Pile(a) for a in l], 1) graphs = urwid.AttrWrap(graphs, 'background') title = urwid.Text(" Speedometer "+__version__) title = urwid.AttrWrap(urwid.Filler(title), 'title') self.top = urwid.Overlay(title, graphs, ('fixed left', 5), 17, ('fixed top', 0), 1) self.urwid_ui = urwid_ui self.exit_on_complete = exit_on_complete palette = [ # name, 16-color fg, bg, mono fg, 88/256-color fg, bg # main bar graph ('background', 'dark gray', '', '', 'g20', 'g70'), ('bar:top', 'dark cyan', '', '', '#488', ''), ('bar', '', 'dark cyan','standout', '', '#488'), ('bar:num', '', '', '', '#066', 'g70'), # latest "curved" + average bar graph at right side ('ca:background', '', '', '', '', ''), ('ca:c:top', 'dark blue', '', '', '#66d', ''), ('ca:c', '', 'dark blue','standout', '', '#66d'), ('ca:c:num', 'light blue','', '', '#006', 'g70'), ('ca:a:top', 'light gray','', '', '#6b6', ''), ('ca:a', '', 'light gray','standout','', '#6b6'), ('ca:a:num', 'light gray','', 'bold', '#060', 'g70'), # text headings and numeric values displayed ('title', '', '', 'underline,bold', '#fff,bold', '#488'), ('reading', '', '', '', '#886', 'g70'), # progress bar ('pr:n', '', 'dark blue','', 'g11', '#bb6'), ('pr:c', '', 'dark green','standout','g11', '#fd0'), ('pr:cn', 'dark green','dark blue','', '#fd0', '#bb6'), ] def main(self, num_colors): self.loop = urwid.MainLoop(self.top, palette=self.palette, unhandled_input=self.unhandled_input) self.loop.screen.set_terminal_properties(colors=num_colors) try: pending = self.update_readings() if self.exit_on_complete and pending == 0: return except EndOfData: return time.sleep(INITIAL_DELAY) self.update_callback() self.loop.run() def unhandled_input(self, key): "Exit on Q or ESC" if key in ('q', 'Q', 'esc'): SubprocessJobQueue.stop_all_job() StdinJobQueue.stop_all_job() raise urwid.ExitMainLoop() def update_callback(self, *args): next_call_in = INTERVAL_DELAY if isinstance(time, SimulatedTime): next_call_in = 0 time.sleep(INTERVAL_DELAY) # update simulated time self.loop.set_alarm_in(next_call_in, self.update_callback) try: pending = self.update_readings() if self.exit_on_complete and pending == 0: return except EndOfData: self.end_of_data() raise urwid.ExitMainLoop() def update_readings(self): pending = 0 for d in self.displays: if d.base_widget.update_readings(): pending += 1 return pending def end_of_data(self): # pause for taking screenshot of simulated data if isinstance(time, SimulatedTime): while not self.loop.screen.get_input(): pass class GraphDisplay(urwid.WidgetWrap): def __init__(self,tap, smoothed): if smoothed: self.speed_graph = SpeedGraph( ['background','bar'], ['background','bar'], {(1,0):'bar:top'}) self.cagraph = urwid.BarGraph( ['ca:background', 'ca:c', 'ca:a'], ['ca:background', 'ca:c', 'ca:a'], {(1,0):'ca:c:top', (2,0):'ca:a:top', }) else: self.speed_graph = SpeedGraph([ ('background', ' '), ('bar', ' ')], ['background', 'bar']) self.cagraph = urwid.BarGraph([ ('ca:background', ' '), ('ca:c',' '), ('ca:a',' '),] ) self.last_reading = urwid.Text("",align="right") scale = urwid.GraphVScale(graph_lines_captions(), graph_range()) footer = self.last_reading graph_cols = urwid.Columns([('fixed', 5, scale), self.speed_graph, ('fixed', 4, self.cagraph)], dividechars = 1) self.top = urwid.Frame(graph_cols, footer=footer) self.spd = Speedometer(6) self.feed = tap.feed self.description = tap.description() super(GraphDisplay, self).__init__(self.top) def update_readings(self): f = self.feed() if f is None: raise EndOfData self.spd.update(f) s = self.spd.speed(1) # last sample c = curve(self.spd) # "curved" reading a = self.spd.speed() # running average self.speed_graph.append_log(s) self.last_reading.set_text([ ('title', [self.description, " "]), ('bar:num', [readable_speed(s), " "]), ('ca:c:num',[readable_speed(c), " "]), ('ca:a:num',readable_speed(a)) ]) self.cagraph.set_data([ [speed_scale(c),0], [0,speed_scale(a)], ], graph_range()) class GraphDisplayProgress(GraphDisplay): def __init__(self, tap, smoothed): GraphDisplay.__init__(self, tap, smoothed) self.spd = FileProgress(6, tap.expected_size) if smoothed: self.pb = urwid.ProgressBar('pr:n','pr:c',0, tap.expected_size, 'pr:cn') else: self.pb = urwid.ProgressBar('pr:n','pr:c',0, tap.expected_size) self.est = urwid.Text("") pbest = urwid.Columns([self.pb,('fixed',10,self.est)], 1) newfoot = urwid.Pile([self.top.footer, pbest]) self.top.footer = newfoot def update_readings(self): GraphDisplay.update_readings(self) current, expected = self.spd.progress() self.pb.set_completion(current) e = self.spd.completion_estimate() if e is not None: self.est.set_text(readable_time(e,10)) return current < expected class SpeedGraph: def __init__(self, attlist, hatt=None, satt=None): if satt is None: self.graph = urwid.BarGraph(attlist, hatt) else: self.graph = urwid.BarGraph(attlist, hatt, satt) # override BarGraph's get_data self.graph.get_data = self.get_data self.smoothed = satt is not None self.log = [] self.bar = [] def get_data(self, max_col_row): maxcol, maxrow = max_col_row bar = self.bar[-maxcol:] if len(bar) < maxcol: bar = [[0]]*(maxcol-len(bar)) + bar return bar, graph_range(), graph_lines() def selectable(self): return False def render(self, max_col_row, focus=False): maxcol, maxrow = max_col_row left = max(0, len(self.log)-maxcol) pad = maxcol-(len(self.log)-left) topl = self.local_maximums(pad, left) yvals = [ max(self.bar[i]) for i in topl ] yvals = urwid.scale_bar_values(yvals, graph_range(), maxrow) graphtop = self.graph for i,y in zip(topl, yvals): s = self.log[ i ] txt = urwid.Text(readable_speed(s)) label = urwid.AttrWrap(urwid.Filler(txt), 'reading') graphtop = urwid.Overlay(label, graphtop, ('fixed left', pad+i-4-left), 10, ('fixed top', max(0,y-2)), 1) return graphtop.render((maxcol, maxrow), focus) def local_maximums(self, pad, left): """ Generate a list of indexes for the local maximums in self.log """ ldist, rdist = 4,5 l = self.log if len(l) <= ldist+rdist: return [] dist = ldist+rdist highs = [] for i in range(left+max(0, ldist-pad),len(l)-rdist+1): li = l[i] if li == 0: continue if i and l[i-1] is not None and l[i-1]>=li: continue if li is None or l[i+1]>li: continue highs.append((li, -i)) highs.sort() highs.reverse() tag = [False]*len(l) out = [] for li, i in highs: i=-i if tag[i]: continue for k in range(max(0,i-dist), min(len(l),i+dist)): tag[k]=True out.append(i) return out def append_log(self, s): x = speed_scale(s) o = [x] self.bar = self.bar[-300:] + [o] self.log = self.log[-300:] + [s] def speed_scale(s): if s is None or s <= 0: return 0 if logarithmic_scale: s = math.log(s, 2) s = min(graph_range(), max(0, s-graph_min())) return s def delta_to_speed(delta): """delta_to_speed(delta) -> speed in bytes per second""" time_passed, byte_increase = delta if time_passed <= 0: return 0 if int(time_passed*1000) == 0: return 0 return int(byte_increase*1000)/int(time_passed*1000) def readable_speed(speed): """ readable_speed(speed) -> string speed is in bytes per second returns a readable version of the speed given """ if speed == None or speed < 0: speed = 0 units = "B/s ", "KiB/s", "MiB/s", "GiB/s", "TiB/s" step = 1 for u in units: if step > 1: s = "%4.2f " %(float(speed)/step) if len(s) <= 5: return s + u s = "%4.1f " %(float(speed)/step) if len(s) <= 5: return s + u if speed/step < 1024: return "%4d " %(speed/step) + u step = step * 1024 return "%4d " % (speed/(step/1024)) + units[-1] def readable_speed_bits(speed): """ bits/s version of readable_speed() """ if speed == None or speed < 0: speed = 0 speed = speed * 8 units = "b/s ", "Kib/s", "Mib/s", "Gib/s", "Tib/s" step = 1 for u in units: if step > 1: s = "%4.2f " %(float(speed)/step) if len(s) <= 5: return s + u s = "%4.1f " %(float(speed)/step) if len(s) <= 5: return s + u if speed/step < 1024: return "%4d " %(speed/step) + u step = step * 1024 return "%4d " % (speed/(step/1024)) + units[-1] def graphic_speed(speed): """graphic_speed(speed) -> string speed is bytes per second returns a graphic representing given speed""" if speed == None: speed = 0 speed_val = [0]+[int(2**(x*5.0/3)) for x in range(20)] speed_gfx = [ r"\ ", r".\ ", r"..\ ", r"...\ ", r"...:\ ", r"...::\ ", r"...:::\ ", r"...:::+| ", r"...:::++| ", r"...:::+++| ", r"...:::+++#| ", r"...:::+++##| ", r"...:::+++###| ", r"...:::+++###%| ", r"...:::+++###%%/ ", r"...:::+++###%%%/ ", r"...:::+++###%%%// ", r"...:::+++###%%%/// ", r"...:::+++###%%%//// ", r"...:::+++###%%%///// ", r"...:::+++###%%%//////", ] for i in range(len(speed_val)-1): low, high = speed_val[i], speed_val[i+1] if speed > high: continue if speed - low < high - speed: return speed_gfx[i] else: return speed_gfx[i+1] return speed_gfx[-1] def file_size_feed(filename): """file_size_feed(filename) -> function that returns given file's size""" def sizefn(filename=filename,os=os): try: return os.stat(filename)[6] except: return 0 return sizefn class NetworkFeed: @classmethod def network_feed(cls, device, rxtx): """network_feed(device,rxtx) -> function that returns given device stream speed rxtx is "RX" or "TX" """ assert rxtx in ["RX","TX"] r = re.compile(r"^\s*" + re.escape(device) + r":(.*)$", re.MULTILINE) def networkfn(devre=r,rxtx=rxtx): if device not in psutil.net_if_addrs().keys(): sys.stderr.write("Network interface %s is not available\n\n" % device) sys.exit(1) if rxtx == 'RX': val=psutil.net_io_counters(pernic=True)[device].bytes_recv else: val=psutil.net_io_counters(pernic=True)[device].bytes_sent return int(val) return networkfn class SubProcessFeed: def __init__(self, cmd=None): self.buffer_current_size = 1 self.is_running = False self.cmd = cmd def stdinfn(self, *args, **kwargs): if self.is_running: return self.buffer_current_size else: self.is_running = True self.sub_process_job = SubprocessJob(feed=self) self.thread = threading.Thread(target=self.sub_process_job.run_job, args=(self.cmd ,)) self.thread.start() return 0 def file_size_feed(self): return self.stdinfn @classmethod def set_command(self, cmd): self.cmd = cmd def set_buffer_size(self, size): self.buffer_current_size = size def get_buffer_size(self): return self.buffer_current_size class StdinFeed: def __init__(self): self.buffer_current_size = 0 self.is_running = False def stdinfn(self, *args, **kwargs): if self.is_running: return self.buffer_current_size else: self.is_running = True self.stdin_job = StdinJob(feed=self) self.thread = threading.Thread(target=self.stdin_job.run_job) self.thread.start() return 0 def file_size_feed(self): return self.stdinfn def set_buffer_size(self, size): self.buffer_current_size = size def get_buffer_size(self): return self.buffer_current_size class SubprocessJobQueue: job_list = [] @classmethod def add_job(cls, id): cls.job_list.append(id) @classmethod def stop_all_job(cls): for item in cls.job_list: item.stop_job() class SubprocessJob: def __init__(self, feed): self.current_job_process = None self.current_job_process_is_stop = None self.default_read_size = 10240*100 self.feed = feed SubprocessJobQueue.add_job(self) def stop_job(self): if self.current_job_process: try: self.current_job_process.terminate() except: pass self.current_job_process_is_stop = True time.sleep(0.2) return True return False def run_job(self, args): self.current_job_process = subprocess.Popen(args, shell=True, stdout=subprocess.PIPE, stderr=subprocess.PIPE, bufsize=self.default_read_size) size = 0 def is_avail(): return self.current_job_process.stdout.peek() while True: if self.current_job_process and is_avail() and not self.current_job_process_is_stop: self.current_job_process.stdout.read(self.default_read_size) size+= self.default_read_size self.feed.set_buffer_size(size) else: self.stop_job() time.sleep(0.2) self.feed.set_buffer_size(None) break class StdinJobQueue: job_list = [] @classmethod def add_job(cls, id): cls.job_list.append(id) @classmethod def stop_all_job(cls): for item in cls.job_list: item.stop_job() class StdinJob: def __init__(self, feed): self.current_job_process = None self.current_job_process_is_stop = None self.default_read_size = 10240*100 self.feed = feed StdinJobQueue.add_job(self) def stop_job(self): self.current_job_process_is_stop = True time.sleep(0.3) return True def run_job(self): size = 0 stdin_handler = sys.stdin.buffer.read while not self.current_job_process_is_stop: i, _, _ = select.select( [sys.stdin], [], []) if not i: time.sleep(0.03) continue try: data = stdin_handler(self.default_read_size) except: data = None if data: size+=self.default_read_size self.feed.set_buffer_size(size) else: self.stop_job() time.sleep(0.2) self.feed.set_buffer_size(None) break class SimulatedFeed: @classmethod def simulated_feed(cls, data): total = 0 adjusted_data = [0] for d in data: d = int(d) adjusted_data.append(d + total) total += d def simfn(data=adjusted_data): if data: return int(data.pop(0)) return None return simfn class SimulatedTime: def __init__(self, start): self.t = start def sleep(self, length): self.t += length def time(self): return self.t class FileProgress: """FileProgress monitors a file's size vs time and expected size to produce progress and estimated completion time readings""" samples_for_estimate = 4 def __init__(self, maxlog, expected_size): """FileProgress(expected_size) expected_size is the file's expected size in bytes""" self.expected_size = expected_size self.speedometer = Speedometer(maxlog) self.current_size = None self.speed = self.speedometer.speed self.delta = self.speedometer.delta def update(self, current_size): """update(current_size) current_size is the current file size update will record the current size and time""" self.current_size = current_size self.speedometer.update(self.current_size) def progress(self): """progress() -> (current size, expected size) current size will be None until update is called""" return self.current_size, self.expected_size def completion_estimate(self): """completion_estimate() -> estimated seconds remaining will return None if not enough data is available""" d = self.speedometer.delta(self.samples_for_estimate) if not d: return None # not enough readings (seconds,bytes) = d if bytes <= 0: return None # currently stalled remaining = self.expected_size - self.current_size if remaining <= 0: return 0 # all done -- no time remaining seconds_left = float(remaining)*seconds/bytes return seconds_left def average_speed(self): """average_speed() -> bytes per second since start will return None if not enough data""" return self.speedometer.speed() def current_speed(self): """current_speed() -> latest bytes per second reading will return None if not enough data""" return self.speedometer.speed(1) def graphic_progress(progress, columns): """graphic_progress(progress, columns) -> string progress is a tuple of (value, max) columns is length of string returned returns a graphic representation of value vs. max""" value, max = progress f = float(value) / float(max) if f > 1: f = 1 if f < 0: f = 0 filled = int(f*columns) gfx = "#" * filled + "-" * (columns-filled) return gfx def time_as_units(seconds): """time_units(seconds) -> list of (count, suffix) tuples returns a unit breakdown for the given number of seconds""" if seconds==None: seconds=0 # (multiplicative factor, suffix) units = (1,"s"), (60,"m"), (60,"h"), (24,"d"), (7,"w"), (52,"y") scale = 1 topunit = -1 # find the top unit to use for mul, suf in units: if seconds / (scale*mul) < 1: break topunit = topunit+1 scale = scale * mul # build the list reading backwards from top unit out = [] for i in range(topunit, -1, -1): mul,suf = units[i] value = int(seconds/scale) seconds = seconds - value * scale scale = scale / mul out.append((value, suf)) return out def readable_time(seconds, columns=None): """readable_time(seconds, columns=None) -> string return the seconds as a readable string if specified, columns is the maximum length of the returned string""" out = "" for value, suf in time_as_units(seconds): new_out = out if out: new_out = new_out + ' ' new_out = new_out + value + suf if columns and len(new_out) > columns: break out = new_out return out class ArgumentError(Exception): pass def console(): """Console mode""" try: cols, urwid_ui, zero_files, exit_on_complete, num_colors, shiny_colors = parse_args() except ArgumentError: sys.stderr.write(__usage__) if not URWID_IMPORTED: sys.stderr.write(__urwid_info__) sys.stderr.write("""\nPython Version: %d.%d\n""""""Urwid >= 0.9.9.1 detected: %s\nUTF-8 encoding detected: %s\n """ % (sys.version_info[:2] + (["NO","yes"][URWID_IMPORTED],) + (["NO","yes"][URWID_UTF8],))) return update_scale() if zero_files: for c in cols: a = [] for tap in c: if hasattr(tap, 'report_zero'): tap.report_zero() try: # wait for every tap to be able to read wait_all(cols) except KeyboardInterrupt: return # plain-text mode if not urwid_ui: [[tap]] = cols if tap.ftype == 'file_exp': do_progress(tap.feed, tap.expected_size, exit_on_complete) else: do_simple(tap.feed) return do_display(cols, urwid_ui, exit_on_complete, num_colors, shiny_colors) def do_display(cols, urwid_ui, exit_on_complete, num_colors, shiny_colors): mg = MultiGraphDisplay(cols, urwid_ui, exit_on_complete, shiny_colors) mg.main(num_colors) class SubProcessTap: def __init__(self, cmd=None): self.ftype = 'subprocess' self.feed = SubProcessFeed(cmd=cmd).file_size_feed() self.wait = False def report_zero(self): self.wait = False def description(self): return "Sub process" def wait_creation(self): return class FileTap: def __init__(self, name): self.ftype = 'file' self.file_name = name self.feed = file_size_feed(name) self.wait = True def set_expected_size(self, size): self.expected_size = int(size) self.ftype = 'file_exp' def report_zero(self): self.wait = False def description(self): return "FILE: "+ self.file_name def wait_creation(self): if not self.wait: return if not os.path.exists(self.file_name): sys.stdout.write("Waiting for '%s' to be created...\n" % self.file_name) while not os.path.exists(self.file_name): time.sleep(1) class StdinTap: def __init__(self): self.ftype = 'stdin' self.feed = StdinFeed().file_size_feed() self.wait = False def report_zero(self): self.wait = False def description(self): return "Pipe/Stdin" def wait_creation(self): return False class NetworkTap: def __init__(self, rxtx, interface): self.ftype = rxtx self.interface = interface self.feed = NetworkFeed.network_feed(interface, rxtx) def description(self): return self.ftype+": "+self.interface def wait_creation(self): if self.feed() is not None: return sys.stdout.write("Waiting for network statistics from interface '%s'...\n" % self.interface) while self.feed() == None: time.sleep(1) def parse_args(): args = sys.argv[1:] tap = None zero_files = False interval_set = False exit_on_complete = False num_colors = 16 colors_set = False shiny_colors = None cols = [] taps = [] isatty = False def push_tap(tap, taps): if tap is None: return taps.append(tap) if not sys.stdin.isatty(): isatty = True push_tap(tap, taps) tap = StdinTap() urwid_ui = False elif URWID_UTF8: urwid_ui = 'smoothed' elif URWID_IMPORTED: urwid_ui = 'blocky' else: urwid_ui = False i = 0 while i < len(args): op = args[i] if op in ("-h","--help"): raise ArgumentError elif op in ("-d", "-i", "-r", "-rx", "-t", "-tx", "-f", "-k", "-m", "-n"): # combine two part arguments with the following argument try: if op != "-f": # keep support for -f being optional args[i+1] = op + args[i+1] except IndexError: raise ArgumentError push_tap(tap, taps) tap = None elif op == "-S": # undocumented simulation option simargs = [] i += 1 while i < len(args) and args[i][:1] != "-": simargs.append(args[i]) i += 1 simulate = tap if not simulate: simulate = taps[-1] simulate.feed = SimulatedFeed.simulated_feed(simargs) global time time = SimulatedTime(time.time()) continue elif op[:2] == '-d': push_tap(tap, taps) process_tap = SubProcessTap(cmd=op[2:]) tap = SubProcessTap(cmd=op[2:]) elif op == "-p": # disable urwid ui urwid_ui = False elif not sys.stdin.isatty(): urwid_ui = False elif op == "-b": urwid_ui = 'blocky' elif op == "-s": global readable_speed global units_per_second readable_speed = readable_speed_bits units_per_second = 'bits' elif op == "-x": exit_on_complete = True elif op == "-z": zero_files = True elif op[:2] == "-k": if colors_set: raise ArgumentError try: num_colors = int(op[2:]) assert num_colors in VALID_NUM_COLORS except: raise ArgumentError if num_colors>16: shiny_colors = num_colors colors_set = True elif op[:2] == "-i": if interval_set: raise ArgumentError global INTERVAL_DELAY global INITIAL_DELAY try: INTERVAL_DELAY = float(op[2:]) except: raise ArgumentError if INTERVAL_DELAY1 or cols): raise ArgumentError if not taps: raise ArgumentError cols.append(taps) if chart_maximum <= chart_minimum: raise ArgumentError return cols, urwid_ui, zero_files, exit_on_complete, num_colors, shiny_colors def autodetect_taps(taps): print("no taps specified, add all... ") for dev in psutil.net_if_addrs().keys(): taps.append(NetworkTap('RX', dev)) taps.append(NetworkTap('TX', dev)) def do_simple(feed): try: spd = Speedometer(6) f = feed() if f is None: return spd.update(f) time.sleep(INITIAL_DELAY) while 1: f = feed() if f is None: return spd.update(f) s = spd.speed(1) # last sample c = curve(spd) # "curved" reading a = spd.speed() # running average show(s,c,a) time.sleep(INTERVAL_DELAY) except KeyboardInterrupt: SubprocessJobQueue.stop_all_job() StdinJobQueue.stop_all_job() def curve(spd): """Try to smooth speed fluctuations""" val = [6, 5, 4, 3, 2, 1] # speed sampling relative weights wtot = 0 # total weighting ws = 0.0 # weighted speed for i in range(len(val)): d = spd.delta(1,i) if d==None: break # ran out of data t, b = d v = val[i] wtot += v ws += float(b)*v/t return delta_to_speed((wtot, ws)) def show(s, c, a, out = sys.stdout.write): out(readable_speed(s)) out(" c:" + readable_speed(c)) out(" A:" + readable_speed(a)) out(" (" + graphic_speed(s)+")") out('\n') sys.stdout.flush() def do_progress(feed, size, exit_on_complete): try: fp = FileProgress(4, int(size)) out = sys.stdout.write f = feed() if f is None: return fp.update(f) time.sleep(INITIAL_DELAY) while 1: f = feed() if f is None: return fp.update(f) out('('+graphic_speed(fp.current_speed())+')') out(readable_speed(fp.current_speed())) out(' ['+graphic_progress(fp.progress(), 36)+']') out(' '+readable_time(fp.completion_estimate())) out('\n') current, expected = fp.progress() if exit_on_complete and current >= expected: break time.sleep(INTERVAL_DELAY) except KeyboardInterrupt: SubprocessJob.stop_job() StdinJob.stop_job() def wait_all(cols): for c in cols: for tap in c: tap.wait_creation() def shiny(y): """ return a value between 0 (dark) and 1 (bright) for a given y position between 0 (top) and 1 (bottom) to create a "shiny" background effect """ gamma = 1 - (4 * (y - 0.25)) ** 2 if y < 0.5 else (2*y - 1) ** 2 return max(0, min(1, (gamma - 0.2)*1.2)) class ShinyMap(urwid.WidgetPlaceholder): def __init__(self, w, colors): assert colors in (88, 256) self._colors = colors super(ShinyMap, self).__init__(w) self._shiny_cache = [] self._shiny_cache_maxrow = None def _rebuild_shiny_cache(self, maxrow): prev_gray = None if self._shiny_cache_maxrow == maxrow: return self._shiny_cache = [] self._shiny_cache_maxrow = maxrow for y in range(maxrow): gamma = shiny(1 - (y+0.5)/maxrow) if self._colors == 256: gamma = gamma * 25 + 10 else: gamma = gamma * 45 spec = urwid.AttrSpec('g70', 'g%d' % gamma, self._colors) gray = spec.background if prev_gray == gray: amap, num = self._shiny_cache[-1] self._shiny_cache[-1] = amap, num + 1 continue prev_gray = gray amap = { 'background': spec, 'bar:top': urwid.AttrSpec('#488', gray, self._colors), 'reading': spec, 'ca:background': spec, 'ca:c:top': urwid.AttrSpec('#66d', gray, self._colors), 'ca:a:top': urwid.AttrSpec('#6b6', gray, self._colors), } self._shiny_cache.append((amap, 1)) def render(self, size, focus=False): maxcol, maxrow = size canv = super(ShinyMap, self).render(size, focus) self._rebuild_shiny_cache(maxrow) slivers = [] y = 0 for amap, run in self._shiny_cache: c = urwid.CompositeCanvas(canv) c.trim(y, run) y = y + run c.fill_attr_apply(amap) slivers.append((c, None, False)) return urwid.CanvasCombine(slivers) if __name__ == "__main__": try: console() except KeyboardInterrupt as err: pass