C / C++ / MFC

Hi Guys! I'm a newbie here. I wanna match the PID in Windows Task Manager with the checksum/hash value generated by dynamic base ASLR in Visual Studio 2010? I have already enabled the ASLR in Visual Studio 2010 but no data is received. Any idea how?

<b>Clues:</b>
1. Windows functions CreateToolhelp32Snapshot
2. MODULEENTRY32
3. Windows function OpenProcess

Appreciate it very much guys.

Giggsey

#include <iostream>
#include <stdlib.h>
#include<ctime>
using namespace std;

void makebg(char**&);

bool Is(int ,int );

void cmaze(int,int);


void count(int,int);

int M=0;
int N=0;
int in=0;
int out=0;
char  **maze; 
int c=0;
int *cti;
int *ctj;
int dir =1;

int main()
{

    cin>>M>>N;
    maze =new char*[M];
    for(int i=0;i<M;i++)
        maze[i]=new char[N];
    cti =new int[M*N];
    ctj =new int[M*N];
    for(int i=0;i<M*N;i++) 
    {
        cti[i]=0;
        ctj[i]=0;
    }

    makebg(maze);

    return 0;
}

void makebg(char **&maze)
{ 
    int   i,j; 


    for(i=0;i <M;i++) 
        for(j=0;j <N;j++) 
            maze[i][j]='#';

    srand((unsigned)time(0));

    in=rand()%(M-2)+1;       // Create entrance or exit 
    maze[in][0]='.';

    out=rand()%(M-2)+1;

         cti[0]=in;
         ctj[0]=1;
    cmaze(in,1);

} 

void cmaze(int i,int j){

    int ran=rand()%4; 


    if((i==out&&j==N-2))      //if then out the recursion
    {
        maze[i][j]='.';
        maze[i][j+1]='.';
    }


    if(maze[out][N-1]=='.')
        return;

    else{

        maze[i][j]='.';

        for (int s=0;s<M;s++)
        {
            for (int t=0;t<N;t++)
                cout<<maze[s][t]<<' ';
            cout<<'\n';
        }
        //system("cls");


        switch(ran)
        {
        case 0:{ //down
                
            if(Is(i+2,j)&&Is(i+1,j-1)&&Is(i+2,j+1)){ //To ensure that the next three sides wall and not backtrack
                i++;
                count(i,j);
                dir=2;
            } 

            else if(i+1==M-1) {               //step return
                c--;
                i=cti[c];
                j=ctj[c];
                cti[c+1]=0;     

                ctj[c+1]=0;

            }
            break;
               }   
        case 1:{ //left
            if(Is(i,j-2)&&Is(i+1,j-1)&&Is(i-1,j-1)){ 
                j--;
                count(i,j);
                dir=3;

            } 

            else if(j-1==0){          
                c--;
                i=cti[c];
                j=ctj[c];
                cti[c+1]=0;

                ctj[c+1]=0;

            }
            break;
               } 
        case 2:{ //up
            if(Is(i-2,j)&&Is(i-1,j-1)&&Is(i-1,j+1)){ 
                i--;
                count(i,j);
                dir=0;

            } 

            else if(i-1==0){             
                c--;
                i=cti[c];
                j=ctj[c];
                cti[c+1]=0;

                ctj[c+1]=0;
            

            }
            break;
               } 
        case 3:{ //right
            if(Is(i,j+2)&&Is(i-1,j+1)&&Is(i+1,j+1)){ 
                j++; 
                count(i,j);
                dir=1;
            }

            else if(j+1==N-1){              
                c--;
                i=cti[c];
                j=ctj[c];
                cti[c+1]=0;

                ctj[c+1]=0;
    
            }
            break;
               } 

        }
        dir=ran;
        cmaze(i,j);

    }

}
void count(int i,int j)
{
    c++;        //       
    cti[c]=i;   //
    ctj[c]=j;   //Record the location

}


bool Is(int i,int j)        
{
    if(i>=0&&i<=M-1&&j>=0&&j<=N-1&&maze[i][j]=='#')
        return true;
    else
        return false;
}