#define bcs_next(x) STAILQ_NEXT(x, link)
-/* @null@ bytecode *bcs_last(bytecodehead *headp); */
-#define bcs_last(headp) STAILQ_LAST(headp, bytecode, link)
-
#endif
return mybuf;
}
+bytecode *
+bcs_last(bytecodehead *headp)
+{
+ return STAILQ_LAST(headp, bytecode, link);
+}
+
void
bcs_delete(bytecodehead *headp)
{
/* bytecode *bcs_first(bytecodehead *headp); */
#define bcs_first(headp) STAILQ_FIRST(headp)
+/*@null@*/ bytecode *bcs_last(bytecodehead *headp);
void bcs_delete(bytecodehead *headp);
/* Adds bc to the list of bytecodes headp.
#define bcs_next(x) STAILQ_NEXT(x, link)
-/* @null@ bytecode *bcs_last(bytecodehead *headp); */
-#define bcs_last(headp) STAILQ_LAST(headp, bytecode, link)
-
#endif
return mybuf;
}
+bytecode *
+bcs_last(bytecodehead *headp)
+{
+ return STAILQ_LAST(headp, bytecode, link);
+}
+
void
bcs_delete(bytecodehead *headp)
{
/* bytecode *bcs_first(bytecodehead *headp); */
#define bcs_first(headp) STAILQ_FIRST(headp)
+/*@null@*/ bytecode *bcs_last(bytecodehead *headp);
void bcs_delete(bytecodehead *headp);
/* Adds bc to the list of bytecodes headp.