1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334
|
/*
* Copyright (c) 2017 Paul Mattes.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the names of Paul Mattes nor the names of his contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY PAUL MATTES "AS IS" AND ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL PAUL MATTES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Construct a manifest file from a template.
* Roughly Equivalent to the mkmanifest.sh used on Unix.
*
* mkmanifest
* -a 32|64
* -d description
* -e app-name
* -m manifest-template
* -v version-file
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "wincmn.h"
typedef char bool;
#define true 1
#define false 0
/* Keyword substitutions. */
#define SUBST(s) { s, "%" #s "%" }
enum subst {
NAME,
VERSION,
ARCHITECTURE,
DESCRIPTION,
NUM_SUBST
};
static struct {
enum subst subst;
const char *keyword;
char *value;
} substs[] = {
SUBST(NAME),
SUBST(VERSION),
SUBST(ARCHITECTURE),
SUBST(DESCRIPTION)
};
/* Allocate memory. */
void *
Malloc(size_t len)
{
void *r;
r = malloc(len);
if (r == NULL) {
fprintf(stderr, "out of memory\n");
exit(1);
}
return r;
}
/* Free memory. */
void
Free(void *s)
{
free(s);
}
/* Allocate a string. */
static char *
NewString(char *s)
{
return strcpy(Malloc(strlen(s) + 1), s);
}
/* Display usage and exit. */
void
Usage(void)
{
fprintf(stderr, "Usage: mkmanifest -a 32|64 -d description -e app-name -m manifest-template -v version-file\n");
exit(1);
}
/* Parse the version string (3.2ga7) into Windows format (3.2.7.0). */
char *
parse_version(const char *version_string)
{
enum fsm {
BASE,
DIG_A,
DIG_A_DOT,
DIG_B,
KW,
DIG_C
} state = BASE;
unsigned char c;
char out[256];
char *outp = out;
# define STORE(c) { \
if (outp - out >= sizeof(out)) { \
return NULL; \
} \
*outp++ = c; \
}
while ((c = *version_string++)) {
switch (state) {
case BASE:
if (isdigit(c)) {
STORE(c);
state = DIG_A;
} else {
return NULL;
}
break;
case DIG_A:
if (isdigit(c)) {
STORE(c);
} else if (c == '.') {
STORE(c);
state = DIG_A_DOT;
} else {
return NULL;
}
break;
case DIG_A_DOT:
if (isdigit(c)) {
STORE(c);
state = DIG_B;
} else {
return NULL;
}
break;
case DIG_B:
if (isdigit(c)) {
STORE(c);
} else {
state = KW;
}
break;
case KW:
if (isdigit(c)) {
STORE('.');
STORE(c);
state = DIG_C;
}
break;
case DIG_C:
if (isdigit(c)) {
STORE(c);
} else {
return NULL;
}
break;
}
}
if (state != DIG_C) {
return NULL;
}
STORE('.');
STORE('0');
STORE('\0');
return NewString(out);
}
int
main(int argc, char *argv[])
{
bool ia64 = false;
FILE *f;
char buf[1024];
char *version = NULL;
char *manifest = NULL;
char *arch = NULL;
char *version_string = NULL;
char *manifest_version = NULL;
char *appname = NULL;
char *description = NULL;
int i, j, k;
/* Check the command line. */
for (i = 1; i < argc; i++) {
if (!strcmp(argv[i], "-e")) {
if (i + 1 >= argc) {
Usage();
}
appname = argv[++i];
} else if (!strcmp(argv[i], "-v")) {
if (i + 1 >= argc) {
Usage();
}
version = argv[++i];
} else if (!strcmp(argv[i], "-d")) {
if (i + 1 >= argc) {
Usage();
}
description = argv[++i];
} else if (!strcmp(argv[i], "-a")) {
if (i + 1 >= argc) {
Usage();
}
arch = argv[++i];
if (!strcmp(arch, "32") || !strcmp(arch, "Win32")) {
ia64 = false;
} else if (!strcmp(arch, "64") || !strcmp(arch, "x64")) {
ia64 = true;
} else {
Usage();
}
} else if (!strcmp(argv[i], "-m")) {
if (i + 1 >= argc) {
Usage();
}
manifest = argv[++i];
} else {
Usage();
}
}
if (appname == NULL || description == NULL || manifest == NULL
|| arch == NULL || version == NULL) {
Usage();
}
/* Read up version.txt. */
f = fopen(version, "r");
if (f == NULL) {
perror(version);
return 1;
}
while (fgets(buf, sizeof(buf), f) != NULL) {
if (!strncmp(buf, "version=\"", 9)) {
char *q;
version_string = NewString(buf + 9);
q = strchr(version_string, '"');
if (q == NULL) {
fprintf(stderr, "syntax error in %s\n", version);
return 1;
}
*q = '\0';
}
}
fclose(f);
if (version_string == NULL) {
fprintf(stderr, "missing version= in %s\n", version);
return 1;
}
/* Translate the version. */
manifest_version = parse_version(version_string);
if (manifest_version == NULL) {
fprintf(stderr, "Syntax error in version '%s'\n", version_string);
return 1;
}
/* Populate the subsitutions. */
substs[NAME].value = appname;
substs[VERSION].value = manifest_version;
substs[ARCHITECTURE].value = ia64? "ia64": "x86";
substs[DESCRIPTION].value = description;
/* Check the substitutions. */
for (j = 0; j < NUM_SUBST; j++) {
for (k = 0; k < NUM_SUBST; k++) {
if (strstr(substs[k].value, substs[j].keyword) != NULL) {
fprintf(stderr, "Substitution '%s' contains keyword '%s'\n",
substs[k].value, substs[j].keyword);
return 1;
}
}
}
/* Parse and substitute. */
f = fopen(manifest, "r");
if (f == NULL) {
perror(manifest);
return 1;
}
while (fgets(buf, sizeof(buf), f) != NULL) {
int i;
char *xbuf = NewString(buf);
for (i = 0; i < NUM_SUBST; i++) {
char *s;
while ((s = strstr(xbuf, substs[i].keyword)) != NULL) {
size_t left_len = s - xbuf;
char *middle_string = substs[i].value;
size_t middle_len = strlen(middle_string);
char *right_string = s + strlen(substs[i].keyword);
size_t right_len = strlen(right_string);
size_t bufsize = left_len + middle_len + right_len + 1;
char *ybuf = Malloc(bufsize);
sprintf(ybuf, "%.*s%s%s",
(int)left_len, xbuf,
middle_string,
right_string);
Free(xbuf);
xbuf = ybuf;
}
}
write(1, xbuf, (int)strlen(xbuf));
Free(xbuf);
}
fclose(f);
return 0;
}
|