From bb73845798cff57670d538da76e8d33d95a83c96 Mon Sep 17 00:00:00 2001
From: Marc Espie <espie@cvs.openbsd.org>
Date: Fri, 20 Jan 2006 23:10:20 +0000
Subject: use stdint.h where appropriate. okay millert@

---
 usr.bin/tsort/tsort.c | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'usr.bin/tsort/tsort.c')

diff --git a/usr.bin/tsort/tsort.c b/usr.bin/tsort/tsort.c
index 7dc841b38bf..8ef36740bbb 100644
--- a/usr.bin/tsort/tsort.c
+++ b/usr.bin/tsort/tsort.c
@@ -1,4 +1,4 @@
-/* $OpenBSD: tsort.c,v 1.19 2004/08/05 10:59:42 espie Exp $ */
+/* $OpenBSD: tsort.c,v 1.20 2006/01/20 23:10:19 espie Exp $ */
 /* ex:ts=8 sw=4:
  *
  * Copyright (c) 1999-2004 Marc Espie <espie@openbsd.org>
@@ -16,18 +16,18 @@
  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  */
 
-#include <sys/types.h>
 #include <assert.h>
 #include <ctype.h>
 #include <err.h>
 #include <limits.h>
 #include <stddef.h>
-#include <ohash.h>
 #include <stdio.h>
+#include <stdint.h>
 #include <stdlib.h>
 #include <string.h>
 #include <sysexits.h>
 #include <unistd.h>
+#include <ohash.h>
 
 /* The complexity of topological sorting is O(e), where e is the
  * size of input.  While reading input, vertices have to be identified,
-- 
cgit v1.2.3