NetBSD/usr.bin/rpcgen/rpc_cout.c

744 lines
16 KiB
C
Raw Normal View History

/* $NetBSD: rpc_cout.c,v 1.5 1995/08/29 23:05:49 cgd Exp $ */
1993-04-03 04:51:49 +04:00
/*
* Sun RPC is a product of Sun Microsystems, Inc. and is provided for
* unrestricted use provided that this legend is included on all tape
* media and as a part of the software program in whole or part. Users
* may copy or modify Sun RPC without charge, but are not authorized
* to license or distribute it to anyone else except as part of a product or
* program developed by the user or with the express written consent of
* Sun Microsystems, Inc.
*
1993-04-03 04:51:49 +04:00
* SUN RPC IS PROVIDED AS IS WITH NO WARRANTIES OF ANY KIND INCLUDING THE
* WARRANTIES OF DESIGN, MERCHANTIBILITY AND FITNESS FOR A PARTICULAR
* PURPOSE, OR ARISING FROM A COURSE OF DEALING, USAGE OR TRADE PRACTICE.
*
1993-04-03 04:51:49 +04:00
* Sun RPC is provided with no support and without any obligation on the
* part of Sun Microsystems, Inc. to assist in its use, correction,
* modification or enhancement.
*
1993-04-03 04:51:49 +04:00
* SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
* INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY SUN RPC
* OR ANY PART THEREOF.
*
1993-04-03 04:51:49 +04:00
* In no event will Sun Microsystems, Inc. be liable for any lost revenue
* or profits or other special, indirect and consequential damages, even if
* Sun has been advised of the possibility of such damages.
*
1993-04-03 04:51:49 +04:00
* Sun Microsystems, Inc.
* 2550 Garcia Avenue
* Mountain View, California 94043
*/
1993-04-03 04:51:49 +04:00
#ifndef lint
static char sccsid[] = "@(#)rpc_cout.c 1.13 89/02/22 (C) 1987 SMI";
1993-04-03 04:51:49 +04:00
#endif
/*
* rpc_cout.c, XDR routine outputter for the RPC protocol compiler
1993-04-03 04:51:49 +04:00
*/
#include <sys/cdefs.h>
1993-04-03 04:51:49 +04:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
1993-04-03 04:51:49 +04:00
#include "rpc_parse.h"
#include "rpc_util.h"
1993-04-03 04:51:49 +04:00
static findtype __P((definition *, char *));
static undefined __P((char *));
static print_generic_header __P((char *, int));
static print_header __P((definition *));
static print_prog_header __P((proc_list *));
static print_trailer __P((void));
static print_ifopen __P((int, char *));
static print_ifarg __P((char *));
static print_ifsizeof __P((char *, char *));
static print_ifclose __P((int));
static print_ifstat __P((int, char *, char *, relation, char *, char *, char *));
static emit_num __P((definition *));
static emit_program __P((definition *));
static emit_enum __P((definition *));
static emit_union __P((definition *));
static emit_struct __P((definition *));
static emit_typedef __P((definition *));
static print_stat __P((int, declaration *));
1993-04-03 04:51:49 +04:00
/*
* Emit the C-routine for the given definition
1993-04-03 04:51:49 +04:00
*/
void
emit(def)
definition *def;
{
if (def->def_kind == DEF_CONST) {
1993-04-03 04:51:49 +04:00
return;
}
if (def->def_kind == DEF_PROGRAM) {
emit_program(def);
return;
}
if (def->def_kind == DEF_TYPEDEF) {
/* now we need to handle declarations like struct typedef foo
* foo; since we dont want this to be expanded into 2 calls to
* xdr_foo */
if (strcmp(def->def.ty.old_type, def->def_name) == 0)
return;
};
1993-04-03 04:51:49 +04:00
print_header(def);
switch (def->def_kind) {
case DEF_UNION:
emit_union(def);
break;
case DEF_ENUM:
emit_enum(def);
break;
case DEF_STRUCT:
emit_struct(def);
break;
case DEF_TYPEDEF:
emit_typedef(def);
break;
}
print_trailer();
}
static
findtype(def, type)
definition *def;
char *type;
1993-04-03 04:51:49 +04:00
{
1993-04-03 04:51:49 +04:00
if (def->def_kind == DEF_PROGRAM || def->def_kind == DEF_CONST) {
return (0);
} else {
return (streq(def->def_name, type));
}
}
static
undefined(type)
char *type;
1993-04-03 04:51:49 +04:00
{
definition *def;
def = (definition *) FINDVAL(defined, type, findtype);
1993-04-03 04:51:49 +04:00
return (def == NULL);
}
static
print_generic_header(procname, pointerp)
char *procname;
int pointerp;
{
f_print(fout, "\n");
f_print(fout, "bool_t\n");
if (Cflag) {
f_print(fout, "xdr_%s(", procname);
f_print(fout, "XDR *xdrs, ");
f_print(fout, "%s ", procname);
if (pointerp)
f_print(fout, "*");
f_print(fout, "objp)\n{\n\n");
} else {
f_print(fout, "xdr_%s(xdrs, objp)\n", procname);
f_print(fout, "\tXDR *xdrs;\n");
f_print(fout, "\t%s ", procname);
if (pointerp)
f_print(fout, "*");
f_print(fout, "objp;\n{\n\n");
}
}
1993-04-03 04:51:49 +04:00
static
print_header(def)
definition *def;
{
decl_list *dl;
bas_type *ptr;
int i;
print_generic_header(def->def_name,
def->def_kind != DEF_TYPEDEF ||
!isvectordef(def->def.ty.old_type, def->def.ty.rel));
/* Now add Inline support */
if (inline == 0)
return;
/* May cause lint to complain. but ... */
f_print(fout, "\t register long *buf;\n\n");
}
static
print_prog_header(plist)
proc_list *plist;
{
print_generic_header(plist->args.argname, 1);
1993-04-03 04:51:49 +04:00
}
static
print_trailer()
{
f_print(fout, "\treturn (TRUE);\n");
f_print(fout, "}\n");
}
static
print_ifopen(indent, name)
int indent;
char *name;
1993-04-03 04:51:49 +04:00
{
tabify(fout, indent);
f_print(fout, " if (!xdr_%s(xdrs", name);
1993-04-03 04:51:49 +04:00
}
static
print_ifarg(arg)
char *arg;
1993-04-03 04:51:49 +04:00
{
f_print(fout, ", %s", arg);
}
static
print_ifsizeof(prefix, type)
char *prefix;
char *type;
1993-04-03 04:51:49 +04:00
{
if (streq(type, "bool")) {
f_print(fout, ", sizeof(bool_t), (xdrproc_t)xdr_bool");
1993-04-03 04:51:49 +04:00
} else {
f_print(fout, ", sizeof(");
if (undefined(type) && prefix) {
f_print(fout, "%s ", prefix);
}
f_print(fout, "%s), (xdrproc_t)xdr_%s", type, type);
1993-04-03 04:51:49 +04:00
}
}
static
print_ifclose(indent)
int indent;
1993-04-03 04:51:49 +04:00
{
f_print(fout, ")) {\n");
tabify(fout, indent);
f_print(fout, "\t return (FALSE);\n");
1993-04-03 04:51:49 +04:00
tabify(fout, indent);
f_print(fout, " }\n");
1993-04-03 04:51:49 +04:00
}
static
print_ifstat(indent, prefix, type, rel, amax, objname, name)
int indent;
char *prefix;
char *type;
1993-04-03 04:51:49 +04:00
relation rel;
char *amax;
char *objname;
char *name;
1993-04-03 04:51:49 +04:00
{
char *alt = NULL;
1993-04-03 04:51:49 +04:00
switch (rel) {
case REL_POINTER:
print_ifopen(indent, "pointer");
print_ifarg("(char **)");
f_print(fout, "%s", objname);
print_ifsizeof(prefix, type);
break;
case REL_VECTOR:
if (streq(type, "string")) {
alt = "string";
} else
if (streq(type, "opaque")) {
alt = "opaque";
}
1993-04-03 04:51:49 +04:00
if (alt) {
print_ifopen(indent, alt);
print_ifarg(objname);
} else {
print_ifopen(indent, "vector");
print_ifarg("(char *)");
f_print(fout, "%s", objname);
}
print_ifarg(amax);
if (!alt) {
print_ifsizeof(prefix, type);
}
break;
case REL_ARRAY:
if (streq(type, "string")) {
alt = "string";
} else
if (streq(type, "opaque")) {
alt = "bytes";
}
1993-04-03 04:51:49 +04:00
if (streq(type, "string")) {
print_ifopen(indent, alt);
print_ifarg(objname);
} else {
if (alt) {
print_ifopen(indent, alt);
} else {
print_ifopen(indent, "array");
}
print_ifarg("(char **)");
if (*objname == '&') {
f_print(fout, "%s.%s_val, (u_int *)%s.%s_len",
objname, name, objname, name);
1993-04-03 04:51:49 +04:00
} else {
f_print(fout, "&%s->%s_val, (u_int *)&%s->%s_len",
objname, name, objname, name);
1993-04-03 04:51:49 +04:00
}
}
print_ifarg(amax);
if (!alt) {
print_ifsizeof(prefix, type);
}
break;
case REL_ALIAS:
print_ifopen(indent, type);
print_ifarg(objname);
break;
}
print_ifclose(indent);
}
/* ARGSUSED */
static
emit_enum(def)
definition *def;
{
print_ifopen(1, "enum");
print_ifarg("(enum_t *)objp");
print_ifclose(1);
}
static
emit_program(def)
definition *def;
{
decl_list *dl;
version_list *vlist;
proc_list *plist;
for (vlist = def->def.pr.versions; vlist != NULL; vlist = vlist->next)
for (plist = vlist->procs; plist != NULL; plist = plist->next) {
if (!newstyle || plist->arg_num < 2)
continue; /* old style, or single
* argument */
print_prog_header(plist);
for (dl = plist->args.decls; dl != NULL;
dl = dl->next)
print_stat(1, &dl->decl);
print_trailer();
}
}
1993-04-03 04:51:49 +04:00
static
emit_union(def)
definition *def;
{
declaration *dflt;
case_list *cl;
declaration *cs;
char *object;
char *vecformat = "objp->%s_u.%s";
char *format = "&objp->%s_u.%s";
1993-04-03 04:51:49 +04:00
print_stat(1, &def->def.un.enum_decl);
1993-04-03 04:51:49 +04:00
f_print(fout, "\tswitch (objp->%s) {\n", def->def.un.enum_decl.name);
for (cl = def->def.un.cases; cl != NULL; cl = cl->next) {
1993-04-03 04:51:49 +04:00
f_print(fout, "\tcase %s:\n", cl->case_name);
if (cl->contflag == 1) /* a continued case statement */
continue;
cs = &cl->case_decl;
1993-04-03 04:51:49 +04:00
if (!streq(cs->type, "void")) {
object = alloc(strlen(def->def_name) + strlen(format) +
strlen(cs->name) + 1);
if (isvectordef(cs->type, cs->rel)) {
s_print(object, vecformat, def->def_name,
cs->name);
} else {
s_print(object, format, def->def_name,
cs->name);
}
1993-04-03 04:51:49 +04:00
print_ifstat(2, cs->prefix, cs->type, cs->rel, cs->array_max,
object, cs->name);
1993-04-03 04:51:49 +04:00
free(object);
}
f_print(fout, "\t\tbreak;\n");
}
dflt = def->def.un.default_decl;
if (dflt != NULL) {
if (!streq(dflt->type, "void")) {
f_print(fout, "\tdefault:\n");
object = alloc(strlen(def->def_name) + strlen(format) +
strlen(dflt->name) + 1);
if (isvectordef(dflt->type, dflt->rel)) {
s_print(object, vecformat, def->def_name,
dflt->name);
} else {
s_print(object, format, def->def_name,
dflt->name);
}
1993-04-03 04:51:49 +04:00
print_ifstat(2, dflt->prefix, dflt->type, dflt->rel,
dflt->array_max, object, dflt->name);
1993-04-03 04:51:49 +04:00
free(object);
f_print(fout, "\t\tbreak;\n");
}
} else {
f_print(fout, "\tdefault:\n");
f_print(fout, "\t\treturn (FALSE);\n");
}
1993-04-03 04:51:49 +04:00
f_print(fout, "\t}\n");
}
static
emit_struct(def)
definition *def;
{
decl_list *dl;
int i, j, size, flag;
decl_list *cur, *psav;
bas_type *ptr;
char *sizestr, *plus;
char ptemp[256];
int can_inline;
1993-04-03 04:51:49 +04:00
if (inline == 0) {
for (dl = def->def.st.decls; dl != NULL; dl = dl->next)
print_stat(1, &dl->decl);
return;
1993-04-03 04:51:49 +04:00
}
for (dl = def->def.st.decls; dl != NULL; dl = dl->next)
if (dl->decl.rel == REL_VECTOR) {
f_print(fout, "\t int i;\n");
break;
}
size = 0;
can_inline = 0;
for (dl = def->def.st.decls; dl != NULL; dl = dl->next)
if ((dl->decl.prefix == NULL) &&
((ptr = find_type(dl->decl.type)) != NULL) &&
((dl->decl.rel == REL_ALIAS) || (dl->decl.rel == REL_VECTOR))) {
if (dl->decl.rel == REL_ALIAS)
size += ptr->length;
else {
can_inline = 1;
break; /* can be inlined */
};
} else {
if (size >= inline) {
can_inline = 1;
break; /* can be inlined */
}
size = 0;
}
if (size > inline)
can_inline = 1;
if (can_inline == 0) { /* can not inline, drop back to old mode */
for (dl = def->def.st.decls; dl != NULL; dl = dl->next)
print_stat(1, &dl->decl);
return;
};
flag = PUT;
for (j = 0; j < 2; j++) {
if (flag == PUT)
f_print(fout, "\n\t if (xdrs->x_op == XDR_ENCODE) {\n");
else
f_print(fout, "\n \t return (TRUE);\n\t} else if (xdrs->x_op == XDR_DECODE) {\n");
i = 0;
size = 0;
sizestr = NULL;
for (dl = def->def.st.decls; dl != NULL; dl = dl->next) { /* xxx */
/* now walk down the list and check for basic types */
if ((dl->decl.prefix == NULL) && ((ptr = find_type(dl->decl.type)) != NULL) && ((dl->decl.rel == REL_ALIAS) || (dl->decl.rel == REL_VECTOR))) {
if (i == 0)
cur = dl;
i++;
if (dl->decl.rel == REL_ALIAS)
size += ptr->length;
else {
/* this is required to handle arrays */
if (sizestr == NULL)
plus = " ";
else
plus = "+";
if (ptr->length != 1)
s_print(ptemp, " %s %s * %d", plus, dl->decl.array_max, ptr->length);
else
s_print(ptemp, " %s %s ", plus, dl->decl.array_max);
/* now concatenate to sizestr !!!! */
if (sizestr == NULL)
sizestr = strdup(ptemp);
else {
sizestr = (char *)realloc(sizestr, strlen(sizestr) + strlen(ptemp) + 1);
if (sizestr == NULL) {
f_print(stderr, "Fatal error : no memory \n");
crash();
};
sizestr = strcat(sizestr, ptemp); /* build up length of
* array */
1993-04-03 04:51:49 +04:00
}
}
1993-04-03 04:51:49 +04:00
} else {
if (i > 0)
if (sizestr == NULL && size < inline) {
/* don't expand into inline
* code if size < inline */
while (cur != dl) {
print_stat(1, &cur->decl);
cur = cur->next;
}
} else {
/* were already looking at a
* xdr_inlineable structure */
if (sizestr == NULL)
f_print(fout, "\t buf = (long *)XDR_INLINE(xdrs,%d * BYTES_PER_XDR_UNIT);",
size);
else
if (size == 0)
f_print(fout,
"\t buf = (long *)XDR_INLINE(xdrs,%s * BYTES_PER_XDR_UNIT);",
sizestr);
else
f_print(fout,
"\t buf = (long *)XDR_INLINE(xdrs,(%d + %s)* BYTES_PER_XDR_UNIT);",
size, sizestr);
f_print(fout, "\n\t if (buf == NULL) {\n");
psav = cur;
while (cur != dl) {
print_stat(2, &cur->decl);
cur = cur->next;
}
f_print(fout, "\n\t }\n\t else {\n");
cur = psav;
while (cur != dl) {
emit_inline(&cur->decl, flag);
cur = cur->next;
}
f_print(fout, "\t }\n");
}
size = 0;
i = 0;
sizestr = NULL;
print_stat(1, &dl->decl);
}
}
if (i > 0)
if (sizestr == NULL && size < inline) {
/* don't expand into inline code if size <
* inline */
while (cur != dl) {
print_stat(1, &cur->decl);
cur = cur->next;
}
} else {
/* were already looking at a xdr_inlineable
* structure */
if (sizestr == NULL)
f_print(fout, "\t\tbuf = (long *)XDR_INLINE(xdrs,%d * BYTES_PER_XDR_UNIT);",
size);
else
if (size == 0)
f_print(fout,
"\t\tbuf = (long *)XDR_INLINE(xdrs,%s * BYTES_PER_XDR_UNIT);",
sizestr);
else
f_print(fout,
"\t\tbuf = (long *)XDR_INLINE(xdrs,(%d + %s)* BYTES_PER_XDR_UNIT);",
size, sizestr);
f_print(fout, "\n\t\tif (buf == NULL) {\n");
psav = cur;
while (cur != NULL) {
print_stat(2, &cur->decl);
cur = cur->next;
}
f_print(fout, "\n\t }\n\t else {\n");
cur = psav;
while (cur != dl) {
emit_inline(&cur->decl, flag);
cur = cur->next;
}
f_print(fout, "\t }\n");
}
flag = GET;
}
f_print(fout, "\t return(TRUE);\n\t}\n\n");
1993-04-03 04:51:49 +04:00
/* now take care of XDR_FREE case */
for (dl = def->def.st.decls; dl != NULL; dl = dl->next)
print_stat(1, &dl->decl);
}
1993-04-03 04:51:49 +04:00
static
emit_typedef(def)
definition *def;
{
char *prefix = def->def.ty.old_prefix;
char *type = def->def.ty.old_type;
char *amax = def->def.ty.array_max;
1993-04-03 04:51:49 +04:00
relation rel = def->def.ty.rel;
1993-04-03 04:51:49 +04:00
print_ifstat(1, prefix, type, rel, amax, "objp", def->def_name);
}
static
print_stat(indent, dec)
1993-04-03 04:51:49 +04:00
declaration *dec;
int indent;
1993-04-03 04:51:49 +04:00
{
char *prefix = dec->prefix;
char *type = dec->type;
char *amax = dec->array_max;
1993-04-03 04:51:49 +04:00
relation rel = dec->rel;
char name[256];
1993-04-03 04:51:49 +04:00
if (isvectordef(type, rel)) {
s_print(name, "objp->%s", dec->name);
} else {
s_print(name, "&objp->%s", dec->name);
}
print_ifstat(indent, prefix, type, rel, amax, name, dec->name);
}
char *upcase __P((char *));
emit_inline(decl, flag)
declaration *decl;
int flag;
{
/*check whether an array or not */
switch (decl->rel) {
case REL_ALIAS:
emit_single_in_line(decl, flag, REL_ALIAS);
break;
case REL_VECTOR:
f_print(fout, "\t\t{ register %s *genp; \n", decl->type);
f_print(fout, "\t\t for ( i = 0,genp=objp->%s;\n \t\t\ti < %s; i++){\n\t\t",
decl->name, decl->array_max);
emit_single_in_line(decl, flag, REL_VECTOR);
f_print(fout, "\t\t }\n\t\t };\n");
}
}
emit_single_in_line(decl, flag, rel)
declaration *decl;
int flag;
relation rel;
{
char *upp_case;
int freed = 0;
if (flag == PUT)
f_print(fout, "\t\t IXDR_PUT_");
else
if (rel == REL_ALIAS)
f_print(fout, "\t\t objp->%s = IXDR_GET_", decl->name);
else
f_print(fout, "\t\t *genp++ = IXDR_GET_");
upp_case = upcase(decl->type);
/* hack - XX */
if (strcmp(upp_case, "INT") == 0) {
free(upp_case);
freed = 1;
upp_case = "LONG";
}
if (strcmp(upp_case, "U_INT") == 0) {
free(upp_case);
freed = 1;
upp_case = "U_LONG";
}
if (flag == PUT)
if (rel == REL_ALIAS)
f_print(fout, "%s(buf,objp->%s);\n", upp_case, decl->name);
else
f_print(fout, "%s(buf,*genp++);\n", upp_case);
else
f_print(fout, "%s(buf);\n", upp_case);
if (!freed)
free(upp_case);
}
char *
upcase(str)
char *str;
{
char *ptr, *hptr;
ptr = (char *) malloc(strlen(str)+1);
if (ptr == (char *) NULL) {
f_print(stderr, "malloc failed \n");
exit(1);
};
hptr = ptr;
while (*str != '\0')
*ptr++ = toupper(*str++);
*ptr = '\0';
return (hptr);
1993-04-03 04:51:49 +04:00
}