Nathan McSween convinced me compilers that inline memset() can optimize the bzero case pretty well.

1 files changed, 1 insertions, 1 deletions

diff --git a/main.c b/main.c
index 0820e87b..1b1f0fcc 100644
--- a/main.c
+++ b/main.c
@@ -84,7 +84,7 @@ void toy_init(struct toy_list *which, char *argv[])
 	// Free old toys contents (to be reentrant)
 
 	if (toys.optargs != toys.argv+1) free(toys.optargs);
-	bzero(&toys, sizeof(struct toy_context));
+	memset(&toys, 0, sizeof(struct toy_context));
 
 	toys.which = which;
 	toys.argv = argv;