sin/samba-mirror
1
0
Fork 0
mirror of https://github.com/samba-team/samba.git synced 2024-12-28 07:21:54 +03:00
Code
b9fcb5b961
samba-mirror/source3/aparser/dump.awk

71 lines
1.5 KiB
Awk
Raw Normal View History

vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
# dump the current parse tree
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
function element_string(elnum,
LOCAL, elem)
{
elem = elements[elnum, "elem"];
if (elements[elnum, "ptr"]=="1") elem="*"elem;
if (elements[elnum, "array_len"]!="")
elem=elem"["elements[elnum, "array_len"]"]";
if (elements[elnum, "switch"]!="")
elem=elem"["elements[elnum, "switch"]"]";
return elem;
}
function dump_element(f, elnum,
LOCAL, elem, type)
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
{
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
type = elements[elnum, "type"];
case = elements[elnum, "case"];
elem = element_string(elnum);
if (case != "") {
xprintf(f,"\t\tcase %d %s %s;\n", case, type, elem);
} else {
xprintf(f,"\t%s %s;\n", type, elem);
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
}
}
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
function dump_union(f, elnum,
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
LOCAL, i)
{
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
xprintf(f,"\tunion %s {\n", element_string(elnum));
for (i=0;i<unions[elnum, "num_elems"];i++) {
dump_element(f, unions[elnum, i]);
}
xprintf(f,"\t}\n");
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
}
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
function dump_elem(f, struct_num, elem_num,
LOCAL, enum)
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
{
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
elnum = structs[struct_num, elem_num];
if (elements[elnum, "type"] == "union") {
dump_union(f, elnum);
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
} else {
started update to handle arbitrary arrays note: this code is currently broken. (This used to be commit 15646ebd84ee4e63a251c87800677f3dd2ae6971)
2000-05-15 17:41:05 +04:00
dump_element(f, elnum);
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
}
}
function dump_structs(f, NIL,
LOCAL, i, j)
{
xprintf(f,"/* dump of parsed structures */\n\n\n");
started adding support for relative, plus options for autoalignment so the same parser generator can be uses for cifs and rpc (This used to be commit c7829fa0d87081d9b3f33468527583e3b763916b)
2000-06-09 06:59:50 +04:00
for (i=0;i < num_options;i++) {
xprintf(f,"option %s %s\n", options[i, "name"], options[i, "value"]);
}
xprintf(f,"\n\n");
vastly improved awk based code generator now handles recursive function definitions, unions etc it is sufficient for some basic types like UNISTR2 and BUFFER5 to be defined in the *.struct file and used successfully this generator uses templates (in *.tpl files) for all code generation, allowing easy replacement of the backend functions (This used to be commit 14ded82dc92ae6eff7639351f391a33b9cc31c0d)
2000-05-14 18:05:10 +04:00
for (i=0;i < num_structs;i++) {
xprintf(f,"/* structure %d */\n", i);
xprintf(f,"struct %s {\n", structs[i, "name"]);
for (j=0;j<structs[i, "num_elems"];j++) {
dump_elem(f, i, j);
}
xprintf(f,"};\n\n");
}
xprintf(f,"/* end dump */\n\n");
}
Copy Permalink