How to call appropriate functions?

[Ganesh Kundapur]

Hi all,
suppose i have 100 functions such as f1, f2,...f100 in a single
file including main. If i pass arguement to main such as
$a.out f1
main should call appropriate functions. I can do this using switch
statement, but if i have 1000 functions, then i have to write 1000 cases
OR i can use pointer to functions. I am passing string to main, how to
map this string to function efficiently.

[Joona I Palaste]

Ganesh Kundapur <gk*******@yaho o.com> scribbled the following:

Hi all,
suppose i have 100 functions such as f1, f2,...f100 in a single
file including main. If i pass arguement to main such as
$a.out f1
main should call appropriate functions. I can do this using switch
statement, but if i have 1000 functions, then i have to write 1000 cases
OR i can use pointer to functions. I am passing string to main, how to
map this string to function efficiently.

If they're all named f{i} where {i} is an integer value from 1 to 100,
then you can use strtol() to find out the value of this integer, and use
it to index an array of function pointers. I don't see any easier way.

--
/-- Joona Palaste (pa*****@cc.hel sinki.fi) ------------- Finland --------\
\-- http://www.helsinki.fi/~palaste --------------------- rules! --------/
"Roses are red, violets are blue, I'm a schitzophrenic and so am I."
- Bob Wiley

[CBFalconer]

Joona I Palaste wrote:

Ganesh Kundapur <gk*******@yaho o.com> scribbled the following:

suppose i have 100 functions such as f1, f2,...f100 in a single
file including main. If i pass arguement to main such as
$a.out f1
main should call appropriate functions. I can do this using
switch statement, but if i have 1000 functions, then i have to
write 1000 cases OR i can use pointer to functions. I am
passing string to main, how to map this string to function
efficiently.

If they're all named f{i} where {i} is an integer value from 1
to 100, then you can use strtol() to find out the value of this
integer, and use it to index an array of function pointers. I
don't see any other way.

That does nicely for trying the system out, including getting the
initialization of the function pointers and declaration of the
function type right. Then the OP can improve on it by changing
the array to an array of struct, where the struct holds the
function pointer and a pointer to its name. Then a sequential
search handles arbitrary input strings.

If you pass argv and argc on down, the functions can continue the
process with argv[2], after checking for existence.

--
Chuck F (cb********@yah oo.com) (cb********@wor ldnet.att.net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home .att.net> USE worldnet address!

[Derk Gwen]

Ganesh Kundapur <gk*******@yaho o.com> wrote:
# Hi all,
# suppose i have 100 functions such as f1, f2,...f100 in a single
# file including main. If i pass arguement to main such as
# $a.out f1
# main should call appropriate functions. I can do this using switch
# statement, but if i have 1000 functions, then i have to write 1000 cases
# OR i can use pointer to functions. I am passing string to main, how to
# map this string to function efficiently.

Use a program generator. Write a program that writes the source file.
...
fputs(
"#include <stdio.h>\n"
"int main(int argc,char **argv) {\n"
...
,stdout);
for (i=1,else=""; i<1000; i++,else="else ") {
printf("%sif (strcmp(\"f%d\" ,argv[1])==0) f%d();",else,i, i);
}
...

If you're using make, you can include program generator
xyz: xyz.o
cc -o xyz xyz.o
xyz.o: xyz.c pqr.h
cc -c xyz.c
xyz.c: xyz-gen
xyz-gen >xyz.c
xyz-gen: xyz-gen.c
cc -o xyz-gen xyz-gen.c

--
Derk Gwen http://derkgwen.250free.com/html/index.html
Don't say anything. Especially you.

[John Bode]

Ganesh Kundapur <gk*******@yaho o.com> wrote in message news:<3F******* *******@yahoo.c om>...

Hi all,
suppose i have 100 functions such as f1, f2,...f100 in a single
file including main. If i pass arguement to main such as
$a.out f1
main should call appropriate functions. I can do this using switch
statement, but if i have 1000 functions, then i have to write 1000 cases
OR i can use pointer to functions. I am passing string to main, how to
map this string to function efficiently.

You're going to have to implement a lookup table of some sort. If all
of the called functions have the same return type and number of
parameters, you could do something like the following (probably not
the best way of doing it, but I'm doing this off the top of my head):

void f1 (void) {...}
void f2 (void) {...}
void f3 (void) {...}
....
void f100 (void) {...}

struct fassoc {
char name[5]; /* long as longest function name + 1 */
void (*fptr)(void); /* pointer to function */
};

struct fassoc fassoc_table[100] =
{ {"f1", f1}, {"f2", f2}, {"f3", f3}, ..., {"f100", f100} };

void call_func_by_na me (char *name)
{
int i;

for (i = 0; i < 100; i++)
{
if (strcmp (name, fassoc_table[i].name) == 0)
{
fassoc_table[i].fptr ();
break;
}
}
}

int main (int argc, char **argv)
{
if (argc == 2)
{
call_func_by_na me (argv[1]);
}

return 0;
}

If the functions have different return types or take different numbers
of parameters, then things get a bit trickier. You'd still need a
lookup table, but now you'd need to accomodate several types of
function pointers, and I'm not sure if you could initialize it like
above (you'd probably have to call a function at program startup to
set up the lookup table).