Obfuscator.cpp File Reference

#include "AstNode.h"
#include "tree.h"
#include "AstContainer.h"
#include "Obfuscator.h"
#include "Utils.h"
#include <cstdlib>
#include <string>
#include <map>
#include <iostream>

Include dependency graph for Obfuscator.cpp:

Go to the source code of this file.

Defines
#define	srand48   srand
#define	lrand48   rand
Functions
string	generateName ()
void	applyModification (Ast &ast)
void	insert_branch (tree< AstNode >::iterator where, tree< AstNode >::iterator from, tree< AstNode > &tr_where, const tree< AstNode > &tr_from)
void	copy_branch (tree< AstNode >::iterator where, tree< AstNode >::iterator from, tree< AstNode > &tr_where)
void	move_branch (const tree< AstNode >::iterator &where, const tree< AstNode >::iterator &from, tree< AstNode > &tr_where)
tree< AstNode >::iterator	rewind (const tree< AstNode >::iterator &from, const string &untilStr, const tree< AstNode > &tr)
tree< AstNode >::iterator	forward (const tree< AstNode >::iterator &from, const string &untilStr, const tree< AstNode > &tr)
void	clean_pattern (tree< AstNode > &tr)
bool	insert_statement (const tree< AstNode >::iterator &where, const tree< AstNode >::iterator &what, tree< AstNode > &tr)
Variables
const unsigned	length = 16

---

Define Documentation

#define lrand48   rand

Referenced by generateName().

#define srand48   srand

Referenced by generateName().

---

Function Documentation

void applyModification

(

Ast &

ast

)

Apply some modification to the current tree. This is used to load the external definition and change some names

Definition at line 55 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), generateName(), Ast::getTreePtr(), utils::replace(), and utils::start_with().

Referenced by ControlFlow::operator()().

                                 {
    tree<AstNode> *tr = ast.getTreePtr();
    map<string, string> randNames;
    string randName = "";
    string randFunc = "";
    for (tree<AstNode>::iterator iter=tr->begin(); iter!=tr->end(); ++iter) {
        string valueType = iter->getValue();
        if (utils::start_with(valueType,"$rand_name")
        ||  utils::start_with(valueType,"rand_func_name")
        ||  utils::start_with(valueType,"rand_class_name")) {
            string genValue = generateName();
            if (valueType[0] == '$')
                genValue = "$" + genValue;
            if (randNames.find(valueType) == randNames.end())
                randNames.insert(make_pair(valueType, genValue));
            iter->setValue(randNames[valueType]);
        }
        else if (utils::start_with(valueType,"$param_")) {
            string name = valueType;
            utils::replace(name, "param_","");
            iter->setValue(name);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void clean_pattern

(

tree< AstNode > &

tr

)

Clean the possible patterns annotations: $enter_new_statement ...

Definition at line 155 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), tree< T, tree_node_allocator >::erase(), and rewind().

Referenced by ControlFlow::operator()().

{
    for (tree<AstNode>::iterator iter=tr.begin(); iter!=tr.end(); ++iter) {
        if (iter->getType() == "text" && iter->getValue() == "$enter_the_new_statement") {
            iter = rewind(iter, "statement", tr);
            tr.erase(iter);
            break;
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

void copy_branch	(	tree< AstNode >::iterator	where,
		tree< AstNode >::iterator	from,
		tree< AstNode > &	tr_where
	)

Copy for duplicating a branch

Definition at line 103 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), and tree< T, tree_node_allocator >::number_of_children().

Referenced by move_branch().

{
    if (tr_where.number_of_children(from) == 0) {
        // simply add the node to it
        tr_where.append_child(where, *from);
    }
    else {
        where = tr_where.append_child(where, *from);
        tree<AstNode>::sibling_iterator cter;
        for (cter = tr_where.begin(from); cter != tr_where.end(from); ++cter)
        {
            copy_branch(where, cter, tr_where);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

tree<AstNode>::iterator forward	(	const tree< AstNode >::iterator &	from,
		const string &	untilStr,
		const tree< AstNode > &	tr
	)

Forward in a tree until the value

Definition at line 142 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::child().

                                                                                                                  {
    tree<AstNode>::iterator ret = from;
    while(ret->getType() != untilStr) { 
        ret = tr.child(ret, 0);
    }
    return ret;
}

Here is the call graph for this function:

string generateName

(

)

Generate a randome name

Definition at line 34 of file Obfuscator.cpp.

References length, lrand48, and srand48.

Referenced by applyModification(), RenameVariable::operator()(), RenameFunction::operator()(), and RenameClass::operator()().

                      {
    static const string ref = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
    static const unsigned refL = ref.length();
    string ret;
#ifndef srand48
    #define srand48 srand
    #define lrand48 rand
#endif
    srand48(time(NULL) + lrand48() % 65527);
    ret += ref[((lrand48() % (refL-36))) + 36];
    for (unsigned i=1; i < length; i++) {
        ret += ref[((lrand48() % refL))];
    }
    return ret;
}

Here is the caller graph for this function:

void insert_branch	(	tree< AstNode >::iterator	where,
		tree< AstNode >::iterator	from,
		tree< AstNode > &	tr_where,
		const tree< AstNode > &	tr_from
	)

Insert all sub-jt into the sub-it

Definition at line 83 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::begin(), tree< T, tree_node_allocator >::end(), and tree< T, tree_node_allocator >::number_of_children().

Referenced by ControlFlow::operator()().

{
    if (tr_from.number_of_children(from) == 0) {
        // simply add the node to it
        tr_where.append_child(where, *from);
    }
    else {
        where = tr_where.append_child(where, *from);
        tree<AstNode>::sibling_iterator cter;
        for (cter = tr_from.begin(from); cter != tr_from.end(from); ++cter) 
        {
            insert_branch(where, cter, tr_where, tr_from);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool insert_statement	(	const tree< AstNode >::iterator &	where,
		const tree< AstNode >::iterator &	what,
		tree< AstNode > &	tr
	)

Insert a new statement.

• Create a new inner_statement_list
• Add the statement under it

Definition at line 172 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::append_child(), tree< T, tree_node_allocator >::child(), move_branch(), and tree< T, tree_node_allocator >::parent().

Referenced by ControlFlow::operator()().

{
    if (where->getType() == "text" && where->getValue() == "$enter_the_new_statement") {
        // rewind to the inner_statement_list
        tree<AstNode>::iterator top = where;
        do {
            top = tr.parent(top);
        } while (top->getType() != "inner_statement" && tr.child(top,0)->getType() != "statement");
        top = tr.parent(top);
        if (top->getType() != "inner_statement_list")
            return false;
        else {
            top = tr.append_child(top, AstNode("inner_statement_list"));
            top = tr.append_child(top, AstNode("inner_statement"));
            if (what->getType() == "statement") {
                top = tr.append_child(top, AstNode("statement"));
                //cout << "Seems to be okay..." << endl;
                move_branch(top, what, tr);
            }
        }
        return true;
    }
    return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void move_branch	(	const tree< AstNode >::iterator &	where,
		const tree< AstNode >::iterator &	from,
		tree< AstNode > &	tr_where
	)

Move all the branches from 'from' to 'where' on the tree 'tr_where'

Definition at line 122 of file Obfuscator.cpp.

References copy_branch(), and tree< T, tree_node_allocator >::erase().

Referenced by insert_statement().

{
    copy_branch(where, from, tr_where);
    tr_where.erase(from);
}

Here is the call graph for this function:

Here is the caller graph for this function:

tree<AstNode>::iterator rewind	(	const tree< AstNode >::iterator &	from,
		const string &	untilStr,
		const tree< AstNode > &	tr
	)

Rewind in a tree until the value

Definition at line 131 of file Obfuscator.cpp.

References tree< T, tree_node_allocator >::parent().

Referenced by clean_pattern().

                                                                                                                 {
    tree<AstNode>::iterator ret = from;
    while(ret->getType() != untilStr) { 
        ret = tr.parent(ret);
    }
    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

---

Variable Documentation

const unsigned length = 16

Definition at line 29 of file Obfuscator.cpp.

Referenced by generateName().

---