From 533868b21e3ebe805b6ba465ee46213f9ac2cb73 Mon Sep 17 00:00:00 2001
From: rnhmjoj <rnhmjoj@inventati.org>
Date: Sat, 17 Jun 2023 09:25:35 +0200
Subject: [PATCH] Fix standard C++ 11 issues

---
 src/Fakeroute.cpp          | 2 +-
 src/FakeroutePacket.h      | 1 +
 src/TracerouteListener.cpp | 2 +-
 src/in_cksum.cpp           | 6 +++---
 4 files changed, 6 insertions(+), 5 deletions(-)

diff --git a/src/Fakeroute.cpp b/src/Fakeroute.cpp
index 1dfca2c..650460e 100644
--- a/src/Fakeroute.cpp
+++ b/src/Fakeroute.cpp
@@ -43,7 +43,7 @@ void printUsage(char*);
 static void daemonize();
 
 int main(int argc, char** argv) {
-  char* fileName = "route.conf";
+  char* fileName = (char*)"route.conf";
   int op;
 
   if (getuid()) {
diff --git a/src/FakeroutePacket.h b/src/FakeroutePacket.h
index cb27b47..7f2bf6a 100644
--- a/src/FakeroutePacket.h
+++ b/src/FakeroutePacket.h
@@ -55,6 +55,7 @@ class FakeroutePacket {
  public:
   FakeroutePacket(u_int16_t receivedSourcePort, u_int16_t receivedDestinationPort,
 		  char* spoofedSourceAddress, char* spoofedDestinationAddress);
+  virtual ~FakeroutePacket();
   virtual void sendOn(int fd);
 };
 
diff --git a/src/TracerouteListener.cpp b/src/TracerouteListener.cpp
index f473ccd..a84e313 100644
--- a/src/TracerouteListener.cpp
+++ b/src/TracerouteListener.cpp
@@ -52,7 +52,7 @@ void TracerouteListener::listen(class TracerouteEvents &tracerouteEvents) {
 
   for (i=0;i<FD_COUNT;i++) {
     if ((fds[i].revents & POLLIN == POLLIN) ||
-	(fds[i].revents & POLLPRI == POLLPRI)) {
+        (fds[i].revents & POLLPRI == POLLPRI)) {
       activeFds[index++] = fds[i].fd;
     }
   }
diff --git a/src/in_cksum.cpp b/src/in_cksum.cpp
index 86cdfe3..71074d8 100644
--- a/src/in_cksum.cpp
+++ b/src/in_cksum.cpp
@@ -44,10 +44,10 @@
  */
 unsigned short in_cksum(unsigned short *addr,int len)
 {
-        register int sum = 0;
+        int sum = 0;
         u_short answer = 0;
-        register u_short *w = addr;
-        register int nleft = len;
+        u_short *w = addr;
+        int nleft = len;
 
         /*
          * Our algorithm is simple, using a 32 bit accumulator (sum), we add