treematch.c File Reference

#include "genC.h"
#include "linear.h"
#include "ri.h"
#include "effects.h"
#include "resources.h"
#include "properties.h"
#include "misc.h"
#include "ri-util.h"
#include "effects-util.h"
#include "pipsdbm.h"
#include "sac.h"
#include "patterns.h"
#include <errno.h>

Include dependency graph for treematch.c:

Go to the source code of this file.

Functions
void	set_simd_treematch (matchTree t)
	treematch.c More...
void	reset_simd_treematch ()
void	simd_reset_finalArgType ()
static list	simd_fill_curArgType_call (call ca)
void	simd_fill_finalArgType (statement stat)
void	simd_fill_curArgType (statement stat)
bool	simd_check_argType ()
static matchTree	make_tree ()
static void	insert_tree_branch (matchTree t, int token, matchTree n)
static matchTree	select_tree_branch (matchTree t, int token)
static matchTree	match_call (call c, matchTree t, list *args)
	Warning: list of arguments is built in reversed order (the head is in fact the last argument) More...
static matchTree	match_expression (expression arg, matchTree t, list *args)
static list	merge_lists (list l, list format)
	merge the 2 lists. More...
list	match_statement (statement s)
	return a list of matching statements More...
void	insert_opcodeClass (char *s, int nbArgs, list opcodes)
static opcodeClass	get_opcodeClass (char *s)
void	insert_pattern (char *s, list tokens, list args)
bool	simd_treematcher (const string module_name)

Variables
static matchTree	patterns_tree = NULL
static list	finalArgType = NIL
static list	curArgType = NIL

Function Documentation

get_opcodeClass()

static opcodeClass get_opcodeClass ( char *  s )

static

Definition at line 273 of file treematch.c.

{
    return gen_find_opcodeClass(s);
}

References gen_find_opcodeClass().

Referenced by insert_pattern().

Here is the call graph for this function:

Here is the caller graph for this function:

insert_opcodeClass()

void insert_opcodeClass	(	char *	s,
		int	nbArgs,
		list	opcodes
	)

Parameters

nbArgs	bArgs
opcodes	pcodes

Definition at line 267 of file treematch.c.

{
    //Add the class and name in the map
    make_opcodeClass(s, nbArgs, opcodes);
}

References make_opcodeClass().

Here is the call graph for this function:

insert_pattern()

void insert_pattern	(	char *	s,
		list	tokens,
		list	args
	)

no such branch -> create a new branch

Parameters

tokens	okens
args	rgs

Definition at line 278 of file treematch.c.

{
    opcodeClass c = get_opcodeClass(s);
    patternx p;
    matchTree m = patterns_tree;
 
    if (c == opcodeClass_undefined)
    {
        pips_user_warning("defining pattern for an undefined opcodeClass (%s).",s);
        return;
    }
 
    p = make_patternx(c, args);
 
    for( ; tokens != NIL; tokens = CDR(tokens) )
    {
        int token = INT(CAR(tokens));
        matchTree next = select_tree_branch(m, token);
 
        if (next == matchTree_undefined)
        {
            /* no such branch -> create a new branch */
            next = make_tree();
            insert_tree_branch(m, token, next);
        }
 
        m = next;
    }
 
    matchTree_patterns(m) = CONS(PATTERNX, p, matchTree_patterns(m));
}

References CAR, CDR, CONS, get_opcodeClass(), insert_tree_branch(), INT, make_patternx(), make_tree(), matchTree_patterns, matchTree_undefined, NIL, opcodeClass_undefined, patterns_tree, PATTERNX, pips_user_warning, and select_tree_branch().

Here is the call graph for this function:

insert_tree_branch()

static void insert_tree_branch ( matchTree  t, int  token, matchTree  n  )

static

Definition at line 115 of file treematch.c.

{
    extend_matchTreeSons(matchTree_sons(t), token, n);
}

References extend_matchTreeSons(), and matchTree_sons.

Referenced by insert_pattern().

Here is the call graph for this function:

Here is the caller graph for this function:

make_tree()

static matchTree make_tree ( )

static

Definition at line 108 of file treematch.c.

{
    matchTreeSons sons = make_matchTreeSons();
    matchTree n = make_matchTree(NIL, sons);
    return n;
}

References make_matchTree(), make_matchTreeSons(), and NIL.

Referenced by insert_pattern(), and simd_treematcher().

Here is the call graph for this function:

Here is the caller graph for this function:

match_call()

static matchTree match_call ( call  c, matchTree  t, list *  args  )

static

Warning: list of arguments is built in reversed order (the head is in fact the last argument)

no match

no match

Definition at line 183 of file treematch.c.

{
    if (!top_level_entity_p(call_function(c)) || call_constant_p(c))
        return matchTree_undefined; /* no match */
 
    t = select_tree_branch(t, get_operator_id(call_function(c)));
    if (matchTree_undefined_p(t))
        return matchTree_undefined; /* no match */
 
    FOREACH(EXPRESSION, arg, call_arguments(c))
    {
        t=match_expression(arg,t,args);
        if (matchTree_undefined_p(t) )
            return matchTree_undefined;
    }
        
 
    return t;
}

References call_arguments, call_constant_p, call_function, EXPRESSION, FOREACH, get_operator_id(), match_expression(), matchTree_undefined, matchTree_undefined_p, select_tree_branch(), and top_level_entity_p().

Referenced by match_expression(), and match_statement().

Here is the call graph for this function:

Here is the caller graph for this function:

match_expression()

static matchTree match_expression ( expression  arg, matchTree  t, list *  args  )

static

field call should be taken care of as references

right now we have matched the rhs of the field, now bring back the lhs !

unexpected token !! -> no match

Definition at line 129 of file treematch.c.

{
    syntax s = expression_syntax(arg);
    switch(syntax_tag(s))
    {
        case is_syntax_call:
            {
                call c = syntax_call(s);
                if (call_constant_p(c))
                {
                    t = select_tree_branch(t, CONSTANT_TOK);
                    *args = CONS(EXPRESSION, arg, *args);
                }
                /* field call should be taken care of as references */
                else if ( ENTITY_FIELD_P(call_function(c)) )
                {
                    t=match_expression(binary_call_rhs(c),t,args);
                    /* right now we have matched the rhs of the field,
                     * now bring back the lhs !
                     */
                    if( !matchTree_undefined_p(t))
                        *REFCAR(*args) = (gen_chunkp)arg;
                }
                else
                    t = match_call(c, t, args);
                break;
            }
 
        case is_syntax_reference:
            {
                basic bas = basic_of_reference(syntax_reference(s));
                if(bas == basic_undefined || basic_type_size(bas)*8 >= get_int_property("SAC_SIMD_REGISTER_WIDTH"))
                {
                    free_basic(bas);
                    return matchTree_undefined;
                }
                else
                {
                    t = select_tree_branch(t, REFERENCE_TOK);
                    *args = CONS(EXPRESSION, arg, *args);
                    free_basic(bas);
                }
                break;
            }
 
        case is_syntax_range:
        default:
            return matchTree_undefined; /* unexpected token !! -> no match */
    }
    return t;
}

References basic_of_reference(), basic_type_size(), basic_undefined, binary_call_rhs, call_constant_p, call_function, CONS, CONSTANT_TOK, ENTITY_FIELD_P, EXPRESSION, expression_syntax, free_basic(), get_int_property(), is_syntax_call, is_syntax_range, is_syntax_reference, match_call(), matchTree_undefined, matchTree_undefined_p, REFCAR, REFERENCE_TOK, select_tree_branch(), syntax_call, syntax_reference, and syntax_tag.

Referenced by match_call().

Here is the call graph for this function:

Here is the caller graph for this function:

match_statement()

list match_statement

(

statement

s

)

return a list of matching statements

find the matching patterns

build the matches

Definition at line 237 of file treematch.c.

{
    list matches = NIL;
 
    if (statement_call_p(s))
    {
 
        /* find the matching patterns */
        list args = NIL;
        matchTree t = match_call(statement_call(s), patterns_tree, &args);
        if (matchTree_undefined_p(t))
        {
            gen_free_list(args);
            return NIL;
        }
 
        /* build the matches */
        FOREACH(PATTERNX, p ,matchTree_patterns(t))
        {
            match m = make_match(
                    patternx_class(p),
                    merge_lists(args, patternx_args(p))
                    );
            matches = CONS(MATCH, m, matches);
        }
    }
 
    return matches;
}

References CONS, FOREACH, gen_free_list(), make_match(), MATCH, match_call(), matches, matchTree_patterns, matchTree_undefined_p, merge_lists(), NIL, patterns_tree, PATTERNX, patternx_args, patternx_class, statement_call(), and statement_call_p().

Referenced by compute_parallelism_factor(), and init_statement_matches_map().

Here is the call graph for this function:

Here is the caller graph for this function:

merge_lists()

static list merge_lists ( list  l, list  format  )

static

merge the 2 lists.

Warning: list gets reversed.

merge according to the format specifier list

append remaining arguments, if any

Definition at line 204 of file treematch.c.

{
    list res = NIL;
 
    /* merge according to the format specifier list */
    FOREACH(PATTERNARG,param,format)
    {
        if (patternArg_dynamic_p(param))
        {
            if (l != NIL)
            {
                res = CONS(EXPRESSION, EXPRESSION(CAR(l)), res);
                l = CDR(l);
            }
            else
                pips_user_warning("Trying to use a malformed rule. Ignoring missing parameter...\n");
        }
        else
        {
            expression e = int_to_expression(patternArg_static(param));
 
            res = CONS(EXPRESSION, e, res);
        }
    }
 
    /* append remaining arguments, if any */
    for( ; l != NIL; l = CDR(l) )
        res = CONS(EXPRESSION, EXPRESSION(CAR(l)), res);
 
    return res;
}

References CAR, CDR, CONS, EXPRESSION, FOREACH, int_to_expression(), NIL, PATTERNARG, patternArg_dynamic_p, patternArg_static, and pips_user_warning.

Referenced by match_statement().

Here is the call graph for this function:

Here is the caller graph for this function:

reset_simd_treematch()

void reset_simd_treematch

(

void

)

Definition at line 52 of file treematch.c.

{
    pips_assert("tree match already set",patterns_tree!=NULL);
    patterns_tree=NULL;
}

References patterns_tree, and pips_assert.

Referenced by simd_treematcher(), simd_unroll_as_needed(), and simdizer().

Here is the caller graph for this function:

select_tree_branch()

static matchTree select_tree_branch ( matchTree  t, int  token  )

static

Definition at line 120 of file treematch.c.

{
    if (bound_matchTreeSons_p(matchTree_sons(t), token))
        return apply_matchTreeSons(matchTree_sons(t), token);
    else
        return matchTree_undefined;
}

References apply_matchTreeSons(), bound_matchTreeSons_p(), matchTree_sons, and matchTree_undefined.

Referenced by insert_pattern(), match_call(), and match_expression().

Here is the call graph for this function:

Here is the caller graph for this function:

set_simd_treematch()

void set_simd_treematch

(

matchTree

t

)

treematch.c

Definition at line 46 of file treematch.c.

{
    pips_assert("tree match not already set",patterns_tree==NULL);
    patterns_tree=t;
}

References patterns_tree, and pips_assert.

Referenced by simd_treematcher(), simd_unroll_as_needed(), and simdizer().

Here is the caller graph for this function:

simd_check_argType()

bool simd_check_argType

(

void

)

Definition at line 87 of file treematch.c.

{
    list pCurBas = curArgType;
 
    FOREACH(BASIC, finBas, finalArgType)
        {
                if(ENDP(pCurBas) )
                        return false;
                basic curBas = BASIC(CAR(pCurBas));
                if(!basic_equal_p(curBas, finBas))
                        return false;
                pCurBas = CDR(pCurBas);
        }
 
    gen_full_free_list(curArgType);
    curArgType = NIL;
 
    return true;
}

References BASIC, basic_equal_p(), CAR, CDR, curArgType, ENDP, finalArgType, FOREACH, gen_full_free_list(), and NIL.

Referenced by extract_matching_statements().

Here is the call graph for this function:

Here is the caller graph for this function:

simd_fill_curArgType()

void simd_fill_curArgType

(

statement

stat

)

Parameters

stat

tat

Definition at line 82 of file treematch.c.

{
    curArgType=simd_fill_curArgType_call(statement_call(stat));
}

References curArgType, simd_fill_curArgType_call(), and statement_call().

Referenced by extract_matching_statements().

Here is the call graph for this function:

Here is the caller graph for this function:

simd_fill_curArgType_call()

static list simd_fill_curArgType_call ( call  ca )

static

Definition at line 69 of file treematch.c.

{
    list c=NIL;
    FOREACH(EXPRESSION, arg, call_arguments(ca))
        c= CONS(BASIC,basic_of_expression(arg),c);
    return c;
}

References BASIC, basic_of_expression(), call_arguments, CONS, EXPRESSION, FOREACH, and NIL.

Referenced by simd_fill_curArgType(), and simd_fill_finalArgType().

Here is the call graph for this function:

Here is the caller graph for this function:

simd_fill_finalArgType()

void simd_fill_finalArgType

(

statement

stat

)

Parameters

stat

tat

Definition at line 77 of file treematch.c.

{
    finalArgType=simd_fill_curArgType_call(statement_call(stat));
}

References finalArgType, simd_fill_curArgType_call(), and statement_call().

Referenced by simdize_simple_statements_pass2().

Here is the call graph for this function:

Here is the caller graph for this function:

simd_reset_finalArgType()

void simd_reset_finalArgType

(

void

)

Definition at line 61 of file treematch.c.

{
    gen_free_list(finalArgType);
    finalArgType = NIL;
 
    gen_free_list(curArgType);
    curArgType = NIL;
}

References curArgType, finalArgType, gen_free_list(), and NIL.

Referenced by simdize_simple_statements_pass2().

Here is the call graph for this function:

Here is the caller graph for this function:

simd_treematcher()

bool simd_treematcher

(

const string

module_name

)

create a new tree match

fill it

put it in pipsdbm

clean up

Parameters

module_name

odule_name

Definition at line 310 of file treematch.c.

{
  pips_assert("true", module_name==module_name);
    /* create a new tree match */
    matchTree treematch = make_tree();
    set_simd_treematch(treematch);
 
    /* fill it */
    sac_lineno=0;
    patterns_yyin=fopen_config("patterns.def","SIMD_PATTERN_FILE",NULL);
    patterns_yyparse();
    fclose(patterns_yyin);
 
    /* put it in pipsdbm */
    DB_PUT_MEMORY_RESOURCE(DBR_SIMD_TREEMATCH,"",treematch);
 
    /* clean up */
    reset_simd_treematch();
    return true;
}

References DB_PUT_MEMORY_RESOURCE, fopen_config(), make_tree(), module_name(), patterns_yyin, patterns_yyparse(), pips_assert, reset_simd_treematch(), sac_lineno, and set_simd_treematch().

Here is the call graph for this function:

Variable Documentation

curArgType

list curArgType = NIL

static

Definition at line 59 of file treematch.c.

Referenced by simd_check_argType(), simd_fill_curArgType(), and simd_reset_finalArgType().

finalArgType

list finalArgType = NIL

static

Definition at line 58 of file treematch.c.

Referenced by simd_check_argType(), simd_fill_finalArgType(), and simd_reset_finalArgType().

patterns_tree

matchTree patterns_tree = NULL

static

Definition at line 45 of file treematch.c.

Referenced by insert_pattern(), match_statement(), reset_simd_treematch(), and set_simd_treematch().