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)

1 files changed, 33 insertions, 0 deletions

diff --git a/source3/aparser/templates/fn_end.tpl b/source3/aparser/templates/fn_end.tpl
new file mode 100644
index 0000000000..b5c36fff35
--- /dev/null
+++ b/source3/aparser/templates/fn_end.tpl
@@ -0,0 +1,33 @@
+
+	return True;
+
+fail:
+        ZERO_STRUCTP(il);
+	return False;
+} /* @FUNCNAME@ */
+
+/*******************************************************************
+parse a @STRUCTNAME@ structure
+********************************************************************/
+BOOL @FUNCNAME@_alloc(char *desc, @STRUCTNAME@ **q_u,
+             prs_struct *ps, int depth)
+{
+	@STRUCTNAME@ *il;
+	BOOL ret;
+	
+	if (!UNMARSHALLING(ps)) return False;
+
+	il=(@STRUCTNAME@ *)malloc(sizeof(@STRUCTNAME@));
+	if (il == NULL) return False;
+	ZERO_STRUCTP(il);
+
+	ret = @FUNCNAME@(desc, il, ps, depth);
+	if (!ret) {
+	   free(il);
+	   return False;
+	}
+	*q_u = il;
+	return True;
+}
+
+