Displaying 12 results from an estimated 12 matches for "defineded".
Did you mean:
definded
2012 Jul 02
0
[LLVMdev] Preprocessor: output only definedness testing macro's
Hi all,
I'm looking for some guidance on how to implement the following GCC behavior
using the Clang libaries. For a simple input file I want to get all the macro's
which are actually being tested against in that specific file. The following
reproduces the behavior:
$ cat > test.c << EOF
#ifdef AA
#define BLABLA
#else
#define WUTWUT
#endif
#ifdef WUTWUT
#endif
#define X 2
2009 Feb 16
1
[LLVMdev] PredicateSimplifier questions
Chris do you have a sense for how the definedness of signed overflow in
LLVM would play out in the context of bounds check elimination? That is,
would it cause lots of failure to eliminate checks that could be seen to
be unnecessary at the C level?
John
On Sun, 15 Feb 2009, Chris Lattner wrote:
>
> On Feb 15, 2009, at 10:08 PM, John Regehr wrote:
>
>>> Predsimplify is
2015 Apr 22
4
[LLVMdev] Missed vectorization opportunities?
Hi,
I am trying to understand the limitations of the current vectorizer, and came upon these test cases that fail to get vectorized.
1. loop1 below (note the increment by 2) fails to get vectorized because the access a[j+1] is considered to wrap around (the corresponding SCEV doesn't have nsw/nuw set) and hence isStridedPtr() in LoopAccessAnalysis.cpp return false.
#define SIZE 100000
void
2008 Apr 17
4
looking for a way to remove module interdependencies
Hello List,
i''m running into an issue with puppet where I don''t know how to solve
correctly.
We''re managing applications and our monitoring (nagios) using puppet
using the following schema:
class nagios {
// ensure nrpe ist installed
// export a host definition
nagios::check { ''ping'': }
nagios::check { ''load'': }
...
2008 Jul 11
0
GLoc's l_date don't work.
Hi, are there anyone have used l_date to format a date object.
I have used it as:
<%= l_date porject.created_at %>
And defineded the "general_fmt_date" in "lang\en.yml" as:
general_fmt_date: %%m/%%d/%%Y
When run it, the output is: %m/%d/%Y
Maybe I had made some mistakes, who can hely me?
--
Posted via http://www.ruby-forum.com/.
--~--~---------~--~----~------------~-------~--~----~
You received this m...
2016 May 31
3
Signed Division and InstCombine
I was looking through the InstCombine pass, and I was wondering why signed
division is not considered a valid operation to combine in the
canEvaluateTruncated function. This means, given the following code:
%conv = sext i16 %0 to i32
%conv1 = sext i16 %1 to i32
%div = sdiv i32 %conv, %conv1
%conv2 = trunc i32 %div to i16
* Assume %0 and %1 are registers created from simple 16-bit loads.
We
2009 Feb 16
0
[LLVMdev] PredicateSimplifier questions
On Feb 15, 2009, at 10:08 PM, John Regehr wrote:
>> Predsimplify is believed to have bugs (it results in miscompiled
>> programs) and certainly isn't efficient (it was written before much
>> of
>> include/ADT). Finally, predsimplify is likely to go away once I or
>> someone else writes a proper VRP pass.
>
> Whoever does this, I strongly encourage looking
2009 Feb 16
3
[LLVMdev] PredicateSimplifier questions
> Predsimplify is believed to have bugs (it results in miscompiled
> programs) and certainly isn't efficient (it was written before much of
> include/ADT). Finally, predsimplify is likely to go away once I or
> someone else writes a proper VRP pass.
Whoever does this, I strongly encourage looking into using (or at least
providing optional support for) the Apron library:
2018 Aug 22
2
Fixed Point Support in LLVM
On 2018-08-22 05:56, John McCall via llvm-dev wrote:
>> On Aug 21, 2018, at 6:20 PM, Leonard Chan <leonardchan at google.com> wrote:
>> If we were to create a new type down the line, I think the main
>> features that would distinguish them from other types are the
>> arbitrary width and scale. Saturation can be handled through
>> instructions since saturation
2018 Jul 11
4
What is the right lowering for misaligned memory access?
What should a well behaved back end do with a load or store with alignment
less than the natural alignment of the type?
I believe C++ considers such access to be UB. I'm not sure what the IR
semantics are.
I think my options are:
- Delete the operation / use undef
- Lower as if it is naturally aligned
- Lower via inefficient code that assumes align 1
Thanks,
Jon
-------------- next part
2018 Aug 21
4
Fixed Point Support in LLVM
If we were to create a new type down the line, I think the main
features that would distinguish them from other types are the
arbitrary width and scale. Saturation can be handled through
instructions since saturation really only takes effect after an
operation and doesn’t really describe anything about the bits in the
resulting type. Signage can similarly be managed through operations
and would be
2018 Aug 22
2
Fixed Point Support in LLVM
On 2018-08-22 11:32, John McCall wrote:
>
>> On Aug 22, 2018, at 4:38 AM, Bevin Hansson <bevin.hansson at ericsson.com> wrote:
>>
>>
>>
>> On 2018-08-22 05:56, John McCall via llvm-dev wrote:
>>>> On Aug 21, 2018, at 6:20 PM, Leonard Chan <leonardchan at google.com> wrote:
>>>> If we were to create a new type down the line, I