├── .gitignore
├── images
    └── probe_demo1.png
├── Makefile
├── CONTRIBUTING.md
├── .github
    └── ISSUE_TEMPLATE
    │   └── feature_request.md
├── include
    ├── CentralDogma.hpp
    └── TerminalDogma.hpp
├── src
    ├── main.cpp
    ├── CentralDogma.cpp
    └── TerminalDogma.cpp
├── CODE_OF_CONDUCT.md
├── README.md
└── LICENSE


/.gitignore:
--------------------------------------------------------------------------------
1 | .vscode
2 | Dockerfile
3 | *.exe


--------------------------------------------------------------------------------
/images/probe_demo1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/spyke7/eva-01/HEAD/images/probe_demo1.png


--------------------------------------------------------------------------------
/Makefile:
--------------------------------------------------------------------------------
1 | CXX = g++
2 | CXXFLAGS = -Iinclude
3 | LDFLAGS = -lws2_32 -liphlpapi -lPsapi -lkernel32 -ladvapi32
4 | TARGET = eva-01
5 | SRCS = src\main.cpp src\CentralDogma.cpp src\TerminalDogma.cpp
6 | all:
7 | 	$(CXX) $(CXXFLAGS) $(SRCS) $(LDFLAGS) -o $(TARGET)


--------------------------------------------------------------------------------
/CONTRIBUTING.md:
--------------------------------------------------------------------------------
1 | # Contribution
2 | All the viewers who want to do some changes in the
3 |  code or want to contribute can fork my repository, 
4 |  then make can make a pull request and can contribute. 
5 | The contribution will be checked and will be accepted. 
6 | 


--------------------------------------------------------------------------------
/.github/ISSUE_TEMPLATE/feature_request.md:
--------------------------------------------------------------------------------
 1 | ---
 2 | name: Feature request
 3 | about: Suggest an idea for this project
 4 | title: ''
 5 | labels: ''
 6 | assignees: ''
 7 | 
 8 | ---
 9 | 
10 | **Is your feature request related to a problem? Please describe.**
11 | A clear and concise description of what the problem is. Ex. I'm always frustrated when [...]
12 | 
13 | **Describe the solution you'd like**
14 | A clear and concise description of what you want to happen.
15 | 
16 | **Describe alternatives you've considered**
17 | A clear and concise description of any alternative solutions or features you've considered.
18 | 
19 | **Additional context**
20 | Add any other context or screenshots about the feature request here.
21 | 


--------------------------------------------------------------------------------
/include/CentralDogma.hpp:
--------------------------------------------------------------------------------
 1 | #pragma once
 2 | #include <unordered_map>
 3 | #include <memory>
 4 | #include <vector>
 5 | #include <cstdlib>
 6 | #include <fstream> 
 7 | #include <list>
 8 | #if defined(_WIN32) || defined(_WIN64)
 9 |     #include <windows.h>
10 | #else
11 |     #include <limits.h>
12 |     #include <unistd.h>
13 | #endif
14 | 
15 | class TerminalDogma;
16 | 
17 | class CentralDogma{
18 | private:
19 |     std::unordered_map<std::string, std::unique_ptr<TerminalDogma>> registry;
20 | 
21 |     // history parts
22 |     std::vector<std::vector<std::string>> historyList;
23 | 
24 |     std::string username;
25 | 
26 | public:
27 |     CentralDogma();
28 |     void registerCommand(const std::string& name, std::unique_ptr<TerminalDogma> cmd);
29 |     bool executeCommand(const std::string& name, const std::vector<std::string>& args);
30 | 
31 |     // to be used by help
32 |     const std::unordered_map<std::string, std::unique_ptr<TerminalDogma>>& getRegistry() const {
33 |         return registry;
34 |     }
35 |     std::string getUsername();
36 |     std::string workingDirectory();
37 |     bool parseCommand(const std::vector<std::string>& args);
38 | 
39 |     // history functions
40 |     void addToHistory(const std::vector<std::string>& args);
41 |     std::vector<std::vector<std::string>> getHistory();
42 |     void searchHistory(const std::string& cmdName);
43 | };


--------------------------------------------------------------------------------
/src/main.cpp:
--------------------------------------------------------------------------------
 1 | #include "CentralDogma.hpp"
 2 | #include "TerminalDogma.hpp"
 3 | #include <iostream>
 4 | #include <vector>
 5 | #include <string>
 6 | 
 7 | std::vector<std::string> split(const std::string& command){
 8 |     std::vector<std::string> tokens;
 9 |     std::string token;
10 |     for (size_t i=0; i<command.length(); i++){
11 |         if (command[i]!=' '){
12 |             token+=command[i];
13 |         }
14 |         else{
15 |             if (token.size() != 0){
16 |                 tokens.push_back(token);
17 |                 token.clear();
18 |             }
19 |         }
20 |     }
21 |     if (token.size()!=0) tokens.push_back(token);
22 | 
23 |     return tokens;
24 | }
25 | 
26 | 
27 | int main(){
28 |     CentralDogma core;
29 | 
30 |     // registering the commands
31 |     core.registerCommand("run", std::make_unique<Run>(core));
32 |     core.registerCommand("say", std::make_unique<Say>());
33 |     core.registerCommand("help", std::make_unique<Help>(core));
34 |     core.registerCommand("calc", std::make_unique<Calculate>());
35 |     core.registerCommand("time", std::make_unique<Time>());
36 |     core.registerCommand("clear", std::make_unique<Clear>());
37 |     core.registerCommand("jump", std::make_unique<ChangeDirectory>());
38 |     core.registerCommand("forge", std::make_unique<MakeDirectory>());
39 |     core.registerCommand("show", std::make_unique<Show>());
40 |     core.registerCommand("erase", std::make_unique<Erase>());
41 |     core.registerCommand("craft", std::make_unique<Craft>());
42 |     core.registerCommand("view", std::make_unique<View>());
43 |     core.registerCommand("shift", std::make_unique<Shift>());
44 |     core.registerCommand("history", std::make_unique<History>(core));
45 |     core.registerCommand("sys", std::make_unique<Sys>());
46 |     core.registerCommand("probe", std::make_unique<Probe>());
47 | 
48 |     // getting credentials
49 |     std::string username, password;
50 |     username = core.getUsername();
51 | 
52 |     std::string command;
53 |     while (true) {
54 |         std::string cwd = core.workingDirectory();
55 |         std::cout << "[EVA-01]::"<<username<<" " << cwd << ">";
56 | 
57 |         std::getline(std::cin, command);
58 |         std::vector<std::string> args = split(command);
59 | 
60 |         if (args[0] == "exit") break;
61 | 
62 |         if (!core.parseCommand(args)) {
63 |             std::cout << "Unknown command." <<"\n";
64 |         }
65 |     }
66 |     return 0;
67 | }


--------------------------------------------------------------------------------
/CODE_OF_CONDUCT.md:
--------------------------------------------------------------------------------
  1 | # Contributor Covenant Code of Conduct
  2 | 
  3 | ## Our Pledge
  4 | 
  5 | We as members, contributors, and leaders pledge to make participation in our
  6 | community a harassment-free experience for everyone, regardless of age, body
  7 | size, visible or invisible disability, ethnicity, sex characteristics, gender
  8 | identity and expression, level of experience, education, socio-economic status,
  9 | nationality, personal appearance, race, religion, or sexual identity
 10 | and orientation.
 11 | 
 12 | We pledge to act and interact in ways that contribute to an open, welcoming,
 13 | diverse, inclusive, and healthy community.
 14 | 
 15 | ## Our Standards
 16 | 
 17 | Examples of behavior that contributes to a positive environment for our
 18 | community include:
 19 | 
 20 | * Demonstrating empathy and kindness toward other people
 21 | * Being respectful of differing opinions, viewpoints, and experiences
 22 | * Giving and gracefully accepting constructive feedback
 23 | * Accepting responsibility and apologizing to those affected by our mistakes,
 24 |   and learning from the experience
 25 | * Focusing on what is best not just for us as individuals, but for the
 26 |   overall community
 27 | 
 28 | Examples of unacceptable behavior include:
 29 | 
 30 | * The use of sexualized language or imagery, and sexual attention or
 31 |   advances of any kind
 32 | * Trolling, insulting or derogatory comments, and personal or political attacks
 33 | * Public or private harassment
 34 | * Publishing others' private information, such as a physical or email
 35 |   address, without their explicit permission
 36 | * Other conduct which could reasonably be considered inappropriate in a
 37 |   professional setting
 38 | 
 39 | ## Enforcement Responsibilities
 40 | 
 41 | Community leaders are responsible for clarifying and enforcing our standards of
 42 | acceptable behavior and will take appropriate and fair corrective action in
 43 | response to any behavior that they deem inappropriate, threatening, offensive,
 44 | or harmful.
 45 | 
 46 | Community leaders have the right and responsibility to remove, edit, or reject
 47 | comments, commits, code, wiki edits, issues, and other contributions that are
 48 | not aligned to this Code of Conduct, and will communicate reasons for moderation
 49 | decisions when appropriate.
 50 | 
 51 | ## Scope
 52 | 
 53 | This Code of Conduct applies within all community spaces, and also applies when
 54 | an individual is officially representing the community in public spaces.
 55 | Examples of representing our community include using an official e-mail address,
 56 | posting via an official social media account, or acting as an appointed
 57 | representative at an online or offline event.
 58 | 
 59 | ## Enforcement
 60 | 
 61 | Instances of abusive, harassing, or otherwise unacceptable behavior may be
 62 | reported to the community leaders responsible for enforcement at
 63 | Dolaishreejan@gmail.com .
 64 | All complaints will be reviewed and investigated promptly and fairly.
 65 | 
 66 | All community leaders are obligated to respect the privacy and security of the
 67 | reporter of any incident.
 68 | 
 69 | ## Enforcement Guidelines
 70 | 
 71 | Community leaders will follow these Community Impact Guidelines in determining
 72 | the consequences for any action they deem in violation of this Code of Conduct:
 73 | 
 74 | ### 1. Correction
 75 | 
 76 | **Community Impact**: Use of inappropriate language or other behavior deemed
 77 | unprofessional or unwelcome in the community.
 78 | 
 79 | **Consequence**: A private, written warning from community leaders, providing
 80 | clarity around the nature of the violation and an explanation of why the
 81 | behavior was inappropriate. A public apology may be requested.
 82 | 
 83 | ### 2. Warning
 84 | 
 85 | **Community Impact**: A violation through a single incident or series
 86 | of actions.
 87 | 
 88 | **Consequence**: A warning with consequences for continued behavior. No
 89 | interaction with the people involved, including unsolicited interaction with
 90 | those enforcing the Code of Conduct, for a specified period of time. This
 91 | includes avoiding interactions in community spaces as well as external channels
 92 | like social media. Violating these terms may lead to a temporary or
 93 | permanent ban.
 94 | 
 95 | ### 3. Temporary Ban
 96 | 
 97 | **Community Impact**: A serious violation of community standards, including
 98 | sustained inappropriate behavior.
 99 | 
100 | **Consequence**: A temporary ban from any sort of interaction or public
101 | communication with the community for a specified period of time. No public or
102 | private interaction with the people involved, including unsolicited interaction
103 | with those enforcing the Code of Conduct, is allowed during this period.
104 | Violating these terms may lead to a permanent ban.
105 | 
106 | ### 4. Permanent Ban
107 | 
108 | **Community Impact**: Demonstrating a pattern of violation of community
109 | standards, including sustained inappropriate behavior,  harassment of an
110 | individual, or aggression toward or disparagement of classes of individuals.
111 | 
112 | **Consequence**: A permanent ban from any sort of public interaction within
113 | the community.
114 | 
115 | ## Attribution
116 | 
117 | This Code of Conduct is adapted from the [Contributor Covenant][homepage],
118 | version 2.0, available at
119 | https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
120 | 
121 | Community Impact Guidelines were inspired by [Mozilla's code of conduct
122 | enforcement ladder](https://github.com/mozilla/diversity).
123 | 
124 | [homepage]: https://www.contributor-covenant.org
125 | 
126 | For answers to common questions about this code of conduct, see the FAQ at
127 | https://www.contributor-covenant.org/faq. Translations are available at
128 | https://www.contributor-covenant.org/translations.
129 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
  1 | <a name="readme-top"></a>
  2 | ![](https://img.shields.io/maintenance/yes/2025)
  3 | ![](https://img.shields.io/readthedocs/cplusplus)
  4 | ![](https://img.shields.io/github/stars/spyke7/eva-01)
  5 | ![](https://img.shields.io/github/last-commit/spyke7/eva-01)
  6 | [![CodeFactor](https://www.codefactor.io/repository/github/spyke7/eva-01/badge)](https://www.codefactor.io/repository/github/spyke7/eva-01)
  7 | ![](https://img.shields.io/github/license/spyke7/eva-01)
  8 | ![](https://img.shields.io/github/issues/spyke7/eva-01)
  9 | 
 10 | <p align="left"> <a href="https://www.gnu.org/software/bash/" target="_blank"> <img src="https://www.vectorlogo.zone/logos/gnu_bash/gnu_bash-icon.svg" alt="bash" width="40" height="40"/> </a>
 11 | 
 12 | <div align="center">
 13 | <h1 align="center">🟣 EVA-01 Shell</h1>
 14 | The <b>Eva-01 Shell</b> is an immersive CLI experience.  
 15 | Inspired by <b>NERV and EVAs</b> from Neon Genesis Evangelion.
 16 | 
 17 | Eva-01 features:
 18 | 
 19 | <li> Clean, organized, and minimal. </li>
 20 | <li> Faster command parsing & execution. </li>
 21 | <li> Built to be <b>developer-friendly</b>, <b>extendable</b>, and <b>modular</b>. </li>
 22 | <br/>
 23 | </div>
 24 | 
 25 | <details>
 26 |   <summary>Table of Contents</summary>
 27 |   <ol>
 28 |     <li>
 29 |       <a href="#features">FEATURES</a>
 30 |     </li>
 31 |     <li>
 32 |       <a href="#documentation">DOCUMENTATION</a>
 33 |       <ul>
 34 |         <li><a href="#commands">COMMANDS</a></li>
 35 | 		<li><a href="#internet">INTERNET</a></li>
 36 |       </ul>
 37 |     </li>
 38 |     <li><a href="#getting-sarted">GETTING STARTED</a></li>
 39 |     <li>
 40 |       <a href="#future-features">FUTURE FEATURES</a>
 41 |     </li>
 42 |     <li><a href="#contributing">CONTRIBUTING</a></li>
 43 |     <li><a href="#support">SUPPORT</a></li>
 44 |     <li><a href="#license">LICENSE</a></li>
 45 |   </ol>
 46 | </details>
 47 | 
 48 | ## 🚀 **Features**
 49 | 
 50 | - Light Weight
 51 | - Fast
 52 | - Cross-Platform
 53 | - User friendly
 54 | 
 55 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
 56 | 
 57 | ## **Documentation**
 58 | 
 59 | I have seen the **Neon Genesis Evangelion** anime by Hideaki Anno, and was really moved by the concepts of EVAs. EVA-01 run by the protagonist was a special one for me as it could change to berserk mode and many other different capabilites. Also, I was moved by the NERV HQ as mentioned in anime and its computer system having central dogma and terminal dogma.
 60 | </br>
 61 | 
 62 | Based on this computer system mentioned in anime, the eva-01 also has two header files - `CentralDogma.hpp` and `TerminalDogma.hpp`. 
 63 | ### **About the CentralDogma**
 64 | - The main `parseCommand()` function, is used to execute commands, store them in history, also the logic for `||`,`;`, and `&&` are implemented. Along with that the command to run a command from history with its index is also implemented - `!<index_number>`
 65 | - Inside it has a registry keeping the records of the commands along with the names with which they will be called. The registry filling is done inside the main function.
 66 | - `searchHistory()` function is used by `history` function inside the `TerminalDogma` to search particular commands with related names.
 67 | 
 68 | ### **About the TerminalDogma**
 69 | 
 70 | - It has a brief abstract base class for all eva-01 shell commands. It defines the common interface for every shell command. Each command has its own behaviour in `execute()` and the `description()` is written inside the header file only.
 71 | - All the commands implemented inside it are described in the commands section.
 72 | - For the `calc()` function many other functions like `isNumber()`, `isLeftAssociative()`, `precedence()`, `postfix()` - to change infix to postfix along with brackets, `solvePostfix()` are implemented.
 73 | - `sys()` - 
 74 |   - For windows (took help from [learn.microsoft.com](learn.microsoft.com), all the link are provided for the documentation of specific functions) - 
 75 |     1. For the harware information  - [getting harware information](https://learn.microsoft.com/en-us/windows/win32/sysinfo/getting-hardware-information)
 76 |     2. For the system information - [getting system information](https://learn.microsoft.com/en-us/windows/win32/sysinfo/getting-system-information)
 77 |     3. For getting the processes - [taking snapshot and view process](https://learn.microsoft.com/en-us/windows/win32/toolhelp/taking-a-snapshot-and-viewing-processes)
 78 |     4. For getting the information of DNS server, adapters information - [ip helper from microsoft](https://learn.microsoft.com/en-us/windows/win32/iphlp/getting-started-with-ip-helper?redirectedfrom=MSDN)
 79 |   
 80 |   - In linux  -
 81 |     1. For getting info about network and adapters - `man getifaddrs`; inet_ntop() → convert IP addresses, sockaddr_ll → read MAC addresses
 82 |   
 83 | 
 84 | ### Commands:
 85 | - [x] probe - Network diagnostics tool with real-time latency visualization.
 86 |           `probe <host> [-c count] [-t] [-i interval]`
 87 |             -c <count>   : Number of packets to send (default: 4)
 88 |             -t           : Continuous ping
 89 |             -i <ms>      : Interval between pings in ms (default: 1000)
 90 | - [x] history - It shows all the previous commands executed and also searches commands related with command name(s) given. To run a particular command from history with their index - `!<index_number>`
 91 | - [x] shift - Moves and renames files/folders. `shift <file1> <folder1/file1>` or `shift <folder2/folder3> <folder4/folder3>`
 92 |         You need to give the name of the file/folder along with the destination you want to move.
 93 |         For renaming you just need to give a new name in the second arguement.
 94 | - [x] view - Displays the content of the files. `view <file1> <file2> <...>`
 95 | - [x] time - It just shows you the time.
 96 | - [x] forge - It makes directory. Command - `forge <directory1> <directory2> <...>`
 97 | - [x] sys - It can be used to interact with the system and processes. Also it shows specific things related to the system.
 98 |   - sys - shows system and hardware informations.
 99 |   - -p | --proc - shows all the processes.
100 |   - -n | --network - shows information about your network and it's adapters.
101 |   - -a | --adapters - shows information about adapters.
102 | - [x] calc - Just a simple calculator.
103 | - [x] say - Prints text to the console and also write and appends text into files which are in double quotes only
104 |          and ends with >> and file name with proper space. `say <text>` or `say <"text"> >> <filename>`
105 | - [x] clear - Clears the console.
106 | - [x] show - Shows all the folder and files present in the working directory.
107 | - [x] jump - Changes the directory to the given directory.
108 | - [x] help - Gives information about the commands
109 | - [x] erase - Deletes the provided files and folders. `erase <file1> <folder1> <file2> <...>`
110 | - [x] craft - Creates files only. `craft <file1> <file2> <...>`
111 | - [x] run - Runs the commands stored in `<filename.eva>` or `<filename.txt>`, one by one.
112 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
113 | 
114 | ### Internet
115 | - `sys -n` and `sys -a` shows information about dns server, IF index (Windows), ipv4 or ipv6 address for adapters.
116 | - `probe` function basically works like ping as in windows to ping a given host. It is a simple packet sniffer with some basic details and a graph (simple). If you give the `-t` flag it will run continuously unless you stop it. `-i` flag is just interval the function will sleep between two consecutive pinging.
117 | 
118 |   Sample of probe -
119 |   <img width="1091" height="705" alt="probe_demo1" src="https://github.com/user-attachments/assets/0be42ef6-c518-48b2-9c03-92b8f9fc1780" />
120 | 
121 | 
122 | 
123 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
124 | 
125 | ## <br/>
126 | 
127 | ## **GETTING STARTED**
128 | Run (windows only)- 
129 | `g++ -Iinclude src\main.cpp src\CentralDogma.cpp src\TerminalDogma.cpp -lPsapi -lkernel32 -ladvapi32 -o eva-01`
130 | then run the eva-01.exe
131 | 
132 | or 
133 | 
134 | `mingw32-make` or `make` to run the makefile
135 | 
136 | Go to the latest release and download the eva-01.exe
137 | Then run it.
138 | 
139 | Run (linux/unix) - 
140 | 
141 | `g++ -Iinclude src/*.cpp -o eva-01`
142 | 
143 | #### Example Commands - 
144 | 1. ```
145 | 	calc 96/2 || say ok  ------>(It shows 48 as the first command is running successfully, so the second command will not run)
146 | 	view a.txt && say hello ------>(If a.txt is there then its content along with hello is displayed. But if it is not present, then hello will not be displayed)
147 | 	view a.txt ; say hello; craft "hello world.txt" ------>(All this commands will be executed one by one, irrespective of the output)
148 | 
149 | 
150 | 2. `run << hello.txt` ----> All the commands inside hello.txt written one by one are executed.
151 |     Sample hello.txt -
152 |     ```bash
153 |     calc 2+4/(3*1)
154 |     craft a.txt && say "hello world" >> a.txt
155 |     ```
156 | 
157 | ## **Future Features**
158 | 1. A tool to ping or a packet sniffer.
159 | 2. A tool to make api requests.
160 | 3. Command to kill or run processes.
161 | 4. Executing commands that run other processes like running a python or cpp file.
162 | 
163 | ## **CONTIBUTING**
164 | 
165 | Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are **greatly appreciated**.
166 | 
167 | If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement".
168 | Don't forget to give the project a star! Thanks again!
169 | 
170 | 1. Fork the Project
171 | 2. Create your Feature Branch (`git checkout -b my-branch`)
172 | 3. Commit your Changes (`git commit -m 'Add some advices'`)
173 | 4. Push to the Branch (`git push origin my-branch`)
174 | 5. Open a Pull Request
175 | 
176 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
177 | 
178 | ## **SUPPORT**
179 | Support me by giving a ✨ to this project
180 | 
181 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
182 | 
183 | ## LICENSE
184 | The license is GNU public license see more n LICENSE
185 | 
186 | <p align="right">(<a href="#readme-top">back to top</a>)</p>
187 | 
188 | **This is all the things about my program. If you like it, then please share with others. This is a project which the begineers as well as intermediate programmers can build. Support me by following my github account. Thank you.**
189 | 
190 | 
191 | 
192 | 
193 | 


--------------------------------------------------------------------------------
/src/CentralDogma.cpp:
--------------------------------------------------------------------------------
  1 | #include "CentralDogma.hpp"
  2 | #include "TerminalDogma.hpp"
  3 | 
  4 | CentralDogma::CentralDogma()
  5 | {
  6 | 
  7 | #if defined(_WIN32) || defined(_WIN64)
  8 |     char hostname[MAX_COMPUTERNAME_LENGTH + 1];
  9 |     DWORD size = sizeof(hostname);
 10 |     if (GetUserNameA(hostname, &size))
 11 |     {
 12 |         username = std::string(hostname);
 13 |     }
 14 | #else
 15 |     char hostname[HOST_NAME_MAX];
 16 |     if (gethostname(hostname, sizeof(hostname)) == 0)
 17 |     {
 18 |         username = std::string(hostname);
 19 |     }
 20 | #endif
 21 | }
 22 | 
 23 | void CentralDogma::registerCommand(const std::string &name, std::unique_ptr<TerminalDogma> cmd)
 24 | {
 25 |     registry[name] = std::move(cmd);
 26 | }
 27 | 
 28 | bool CentralDogma::executeCommand(const std::string &name, const std::vector<std::string> &args)
 29 | {
 30 |     auto it = registry.find(name);
 31 |     if (it != registry.end())
 32 |     {
 33 |         it->second->execute(args);
 34 |         return true;
 35 |     }
 36 |     return false;
 37 | }
 38 | 
 39 | std::string CentralDogma::getUsername()
 40 | {
 41 |     return username;
 42 | }
 43 | 
 44 | std::string CentralDogma::workingDirectory()
 45 | {
 46 |     char cwd[1024];
 47 |     if (getcwd(cwd, sizeof(cwd)) != nullptr)
 48 |     {
 49 |         std::string path = cwd;
 50 |         size_t pos = path.find_last_of("/\\");
 51 |         std::string lastDir;
 52 |         if (pos != std::string::npos)
 53 |         {
 54 |             lastDir = path.substr(pos + 1);
 55 |         }
 56 |         else
 57 |         {
 58 |             lastDir = path;
 59 |         }
 60 |         return lastDir;
 61 |     }
 62 |     return "";
 63 | }
 64 | 
 65 | void CentralDogma::addToHistory(const std::vector<std::string> &args)
 66 | {
 67 | 
 68 |     historyList.push_back(args);
 69 | }
 70 | 
 71 | bool CentralDogma::parseCommand(const std::vector<std::string> &args)
 72 | {
 73 |     if (args.empty())
 74 |         return true;
 75 | 
 76 |     std::vector<std::vector<std::string>> commands;
 77 |     std::vector<std::string> commandOperators;
 78 |     std::vector<std::string> currentCommand;
 79 |     std::string currentToken;
 80 | 
 81 |     bool insideQuotes = false;
 82 | 
 83 |     // ; - executes all commands one after other, || - run the second command only if first fails, && - run the second if the first succeeds
 84 |     // !<n> - executes the nth command from history.
 85 |     // refining the args for double quotes and the rest of the operators. anything inside double quotes is considered to be a token.
 86 |     for (const std::string &token : args)
 87 |     {
 88 |         size_t i = 0;
 89 |         while (i < token.size())
 90 |         {
 91 |             if (token[i] == '"' && !insideQuotes)
 92 |             {
 93 |                 insideQuotes = true;
 94 |                 i++;
 95 |                 continue;
 96 |             }
 97 |             else if (token[i] == '"' && insideQuotes)
 98 |             {
 99 |                 insideQuotes = false;
100 |                 i++;
101 |                 continue;
102 |             }
103 | 
104 |             // checking for the operators when quotes are closed
105 |             if (!insideQuotes)
106 |             {
107 |                 if (i + 1 < token.size() && ((token[i] == '&' && token[i + 1] == '&') || (token[i] == '|' && token[i + 1] == '|')))
108 |                 {
109 |                     if (!currentToken.empty())
110 |                     {
111 |                         currentCommand.push_back(currentToken);
112 |                         currentToken.clear();
113 |                     }
114 |                     if (!currentCommand.empty())
115 |                     {
116 |                         commands.push_back(currentCommand);
117 |                         currentCommand.clear();
118 |                     }
119 |                     commandOperators.push_back(token.substr(i, 2));
120 |                     i += 2;
121 |                     continue;
122 |                 }
123 |                 if (token[i] == ';')
124 |                 {
125 |                     if (!currentToken.empty())
126 |                     {
127 |                         currentCommand.push_back(currentToken);
128 |                         currentToken.clear();
129 |                     }
130 | 
131 |                     if (!currentCommand.empty())
132 |                     {
133 |                         commands.push_back(currentCommand);
134 |                         currentCommand.clear();
135 |                     }
136 | 
137 |                     commandOperators.push_back(";");
138 |                     i++;
139 |                     continue;
140 |                 }
141 |             }
142 |             currentToken.push_back(token[i]);
143 |             i++;
144 |         }
145 | 
146 |         // if inside quotes, adding a space to join with next token
147 |         if (insideQuotes)
148 |         {
149 |             currentToken.push_back(' ');
150 |         }
151 |         else
152 |         {
153 |             if (!currentToken.empty())
154 |             {
155 |                 currentCommand.push_back(currentToken);
156 |                 currentToken.clear();
157 |             }
158 |         }
159 |     }
160 | 
161 |     if (!currentToken.empty())
162 |     {
163 |         currentCommand.push_back(currentToken);
164 |         currentToken.clear();
165 |     }
166 |     if (!currentCommand.empty())
167 |     {
168 |         commands.push_back(currentCommand);
169 |     }
170 | 
171 |     if (commandOperators.size() >= commands.size())
172 |     {
173 |         return false;
174 |     }
175 |     else
176 |     {
177 |         bool finalRes = true;
178 | 
179 |         // evaluating ; , ||, &&, !<n>
180 |         for (size_t i = 0; i < commands.size(); i++)
181 |         {
182 |             bool historyRefer=false;
183 |             if (commands[i][0][0] == '!')
184 |             {
185 |                 bool validHistoryNumber = true;
186 |                 int historyNumber;
187 |                 if (commands[i].size() >= 2)
188 |                 {
189 |                     validHistoryNumber = false;
190 |                 }
191 |                 if (validHistoryNumber)
192 |                 {
193 |                     std::string historyNumToken = "";
194 |                     bool hasDecimal = false;
195 |                     for (size_t j = 1; j < commands[i][0].size(); j++)
196 |                     {
197 |                         historyNumToken += commands[i][0][j];
198 |                         if (commands[i][0][j] == '.')
199 |                         {
200 |                             if (!hasDecimal)
201 |                             {
202 |                                 hasDecimal = true;
203 |                             }
204 |                             else
205 |                             {
206 |                                 validHistoryNumber = false;
207 |                                 break;
208 |                             }
209 |                         }
210 |                         else if (!isdigit(commands[i][0][j]))
211 |                         {
212 |                             validHistoryNumber = false;
213 |                             break;
214 |                         }
215 |                     }
216 |                     if (validHistoryNumber)
217 |                     {
218 |                         historyNumber = std::stoi(historyNumToken);
219 |                         if (historyNumber < 1 || historyNumber > historyList.size())
220 |                         {
221 |                             validHistoryNumber = false;
222 |                         }
223 |                         if (validHistoryNumber)
224 |                         {
225 |                             if (!executeCommand(historyList[historyNumber - 1][0], historyList[historyNumber - 1]))
226 |                             {
227 |                                 finalRes = false;
228 |                                 std::cout << "Cannot run the below command - \n";
229 |                                 for (size_t j = 0; j < historyList[historyNumber - 1].size(); j++)
230 |                                 {
231 |                                     std::cout << historyList[historyNumber - 1][j] << " ";
232 |                                 }
233 |                                 std::cout << "\n";
234 |                             }
235 |                             else
236 |                             {
237 |                                 finalRes = true;
238 |                                 historyRefer=true;
239 |                             }
240 |                         }
241 |                     }
242 |                 }
243 |             }
244 |             if (!executeCommand(commands[i][0], commands[i]) && !historyRefer)
245 |             {
246 |                 finalRes = false;
247 |                 std::cout << "Cannot run the below command - \n";
248 |                 for (size_t j = 0; j < commands[i].size(); j++)
249 |                 {
250 |                     std::cout << commands[i][j] << " ";
251 |                 }
252 |                 std::cout << "\n";
253 |             }
254 |             else
255 |             {
256 |                 finalRes = true;
257 |             }
258 |             if (i < commandOperators.size() && finalRes && commandOperators[i] == "||")
259 |             {
260 |                 break;
261 |             }
262 |             if (i < commandOperators.size() && !finalRes && commandOperators[i] == "&&")
263 |             {
264 |                 bool orOperatorFound = false;
265 |                 // checking for any || or ;, so that to jump there and execute that and skip the left
266 |                 for (size_t k = i; k < commandOperators.size(); ++k)
267 |                 {
268 |                     if (commandOperators[k] == "||" || commandOperators[k] == ";")
269 |                     {
270 |                         i = k;
271 |                         orOperatorFound = true;
272 |                         break;
273 |                     }
274 |                 }
275 |                 if (!orOperatorFound)
276 |                 {
277 |                     break;
278 |                 }
279 |             }
280 |         }
281 |         addToHistory(args);
282 |         return finalRes;
283 |     }
284 | }
285 | 
286 | std::vector<std::vector<std::string>> CentralDogma::getHistory()
287 | {
288 |     return historyList;
289 | }
290 | 
291 | void CentralDogma::searchHistory(const std::string &cmdName)
292 | {
293 |     for (int i = 0; i < historyList.size(); i++)
294 |     {
295 |         if (historyList[i][0] == cmdName)
296 |         {
297 |             std::cout << i + 1 << ". ";
298 |             for (int j = 0; j < historyList[i].size(); j++)
299 |             {
300 |                 std::cout << historyList[i][j] << " ";
301 |             }
302 |             std::cout << "\n";
303 |         }
304 |     }
305 | }


--------------------------------------------------------------------------------
/include/TerminalDogma.hpp:
--------------------------------------------------------------------------------
  1 | #pragma once
  2 | 
  3 | #if defined(_WIN32) || defined(_WIN64)
  4 | #ifndef _WIN32_WINNT
  5 | #define _WIN32_WINNT 0x0601
  6 | #endif
  7 | #define WIN32_LEAN_AND_MEAN
  8 | // CRITICAL: winsock2.h MUST come before windows.h
  9 | #include <winsock2.h>
 10 | #include <ws2tcpip.h>
 11 | #endif
 12 | 
 13 | #include <iostream>
 14 | #include <memory>
 15 | #include <vector>
 16 | #include <map>
 17 | #include <string>
 18 | #include <unordered_set>
 19 | #include <stack>
 20 | #include <math.h>
 21 | #include <ctime>
 22 | #include <unistd.h>
 23 | #include <dirent.h>
 24 | #include <sys/stat.h>
 25 | #include <sys/types.h>
 26 | #include <fstream>
 27 | #include <stdio.h>
 28 | #include <unistd.h>
 29 | #include <dirent.h>
 30 | #include <cstdarg>
 31 | #include <cstdlib>
 32 | #include <cstring>
 33 | #include <cctype>
 34 | #include <sstream>
 35 | #include <cstdarg>
 36 | #include <cstdlib>
 37 | #include <chrono>
 38 | #include <thread>
 39 | #include <iomanip>
 40 | #include <csignal>
 41 | #include <algorithm>
 42 | #if defined(_WIN32) || defined(_WIN64)
 43 | #include <direct.h>
 44 | #include <windows.h>
 45 | #include <tchar.h>
 46 | #include <psapi.h>
 47 | #include <tlhelp32.h>
 48 | #include <iphlpapi.h>
 49 | 
 50 | #ifndef ERROR_BUFFER_OVERFLOW
 51 | #define ERROR_BUFFER_OVERFLOW 111L
 52 | #endif
 53 | 
 54 | #ifndef ERROR_INSUFFICIENT_BUFFER
 55 | #define ERROR_INSUFFICIENT_BUFFER 122L
 56 | #endif
 57 | 
 58 | #ifndef NO_ERROR
 59 | #define NO_ERROR 0L
 60 | #endif
 61 | 
 62 | #ifndef ERROR_SUCCESS
 63 | #define ERROR_SUCCESS 0L
 64 | #endif
 65 | 
 66 | #if defined(__MINGW32__) || defined(__MINGW64__)
 67 | inline const char *inet_ntop_mingw(int af, const void *src, char *dst, size_t size)
 68 | {
 69 |     if (af == AF_INET)
 70 |     {
 71 |         struct sockaddr_in in;
 72 |         memset(&in, 0, sizeof(in));
 73 |         in.sin_family = AF_INET;
 74 |         memcpy(&in.sin_addr, src, sizeof(struct in_addr));
 75 | 
 76 |         DWORD s = (DWORD)size;
 77 |         if (WSAAddressToStringA((LPSOCKADDR)&in, sizeof(in), nullptr, dst, &s) == 0)
 78 |         {
 79 |             return dst;
 80 |         }
 81 |     }
 82 |     return nullptr;
 83 | }
 84 | // Override inet_ntop for MinGW
 85 | #define inet_ntop(af, src, dst, size) inet_ntop_mingw(af, src, dst, size)
 86 | #endif
 87 | 
 88 | #endif
 89 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
 90 | #include <netdb.h>
 91 | #include <netinet/ip_icmp.h>
 92 | #include <sys/ioctl.h>
 93 | #include <netinet/in.h>
 94 | #include <net/if.h>
 95 | #include <sys/select.h>
 96 | #include <netpacket/packet.h>
 97 | #include <sys/socket.h>
 98 | #include <ifaddrs.h>
 99 | #include <sysexits.h>
100 | #include <cerrno>
101 | #include <arpa/inet.h>
102 | #endif
103 | 
104 | #define ICMP_ECHO_REQUEST 8
105 | #define ICMP_ECHO_REPLY 0
106 | 
107 | class CentralDogma;
108 | 
109 | class TerminalDogma
110 | {
111 | public:
112 |     virtual ~TerminalDogma() {};
113 |     virtual void execute(const std::vector<std::string> &args) = 0;
114 |     virtual std::string description() const = 0;
115 | };
116 | 
117 | class Run : public TerminalDogma
118 | {
119 |     CentralDogma &core;
120 | 
121 | public:
122 |     Run(CentralDogma &c) : core(c) {};
123 |     void execute(const std::vector<std::string> &args) override;
124 |     std::string description() const override { return "Runs the commands stored in <filename>.eva, one by one."; }
125 | };
126 | 
127 | class Say : public TerminalDogma
128 | {
129 | public:
130 |     void execute(const std::vector<std::string> &args) override;
131 |     std::string description() const override { return "Prints text to the console and also write and appends text into files which are in double quotes only \n\t and ends with >> and file name with proper space. say <text> or say <\"text\"> >> <filename>"; }
132 | };
133 | 
134 | class Help : public TerminalDogma
135 | {
136 |     CentralDogma &core;
137 | 
138 | public:
139 |     Help(CentralDogma &c) : core(c) {};
140 |     void execute(const std::vector<std::string> &args) override;
141 |     std::string description() const override { return "Gives information about the commands"; };
142 | };
143 | 
144 | class Calculate : public TerminalDogma
145 | {
146 |     std::unordered_set<char> operators = {'+', '-', '*', '/', '%', '^'};
147 | 
148 | public:
149 |     void execute(const std::vector<std::string> &args) override;
150 |     std::string description() const override { return "Just a simple calculator."; };
151 |     int precedence(std::string c);
152 |     std::vector<std::string> postfix(std::vector<std::string> args);
153 |     long double solvePostfix(std::vector<std::string> expression);
154 |     bool isNumber(const std::string &s);
155 |     bool isLeftAssociative(char op);
156 | };
157 | 
158 | class Time : public TerminalDogma
159 | {
160 | public:
161 |     void execute(const std::vector<std::string> &args) override;
162 |     std::string description() const override { return "It just shows you the time."; };
163 | };
164 | 
165 | class Clear : public TerminalDogma
166 | {
167 | public:
168 |     void execute(const std::vector<std::string> &args) override;
169 |     std::string description() const override { return "Clears the console."; };
170 | };
171 | 
172 | class MakeDirectory : public TerminalDogma
173 | {
174 | public:
175 |     void execute(const std::vector<std::string> &args) override;
176 |     std::string description() const override
177 |     {
178 | #if defined(_WIN32) || defined(_WIN64)
179 |         return "It makes directory. Command - forge <directory1> <directory2> <...>";
180 | #else
181 |         return "It makes directory. Command - forge [-a|-s] <directory1> <directory2> <...>";
182 | #endif
183 |     };
184 |     std::vector<std::string> splitPath(const std::string &path);
185 | };
186 | 
187 | class ChangeDirectory : public TerminalDogma
188 | {
189 | public:
190 |     void execute(const std::vector<std::string> &args) override;
191 |     std::string description() const override { return "Changes the directory to the given directory."; };
192 | };
193 | 
194 | class Erase : public TerminalDogma
195 | {
196 | public:
197 |     void execute(const std::vector<std::string> &args) override;
198 |     std::string description() const override { return "Deletes the provided files and folders. erase <file1> <folder1> <file2> <...>"; };
199 |     int removeDir(std::string path);
200 | };
201 | 
202 | class Show : public TerminalDogma
203 | {
204 | public:
205 |     void execute(const std::vector<std::string> &args) override;
206 |     std::string description() const override { return "Shows all the folder and files present in the working directory."; };
207 | };
208 | 
209 | class Craft : public TerminalDogma
210 | {
211 | public:
212 |     void execute(const std::vector<std::string> &args) override;
213 |     std::string description() const override { return "Creates files only. craft <file1> <file2> <...>"; };
214 | };
215 | 
216 | class View : public TerminalDogma
217 | {
218 | public:
219 |     void execute(const std::vector<std::string> &args) override;
220 |     std::string description() const override { return "Displays the content of the files. view <file1> <file2> <...>"; };
221 | };
222 | 
223 | class Shift : public TerminalDogma
224 | {
225 | public:
226 |     void execute(const std::vector<std::string> &args) override;
227 |     std::string description() const override { return "Moves and renames files/folders. shift <file1> <folder1/file1> or shift <folder2/folder3> <folder4/folder3>.\n\tYou need to give the name of the file/folder along with the destination you want to move.\n\tFor renaming you just need to give a new name in the second arguement."; };
228 | };
229 | 
230 | class History : public TerminalDogma
231 | {
232 |     CentralDogma &core;
233 | 
234 | public:
235 |     History(CentralDogma &c) : core(c) {};
236 |     void execute(const std::vector<std::string> &args) override;
237 |     std::string description() const override { return "It shows all the previous commands executed and also searches commands related with command name(s) given.\n\tTo run a particular command from history with their index - !<index_number>"; };
238 | };
239 | 
240 | class Sys : public TerminalDogma
241 | {
242 | public:
243 |     void execute(const std::vector<std::string> &args) override;
244 |     std::string description() const override { return "It can be used to interact with the system and processes. Also it shows specific things related to the system.\n\tsys - shows system and hardware informations.\n\t -p | --proc - shows all the processes.\n\t -n | --network - shows information about your network and it's adapters.\n\t -a | --adapters - shows information about adapters."; };
245 | 
246 |     // for getting process in windows
247 | #if defined(_WIN64) || defined(_WIN32)
248 |     BOOL GetProcessListWin();
249 |     void PrintError(const TCHAR *msg);
250 | #endif
251 |     void SystemInfo();
252 | 
253 | // for getting process in linux/unix
254 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
255 |     bool isNumeric(const std::string &s)
256 |     {
257 |         for (char c : s)
258 |             if (!isdigit(c))
259 |                 return false;
260 |         return !s.empty();
261 |     }
262 | 
263 |     void GetProcessesUnix();
264 | #endif
265 | 
266 |     // for network
267 | #if defined(_WIN64) || defined(_WIN32)
268 |     void GetNetworkInfoWin();
269 | 
270 |     // shows network adapters and other adapters as well.
271 |     void GetAdapterInfoWin();
272 | #endif
273 | 
274 |     // for getting network informations and adapters information in linux and other processes
275 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
276 |     void GetNetworkInfoUnix();
277 |     void GetAdapterInfoUnix();
278 | #endif
279 | };
280 | 
281 | class Probe : public TerminalDogma
282 | {
283 | public:
284 |     void execute(const std::vector<std::string> &args) override;
285 |     std::string description() const override
286 |     {
287 |         return "Network diagnostics tool with real-time latency visualization.\n"
288 |                "\tprobe <host> [-c count] [-t] [-i interval]\n"
289 |                "\t  -c <count>   : Number of packets to send (default: 4)\n"
290 |                "\t  -t           : Continuous ping\n"
291 |                "\t  -i <ms>      : Interval between pings in ms (default: 1000)";
292 |     }
293 | 
294 | private:
295 |     struct PingStats
296 |     {
297 |         int sent = 0;
298 |         int received = 0;
299 |         int lost = 0;
300 |         double minTime = 9999.0;
301 |         double maxTime = 0.0;
302 |         double totalTime = 0.0;
303 |         std::vector<double> latencies;
304 |     };
305 | 
306 |     void displayHeader(const std::string &host, const std::string &ip);
307 |     void displayResult(int seq, double latency, const std::string &ip, int ttl);
308 |     void displayStats(const PingStats &stats, const std::string &host);
309 |     void displayGraph(const std::vector<double> &latencies);
310 |     std::string resolveHostname(const std::string &host);
311 |     std::string getSignalQuality(double avgLatency);
312 | 
313 |     // Use raw sockets on all platforms (MinGW compatible)
314 |     bool pingRawSocket(const std::string &ip, double &latency, int &ttl);
315 |     unsigned short checksum(void *b, int len);
316 | 
317 |     // ICMP packet structure
318 |     struct ICMPHeader
319 |     {
320 |         unsigned char type;
321 |         unsigned char code;
322 |         unsigned short checksum;
323 |         unsigned short id;
324 |         unsigned short seq;
325 |     };
326 | };


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     <one line to give the program's name and a brief idea of what it does.>
635 |     Copyright (C) <year>  <name of author>
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <https://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     <program>  Copyright (C) <year>  <name of author>
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <https://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <https://www.gnu.org/licenses/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------
/src/TerminalDogma.cpp:
--------------------------------------------------------------------------------
   1 | #include "TerminalDogma.hpp"
   2 | #include "CentralDogma.hpp"
   3 | #include <iostream>
   4 | 
   5 | inline void sleep_milliseconds(int milliseconds)
   6 | {
   7 | #if defined(_WIN32) || defined(_WIN64)
   8 |     Sleep(milliseconds); // Windows Sleep takes milliseconds
   9 | #else
  10 |     std::this_thread::sleep_for(std::chrono::milliseconds(milliseconds));
  11 | #endif
  12 | }
  13 | 
  14 | void Run ::execute(const std::vector<std::string> &args)
  15 | {
  16 |     if (args[1] != "<<")
  17 |     {
  18 |         std::cout << "Put << before giving files\n";
  19 |         return;
  20 |     }
  21 | 
  22 |     for (size_t i = 2; i < args.size(); i++)
  23 |     {
  24 |         size_t pos = args[i].rfind('.');
  25 | 
  26 |         bool correctExt = false;
  27 |         if (pos == std::string::npos)
  28 |         {
  29 |             std::cout << "Provide file extension\n";
  30 |         }
  31 |         if (args[i].substr(pos + 1) == "eva" || args[i].substr(pos + 1) == "txt")
  32 |         {
  33 |             correctExt = true;
  34 |         }
  35 | 
  36 |         if (correctExt)
  37 |         {
  38 |             std::ifstream file(args[i]);
  39 |             if (!file.is_open())
  40 |             {
  41 |                 std::cout << "Cannot open script file: " << args[i] << "\n";
  42 |                 return;
  43 |             }
  44 | 
  45 |             std::string line;
  46 |             while (std::getline(file, line))
  47 |             {
  48 |                 if (line.empty())
  49 |                 {
  50 |                     continue;
  51 |                 }
  52 |                 std::vector<std::string> tokens;
  53 |                 std::string token;
  54 |                 for (size_t i = 0; i < line.length(); i++)
  55 |                 {
  56 |                     if (line[i] != ' ')
  57 |                     {
  58 |                         token += line[i];
  59 |                     }
  60 |                     else
  61 |                     {
  62 |                         if (token.size() != 0)
  63 |                         {
  64 |                             tokens.push_back(token);
  65 |                             token.clear();
  66 |                         }
  67 |                     }
  68 |                 }
  69 |                 if (token.size() != 0)
  70 |                     tokens.push_back(token);
  71 | 
  72 |                 core.parseCommand(tokens);
  73 |             }
  74 | 
  75 |             file.close();
  76 |         }
  77 |     }
  78 | }
  79 | 
  80 | void Say ::execute(const std::vector<std::string> &args)
  81 | {
  82 |     std::string filePath;
  83 |     if (args[args.size() - 2] == ">>" && args.size() >= 4)
  84 |     {
  85 |         filePath = args[args.size() - 1];
  86 |     }
  87 |     if (filePath.size() == 0)
  88 |     {
  89 |         for (size_t i = 1; i < args.size(); ++i)
  90 |         {
  91 |             std::cout << args[i] << " ";
  92 |         }
  93 |         std::cout << "\n";
  94 |     }
  95 |     else
  96 |     {
  97 |         std::string userText;
  98 |         for (size_t i = 1; i <= args.size() - 3; i++)
  99 |         {
 100 |             for (size_t j = 0; j < args[i].size(); j++)
 101 |             {
 102 | 
 103 |                 userText += args[i][j];
 104 |             }
 105 |             userText += ' ';
 106 |         }
 107 |         std::cout << userText << "\n";
 108 |         std::ofstream file(filePath, std::ios::app);
 109 |         if (!file)
 110 |         {
 111 |             std::fstream file(filePath, std::ios::out);
 112 |             file << userText;
 113 |         }
 114 |         else
 115 |         {
 116 |             file << userText;
 117 |         }
 118 |         file.close();
 119 |     }
 120 | }
 121 | 
 122 | void Help::execute(const std::vector<std::string> &args)
 123 | {
 124 |     std::cout << "Available commands:\n";
 125 |     for (const auto &name : core.getRegistry())
 126 |     {
 127 |         std::cout << "  " << name.first << " - " << name.second->description() << "\n";
 128 |     }
 129 | }
 130 | 
 131 | bool Calculate::isNumber(const std::string &s)
 132 | {
 133 |     if (s.empty())
 134 |         return false;
 135 | 
 136 |     bool hasDecimal = false;
 137 |     for (char c : s)
 138 |     {
 139 |         if (c == '.')
 140 |         {
 141 |             if (hasDecimal)
 142 |                 return false;
 143 |             hasDecimal = true;
 144 |         }
 145 |         else if (!isdigit(c))
 146 |         {
 147 |             return false;
 148 |         }
 149 |     }
 150 |     return true;
 151 | }
 152 | 
 153 | bool Calculate::isLeftAssociative(char op)
 154 | {
 155 |     if (op == '^')
 156 |         return false;
 157 |     return true;
 158 | }
 159 | 
 160 | int Calculate::precedence(std::string c)
 161 | {
 162 |     if (c == "^")
 163 |         return 3;
 164 |     else if (c == "/" || c == "*")
 165 |         return 2;
 166 |     else if (c == "+" || c == "-")
 167 |         return 1;
 168 |     else
 169 |         return -1;
 170 | }
 171 | 
 172 | std::vector<std::string> Calculate::postfix(std::vector<std::string> args)
 173 | {
 174 |     std::stack<std::string> st;
 175 |     std::vector<std::string> result;
 176 | 
 177 |     for (int i = 0; i < args.size(); i++)
 178 |     {
 179 |         if (isNumber(args[i]))
 180 |         {
 181 |             result.push_back(args[i]);
 182 |         }
 183 |         // handling -> ()
 184 |         else if (args[i] == "(")
 185 |         {
 186 |             st.push(args[i]);
 187 |         }
 188 |         else if (args[i] == ")")
 189 |         {
 190 |             while (!st.empty() && st.top() != "(")
 191 |             {
 192 |                 result.push_back(st.top());
 193 |                 st.pop();
 194 |             }
 195 |             if (!st.empty())
 196 |                 st.pop();
 197 |         }
 198 | 
 199 |         // in case of operators
 200 |         else if (operators.count(args[i][0]))
 201 |         {
 202 |             while (!st.empty() && operators.count(args[i][0]))
 203 |             {
 204 |                 if ((isLeftAssociative(args[i][0]) && precedence(args[i]) <= precedence(st.top())) ||
 205 |                     (!isLeftAssociative(args[i][0]) && precedence(args[i]) < precedence(st.top())))
 206 |                 {
 207 |                     result.push_back(st.top());
 208 |                     st.pop();
 209 |                 }
 210 |                 else
 211 |                 {
 212 |                     break;
 213 |                 }
 214 |             }
 215 |             st.push(args[i]);
 216 |         }
 217 |     }
 218 | 
 219 |     while (!st.empty())
 220 |     {
 221 |         result.push_back(st.top());
 222 |         st.pop();
 223 |     }
 224 | 
 225 |     return result;
 226 | }
 227 | 
 228 | long double Calculate::solvePostfix(std::vector<std::string> expression)
 229 | {
 230 |     std::stack<long double> st;
 231 |     for (int i = 0; i < expression.size(); i++)
 232 |     {
 233 |         if (isNumber(expression[i]))
 234 |         {
 235 |             long double num = std::stold(expression[i]);
 236 |             st.push(num);
 237 |         }
 238 |         else
 239 |         {
 240 |             long double val1 = st.top();
 241 |             st.pop();
 242 |             long double val2 = st.top();
 243 |             st.pop();
 244 |             long double res;
 245 |             if (expression[i] == "+")
 246 |             {
 247 |                 res = val1 + val2;
 248 |             }
 249 |             else if (expression[i] == "-")
 250 |             {
 251 |                 res = val2 - val1;
 252 |             }
 253 |             else if (expression[i] == "*")
 254 |             {
 255 |                 res = val1 * val2;
 256 |             }
 257 |             else if (expression[i] == "/")
 258 |             {
 259 |                 res = val2 / val1;
 260 |             }
 261 |             else if (expression[i] == "^")
 262 |             {
 263 |                 res = pow(val2, val1);
 264 |             }
 265 |             st.push(res);
 266 |         }
 267 |     }
 268 |     return st.top();
 269 | }
 270 | 
 271 | void Calculate::execute(const std::vector<std::string> &args)
 272 | {
 273 |     std::string expression;
 274 |     for (size_t i = 1; i < args.size(); i++)
 275 |     {
 276 |         expression += args[i];
 277 |     }
 278 | 
 279 |     if (expression.size() > 2)
 280 |     {
 281 |         bool safety = true;
 282 |         long long nbraces = 0;
 283 | 
 284 |         // tokens vector after filtering user input
 285 |         std::vector<std::string> tokens;
 286 |         std::string token = "";
 287 | 
 288 |         int i = 0;
 289 |         while (i < expression.size() && safety)
 290 |         {
 291 |             if ((expression[i] >= '0' && expression[i] <= '9') || expression[i] == '.')
 292 |             {
 293 |                 while (!operators.count(expression[i]) && (expression[i] != '(') && (expression[i] != ')') && i < expression.size())
 294 |                 {
 295 |                     token += expression[i];
 296 |                     i++;
 297 |                 }
 298 |                 safety = isNumber(token);
 299 |                 if (safety)
 300 |                 {
 301 |                     tokens.push_back(token);
 302 |                 }
 303 |                 token = "";
 304 |             }
 305 |             else if (expression[i] == '(' || expression[i] == ')' || operators.count(expression[i]))
 306 |             {
 307 |                 token += expression[i];
 308 |                 tokens.push_back(token);
 309 |                 if (expression[i] == '(' || expression[i] == ')')
 310 |                 {
 311 |                     nbraces++;
 312 |                 }
 313 | 
 314 |                 token = "";
 315 |                 i++;
 316 |             }
 317 |             else
 318 |             {
 319 |                 safety = false;
 320 |                 break;
 321 |             }
 322 |         }
 323 | 
 324 |         // validating signs and brackets
 325 |         if (nbraces % 2 != 0)
 326 |         {
 327 |             safety = false;
 328 |         }
 329 |         else
 330 |         {
 331 |             for (int i = 0; i < tokens.size() - 1; i++)
 332 |             {
 333 |                 if (tokens[i] == "/" && tokens[i + 1] == "0")
 334 |                 {
 335 |                     safety = false;
 336 |                     break;
 337 |                 }
 338 |                 // handling negative sign before making the safety false for other cases
 339 |                 else if (tokens[i] == "-")
 340 |                 {
 341 |                     if (i == 0 || (tokens[i - 1] == "(" && i > 0))
 342 |                     {
 343 |                         tokens.insert(tokens.begin() + i, "0");
 344 |                     }
 345 |                     else if (operators.count(tokens[i - 1][0]) && tokens[i - 1] != "-")
 346 |                     {
 347 |                         tokens.insert(tokens.begin() + i, "(");
 348 |                         tokens.insert(tokens.begin() + i + 1, "0");
 349 |                         int k = i + 3;
 350 | 
 351 |                         while (k < tokens.size() &&
 352 |                                !operators.count(tokens[k][0]) && tokens[k] != ")" && tokens[k] != "(" && tokens[k] != ".")
 353 |                         {
 354 |                             k++;
 355 |                         }
 356 | 
 357 |                         tokens.insert(tokens.begin() + k, ")");
 358 |                     }
 359 |                     else if (operators.count(tokens[i + 1][0]))
 360 |                     {
 361 |                         safety = false;
 362 |                         break;
 363 |                     }
 364 |                     continue;
 365 |                 }
 366 |                 else if (operators.count(tokens[0][0]) && tokens[i] != "-")
 367 |                 {
 368 |                     safety = false;
 369 |                 }
 370 |                 else if (operators.count(tokens[tokens.size() - 1][0]))
 371 |                 {
 372 |                     safety = false;
 373 |                 }
 374 |                 else if (operators.count(tokens[i][0]) && operators.count(tokens[i + 1][0]) && tokens[i + 1] != "-")
 375 |                 {
 376 |                     safety = false;
 377 |                 }
 378 |                 else if ((operators.count(tokens[i][0]) && (tokens[i + 1] == ")")) || (tokens[i] == "(") && operators.count(tokens[i + 1][0]) && (tokens[i + 1] != "-"))
 379 |                 {
 380 |                     safety = false;
 381 |                 }
 382 |             }
 383 |         }
 384 | 
 385 |         if (!safety)
 386 |         {
 387 |             std::cout << "Give Correct expression\n";
 388 |         }
 389 |         else
 390 |         {
 391 |             std::cout << solvePostfix(postfix(tokens)) << "\n";
 392 |         }
 393 |     }
 394 | }
 395 | 
 396 | void Time ::execute(const std::vector<std::string> &args)
 397 | {
 398 |     if (args.size() > 1)
 399 |     {
 400 |         std::cout << "time takes no arguement!\n";
 401 |         return;
 402 |     }
 403 |     std::time_t now = std::time(nullptr);
 404 |     std::string datetime = std::ctime(&now);
 405 |     datetime.pop_back();
 406 |     std::cout << datetime << "\n";
 407 | }
 408 | 
 409 | void Clear ::execute(const std::vector<std::string> &args)
 410 | {
 411 |     if (args.size() > 1)
 412 |     {
 413 |         std::cout << "clear takes no arguement!\n";
 414 |         return;
 415 |     }
 416 | #if defined(_WIN32) || defined(_WIN64)
 417 |     COORD topLeft = {0, 0};
 418 |     HANDLE console = GetStdHandle(STD_OUTPUT_HANDLE);
 419 |     CONSOLE_SCREEN_BUFFER_INFO screen;
 420 |     DWORD written;
 421 | 
 422 |     GetConsoleScreenBufferInfo(console, &screen);
 423 |     FillConsoleOutputCharacterA(
 424 |         console, ' ', screen.dwSize.X * screen.dwSize.Y, topLeft, &written);
 425 |     FillConsoleOutputAttribute(
 426 |         console, FOREGROUND_GREEN | FOREGROUND_RED | FOREGROUND_BLUE,
 427 |         screen.dwSize.X * screen.dwSize.Y, topLeft, &written);
 428 |     SetConsoleCursorPosition(console, topLeft);
 429 | #else
 430 |     std::cout << "\033[H\033[2J\033[3J" << std::flush;
 431 | #endif
 432 | }
 433 | 
 434 | std::vector<std::string> MakeDirectory ::splitPath(const std::string &path)
 435 | {
 436 |     std::vector<std::string> paths;
 437 |     std::string token;
 438 |     for (size_t i = 0; i < path.size(); i++)
 439 |     {
 440 |         if (path[i] != '/')
 441 |             token += path[i];
 442 |         else
 443 |         {
 444 |             if (!token.empty())
 445 |             {
 446 |                 paths.push_back(token);
 447 |                 token.clear();
 448 |             }
 449 |         }
 450 |     }
 451 | 
 452 |     if (!token.empty())
 453 |         paths.push_back(token);
 454 | 
 455 |     return paths;
 456 | }
 457 | 
 458 | void MakeDirectory ::execute(const std::vector<std::string> &args)
 459 | {
 460 |     if (args.size() < 2)
 461 |     {
 462 |         std::cout << "forge takes 1 or more arguements. See help.\n";
 463 |         return;
 464 |     }
 465 | 
 466 | #if defined(_WIN32) || defined(_WIN64)
 467 |     for (size_t i = 1; i < args.size(); i++)
 468 |     {
 469 |         std::string tmp = args[i];
 470 |         std::vector<std::string> paths = splitPath(tmp);
 471 |         std::string currentPath;
 472 | 
 473 |         if (!tmp.empty() && tmp[0] == '/')
 474 |             currentPath = "/";
 475 | 
 476 |         for (size_t i = 0; i < paths.size(); ++i)
 477 |         {
 478 |             currentPath += paths[i];
 479 |             if (i != paths.size() - 1)
 480 |                 currentPath += "\\";
 481 | 
 482 |             if (mkdir(currentPath.c_str()) == -1)
 483 |             {
 484 |                 std::cout << "Cannot create - " << tmp << "\n";
 485 |                 break;
 486 |             }
 487 |         }
 488 |     }
 489 | 
 490 | #else
 491 |     size_t index = 1;
 492 |     mode_t defaultMode = 0755; // default permission
 493 | 
 494 |     std::map<std::string, int> nameAndModes;
 495 | 
 496 |     while (index < args.size())
 497 |     {
 498 |         if (index + 1 < args.size())
 499 |         {
 500 |             if (args[index + 1][0] == '-')
 501 |             {
 502 |                 mode_t mode;
 503 |                 if (args[index + 1] == "-a")
 504 |                 {
 505 |                     mode = 0777; // access to all
 506 |                 }
 507 |                 else if (args[index + 1] == "-s")
 508 |                 {
 509 |                     mode = 0700; // acess to owner only
 510 |                 }
 511 |                 else
 512 |                 {
 513 |                     std::cout << "forge: unknown option " << args[index + 1] << "'\n";
 514 |                     return;
 515 |                 }
 516 | 
 517 |                 nameAndModes[args[index]] = mode;
 518 |                 index++;
 519 |             }
 520 |             else
 521 |             {
 522 |                 nameAndModes[args[index]] = defaultMode;
 523 |             }
 524 |         }
 525 |         else
 526 |         {
 527 |             nameAndModes[args[index]] = defaultMode;
 528 |         }
 529 |         index++;
 530 |     }
 531 | 
 532 |     for (const auto &pair : nameAndModes)
 533 |     {
 534 |         std::string dirPath = pair.first;
 535 |         std::vector<std::string> paths = splitPath(dirPath);
 536 |         std::string currentPath;
 537 | 
 538 |         if (!dirPath.empty() && dirPath[0] == '/')
 539 |         {
 540 |             currentPath = "/";
 541 |         }
 542 | 
 543 |         for (size_t i = 0; i < paths.size(); ++i)
 544 |         {
 545 |             currentPath += paths[i];
 546 |             if (i != paths.size() - 1)
 547 |                 currentPath += "/";
 548 | 
 549 |             if (mkdir(currentPath.c_str(), pair.second) == -1)
 550 |             {
 551 |                 std::cout << "Cannot create - " << dirPath << "\n";
 552 |                 break;
 553 |             }
 554 |         }
 555 |     }
 556 | #endif
 557 | }
 558 | 
 559 | void ChangeDirectory ::execute(const std::vector<std::string> &args)
 560 | {
 561 |     std::string tmp;
 562 |     for (int i = 1; i < args.size(); i++)
 563 |     {
 564 |         tmp += args[i];
 565 |     }
 566 | 
 567 |     if (chdir(tmp.c_str()) != 0)
 568 |     {
 569 |         std::cout << "Cannot change directory to " << tmp << "\n";
 570 |     }
 571 | }
 572 | 
 573 | int Erase::removeDir(std::string path)
 574 | {
 575 |     DIR *dir = opendir(path.c_str());
 576 |     if (!dir)
 577 |         return -1;
 578 | 
 579 |     struct dirent *entity;
 580 |     while ((entity = readdir(dir)) != nullptr)
 581 |     {
 582 |         if (strcmp(entity->d_name, ".") == 0 || strcmp(entity->d_name, "..") == 0)
 583 |         {
 584 |             continue;
 585 |         }
 586 | 
 587 |         std::string fullPath = path + "/" + entity->d_name;
 588 | 
 589 |         // checking for files and folders
 590 |         struct stat buf;
 591 |         if (stat(fullPath.c_str(), &buf) == 0)
 592 |         {
 593 |             if (S_ISDIR(buf.st_mode))
 594 |             {
 595 |                 if (removeDir(fullPath) != 0)
 596 |                 {
 597 |                     std::cout << "Cannot delete - " << fullPath << "\n";
 598 |                     closedir(dir);
 599 |                     return -1;
 600 |                 }
 601 |             }
 602 |             else
 603 |             {
 604 |                 if (remove(fullPath.c_str()) != 0)
 605 |                 {
 606 |                     std::cout << "Cannot delete - " << fullPath << "\n";
 607 |                     closedir(dir);
 608 |                     return -1;
 609 |                 }
 610 |             }
 611 |         }
 612 |     }
 613 | 
 614 |     closedir(dir);
 615 |     return rmdir(path.c_str());
 616 | }
 617 | 
 618 | void Erase::execute(const std::vector<std::string> &args)
 619 | {
 620 |     if (args.size() < 2)
 621 |     {
 622 |         std::cout << "erase takes 2 or more arguements. See help.\n";
 623 |     }
 624 | 
 625 |     for (size_t i = 1; i < args.size(); i++)
 626 |     {
 627 |         // checking for files and folders
 628 |         struct stat buf;
 629 |         if (stat(args[i].c_str(), &buf) == 0)
 630 |         {
 631 |             if (S_ISDIR(buf.st_mode))
 632 |             {
 633 |                 // checking and recursively deleteing file and folder using the removeDir()
 634 | 
 635 |                 if (removeDir(args[i]) != 0)
 636 |                 {
 637 |                     std::cout << "Cannot delete - " << args[i] << "\n";
 638 |                 }
 639 |             }
 640 |             else
 641 |             {
 642 |                 if (remove(args[i].c_str()) != 0)
 643 |                 {
 644 |                     std::cout << "Cannot delete - " << args[i] << "\n";
 645 |                 }
 646 |             }
 647 |         }
 648 |         else
 649 |         {
 650 |             std::cout << "See help.\n";
 651 |         }
 652 |     }
 653 | }
 654 | 
 655 | void Show ::execute(const std::vector<std::string> &args)
 656 | {
 657 |     if (args.size() < 2)
 658 |     {
 659 |         char cwd[1024];
 660 |         if (getcwd(cwd, sizeof(cwd)) != nullptr)
 661 |         {
 662 |             std::cout << "Working Directory - " << cwd << "\n";
 663 |         }
 664 | 
 665 |         DIR *dir;
 666 |         dir = opendir(".");
 667 |         if (dir != nullptr)
 668 |         {
 669 |             struct dirent *entity;
 670 |             entity = readdir(dir);
 671 |             while (entity != nullptr)
 672 |             {
 673 |                 std::cout << entity->d_name << " ";
 674 |                 entity = readdir(dir);
 675 |             }
 676 |             std::cout << "\n";
 677 |             closedir(dir);
 678 |         }
 679 |     }
 680 |     else
 681 |     {
 682 |         std::cout << "show takes no arguement.\n";
 683 |     }
 684 | }
 685 | 
 686 | void Craft ::execute(const std::vector<std::string> &args)
 687 | {
 688 |     for (size_t i = 1; i < args.size(); i++)
 689 |     {
 690 |         // checking if the file exists
 691 |         std::fstream file(args[i], std::ios::in);
 692 |         if (!file.is_open())
 693 |         {
 694 |             std::ofstream file(args[i]);
 695 |         }
 696 |         file.close();
 697 |     }
 698 | }
 699 | 
 700 | void View ::execute(const std::vector<std::string> &args)
 701 | {
 702 |     for (size_t i = 1; i < args.size(); i++)
 703 |     {
 704 |         std::fstream file(args[i], std::ios::in);
 705 |         if (file.is_open())
 706 |         {
 707 |             std::cout << args[i] << " - \n";
 708 |             std::ifstream file(args[i]);
 709 |             std::string line;
 710 |             while (std::getline(file, line))
 711 |                 std::cout << line << "\n";
 712 |         }
 713 |         else
 714 |         {
 715 |             std::cout << args[i] << " - doesn't exists!\n";
 716 |         }
 717 |         file.close();
 718 |     }
 719 | }
 720 | 
 721 | void Shift ::execute(const std::vector<std::string> &args)
 722 | {
 723 |     if (args.size() != 3)
 724 |     {
 725 |         std::cout << "shift takes 3 arguements\n";
 726 |     }
 727 |     std::string src = args[1];
 728 |     std::string dest = args[2];
 729 | 
 730 |     if (rename(src.c_str(), dest.c_str()) != 0)
 731 |     {
 732 |         std::cout << "Unable to do the operation\n";
 733 |     }
 734 | }
 735 | 
 736 | void History ::execute(const std::vector<std::string> &args)
 737 | {
 738 |     if (args.size() >= 2)
 739 |     {
 740 |         for (int i = 1; i < args.size(); i++)
 741 |         {
 742 |             core.searchHistory(args[i]);
 743 |         }
 744 |     }
 745 |     else
 746 |     {
 747 |         std::vector<std::vector<std::string>> commandList = core.getHistory();
 748 |         for (int i = 0; i < commandList.size(); i++)
 749 |         {
 750 |             std::cout << i + 1 << ".  ";
 751 |             for (int j = 0; j < commandList[i].size(); j++)
 752 |             {
 753 |                 std::cout << commandList[i][j] << " ";
 754 |             }
 755 |             std::cout << "\n";
 756 |         }
 757 |     }
 758 | }
 759 | 
 760 | void Sys ::SystemInfo()
 761 | {
 762 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
 763 |     auto ifs = std::ifstream("/proc/cpuinfo");
 764 |     std::string line;
 765 |     while (std::getline(ifs, line))
 766 |     {
 767 |         std::cout << line << '\n';
 768 |     }
 769 | #endif
 770 | 
 771 | #if defined(_WIN32) || defined(_WIN64)
 772 |     const TCHAR *envVarStrings[] =
 773 |         {
 774 |             TEXT("OS         = %OS%"),
 775 |             TEXT("PATH       = %PATH%"),
 776 |             TEXT("HOMEPATH   = %HOMEPATH%"),
 777 |             TEXT("TEMP       = %TEMP%")};
 778 | 
 779 | #define ENV_VAR_STRING_COUNT (sizeof(envVarStrings) / sizeof(TCHAR *))
 780 | #define INFO_BUFFER_SIZE 32767
 781 |     TCHAR infoBuf[INFO_BUFFER_SIZE] = {'\0'};
 782 |     DWORD i = 0;
 783 |     DWORD bufCharCount = INFO_BUFFER_SIZE;
 784 | 
 785 |     // Get and display the name of the computer.
 786 |     if (!::GetComputerName(infoBuf, &bufCharCount))
 787 |         PrintError(TEXT("GetComputerName"));
 788 |     _tprintf(TEXT("\nComputer name:      %s"), infoBuf);
 789 | 
 790 |     // Get and display the user name.
 791 |     bufCharCount = INFO_BUFFER_SIZE;
 792 |     if (!::GetUserName(infoBuf, &bufCharCount))
 793 |         PrintError(TEXT("GetUserName"));
 794 |     _tprintf(TEXT("\nUser name:          %s"), infoBuf);
 795 | 
 796 |     // Get and display the system directory.
 797 |     if (!::GetSystemDirectory(infoBuf, INFO_BUFFER_SIZE))
 798 |         PrintError(TEXT("GetSystemDirectory"));
 799 |     _tprintf(TEXT("\nSystem Directory:   %s"), infoBuf);
 800 | 
 801 |     // Get and display the Windows directory.
 802 |     if (!::GetWindowsDirectory(infoBuf, INFO_BUFFER_SIZE))
 803 |         PrintError(TEXT("GetWindowsDirectory"));
 804 |     _tprintf(TEXT("\nWindows Directory:  %s"), infoBuf);
 805 | 
 806 |     // Expand and display a few environment variables.
 807 |     _tprintf(TEXT("\n\nSmall selection of Environment Variables:"));
 808 |     for (i = 0; i < ENV_VAR_STRING_COUNT; ++i)
 809 |     {
 810 |         bufCharCount = ::ExpandEnvironmentStrings(envVarStrings[i], infoBuf,
 811 |                                                   INFO_BUFFER_SIZE);
 812 |         if (bufCharCount > INFO_BUFFER_SIZE)
 813 |             _tprintf(TEXT("\n\t(Buffer too small to expand: \"%s\")"),
 814 |                      envVarStrings[i]);
 815 |         else if (!bufCharCount)
 816 |             PrintError(TEXT("ExpandEnvironmentStrings"));
 817 |         else
 818 |             _tprintf(TEXT("\n   %s"), infoBuf);
 819 |     }
 820 |     _tprintf(TEXT("\n\n"));
 821 | 
 822 | #pragma comment(lib, "user32.lib")
 823 | 
 824 |     SYSTEM_INFO siSysInfo;
 825 |     GetSystemInfo(&siSysInfo);
 826 |     printf("Hardware information: \n");
 827 |     printf("  OEM ID: %u\n", siSysInfo.dwOemId);
 828 |     printf("  Number of processors: %u\n",
 829 |            siSysInfo.dwNumberOfProcessors);
 830 |     printf("  Page size: %u\n", siSysInfo.dwPageSize);
 831 |     printf("  Processor type: %u\n", siSysInfo.dwProcessorType);
 832 |     printf("  Minimum application address: %lx\n",
 833 |            siSysInfo.lpMinimumApplicationAddress);
 834 |     printf("  Maximum application address: %lx\n",
 835 |            siSysInfo.lpMaximumApplicationAddress);
 836 |     printf("  Active processor mask: %u\n",
 837 |            siSysInfo.dwActiveProcessorMask);
 838 | #endif
 839 | }
 840 | 
 841 | #if defined(_WIN64) || defined(_WIN32)
 842 | void Sys ::PrintError(const TCHAR *msg)
 843 | {
 844 |     TCHAR sysMsg[MAX_PATH] = {'\0'};
 845 |     TCHAR *p = sysMsg;
 846 |     DWORD eNum = ::GetLastError();
 847 | 
 848 |     ::FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM |
 849 |                         FORMAT_MESSAGE_IGNORE_INSERTS,
 850 |                     nullptr, eNum,
 851 |                     MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT),
 852 |                     sysMsg, MAX_PATH, nullptr);
 853 | 
 854 |     while (*p++)
 855 |     {
 856 |         if ((*p != 9 && *p < 32) || *p == 46)
 857 |         {
 858 |             *p = 0;
 859 |             break;
 860 |         }
 861 |     }
 862 | 
 863 |     _tprintf(TEXT("\n\t%s failed with error %d (%s)"), msg, eNum, sysMsg);
 864 | 
 865 |     p = nullptr;
 866 | }
 867 | 
 868 | // getting procesess
 869 | BOOL Sys ::GetProcessListWin()
 870 | {
 871 |     HANDLE hProcessSnap;
 872 |     HANDLE hProcess;
 873 |     PROCESSENTRY32 pe32;
 874 |     DWORD dwPriorityClass;
 875 | 
 876 |     // Take a snapshot of all processes in the system.
 877 |     hProcessSnap = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS, 0);
 878 |     if (hProcessSnap == INVALID_HANDLE_VALUE)
 879 |     {
 880 |         PrintError(TEXT("CreateToolhelp32Snapshot (of processes)"));
 881 |         return (FALSE);
 882 |     }
 883 | 
 884 |     // Set the size of the structure before using it.
 885 |     pe32.dwSize = sizeof(PROCESSENTRY32);
 886 | 
 887 |     // Retrieve information about the first process,
 888 |     if (!Process32First(hProcessSnap, &pe32))
 889 |     {
 890 |         PrintError(TEXT("Process32First"));
 891 |         CloseHandle(hProcessSnap);
 892 |         return (FALSE);
 893 |     }
 894 |     else
 895 |     {
 896 |         while (Process32Next(hProcessSnap, &pe32))
 897 |         {
 898 | 
 899 |             _tprintf(TEXT("\nPROCESS NAME:  %s"), pe32.szExeFile);
 900 |             _tprintf(TEXT("\n-------------------------------------------------------"));
 901 | 
 902 |             // Retrieve the priority class.
 903 |             dwPriorityClass = 0;
 904 |             hProcess = OpenProcess(PROCESS_ALL_ACCESS, FALSE, pe32.th32ProcessID);
 905 |             if (hProcess == NULL)
 906 |                 PrintError(TEXT("OpenProcess"));
 907 |             else
 908 |             {
 909 |                 dwPriorityClass = GetPriorityClass(hProcess);
 910 |                 if (!dwPriorityClass)
 911 |                     PrintError(TEXT("GetPriorityClass"));
 912 |                 CloseHandle(hProcess);
 913 |             }
 914 | 
 915 |             _tprintf(TEXT("\n  Process ID        = 0x%08X"), pe32.th32ProcessID);
 916 |             _tprintf(TEXT("\n  Thread count      = %d"), pe32.cntThreads);
 917 |             _tprintf(TEXT("\n  Parent process ID = 0x%08X"), pe32.th32ParentProcessID);
 918 |             _tprintf(TEXT("\n  Priority base     = %d"), pe32.pcPriClassBase);
 919 |             if (dwPriorityClass)
 920 |                 _tprintf(TEXT("\n  Priority class    = %d"), dwPriorityClass);
 921 | 
 922 |             std::cout << "\n=======================================================\n";
 923 |         }
 924 |     }
 925 | 
 926 |     CloseHandle(hProcessSnap);
 927 |     return (TRUE);
 928 | }
 929 | 
 930 | // for network
 931 | void Sys ::GetNetworkInfoWin()
 932 | {
 933 |     FIXED_INFO *pFixedInfo;
 934 |     IP_ADDR_STRING *pIPAddr;
 935 | 
 936 |     ULONG ulOutBufLen;
 937 |     DWORD dwRetVal;
 938 | 
 939 |     pFixedInfo = (FIXED_INFO *)malloc(sizeof(FIXED_INFO));
 940 |     ulOutBufLen = sizeof(FIXED_INFO);
 941 | 
 942 |     // initial call to GetNetworkParams to get the size required for the ulOutBufLen variable
 943 |     if (GetNetworkParams(pFixedInfo, &ulOutBufLen) == ERROR_BUFFER_OVERFLOW)
 944 |     {
 945 |         free(pFixedInfo);
 946 |         pFixedInfo = (FIXED_INFO *)malloc(ulOutBufLen);
 947 |         if (pFixedInfo == NULL)
 948 |         {
 949 |             printf("Error allocating memory needed to call GetNetworkParams\n");
 950 |         }
 951 |     }
 952 | 
 953 |     // using general error checking and returning its value to the DWORD variable dwRetVal
 954 |     if (dwRetVal = GetNetworkParams(pFixedInfo, &ulOutBufLen) != NO_ERROR)
 955 |     {
 956 |         printf("GetNetworkParams failed with error %d\n", dwRetVal);
 957 |         if (pFixedInfo)
 958 |         {
 959 |             free(pFixedInfo);
 960 |         }
 961 |     }
 962 | 
 963 |     // showing data from pFixedInfo data structure
 964 |     printf("Host Name: %s\n", pFixedInfo->HostName);
 965 |     printf("Domain Name: %s\n", pFixedInfo->DomainName);
 966 |     printf("DNS Servers:\n");
 967 |     printf("\t%s\n", pFixedInfo->DnsServerList.IpAddress.String);
 968 | 
 969 |     pIPAddr = pFixedInfo->DnsServerList.Next;
 970 |     while (pIPAddr)
 971 |     {
 972 |         printf("\t%s\n", pIPAddr->IpAddress.String);
 973 |         pIPAddr = pIPAddr->Next;
 974 |     }
 975 | 
 976 |     printf("Node Type: ");
 977 |     switch (pFixedInfo->NodeType)
 978 |     {
 979 |     case 1:
 980 |         printf("%s\n", "Broadcast");
 981 |         break;
 982 |     case 2:
 983 |         printf("%s\n", "Peer to peer");
 984 |         break;
 985 |     case 4:
 986 |         printf("%s\n", "Mixed");
 987 |         break;
 988 |     case 8:
 989 |         printf("%s\n", "Hybrid");
 990 |         break;
 991 |     default:
 992 |         printf("\n");
 993 |     }
 994 | 
 995 |     printf("NetBIOS Scope ID: %s\n", pFixedInfo->ScopeId);
 996 | 
 997 |     if (pFixedInfo->EnableRouting)
 998 |         printf("IP Routing Enabled: Yes\n");
 999 |     else
1000 |         printf("IP Routing Enabled: No\n");
1001 | 
1002 |     if (pFixedInfo->EnableProxy)
1003 |         printf("WINS Proxy Enabled: Yes\n");
1004 |     else
1005 |         printf("WINS Proxy Enabled: No\n");
1006 | 
1007 |     if (pFixedInfo->EnableDns)
1008 |         printf("NetBIOS Resolution Uses DNS: Yes\n");
1009 |     else
1010 |         printf("NetBIOS Resolution Uses DNS: No\n");
1011 | 
1012 |     if (pFixedInfo)
1013 |     {
1014 |         free(pFixedInfo);
1015 |         pFixedInfo = NULL;
1016 |     }
1017 | 
1018 |     // printing ip, mask and broadcast address, IF index, and re assembly size
1019 |     MIB_IPADDRTABLE *pIPAddrTable;
1020 |     DWORD dwSize = 0;
1021 | 
1022 |     pIPAddrTable = (MIB_IPADDRTABLE *)malloc(sizeof(MIB_IPADDRTABLE));
1023 |     if (GetIpAddrTable(pIPAddrTable, &dwSize, 0) == ERROR_INSUFFICIENT_BUFFER)
1024 |     {
1025 |         free(pIPAddrTable);
1026 |         pIPAddrTable = (MIB_IPADDRTABLE *)malloc(dwSize);
1027 |     }
1028 |     if ((dwRetVal = GetIpAddrTable(pIPAddrTable, &dwSize, 0)) != NO_ERROR)
1029 |     {
1030 |         printf("GetIpAddrTable call failed with %d\n", dwRetVal);
1031 |     }
1032 | 
1033 |     // IPAddrTable->table[0].dwAddr stores address in network byte order
1034 |     // changing it to dotted format
1035 |     IN_ADDR ipaddr, broadaddr, maskaddr;
1036 |     ipaddr.S_un.S_addr = pIPAddrTable->table[0].dwAddr;
1037 |     broadaddr.S_un.S_addr = pIPAddrTable->table[0].dwBCastAddr;
1038 |     maskaddr.S_un.S_addr = pIPAddrTable->table[0].dwMask;
1039 | 
1040 |     printf("IP Address:         %s\n", inet_ntoa(ipaddr));
1041 |     printf("IP Mask:            %s\n", inet_ntoa(maskaddr));
1042 |     printf("Broadcast Addr:     %s\n", inet_ntoa(broadaddr));
1043 |     printf("IF Index:           %ld\n", pIPAddrTable->table[0].dwIndex);
1044 |     printf("Re-assembly size:   %ld\n", pIPAddrTable->table[0].dwReasmSize);
1045 | 
1046 |     if (pIPAddrTable)
1047 |         free(pIPAddrTable);
1048 | }
1049 | 
1050 | // showing adapter information
1051 | void Sys::GetAdapterInfoWin()
1052 | {
1053 |     IP_ADAPTER_INFO *pAdapterInfo;
1054 |     ULONG ulOutBufLen;
1055 |     DWORD dwRetVal;
1056 | 
1057 |     pAdapterInfo = (IP_ADAPTER_INFO *)malloc(sizeof(IP_ADAPTER_INFO));
1058 |     ulOutBufLen = sizeof(IP_ADAPTER_INFO);
1059 | 
1060 |     // call to GetAdaptersInfo to get the size needed into the ulOutBufLen variable
1061 |     if (GetAdaptersInfo(pAdapterInfo, &ulOutBufLen) != ERROR_SUCCESS)
1062 |     {
1063 |         free(pAdapterInfo);
1064 |         pAdapterInfo = (IP_ADAPTER_INFO *)malloc(ulOutBufLen);
1065 |     }
1066 | 
1067 |     // call to GetAdaptersInfo, passing pAdapterInfo and ulOutBufLen as parameters, returning its value to the DWORD variable dwRetVal
1068 |     if ((dwRetVal = GetAdaptersInfo(pAdapterInfo, &ulOutBufLen)) != ERROR_SUCCESS)
1069 |     {
1070 |         printf("GetAdaptersInfo call failed with %d\n", dwRetVal);
1071 |     }
1072 | 
1073 |     PIP_ADAPTER_INFO pAdapter = pAdapterInfo;
1074 |     while (pAdapter)
1075 |     {
1076 |         printf("Adapter Name: %s\n", pAdapter->AdapterName);
1077 |         printf("Adapter Desc: %s\n", pAdapter->Description);
1078 |         printf("Adapter Addr: \t");
1079 |         for (UINT i = 0; i < pAdapter->AddressLength; i++)
1080 |         {
1081 |             if (i == (pAdapter->AddressLength - 1))
1082 |                 printf("%.2X\n", (int)pAdapter->Address[i]);
1083 |             else
1084 |                 printf("%.2X-", (int)pAdapter->Address[i]);
1085 |         }
1086 |         printf("IP Address: %s\n", pAdapter->IpAddressList.IpAddress.String);
1087 |         printf("IP Mask: %s\n", pAdapter->IpAddressList.IpMask.String);
1088 |         printf("Gateway: \t%s\n", pAdapter->GatewayList.IpAddress.String);
1089 | 
1090 |         if (pAdapter->DhcpEnabled)
1091 |         {
1092 |             printf("DHCP Enabled: Yes\n");
1093 |             printf("\tDHCP Server: \t%s\n", pAdapter->DhcpServer.IpAddress.String);
1094 |         }
1095 |         else
1096 |         {
1097 |             printf("DHCP Enabled: No\n");
1098 |         }
1099 | 
1100 |         printf("\n-----------\n");
1101 | 
1102 |         pAdapter = pAdapter->Next;
1103 |     }
1104 | 
1105 |     if (pAdapterInfo)
1106 |     {
1107 |         free(pAdapterInfo);
1108 |     }
1109 | }
1110 | #endif
1111 | 
1112 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
1113 | void Sys::GetProcessesUnix()
1114 | {
1115 |     DIR *dir;
1116 |     struct dirent *entry;
1117 | 
1118 |     dir = opendir("/proc");
1119 |     if (!dir)
1120 |     {
1121 |         perror("opendir");
1122 |     }
1123 | 
1124 |     std::cout << "PID\tPPID\tNAME\n";
1125 |     std::cout << "---------------------------\n";
1126 | 
1127 |     while ((entry = readdir(dir)) != nullptr)
1128 |     {
1129 |         std::string pidStr = entry->d_name;
1130 |         if (!isNumeric(pidStr))
1131 |             continue;
1132 | 
1133 |         std::string statPath = "/proc/" + pidStr + "/stat";
1134 |         std::ifstream statFile(statPath);
1135 |         if (!statFile.is_open())
1136 |             continue;
1137 | 
1138 |         int pid, ppid;
1139 |         std::string comm;
1140 |         char state;
1141 | 
1142 |         std::string line;
1143 |         std::getline(statFile, line);
1144 |         std::istringstream iss(line);
1145 | 
1146 |         iss >> pid;
1147 |         iss >> std::ws;
1148 |         iss.ignore(1, '(');
1149 |         std::getline(iss, comm, ')');
1150 |         iss >> state >> ppid;
1151 | 
1152 |         std::cout << pid << "\t" << ppid << "\t" << comm << "\n";
1153 |     }
1154 | }
1155 | 
1156 | void Sys::GetNetworkInfoUnix()
1157 | {
1158 |     struct ifaddrs *ifaddr, *ifa;
1159 |     char addr[INET6_ADDRSTRLEN];
1160 | 
1161 |     if (getifaddrs(&ifaddr) == -1)
1162 |     {
1163 |         perror("getifaddrs");
1164 |     }
1165 | 
1166 |     for (ifa = ifaddr; ifa != nullptr; ifa = ifa->ifa_next)
1167 |     {
1168 |         if (!ifa->ifa_addr)
1169 |             continue;
1170 | 
1171 |         // Check for IPv4 or IPv6
1172 |         int family = ifa->ifa_addr->sa_family;
1173 | 
1174 |         if (family == AF_INET || family == AF_INET6)
1175 |         {
1176 |             void *in_addr = nullptr;
1177 | 
1178 |             if (family == AF_INET)
1179 |                 in_addr = &((struct sockaddr_in *)ifa->ifa_addr)->sin_addr;
1180 |             else
1181 |                 in_addr = &((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr;
1182 | 
1183 |             inet_ntop(family, in_addr, addr, sizeof(addr));
1184 | 
1185 |             std::cout << "Interface: " << ifa->ifa_name
1186 |                       << "\n  Address: " << addr
1187 |                       << "\n  Family: " << (family == AF_INET ? "IPv4" : "IPv6")
1188 |                       << "\n\n";
1189 |         }
1190 |     }
1191 | }
1192 | 
1193 | // getting info about adapters
1194 | void Sys::GetAdapterInfoUnix()
1195 | {
1196 |     struct ifaddrs *ifaddr, *ifa;
1197 |     char addrBuf[INET6_ADDRSTRLEN];
1198 | 
1199 |     if (getifaddrs(&ifaddr) == -1)
1200 |     {
1201 |         perror("getifaddrs");
1202 |         return;
1203 |     }
1204 | 
1205 |     for (ifa = ifaddr; ifa != nullptr; ifa = ifa->ifa_next)
1206 |     {
1207 |         if (!ifa->ifa_addr)
1208 |             continue;
1209 | 
1210 |         std::cout << "Interface: " << ifa->ifa_name << "\n";
1211 | 
1212 |         // Flags
1213 |         std::cout << "  Flags: ";
1214 |         if (ifa->ifa_flags & IFF_UP)
1215 |             std::cout << "UP ";
1216 |         if (ifa->ifa_flags & IFF_LOOPBACK)
1217 |             std::cout << "LOOPBACK ";
1218 |         if (ifa->ifa_flags & IFF_BROADCAST)
1219 |             std::cout << "BROADCAST ";
1220 |         if (ifa->ifa_flags & IFF_RUNNING)
1221 |             std::cout << "RUNNING ";
1222 |         std::cout << "\n";
1223 | 
1224 |         // IP address
1225 |         int family = ifa->ifa_addr->sa_family;
1226 |         if (family == AF_INET || family == AF_INET6)
1227 |         {
1228 |             void *addrPtr = (family == AF_INET)
1229 |                                 ? (void *)&((struct sockaddr_in *)ifa->ifa_addr)->sin_addr
1230 |                                 : (void *)&((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr;
1231 | 
1232 |             inet_ntop(family, addrPtr, addrBuf, sizeof(addrBuf));
1233 |             std::cout << "  Address (" << (family == AF_INET ? "IPv4" : "IPv6") << "): "
1234 |                       << addrBuf << "\n";
1235 |         }
1236 | 
1237 |         // MAC address (works for AF_PACKET)
1238 |         if (ifa->ifa_addr->sa_family == AF_PACKET)
1239 |         {
1240 |             struct sockaddr_ll *s = (struct sockaddr_ll *)ifa->ifa_addr;
1241 |             std::cout << "  MAC: ";
1242 |             for (int i = 0; i < s->sll_halen; i++)
1243 |             {
1244 |                 printf("%02x%s", s->sll_addr[i], (i + 1 != s->sll_halen) ? ":" : "");
1245 |             }
1246 |             std::cout << "\n";
1247 |         }
1248 | 
1249 |         // MTU
1250 |         int sock = socket(AF_INET, SOCK_DGRAM, 0);
1251 |         if (sock >= 0)
1252 |         {
1253 |             struct ifreq ifr;
1254 |             memset(&ifr, 0, sizeof(ifr));
1255 |             strncpy(ifr.ifr_name, ifa->ifa_name, IFNAMSIZ - 1);
1256 |             if (ioctl(sock, SIOCGIFMTU, &ifr) == 0)
1257 |             {
1258 |                 std::cout << "  MTU: " << ifr.ifr_mtu << "\n";
1259 |             }
1260 |             close(sock);
1261 |         }
1262 | 
1263 |         std::cout << "--------------------------------------\n";
1264 |     }
1265 | 
1266 |     freeifaddrs(ifaddr);
1267 | }
1268 | #endif
1269 | 
1270 | void Sys ::execute(const std::vector<std::string> &args)
1271 | {
1272 |     if (args.size() < 2)
1273 |     {
1274 |         SystemInfo();
1275 |         return;
1276 |     }
1277 | 
1278 |     for (size_t i = 1; i < args.size(); i++)
1279 |     {
1280 |         if (args[i] == "-p" || args[i] == "--proc")
1281 |         {
1282 |             std::cout << "Processes Informations\n"
1283 |                       << "---------------------" << "\n";
1284 | #if defined(_WIN64) || defined(_WIN32)
1285 |             GetProcessListWin();
1286 | #endif
1287 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
1288 |             GetProcessesUnix();
1289 | #endif
1290 |             std::cout << "\n";
1291 |         }
1292 | 
1293 |         else if (args[i] == "-n" || args[i] == "--network")
1294 |         {
1295 |             std::cout << "Network Informations\n"
1296 |                       << "---------------------" << "\n";
1297 | #if defined(_WIN64) || defined(_WIN32)
1298 |             GetNetworkInfoWin();
1299 | #endif
1300 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
1301 |             GetNetworkInfoUnix();
1302 | #endif
1303 |         }
1304 | 
1305 |         if (args[i] == "-a" || args[i] == "--adapters")
1306 |         {
1307 |             std::cout << "Adapter Informations\n"
1308 |                       << "---------------------" << "\n";
1309 | #if defined(_WIN64) || defined(_WIN32)
1310 |             GetAdapterInfoWin();
1311 | #endif
1312 | #if defined(__linux__) || defined(__unix__) || defined(__APPLE__)
1313 |             GetAdapterInfoUnix();
1314 | #endif
1315 |         }
1316 |     }
1317 | }
1318 | 
1319 | // probe implementation
1320 | 
1321 | static volatile bool keepPinging = true;
1322 | 
1323 | void signalHandler(int signum)
1324 | {
1325 |     keepPinging = false;
1326 | }
1327 | 
1328 | std::string Probe::resolveHostname(const std::string &host)
1329 | {
1330 |     struct addrinfo hints, *res;
1331 |     memset(&hints, 0, sizeof(hints));
1332 |     hints.ai_family = AF_INET;
1333 |     hints.ai_socktype = SOCK_STREAM;
1334 | 
1335 |     if (getaddrinfo(host.c_str(), nullptr, &hints, &res) != 0)
1336 |     {
1337 |         return "";
1338 |     }
1339 | 
1340 |     char ipstr[INET_ADDRSTRLEN];
1341 |     struct sockaddr_in *ipv4 = (struct sockaddr_in *)res->ai_addr;
1342 |     inet_ntop(AF_INET, &(ipv4->sin_addr), ipstr, sizeof(ipstr));
1343 | 
1344 |     std::string result(ipstr);
1345 |     freeaddrinfo(res);
1346 |     return result;
1347 | }
1348 | 
1349 | void Probe::displayHeader(const std::string &host, const std::string &ip)
1350 | {
1351 |     std::cout << "PROBE - \n";
1352 |     std::cout << "|--------------------------------------------------------------|\n";
1353 |     std::cout << "  Target Host: " << host << "\n";
1354 |     std::cout << "  Target IP:   " << ip << "\n";
1355 |     std::cout << "----------------------------------------------------------------\n\n";
1356 | }
1357 | 
1358 | void Probe::displayResult(int seq, double latency, const std::string &ip, int ttl)
1359 | {
1360 |     std::cout << std::fixed << std::setprecision(2);
1361 | 
1362 |     // coding based on latency
1363 |     std::string indicator;
1364 |     if (latency < 50)
1365 |     {
1366 |         indicator = "OPTIMAL";
1367 |     }
1368 |     else if (latency < 100)
1369 |     {
1370 |         indicator = "STABLE";
1371 |     }
1372 |     else if (latency < 200)
1373 |     {
1374 |         indicator = "DEGRADED";
1375 |     }
1376 |     else
1377 |     {
1378 |         indicator = "CRITICAL";
1379 |     }
1380 | 
1381 |     std::cout << "[#" << std::setw(3) << std::setfill('0') << seq << "] "
1382 |               << indicator << " | "
1383 |               << ip << " | "
1384 |               << "TTL=" << ttl << " | "
1385 |               << "Time=" << std::setw(7) << latency << "ms\n";
1386 | }
1387 | 
1388 | void Probe::displayGraph(const std::vector<double> &latencies)
1389 | {
1390 |     if (latencies.empty())
1391 |         return;
1392 | 
1393 |     const int graphHeight = 10;
1394 |     const int graphWidth = std::min((int)latencies.size(), 50);
1395 | 
1396 |     double maxLatency = *std::max_element(latencies.begin(), latencies.end());
1397 |     double minLatency = *std::min_element(latencies.begin(), latencies.end());
1398 | 
1399 |     std::cout << "\nSynchronization Pattern\n";
1400 |     std::cout << "--------------------------------------------------------------\n";
1401 | 
1402 |     // Display graph
1403 |     for (int row = graphHeight; row >= 0; --row)
1404 |     {
1405 |         double threshold = minLatency + (maxLatency - minLatency) * row / graphHeight;
1406 |         std::cout << std::setw(7) << std::fixed << std::setprecision(1) << threshold << "ms"<<" |";
1407 | 
1408 |         for (int col = 0; col < graphWidth && col < latencies.size(); ++col)
1409 |         {
1410 |             if (latencies[latencies.size() - graphWidth + col] >= threshold)
1411 |             {
1412 |                 std::cout << "||";
1413 |             }
1414 |             else
1415 |             {
1416 |                 std::cout << " ";
1417 |             }
1418 |         }
1419 |         std::cout << "\n";
1420 |     }
1421 | 
1422 |     std::cout << "          +";
1423 |     for (int i = 0; i < graphWidth; ++i)
1424 |     {
1425 |         std::cout << "__";
1426 |     }
1427 |     std::cout << "\n";
1428 | }
1429 | 
1430 | std::string Probe::getSignalQuality(double avgLatency)
1431 | {
1432 |     if (avgLatency < 30)
1433 |         return "EXCELLENT - Optimal";
1434 |     if (avgLatency < 50)
1435 |         return "GOOD - Synchronization Stable";
1436 |     if (avgLatency < 100)
1437 |         return "FAIR - Minor AT Field Interference";
1438 |     if (avgLatency < 200)
1439 |         return "POOR - Significant Degradation";
1440 |     return "CRITICAL - Connection Unstable";
1441 | }
1442 | 
1443 | void Probe::displayStats(const PingStats &stats, const std::string &host)
1444 | {
1445 |     std::cout << "\nMISSION REPORT: Target - " << host << "\n";
1446 |     std::cout << "--------------------------------------------------------------\n";
1447 | 
1448 |     std::cout << std::fixed << std::setprecision(2);
1449 |     std::cout << "  Packets: Sent=" << stats.sent
1450 |               << ", Received=" << stats.received
1451 |               << ", Lost=" << stats.lost
1452 |               << " (" << (stats.sent > 0 ? (stats.lost * 100.0 / stats.sent) : 0) << "%)\n";
1453 | 
1454 |     if (stats.received > 0)
1455 |     {
1456 |         double avgLatency = stats.totalTime / stats.received;
1457 |         std::cout << "  Latency: Min=" << stats.minTime << "ms"
1458 |                   << ", Max=" << stats.maxTime << "ms"
1459 |                   << ", Avg=" << avgLatency << "ms\n";
1460 |         std::cout << "  Signal Quality: " << getSignalQuality(avgLatency) << "\n";
1461 | 
1462 |         displayGraph(stats.latencies);
1463 |     }
1464 | 
1465 |     std::cout << "--------------------------------------------------------------\n";
1466 | }
1467 | 
1468 | unsigned short Probe::checksum(void *b, int len)
1469 | {
1470 |     unsigned short *buf = (unsigned short *)b;
1471 |     unsigned int sum = 0;
1472 |     unsigned short result;
1473 | 
1474 |     for (sum = 0; len > 1; len -= 2)
1475 |         sum += *buf++;
1476 |     if (len == 1)
1477 |         sum += *(unsigned char *)buf;
1478 |     sum = (sum >> 16) + (sum & 0xFFFF);
1479 |     sum += (sum >> 16);
1480 |     result = ~sum;
1481 |     return result;
1482 | }
1483 | 
1484 | bool Probe::pingRawSocket(const std::string &ip, double &latency, int &ttl)
1485 | {
1486 | #if defined(_WIN32) || defined(_WIN64)
1487 |     // Windows raw socket implementation
1488 |     SOCKET sockRaw = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP);
1489 |     if (sockRaw == INVALID_SOCKET)
1490 |     {
1491 |         std::cerr << "Error: Administrator privileges required for ICMP on Windows\n";
1492 |         return false;
1493 |     }
1494 | 
1495 |     // Set timeout
1496 |     int timeout = 5000;
1497 |     setsockopt(sockRaw, SOL_SOCKET, SO_RCVTIMEO, (const char *)&timeout, sizeof(timeout));
1498 | 
1499 |     struct sockaddr_in dest;
1500 |     memset(&dest, 0, sizeof(dest));
1501 |     dest.sin_family = AF_INET;
1502 |     dest.sin_addr.s_addr = inet_addr(ip.c_str());
1503 | 
1504 |     // Prepare ICMP packet
1505 |     char sendBuf[32];
1506 |     ICMPHeader *icmp_hdr = (ICMPHeader *)sendBuf;
1507 |     icmp_hdr->type = ICMP_ECHO_REQUEST;
1508 |     icmp_hdr->code = 0;
1509 |     icmp_hdr->id = (unsigned short)GetCurrentProcessId();
1510 |     icmp_hdr->seq = 1;
1511 |     icmp_hdr->checksum = 0;
1512 | 
1513 |     // Fill data
1514 |     memset(sendBuf + sizeof(ICMPHeader), 'E', sizeof(sendBuf) - sizeof(ICMPHeader));
1515 |     icmp_hdr->checksum = checksum(sendBuf, sizeof(sendBuf));
1516 | 
1517 |     auto start = std::chrono::high_resolution_clock::now();
1518 | 
1519 |     if (sendto(sockRaw, sendBuf, sizeof(sendBuf), 0,
1520 |                (struct sockaddr *)&dest, sizeof(dest)) == SOCKET_ERROR)
1521 |     {
1522 |         closesocket(sockRaw);
1523 |         return false;
1524 |     }
1525 | 
1526 |     // Receive response
1527 |     char recvBuf[1024];
1528 |     struct sockaddr_in from;
1529 |     int fromlen = sizeof(from);
1530 | 
1531 |     int bytes = recvfrom(sockRaw, recvBuf, sizeof(recvBuf), 0,
1532 |                          (struct sockaddr *)&from, &fromlen);
1533 | 
1534 |     auto end = std::chrono::high_resolution_clock::now();
1535 | 
1536 |     if (bytes > 0)
1537 |     {
1538 |         // IP header is 20 bytes, skip to ICMP
1539 |         ICMPHeader *recv_icmp = (ICMPHeader *)(recvBuf + 20);
1540 | 
1541 |         if (recv_icmp->type == ICMP_ECHO_REPLY)
1542 |         {
1543 |             latency = std::chrono::duration<double, std::milli>(end - start).count();
1544 |             // Extract TTL from IP header
1545 |             ttl = (unsigned char)recvBuf[8];
1546 |             closesocket(sockRaw);
1547 |             return true;
1548 |         }
1549 |     }
1550 | 
1551 |     closesocket(sockRaw);
1552 |     return false;
1553 | 
1554 | #else
1555 |     // Linux/Unix implementation
1556 |     int sockfd = socket(AF_INET, SOCK_RAW, IPPROTO_ICMP);
1557 |     if (sockfd < 0)
1558 |     {
1559 |         std::cerr << "Error: Root/Administrator privileges required for ICMP\n";
1560 |         return false;
1561 |     }
1562 | 
1563 |     struct sockaddr_in addr;
1564 |     memset(&addr, 0, sizeof(addr));
1565 |     addr.sin_family = AF_INET;
1566 |     addr.sin_addr.s_addr = inet_addr(ip.c_str());
1567 | 
1568 |     // Prepare ICMP packet
1569 |     char packet[64];
1570 |     memset(packet, 0, sizeof(packet));
1571 |     ICMPHeader *icmp_hdr = (ICMPHeader *)packet;
1572 |     icmp_hdr->type = ICMP_ECHO_REQUEST;
1573 |     icmp_hdr->code = 0;
1574 |     icmp_hdr->id = getpid();
1575 |     icmp_hdr->seq = 1;
1576 |     icmp_hdr->checksum = 0;
1577 |     icmp_hdr->checksum = checksum(icmp_hdr, sizeof(packet));
1578 | 
1579 |     // Set timeout
1580 |     struct timeval timeout;
1581 |     timeout.tv_sec = 5;
1582 |     timeout.tv_usec = 0;
1583 |     setsockopt(sockfd, SOL_SOCKET, SO_RCVTIMEO, &timeout, sizeof(timeout));
1584 | 
1585 |     auto start = std::chrono::high_resolution_clock::now();
1586 | 
1587 |     if (sendto(sockfd, packet, sizeof(packet), 0,
1588 |                (struct sockaddr *)&addr, sizeof(addr)) <= 0)
1589 |     {
1590 |         close(sockfd);
1591 |         return false;
1592 |     }
1593 | 
1594 |     char recv_buf[1024];
1595 |     struct sockaddr_in recv_addr;
1596 |     socklen_t addr_len = sizeof(recv_addr);
1597 | 
1598 |     int bytes = recvfrom(sockfd, recv_buf, sizeof(recv_buf), 0,
1599 |                          (struct sockaddr *)&recv_addr, &addr_len);
1600 | 
1601 |     auto end = std::chrono::high_resolution_clock::now();
1602 | 
1603 |     if (bytes > 0)
1604 |     {
1605 |         // Extract TTL from IP header
1606 |         ttl = (unsigned char)recv_buf[8];
1607 |         latency = std::chrono::duration<double, std::milli>(end - start).count();
1608 |         close(sockfd);
1609 |         return true;
1610 |     }
1611 | 
1612 |     close(sockfd);
1613 |     return false;
1614 | #endif
1615 | }
1616 | 
1617 | void Probe::execute(const std::vector<std::string> &args)
1618 | {
1619 |     if (args.size() < 2)
1620 |     {
1621 |         std::cout << "Usage: probe <host> [-c count] [-t] [-i interval]\n";
1622 |         return;
1623 |     }
1624 | 
1625 |     std::string host = args[1];
1626 |     int count = 4;
1627 |     bool continuous = false;
1628 |     int interval = 1000;
1629 | 
1630 |     // Parse arguments
1631 |     for (size_t i = 2; i < args.size(); ++i)
1632 |     {
1633 |         if (args[i] == "-c" && i + 1 < args.size())
1634 |         {
1635 |             count = std::stoi(args[++i]);
1636 |         }
1637 |         else if (args[i] == "-t")
1638 |         {
1639 |             continuous = true;
1640 |         }
1641 |         else if (args[i] == "-i" && i + 1 < args.size())
1642 |         {
1643 |             interval = std::stoi(args[++i]);
1644 |         }
1645 |     }
1646 | 
1647 | #if defined(_WIN32) || defined(_WIN64)
1648 |     WSADATA wsaData;
1649 |     if (WSAStartup(MAKEWORD(2, 2), &wsaData) != 0)
1650 |     {
1651 |         std::cout << "Failed to initialize Winsock\n";
1652 |         return;
1653 |     }
1654 | #endif
1655 | 
1656 |     std::string ip = resolveHostname(host);
1657 |     if (ip.empty())
1658 |     {
1659 |         std::cout << "[ERROR] Cannot resolve hostname: " << host << "\n";
1660 | #if defined(_WIN32) || defined(_WIN64)
1661 |         WSACleanup();
1662 | #endif
1663 |         return;
1664 |     }
1665 | 
1666 |     displayHeader(host, ip);
1667 | 
1668 |     // Setup signal handler for continuous mode
1669 |     if (continuous)
1670 |     {
1671 |         signal(SIGINT, signalHandler);
1672 |         std::cout << "[INFO] Continuous mode active.\n\n";
1673 |     }
1674 | 
1675 |     PingStats stats;
1676 |     keepPinging = true;
1677 | 
1678 |     for (int i = 0; (continuous ? keepPinging : i < count); ++i)
1679 |     {
1680 |         double latency;
1681 |         int ttl = 0;
1682 |         stats.sent++;
1683 | 
1684 |         bool success = pingRawSocket(ip, latency, ttl);
1685 | 
1686 |         if (success)
1687 |         {
1688 |             stats.received++;
1689 |             stats.totalTime += latency;
1690 |             stats.minTime = std::min(stats.minTime, latency);
1691 |             stats.maxTime = std::max(stats.maxTime, latency);
1692 |             stats.latencies.push_back(latency);
1693 | 
1694 |             displayResult(i + 1, latency, ip, ttl);
1695 |         }
1696 |         else
1697 |         {
1698 |             stats.lost++;
1699 |             std::cout << "[#" << std::setw(3) << std::setfill('0') << (i + 1)
1700 |                       << "] X TIMEOUT - Target unresponsive\n";
1701 |         }
1702 | 
1703 |         if ((continuous && keepPinging) || i < count - 1)
1704 |         {
1705 |             sleep_milliseconds(interval);
1706 |         }
1707 |     }
1708 | 
1709 |     displayStats(stats, host);
1710 | 
1711 | #if defined(_WIN32) || defined(_WIN64)
1712 |     WSACleanup();
1713 | #endif
1714 | }


--------------------------------------------------------------------------------