From 35216502db7d018b0c5830321437f69e9dace528 Mon Sep 17 00:00:00 2001
From: Alan Cox <alan@linux.intel.com>
Date: Thu, 17 Mar 2016 12:35:43 +0000
Subject: [PATCH] advgen: support generating a cross endian database

Before Brett & Tormod notice it's broken on 6809 at the moment ;-)
---
 Applications/cave/advgen.c | 30 +++++++++++++++++++++++++-----
 1 file changed, 25 insertions(+), 5 deletions(-)

diff --git a/Applications/cave/advgen.c b/Applications/cave/advgen.c
index b8b178ec..3c2d9c11 100644
--- a/Applications/cave/advgen.c
+++ b/Applications/cave/advgen.c
@@ -4,6 +4,7 @@
 #include <unistd.h>
 #include <fcntl.h>
 #include <stdlib.h>
+#include <arpa/inet.h>
 
 #define MAXDIM(a)		    (sizeof(a) / sizeof(a[0]))
 struct trav {
@@ -1646,6 +1647,16 @@ struct gameheader {
 };
 
 #define out 1
+
+static int crossendian;
+
+static uint16_t endianize(uint16_t v)
+{
+	if (crossendian)
+		v = ((v & 0xFF) << 8) | (v >> 8);
+	return v;
+}
+
 int main(int argc, char *argv[])
 {
 	int i = 0;
@@ -1654,12 +1665,21 @@ int main(int argc, char *argv[])
 	int len;
 	struct trav t;
 	struct gameheader game;
+
+	if (argc == 2 && strcmp(argv[1], "-x") == 0) {
+		crossendian = 1;
+		argc--;
+	}
+	if (argc != 1) {
+		fprintf(stderr, "%s [-x] >advent.db", argv[0]);
+		exit(1);
+	}
 	base = sizeof(game);
 	write(out, &game, sizeof(game));
 	dp = sizeof(game);
 	while (i < 210) {
 		len = strlen(pTextMsg[i]) + 1;
-		game.msg[i] = dp;
+		game.msg[i] = endianize(dp);
 		dp += len;
 		write(out, pTextMsg[i], len);
 		i++;
@@ -1669,7 +1689,7 @@ int main(int argc, char *argv[])
 
 		/* 0 terminate as entries don't give the true length */
 		len = strlen(pShortRmDesc[i]) + 1;
-		game.lshort[i] = dp;
+		game.lshort[i] = endianize(dp);
 		write(out, pShortRmDesc[i], len);
 		dp += len;
 		if (TravTab[i].sTrav > 16) {
@@ -1682,18 +1702,18 @@ int main(int argc, char *argv[])
 	} game.lshort[i] = dp;
 	for (i = 0; i < 64; i++) {
 		len = strlen(pObjDesc[i]);
-		game.odesc[i] = dp;
+		game.odesc[i] = endianize(dp);
 		write(out, pObjDesc[i], len);
 		dp += len;
 	}
 	game.odesc[i] = dp;
 	for (i = 0; i < 64; i++) {
 		len = strlen(pLongRmDesc[i]);
-		game.loclong[i] = dp;
+		game.loclong[i] = endianize(dp);
 		write(out, pLongRmDesc[i], len);
 		dp += len;
 	}
-	game.loclong[i] = dp;
+	game.loclong[i] = endianize(dp);
 	if (lseek(out, 0L, SEEK_SET) == -1) {
 		perror("seek");
 		exit(1);
-- 
2.34.1