- Dec 04, 2012
-
-
Chandler Carruth authored
llvm-svn: 169245
-
Chandler Carruth authored
I forgot to re-sort after fixing main module headers. llvm-svn: 169244
-
Chandler Carruth authored
I've tried to place sensible headers at the top as main-module headers. llvm-svn: 169243
-
Chandler Carruth authored
the system headers. llvm-svn: 169242
-
Chandler Carruth authored
llvm-svn: 169241
-
Chandler Carruth authored
Completely automated with sort_includes.py llvm-svn: 169240
-
Chandler Carruth authored
llvm-svn: 169239
-
Chandler Carruth authored
This is a simpler sort, entirely automatic with the help of llvm/utils/sort_includes.py -- no manual edits here. llvm-svn: 169238
-
Chandler Carruth authored
uncovered. This required manually correcting all of the incorrect main-module headers I could find, and running the new llvm/utils/sort_includes.py script over the files. I also manually added quite a few missing headers that were uncovered by shuffling the order or moving headers up to be main-module-headers. llvm-svn: 169237
-
NAKAMURA Takumi authored
llvm-svn: 169236
-
NAKAMURA Takumi authored
llvm-svn: 169235
-
Kostya Serebryany authored
[tsan] refactoring and comment changes in sanitizer_common/sanitizer_allocator{,64}.h. No functionality change llvm-svn: 169234
-
NAKAMURA Takumi authored
llvm-svn: 169233
-
Bill Wendling authored
llvm-svn: 169232
-
Dmitry Vyukov authored
currently the message is SIGSEGV llvm-svn: 169231
-
Dmitry Vyukov authored
On some programs I see: failed to open suppressions file '<null>/testing/tsan/v2/tsan.supp' llvm-svn: 169230
-
Argyrios Kyrtzidis authored
PreprocessingRecord and into its own class, PPConditionalDirectiveRecord. Decoupling allows a client to use the functionality of PPConditionalDirectiveRecord without needing a PreprocessingRecord. llvm-svn: 169229
-
Argyrios Kyrtzidis authored
use the SourceLocation at the start of the respective region, instead of a unique integer. llvm-svn: 169228
-
Argyrios Kyrtzidis authored
llvm-svn: 169227
-
Argyrios Kyrtzidis authored
compile commands of the database and expose it via the libclang API. llvm-svn: 169226
-
NAKAMURA Takumi authored
FIXME: I have not checked whether to be compiled on msvc11. llvm-svn: 169225
-
Chandler Carruth authored
missed in the first pass because the script didn't yet handle include guards. Note that the script is now able to handle all of these headers without manual edits. =] llvm-svn: 169224
-
Nadav Rotem authored
llvm-svn: 169223
-
Chandler Carruth authored
1) Teach it to handle files with #include on the first line -- these do actually exist in LLVM. 2) Support llvm-c and clang-c include projects. 3) Nuke some stail imports. 4) Switch to using os.path to split the file extension off. 5) Remove debugging leftovers. 6) Add docstring (a really puny one) for the sort function. I'm continuing te avoid stripping the whitespace on the RHS to preserve whatever newline characters happen to be in the original file. llvm-svn: 169222
-
Chandler Carruth authored
This comment has the dual effect of blocking reorderings with the sort_include script. llvm-svn: 169221
-
NAKAMURA Takumi authored
clang/test/CodeGenCXX/debug-info-zero-length-arrays.cpp: Add explicit triple, x86_64-unknown-unknown. It was incompatible to i686. llvm-svn: 169220
-
Bill Wendling authored
The count field is necessary because there isn't a difference between the 'lo' and 'hi' attributes for a one-element array and a zero-element array. When the count is '0', we know that this is a zero-element array. When it's >=1, then it's a normal constant sized array. When it's -1, then the array is unbounded. llvm-svn: 169219
-
Bill Wendling authored
The count field is necessary because there isn't a difference between the 'lo' and 'hi' attributes for a one-element array and a zero-element array. When the count is '0', we know that this is a zero-element array. When it's >=1, then it's a normal constant sized array. When it's -1, then the array is unbounded. llvm-svn: 169218
-
Nadav Rotem authored
Add the last part that is needed for vectorization of if-converted code. Added the code that actually performs the if-conversion during vectorization. We can now vectorize this code: for (int i=0; i<n; ++i) { unsigned k = 0; if (a[i] > b[i]) <------ IF inside the loop. k = k * 5 + 3; a[i] = k; <---- K is a phi node that becomes vector-select. } llvm-svn: 169217
-
Kostya Serebryany authored
[asan] add experimental -asan-realign-stack option (true by default, which does not change the current behavior) llvm-svn: 169216
-
Bill Wendling authored
llvm-svn: 169215
-
Matt Beaumont-Gay authored
llvm-svn: 169214
-
Jyotsna Verma authored
llvm-svn: 169213
-
Jyotsna Verma authored
llvm-svn: 169212
-
Sean Silva authored
llvm-svn: 169211
-
Sean Silva authored
Apparently Dinkumware are no longer hosting their nice reference manuals. Thankfully, `cppreference.com` can fill that role well. llvm-svn: 169210
-
rdar://12329730Shuxin Yang authored
The type of shirt-right (logical or arithemetic) should remain unchanged when transforming "X << C1 >> C2" into "X << (C1-C2)" llvm-svn: 169209
-
Sean Silva authored
Patch by Alexander Zinenko! llvm-svn: 169208
-
Richard Smith authored
llvm-svn: 169207
-
Alexander Potapenko authored
Need to define MISSING_BLOCKS_SUPPORT in this case at buildtime. Patch by Jack Howarth <howarth@bromo.med.uc.edu> llvm-svn: 169206
-