static void parse_cmdline(char *token)
{
int name_len;
char fn_end;
#if SFX_LEVEL>=ARJSFXV
if(is_switch(token))
analyze_arg(token);
#else
if(!skip_switch_processing&&switch_char==0&&strchr(switch_chars, token[0])!=NULL)
{
switch_char=(int)token[0];
analyze_arg(token);
}
else if(!skip_switch_processing&&switch_char!=0&&(int)token[0]==switch_char)
analyze_arg(token);
#endif
else
{
name_len=strlen(token);
fn_end=token[name_len-1];
if(file_args==0&&target_dir[0]=='\0'&&strchr(path_separators, fn_end)!=NULL)
target_dir=token;
else
{
if(file_args>=params_max)
error(M_ARGTABLE_OVERFLOW);
f_arg_array[file_args++]=token;
}
}
}
/*
analyzing all arguments of the function call
*/
void analyze_args(Exprs args, char* procName, char* callee, int paramNum)
{
Expr first = args->first;
Exprs rest = args->rest;
if(first && getParamType(callee, paramNum)!=-1)
{
analyze_expr(first, procName);
analyze_arg(first, callee, paramNum, procName);
}
else if(first && getParamType(callee, paramNum)==-1)
{
printf("function call %s has more number of parameter.\n",
callee);
errorNum++;
return;
}
if(rest == 0 && getParamType(callee, paramNum+1)!=-1)
{
printf("function call %s has less number of parameter.\n",
callee);
errorNum++;
}
if(rest)
analyze_args(rest, procName, callee, paramNum+1);
}
/**
* Check if a argument of the ir graph with mode
* reference is read, write or both.
*
* @param irg The ir graph to analyze.
*/
static void analyze_ent_args(ir_entity *ent)
{
ir_type *mtp = get_entity_type(ent);
size_t nparams = get_method_n_params(mtp);
ent->attr.mtd_attr.param_access = NEW_ARR_F(ptr_access_kind, nparams);
/* If the method haven't parameters we have
* nothing to do.
*/
if (nparams <= 0)
return;
/* we have not yet analyzed the graph, set ALL access for pointer args */
for (size_t i = nparams; i-- > 0; ) {
ir_type *type = get_method_param_type(mtp, i);
ent->attr.mtd_attr.param_access[i] = is_Pointer_type(type) ? ptr_access_all : ptr_access_none;
}
ir_graph *irg = get_entity_irg(ent);
if (irg == NULL) {
/* no graph, no better info */
return;
}
assure_irg_outs(irg);
ir_node *irg_args = get_irg_args(irg);
/* A array to save the information for each argument with
mode reference.*/
ptr_access_kind *rw_info;
NEW_ARR_A(ptr_access_kind, rw_info, nparams);
/* We initialize the element with none state. */
for (size_t i = nparams; i-- > 0; )
rw_info[i] = ptr_access_none;
/* search for arguments with mode reference
to analyze them.*/
for (int i = get_irn_n_outs(irg_args); i-- > 0; ) {
ir_node *arg = get_irn_out(irg_args, i);
ir_mode *arg_mode = get_irn_mode(arg);
long proj_nr = get_Proj_proj(arg);
if (mode_is_reference(arg_mode))
rw_info[proj_nr] |= analyze_arg(arg, rw_info[proj_nr]);
}
/* copy the temporary info */
memcpy(ent->attr.mtd_attr.param_access, rw_info,
nparams * sizeof(ent->attr.mtd_attr.param_access[0]));
}
/**
* Walk recursive the successors of a graph argument
* with mode reference and mark if it will be read,
* written or stored.
*
* @param arg The graph argument with mode reference,
* that must be checked.
*/
static ptr_access_kind analyze_arg(ir_node *arg, ptr_access_kind bits)
{
/* We must visit a node once to avoid endless recursion.*/
mark_irn_visited(arg);
for (int i = get_irn_n_outs(arg); i-- > 0; ) {
ir_node *succ = get_irn_out(arg, i);
if (irn_visited(succ))
continue;
/* We should not walk over the memory edge.*/
if (get_irn_mode(succ) == mode_M)
continue;
/* If we reach with the recursion a Call node and our reference
isn't the address of this Call we accept that the reference will
be read and written if the graph of the method represented by
"Call" isn't computed else we analyze that graph. If our
reference is the address of this
Call node that mean the reference will be read.*/
switch (get_irn_opcode(succ)) {
case iro_Call: {
ir_node *ptr = get_Call_ptr(succ);
if (ptr == arg) {
/* Hmm: not sure what this is, most likely a read */
bits |= ptr_access_read;
} else {
ir_entity *meth_ent;
if (is_SymConst_addr_ent(ptr)) {
meth_ent = get_SymConst_entity(ptr);
for (int p = get_Call_n_params(succ); p-- > 0; ) {
if (get_Call_param(succ, p) == arg) {
/* an arg can be used more than once ! */
bits |= get_method_param_access(meth_ent, p);
}
}
} else if (is_Sel(ptr) && get_irp_callee_info_state() == irg_callee_info_consistent) {
/* is be a polymorphic call but callee information is available */
size_t n_params = get_Call_n_params(succ);
/* simply look into ALL possible callees */
for (int c = get_Call_n_callees(succ); c-- > 0; ) {
meth_ent = get_Call_callee(succ, c);
/* unknown_entity is used to signal that we don't know what is called */
if (is_unknown_entity(meth_ent)) {
bits |= ptr_access_all;
break;
}
for (size_t p = n_params; p-- > 0; ) {
if (get_Call_param(succ, p) == arg) {
/* an arg can be used more than once ! */
bits |= get_method_param_access(meth_ent, p);
}
}
}
} else /* can do anything */
bits |= ptr_access_all;
}
/* search stops here anyway */
continue;
}
case iro_Store:
/* We have reached a Store node => the reference is written or stored. */
if (get_Store_ptr(succ) == arg) {
/* written to */
bits |= ptr_access_write;
} else {
/* stored itself */
bits |= ptr_access_store;
}
/* search stops here anyway */
continue;
case iro_Load:
/* We have reached a Load node => the reference is read. */
bits |= ptr_access_read;
/* search stops here anyway */
continue;
case iro_Conv:
/* our address is casted into something unknown. Break our search. */
bits = ptr_access_all;
break;
default:
break;
}
/* If we know that, the argument will be read, write and stored, we
can break the recursion.*/
if (bits == ptr_access_all) {
bits = ptr_access_all;
break;
}
/*
* A calculation that do not lead to a reference mode ends our search.
* This is dangerous: It would allow to cast into integer and that cast back ...
* so, when we detect a Conv we go mad, see the Conv case above.
*/
if (!mode_is_reference(get_irn_mode(succ)))
continue;
/* follow further the address calculation */
bits = analyze_arg(succ, bits);
}
set_irn_link(arg, NULL);
return bits;
}
