| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
we have invokes, so there is no functionality change here.
llvm-svn: 122990
|
| |
|
|
|
|
|
|
| |
cache even when a valid process exists. Previously, Target::ReadMemory would
read from the process if there was a valid one and then fallback to the
object file cache.
llvm-svn: 122989
|
| |
|
|
|
|
|
|
|
|
| |
In particular, the iteration variable (if present) should be created and
destroyed in a narrow span around the loop body, and the body should
be emitted in a cleanup scope in case it's not a compound statement.
Otherwise, rename a few variables and use phis instead of temporary
variables for the index and buffer count.
llvm-svn: 122988
|
| |
|
|
| |
llvm-svn: 122987
|
| |
|
|
|
|
|
|
|
| |
parameters into parameter types, so that substitution of
explicitly-specified function template arguments uses the same
path. This enables the use of explicitly-specified function template
arguments with variadic templates.
llvm-svn: 122986
|
| |
|
|
|
|
| |
matching failed.
llvm-svn: 122985
|
| |
|
|
|
|
|
| |
Also, call GetProcess instead of CalculateProcess as the latter is morally part
of the ExecutionContextScope API.
llvm-svn: 122984
|
| |
|
|
|
|
| |
Nadav Rotem.
llvm-svn: 122983
|
| |
|
|
|
|
| |
comes back some day.
llvm-svn: 122982
|
| |
|
|
|
|
| |
try and build this and let me know how it goes?
llvm-svn: 122981
|
| |
|
|
| |
llvm-svn: 122980
|
| |
|
|
|
|
| |
typed atomics. This will lower exclusively to libcalls at the moment.
llvm-svn: 122979
|
| |
|
|
|
|
| |
things :)
llvm-svn: 122978
|
| |
|
|
| |
llvm-svn: 122977
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
an issue with the way the UnwindLLDB was handing out RegisterContexts: it
was making shared pointers to register contexts and then handing out just
the pointers (which would get put into shared pointers in the thread and
stack frame classes) and cause double free issues. MallocScribble helped to
find these issues after I did some other cleanup. To help avoid any
RegisterContext issue in the future, all code that deals with them now
returns shared pointers to the register contexts so we don't end up with
multiple deletions. Also now that the RegisterContext class doesn't require
a stack frame, we patched a memory leak where a StackFrame object was being
created and leaked.
Made the RegisterContext class not have a pointer to a StackFrame object as
one register context class can be used for N inlined stack frames so there is
not a 1 - 1 mapping. Updates the ExecutionContextScope part of the
RegisterContext class to never return a stack frame to indicate this when it
is asked to recreate the execution context. Now register contexts point to the
concrete frame using a concrete frame index. Concrete frames are all of the
frames that are actually formed on the stack of a thread. These concrete frames
can be turned into one or more user visible frames due to inlining. Each
inlined stack frame has the exact same register context (shared via shared
pointers) as any parent inlined stack frames all the way up to the concrete
frame itself.
So now the stack frames and the register contexts should behave much better.
llvm-svn: 122976
|
| |
|
|
|
|
|
| |
Update lib/Makefile to use current LLVM and Clang components and add the
PluginUtility library to the build.
llvm-svn: 122975
|
| |
|
|
|
|
|
|
| |
In particular, we are looking to ignore the "#pragma mark" construct which GCC
warns about on platforms other than Darwin. This cleans up diagnostic output
significantly.
llvm-svn: 122974
|
| |
|
|
|
|
|
|
|
|
|
|
| |
template whose last parameter is a parameter pack. This allows us to
form a call to, e.g.,
template<typename ...Args1, typename ...Args2>
void f(std::pair<Args1, Args2> ...pairs);
given zero or more instances of "pair".
llvm-svn: 122973
|
| |
|
|
| |
llvm-svn: 122972
|
| |
|
|
|
|
| |
This fixes PR 8913 crash.
llvm-svn: 122971
|
| |
|
|
| |
llvm-svn: 122970
|
| |
|
|
| |
llvm-svn: 122969
|
| |
|
|
| |
llvm-svn: 122968
|
| |
|
|
|
|
|
| |
its own deprecated diagnostics group so it can be
turned off selectively. // rdar://8827606
llvm-svn: 122967
|
| |
|
|
| |
llvm-svn: 122966
|
| |
|
|
|
|
| |
Patch by Sylvère Teissier.
llvm-svn: 122965
|
| |
|
|
| |
llvm-svn: 122964
|
| |
|
|
| |
llvm-svn: 122963
|
| |
|
|
|
|
| |
Patch by Richard Simth.
llvm-svn: 122962
|
| |
|
|
|
|
|
|
| |
langth are equal.
This happens when we take the (non-constant) length from a malloc.
llvm-svn: 122961
|
| |
|
|
| |
llvm-svn: 122960
|
| |
|
|
|
|
| |
with the size passed to malloc.
llvm-svn: 122959
|
| |
|
|
| |
llvm-svn: 122958
|
| |
|
|
| |
llvm-svn: 122957
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
Fix the width and align of bool type on Darwin to be 32bits
while keeping it 8 everywhere else.
Change the definition of va_list to default to SV4 ABI one
and let darwin subtarget override this.
Both changes submitted by Nathan Whitehorn and reviewed
by Rafael Espindola.
llvm-svn: 122956
|
| |
|
|
|
|
|
|
| |
The theory is it's still faster than a pair of movq / a quad of movl. This
will probably hurt older chips like P4 but should run faster on current
and future Intel processors. rdar://8817010
llvm-svn: 122955
|
| |
|
|
|
|
| |
179.art.
llvm-svn: 122954
|
| |
|
|
| |
llvm-svn: 122953
|
| |
|
|
|
|
|
| |
etc. takes an option OptSize. If OptSize is true, it would return
the inline limit for functions with attribute OptSize.
llvm-svn: 122952
|
| |
|
|
| |
llvm-svn: 122951
|
| |
|
|
|
|
|
|
|
|
| |
ret i64 ptrtoint (i8* getelementptr ([1000 x i8]* @X, i64 1, i64 sub (i64 0, i64 ptrtoint ([1000 x i8]* @X to i64))) to i64)
to "ret i64 1000". This allows us to correctly compute the trip count
on a loop in PR8883, which occurs with std::fill on a char array. This
allows us to transform it into a memset with a constant size.
llvm-svn: 122950
|
| |
|
|
| |
llvm-svn: 122949
|
| |
|
|
| |
llvm-svn: 122948
|
| |
|
|
| |
llvm-svn: 122947
|
| |
|
|
|
|
| |
that contains the ## operator.
llvm-svn: 122946
|
| |
|
|
|
|
| |
OptimizeInst() so that they can be used on a worklist instruction.
llvm-svn: 122945
|
| |
|
|
| |
llvm-svn: 122944
|
| |
|
|
|
|
|
| |
into a separate function, so that it can be called from a loop using a worklist
rather than a loop traversing a whole basic block.
llvm-svn: 122943
|
| |
|
|
|
|
|
|
|
|
| |
The initial TreeTransform is a cop-out, but it's more-or-less equivalent
to what we were doing before, or rather what we're doing now and might
eventually stop doing in favor of using this type.
I am simultaneously intrigued by the possibilities of rebuilding a
dependent Attri
llvm-svn: 122942
|
| |
|
|
| |
llvm-svn: 122941
|