com.sittinglittleduck.DirBuster.ProcessChecker Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of dirbuster Show documentation
Show all versions of dirbuster Show documentation
DirBuster is a multi threaded java application designed to brute force directories and
files names on web/application servers. Often is the case now of what looks
like a web server in a state of default installation is actually not, and has pages and applications
hidden within. DirBuster attempts to find these.
The newest version!
/*
* ProcessChecker.java
*
* Copyright 2007 James Fisher
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
package com.sittinglittleduck.DirBuster;
import java.util.TimerTask;
import java.util.Vector;
public class ProcessChecker extends TimerTask
{
Manager manager;
private long timeStarted;
private long lastTotal = 0L;
private Vector lastTen = new Vector(10, 1);
/**
* Creates a new instance of ProcessChecker
*/
public interface ProcessUpdate
{
public void isAlive();
}
public ProcessChecker()
{
this.manager = Manager.getInstance();
timeStarted = System.currentTimeMillis();
}
public void run()
{
if(System.currentTimeMillis() - scheduledExecutionTime() > 5000)
{
return;
}
long timePassed = (scheduledExecutionTime() - timeStarted) / 1000;
if(timePassed > 0)
{
int totalDirs = 1;
if(manager.isRecursive() && manager.getDoDirs())
{
totalDirs = 1 + manager.getTotalDirsFound();
}
int doingFiles = 1;
//only if we are doing both files and dirs do we need to times by 2
if(manager.getDoFiles() && manager.getDoDirs())
{
doingFiles = 1 + manager.getExtToUse().size();
}
else if((manager.getDoFiles() && !manager.getDoDirs()))
{
doingFiles = manager.getExtToUse().size();
}
long totalToDo = ((long) manager.getTotalPass()) * totalDirs * doingFiles;
//add the number of base cases and the frist inital request
totalToDo = totalToDo + manager.getNumberOfBaseCasesProduced();
//correct to deal with the intial dir we need to test
if(manager.getDoDirs())
{
totalToDo = totalToDo + 1;
}
//add the process parsed links
totalToDo = totalToDo + manager.getParsedLinksProcessed();
//correct the total to do but removing items we have skipped
totalToDo = totalToDo - manager.getWorkAmountCorrection();
//correct the total removing base cases that where not processed
//totalToDo = totalToDo - manager.getBaseCaseCounterCorrection();
//System.out.println("totalToDo = " + totalToDo + " = " + manager.getTotalPass() + " * " + totalDirs + " * " + doingFiles + " + " + numberOfBaseCases);
long currentTotal = manager.getTotalDone();
long average = currentTotal / timePassed;
long current = currentTotal - lastTotal;
//store the last ten current speeds
//used to calculate averages better
if(lastTen.size() < 10)
{
lastTen.addElement(current);
}
else if(lastTen.size() == 10)
{
//remove the first item from the vector
lastTen.removeElementAt(0);
lastTen.addElement(current);
}
else
{
//should never get here
}
long lastTenTotal = 0;
for(int a = 0; a < lastTen.size(); a++)
{
long temp = (Long) lastTen.elementAt(a);
lastTenTotal = lastTenTotal + temp;
}
long averageLastTen = lastTenTotal / lastTen.size();
String parseQueueLength = "N/A";
if(Config.parseHTML)
{
parseQueueLength = String.valueOf(manager.parseQueue.size());
}
if(average == 0 || lastTenTotal == 0 || averageLastTen == 0)
{
manager.updateProgress(
"Current speed: " + current + " requests/sec",
"Average speed: (T) " + average + ", (C) " + averageLastTen + " requests/sec",
"Total Requests: " + currentTotal + "/" + totalToDo, "Time To Finish: ~",
parseQueueLength);
}
else
{
long timeLeft = (totalToDo - currentTotal) / averageLastTen;
String timeToCompelete = convertSecsToTime(timeLeft);
lastTotal = currentTotal;
manager.updateProgress(
"Current speed: " + current + " requests/sec",
"Average speed: (T) " + average + ", (C) " + averageLastTen + " requests/sec",
"Total Requests: " + currentTotal + "/" + totalToDo, "Time To Finish: " + timeToCompelete,
parseQueueLength);
}
if(Config.debug)
{
//System.out.println("workQ: " + manager.workQueue.size());
System.out.println("dirQ: " + manager.dirQueue.size());
//System.out.println("parseQ: " + manager.parseQueue.size());
//manager.
}
//set the second status bar to show what work we are doing
if(!manager.isHeadLessMode())
{
if(manager.workQueue.peek() != null)
{
manager.gui.jLabelCurrentWork.setText(manager.workQueue.peek().getWork().getPath());
}
else
{
manager.gui.jLabelCurrentWork.setText("");
}
}
}
}
private String convertSecsToTime(long secs)
{
//get the number of minuates
if(secs < 10)
{
return "00:00:0" + secs;
}
if(secs < 60)
{
return "00:00:" + secs;
}
long mins = secs / 60;
long secsleft = secs - (mins * 60);
String addZeroSecs = "";
if(secsleft < 10)
{
addZeroSecs = "0";
}
String addZeroMins = "";
if(mins < 10)
{
addZeroMins = "0";
}
if(mins < 60)
{
return "00:" + addZeroMins + mins + ":" + addZeroSecs + secsleft;
}
long hours = mins / 60;
long minsleft = mins - (hours * 60);
if(minsleft < 10)
{
addZeroMins = "0";
}
if(hours > 24)
{
long days = hours / 24;
if(days == 1)
{
return days + " Day";
}
else
{
return days + " Days";
}
}
if(hours < 10)
{
return "0" + hours + ":" + addZeroMins + minsleft + ":" + addZeroSecs + secsleft;
}
else
{
return hours + ":" + addZeroMins + minsleft + ":" + addZeroSecs + secsleft;
}
}
}