forked from ispc/ispc
-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.cpp
659 lines (555 loc) · 19.1 KB
/
util.cpp
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
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
/*
Copyright (c) 2010-2014, Intel Corporation
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 name of Intel Corporation nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 THE COPYRIGHT OWNER
OR CONTRIBUTORS 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.
*/
/** @file util.cpp
@brief Various small utility routines.
*/
#include "util.h"
#include "module.h"
#ifdef ISPC_IS_WINDOWS
#include <shlwapi.h>
#ifdef __MINGW32__
#include <malloc.h> // for alloca()
#endif
#else
#include <alloca.h>
#include <unistd.h>
#endif
#include <stdio.h>
#include <stdio.h>
#include <ctype.h>
#include <stdarg.h>
#include <stdlib.h>
#include <string.h>
#ifdef ISPC_IS_WINDOWS
#include <io.h>
#include <direct.h>
#include <windows.h>
#else
#include <sys/ioctl.h>
#include <unistd.h>
#include <errno.h>
#endif // ISPC_IS_WINDOWS
#include <set>
#include <algorithm>
#if ISPC_LLVM_VERSION == ISPC_LLVM_3_2
#include <llvm/DataLayout.h>
#else // LLVM 3.3+
#include <llvm/IR/DataLayout.h>
#endif
/** Returns the width of the terminal where the compiler is running.
Finding this out may fail in a variety of reasonable situations (piping
compiler output to 'less', redirecting output to a file, running the
compiler under a debuffer; in this case, just return a reasonable
default.
*/
int
TerminalWidth() {
if (g->disableLineWrap)
return 1<<30;
#if defined(ISPC_IS_WINDOWS)
HANDLE h = GetStdHandle(STD_OUTPUT_HANDLE);
if (h == INVALID_HANDLE_VALUE || h == NULL)
return 80;
CONSOLE_SCREEN_BUFFER_INFO bufferInfo = { {0} };
GetConsoleScreenBufferInfo(h, &bufferInfo);
return bufferInfo.dwSize.X;
#else
struct winsize w;
if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &w) < 0)
return 80;
return w.ws_col;
#endif // ISPC_IS_WINDOWS
}
static bool
lHaveANSIColors() {
static bool r = (getenv("TERM") != NULL &&
strcmp(getenv("TERM"), "dumb") != 0);
#ifndef ISPC_IS_WINDOWS
r &= isatty(2);
#endif // !ISPC_IS_WINDOWS
r |= g->forceColoredOutput;
return r;
}
static const char *
lStartBold() {
if (lHaveANSIColors())
return "\033[1m";
else
return "";
}
static const char *
lStartRed() {
if (lHaveANSIColors())
return "\033[31m";
else
return "";
}
static const char *
lStartBlue() {
if (lHaveANSIColors())
return "\033[34m";
else
return "";
}
static const char *
lResetColor() {
if (lHaveANSIColors())
return "\033[0m";
else
return "";
}
/** Given a pointer into a string, find the end of the current word and
return a pointer to its last character.
*/
static const char *
lFindWordEnd(const char *buf) {
while (*buf != '\0' && !isspace(*buf))
++buf;
return buf;
}
/** When printing error messages, we sometimes want to include the source
file line for context. This function print the line(s) of the file
corresponding to the provided SourcePos and underlines the range of the
SourcePos with '^' symbols.
*/
static void
lPrintFileLineContext(SourcePos p) {
if (p.first_line == 0)
return;
FILE *f = fopen(p.name, "r");
if (!f)
return;
int c, curLine = 1;
while ((c = fgetc(f)) != EOF) {
// Don't print more than three lines of context. (More than that,
// and we're probably doing the wrong thing...)
if (curLine >= std::max(p.first_line, p.last_line-2) &&
curLine <= p.last_line)
fputc(c, stderr);
if (c == '\n')
++curLine;
if (curLine > p.last_line)
break;
}
int i = 1;
for (; i < p.first_column; ++i)
fputc(' ', stderr);
fputc('^', stderr);
++i;
for (; i < p.last_column; ++i)
fputc('^', stderr);
fputc('\n', stderr);
fputc('\n', stderr);
fclose(f);
}
/** Counts the number of characters into the buf at which the numColons
colon character is found. Skips over ANSI escape sequences and doesn't
include their characters in the final count.
*/
static int
lFindIndent(int numColons, const char *buf) {
int indent = 0;
while (*buf != '\0') {
if (*buf == '\033') {
while (*buf != '\0' && *buf != 'm')
++buf;
if (*buf == 'm')
++buf;
}
else {
if (*buf == ':') {
if (--numColons == 0)
break;
}
++indent;
++buf;
}
}
return indent + 2;
}
/** Print the given string to the given FILE, assuming the given output
column width. Break words as needed to avoid words spilling past the
last column. */
void
PrintWithWordBreaks(const char *buf, int indent, int columnWidth, FILE *out) {
#ifdef ISPC_IS_WINDOWS
fputs(buf, out);
fputs("\n", out);
#else
int column = 0;
int width = std::max(40, columnWidth - 2);
// Collect everything into a string and print it all at once at the end
// -> try to avoid troubles with mangled error messages with
// multi-threaded builds.
std::string outStr;
const char *msgPos = buf;
while (true) {
if (*msgPos == '\033') {
// handle ANSI color escape: copy it to the output buffer
// without charging for the characters it uses
do {
outStr.push_back(*msgPos++);
} while (*msgPos != '\0' && *msgPos != 'm');
continue;
}
else if (*msgPos == '\n') {
// Handle newlines cleanly
column = indent;
outStr.push_back('\n');
for (int i = 0; i < indent; ++i)
outStr.push_back(' ');
// Respect spaces after newlines
++msgPos;
while (*msgPos == ' ') {
outStr.push_back(' ');
++msgPos;
}
continue;
}
while (*msgPos != '\0' && isspace(*msgPos))
++msgPos;
if (*msgPos == '\0')
break;
const char *wordEnd = lFindWordEnd(msgPos);
if (column > indent && column + wordEnd - msgPos > width) {
// This word would overflow, so start a new line
column = indent;
outStr.push_back('\n');
// Indent to the same column as the ":" at the start of the
// message.
for (int i = 0; i < indent; ++i)
outStr.push_back(' ');
}
// Finally go and copy the word
while (msgPos != wordEnd) {
outStr.push_back(*msgPos++);
++column;
}
outStr.push_back(' ');
++column;
}
outStr.push_back('\n');
fputs(outStr.c_str(), out);
#endif
}
#ifdef ISPC_IS_WINDOWS
// we cover for the lack vasprintf and asprintf on windows (also covers mingw)
int
vasprintf(char **sptr, const char *fmt, va_list argv)
{
int wanted = vsnprintf(*sptr = NULL, 0, fmt, argv);
if((wanted < 0) || ((*sptr = (char*)malloc( 1 + wanted )) == NULL))
return -1;
return vsprintf(*sptr, fmt, argv);
}
int
asprintf(char **sptr, const char *fmt, ...)
{
int retval;
va_list argv;
va_start(argv, fmt);
retval = vasprintf(sptr, fmt, argv);
va_end(argv);
return retval;
}
#endif
/** Helper function for Error(), Warning(), etc.
@param type The type of message being printed (e.g. "Warning")
@param p Position in source file that is connected to the message
being printed
@param fmt printf()-style format string
@param args Arguments with values for format string % entries
*/
static void
lPrint(const char *type, bool isError, SourcePos p, const char *fmt,
va_list args) {
char *errorBuf, *formattedBuf;
if (vasprintf(&errorBuf, fmt, args) == -1) {
fprintf(stderr, "vasprintf() unable to allocate memory!\n");
abort();
}
int indent = 0;
if (p.first_line == 0) {
// We don't have a valid SourcePos, so create a message without it
if (asprintf(&formattedBuf, "%s%s%s%s%s: %s%s", lStartBold(),
isError ? lStartRed() : lStartBlue(), type,
lResetColor(), lStartBold(), errorBuf,
lResetColor()) == -1) {
fprintf(stderr, "asprintf() unable to allocate memory!\n");
exit(1);
}
indent = lFindIndent(1, formattedBuf);
}
else {
// Create an error message that includes the file and line number
if (asprintf(&formattedBuf, "%s%s:%d:%d: %s%s%s%s: %s%s",
lStartBold(), p.name, p.first_line, p.first_column,
isError ? lStartRed() : lStartBlue(), type,
lResetColor(), lStartBold(), errorBuf,
lResetColor()) == -1) {
fprintf(stderr, "asprintf() unable to allocate memory!\n");
exit(1);
}
indent = lFindIndent(3, formattedBuf);
}
// Don't indent too much with long filenames
indent = std::min(indent, 8);
// Now that we've done all that work, see if we've already printed the
// exact same error message. If so, return, so we don't redundantly
// print it and annoy the user.
static std::set<std::string> printed;
if (printed.find(formattedBuf) != printed.end())
return;
printed.insert(formattedBuf);
PrintWithWordBreaks(formattedBuf, indent, TerminalWidth(), stderr);
lPrintFileLineContext(p);
free(errorBuf);
free(formattedBuf);
}
void
Error(SourcePos p, const char *fmt, ...) {
if (m != NULL) ++m->errorCount;
if (g->quiet)
return;
va_list args;
va_start(args, fmt);
lPrint("Error", true, p, fmt, args);
va_end(args);
}
void
Debug(SourcePos p, const char *fmt, ...) {
if (!g->debugPrint || g->quiet)
return;
va_list args;
va_start(args, fmt);
lPrint("Debug", false, p, fmt, args);
va_end(args);
}
void
Warning(SourcePos p, const char *fmt, ...) {
if (g->warningsAsErrors && m != NULL)
++m->errorCount;
if (g->disableWarnings || g->quiet)
return;
va_list args;
va_start(args, fmt);
lPrint(g->warningsAsErrors ? "Error" : "Warning", g->warningsAsErrors,
p, fmt, args);
va_end(args);
}
void
PerformanceWarning(SourcePos p, const char *fmt, ...) {
if (!g->emitPerfWarnings || strcmp(p.name, "stdlib.ispc") == 0 ||
g->quiet)
return;
va_list args;
va_start(args, fmt);
lPrint("Performance Warning", false, p, fmt, args);
va_end(args);
}
static void
lPrintBugText() {
static bool printed = false;
if (printed)
return;
printed = true;
fprintf(stderr, "***\n"
"*** Please file a bug report at https://github.com/ispc/ispc/issues\n"
"*** (Including as much information as you can about how to "
"reproduce this error).\n"
"*** You have apparently encountered a bug in the compiler that we'd "
"like to fix!\n***\n");
}
void
FatalError(const char *file, int line, const char *message) {
fprintf(stderr, "%s(%d): FATAL ERROR: %s\n", file, line, message);
lPrintBugText();
abort();
}
void
DoAssert(const char *file, int line, const char *expr) {
fprintf(stderr, "%s:%u: Assertion failed: \"%s\".\n", file, line, expr);
lPrintBugText();
abort();
}
void
DoAssertPos(SourcePos pos, const char *file, int line, const char *expr) {
Error(pos, "Assertion failed (%s:%u): \"%s\".", file, line, expr);
lPrintBugText();
abort();
}
///////////////////////////////////////////////////////////////////////////
// http://en.wikipedia.org/wiki/Levenshtein_distance
int
StringEditDistance(const std::string &str1, const std::string &str2, int maxDist) {
// Small hack: don't return 0 if the strings are the same; if we've
// gotten here, there's been a parsing error, and suggesting the same
// string isn't going to actually help things.
if (str1 == str2)
return maxDist;
int n1 = (int)str1.size(), n2 = (int)str2.size();
int nmax = std::max(n1, n2);
int *current = (int *)alloca((nmax+1) * sizeof(int));
int *previous = (int *)alloca((nmax+1) * sizeof(int));
for (int i = 0; i <= n2; ++i)
previous[i] = i;
for (int y = 1; y <= n1; ++y) {
current[0] = y;
int rowBest = y;
for (int x = 1; x <= n2; ++x) {
current[x] = std::min(previous[x-1] + (str1[y-1] == str2[x-1] ? 0 : 1),
std::min(current[x-1], previous[x])+1);
rowBest = std::min(rowBest, current[x]);
}
if (maxDist != 0 && rowBest > maxDist)
return maxDist + 1;
std::swap(current, previous);
}
return previous[n2];
}
std::vector<std::string>
MatchStrings(const std::string &str, const std::vector<std::string> &options) {
if (str.size() == 0 || (str.size() == 1 && !isalpha(str[0])))
// don't even try...
return std::vector<std::string>();
const int maxDelta = 2;
std::vector<std::string> matches[maxDelta+1];
// For all of the options that are up to maxDelta edit distance, store
// them in the element of matches[] that corresponds to their edit
// distance.
for (int i = 0; i < (int)options.size(); ++i) {
int dist = StringEditDistance(str, options[i], maxDelta+1);
if (dist <= maxDelta)
matches[dist].push_back(options[i]);
}
// And return the first one of them, if any, that has at least one
// match.
for (int i = 0; i <= maxDelta; ++i) {
if (matches[i].size())
return matches[i];
}
return std::vector<std::string>();
}
void
GetDirectoryAndFileName(const std::string ¤tDirectory,
const std::string &relativeName,
std::string *directory, std::string *filename) {
#ifdef ISPC_IS_WINDOWS
char path[MAX_PATH];
const char *combPath = PathCombine(path, currentDirectory.c_str(),
relativeName.c_str());
Assert(combPath != NULL);
const char *filenamePtr = PathFindFileName(combPath);
*filename = filenamePtr;
*directory = std::string(combPath, filenamePtr - combPath);
#else
// We need a fully qualified path. First, see if the current file name
// is fully qualified itself--in that case, the current working
// directory isn't needed.
// @todo This probably needs to be smarter for Windows...
std::string fullPath;
if (relativeName[0] == '/')
fullPath = relativeName;
else {
fullPath = g->currentDirectory;
if (fullPath[fullPath.size()-1] != '/')
fullPath.push_back('/');
fullPath += relativeName;
}
// now, we need to separate it into the base name and the directory
const char *fp = fullPath.c_str();
const char *basenameStart = strrchr(fp, '/');
Assert(basenameStart != NULL);
++basenameStart;
Assert(basenameStart[0] != '\0');
*filename = basenameStart;
*directory = std::string(fp, basenameStart - fp);
#endif // ISPC_IS_WINDOWS
}
static std::set<std::string> lGetStringArray(const std::string &str) {
std::set<std::string> result;
Assert(str.find('-') != str.npos);
size_t pos_prev = 0, pos;
do {
pos = str.find('-', pos_prev);
std::string substr = str.substr(pos_prev, pos-pos_prev);
result.insert(substr);
pos_prev = pos;
pos_prev++;
} while (pos != str.npos);
return result;
}
bool
VerifyDataLayoutCompatibility(const std::string &module_dl,
const std::string &lib_dl) {
if (lib_dl.empty()) {
// This is the case for most of library pre-compiled .ll files.
return true;
}
// Get "canonical" form. Instead of looking at "raw" DataLayout string, we
// look at the actual representation, as DataLayout class understands it.
// In the most cases there's no difference. But on x86 Windows (i386-pc-win32),
// clang generates a DataLayout string, which contains two definitions of f80,
// which contradic: f80:128:128 followed by f80:32:32. This is a bug, but
// correct thing to do is to interpret this exactly how LLVM would treat it,
// so we create a DataLayout class and take its string representation.
llvm::DataLayout d1(module_dl);
llvm::DataLayout d2(lib_dl);
std::string module_dl_canonic = d1.getStringRepresentation();
std::string lib_dl_canonic = d2.getStringRepresentation();
// Break down DataLayout strings to separate type definitions.
std::set<std::string> module_dl_set = lGetStringArray(module_dl_canonic);
std::set<std::string> lib_dl_set = lGetStringArray(lib_dl_canonic);
// For each element in library data layout, find matching module element.
// If no match is found, then we are in trouble and the library can't be used.
for (std::set<std::string>::iterator it = lib_dl_set.begin();
it != lib_dl_set.end(); ++it) {
// We use the simplest possible definition of "match", which is match exactly.
// Ideally it should be relaxed and for triples [p|i|v|f|a|s]<size>:<abi>:<pref>
// we should allow <pref> part (preferred alignment) to not match.
// But this seems to have no practical value at this point.
std::set<std::string>::iterator module_match =
std::find(module_dl_set.begin(), module_dl_set.end(), *it);
if (module_match == module_dl_set.end()) {
// No match for this piece of library DataLayout was found,
// return false.
return false;
}
// Remove matching piece from Module set.
module_dl_set.erase(module_match);
}
// We allow extra types to be defined in the Module, but we should check
// that it's something that we expect. And we expect vectors and floats.
for (std::set<std::string>::iterator it = module_dl_set.begin();
it != module_dl_set.end(); ++it) {
if ((*it)[0] == 'v' || (*it)[0] == 'f') {
continue;
}
return false;
}
return true;
}