Displaying 20 results from an estimated 1100 matches similar to: "Invalid transformation in LibCallSimplifier::replacePowWithSqrt?"
2020 Sep 14
2
Invalid transformation in LibCallSimplifier::replacePowWithSqrt?
On Mon, Sep 14, 2020 at 12:45 PM Sanjay Patel <spatel at rotateright.com>
wrote:
> Yes, that looks like a bug. The transform is ok in general for negative
> numbers, but -Inf is a special-case for pow(), right?
> If so, we probably need an extra check of the input with
> "isKnownNeverInfinity()".
>
There is an extra check there already, but it uses
2020 Sep 14
2
Invalid transformation in LibCallSimplifier::replacePowWithSqrt?
Sorry - I misread your example and the problem. I see now where
LibCallSimplifier creates the select...but we are immediately erasing that
select with the code from the godbolt example.
Does the real motivating case have no uses of the pow() result value?
On Mon, Sep 14, 2020 at 1:03 PM Sanjay Patel <spatel at rotateright.com> wrote:
> Yes, I mean just bail out on the transform in
>
2020 Oct 10
2
Undef and Poison round table follow-up & a plan
>
> Okay, it's just not immediately undefined behaviour. The C model has more
> issues because of the problem with how "trap representation" is defined
> (which precludes trap representations for unsigned char, two's complement
> signed char, etc.).
This interpretation is further stressed because C only explicitly ascribes
> undefined behaviour to trap
2007 Mar 22
2
[LLVMdev] a question about constant fold for fdiv
Reid Spencer wrote:
> On Thu, 2007-03-22 at 15:50 -0700, leo han wrote:
>
>> Hello, I have a question about the constant folding for fdiv instructions.
>> For the instruction "fdiv double 0.0, 0.0", the folded result is inf. I
>> think this should be nan. Can anyone tell me why it is not nan?
>>
>
> I think the specification says that it is
2007 Mar 22
0
[LLVMdev] a question about constant fold for fdiv
Jeff Cohen wrote:
> Reid Spencer wrote:
>> On Thu, 2007-03-22 at 15:50 -0700, leo han wrote:
>>
>>> Hello, I have a question about the constant folding for fdiv instructions.
>>> For the instruction "fdiv double 0.0, 0.0", the folded result is inf. I
>>> think this should be nan. Can anyone tell me why it is not nan?
>>>
2019 Jul 15
2
A libc in LLVM
On Mon, Jul 15, 2019 at 2:43 PM Siva Chandra <sivachandra at google.com> wrote:
>
> > On 7/15/19 1:22 PM, Aaron Ballman via llvm-dev wrote:
> > > On Mon, Jul 15, 2019 at 1:02 PM Siva Chandra <sivachandra at google.com> wrote:
> > >> On Fri, Jul 12, 2019 at 8:32 AM Aaron Ballman <aaron at aaronballman.com> wrote:
> > >>>> llvm-libc
2019 Jul 15
2
A libc in LLVM
On Fri, Jul 12, 2019 at 8:32 AM Aaron Ballman <aaron at aaronballman.com> wrote:
> > llvm-libc is an implementation of the C standard library targeting C11
> > and above.
>
> Any particular reason for C11 as opposed to C17?
Two reasons:
1. The C++17 standard refers to the C11 standard.
2. C11 is sufficiently modern while not closing doors for users
requiring compliance
2019 Jul 15
2
A libc in LLVM
On 7/15/19 1:22 PM, Aaron Ballman via llvm-dev wrote:
> On Mon, Jul 15, 2019 at 1:02 PM Siva Chandra <sivachandra at google.com> wrote:
>> On Fri, Jul 12, 2019 at 8:32 AM Aaron Ballman <aaron at aaronballman.com> wrote:
>>>> llvm-libc is an implementation of the C standard library targeting C11
>>>> and above.
>>> Any particular reason for C11
2017 Feb 14
2
RFC: Representing unions in TBAA
On Mon, Feb 13, 2017 at 10:07 AM, Hubert Tong <
hubert.reinterpretcast at gmail.com> wrote:
> On Mon, Feb 13, 2017 at 2:23 AM, Daniel Berlin via llvm-dev <
> llvm-dev at lists.llvm.org> wrote:
>
>>
>>> I don't think this fully solves the problem -- you'll also need to fix
>>> getMostGenericTBAA. That is, even if you implement the above scheme,
2008 May 28
2
home lan
I've read too many articles and posts on "domain master browser",
"computer master browser", "NT domain browser", "PDC and BDCs", etc.
etc. and I've managed to confuse my shrinking brain over this. I
apologize in advance if I'm posting a redundant question (I've looked
thru archivers best I could) or posting to the wrong place.
2007 Mar 10
3
long character string problem
Hi All
I am having 2 very long character strings (550chars) and I want to put them as
expressions together with c(). The problem is that I also get these
double-quotes, as seen below in 'fct'. How can I remove these double-quotes? I
tried as.name() but it did not work (because of size?). These are creating
trouble with subsequent programs, which I tested with strings that for some
2011 Jul 31
2
[LLVMdev] llvm bugzilla broken?
Is the llvm bugzilla having issues? I have been trying to submit comments under both
Snow Leopard and Lion from Safari, Firefox and Google Chrome. In all cases, the web page
for the bug refreshes at reasonable rate but commiting comments time out. Often partial
text is added to the bugzilla. See...
http://llvm.org/bugs/show_bug.cgi?id=10543#c17
http://llvm.org/bugs/show_bug.cgi?id=10543#c18
Very
2020 Aug 19
2
The value of padding when storing an aggregate into memory
Hello all,
LangRef isn't clear about the value of padding when an aggregate value is
stored into memory, and I'd like to suggest that storing an aggregate fills
padding with undef.
Here are a few clues that supports this change:
- According to C17, the value of padding bytes when storing values in
structures or unions is unspecified.
- IPSCCP ignores padding and directly stores a
2016 Sep 14
3
CentOS 6.8 and samba
> Not sure what would cause that error message, nor have I experienced it. Looks like other people have seen it:
> https://www.google.com/?gws_rd=ssl#q=gss_init_sec_context+failed+with+%5BUnspecified+GSS+failure.++Minor+code+may+provide+more+information:+No+credentials+cache+found
I found no way to get rid of this, although everything seems to work fine.
Red Hat need to push out an update
2020 Jul 09
2
Understand alias-analysis results
Hello,
I am performing alias analysis toward the following simple code:
struct MyStruct {
int * f1;
int * f2;
};
void NOALIAS(void* p, void* q){
}
int main() {
struct MyStruct s[2];
int a,b;
s[0].f1 = &a;
s[1].f1 = &b;
NOALIAS(s[a].f1, s[b].f2);
return 0;
}
When I use the following command to generate .bc code and conduct alias
analysis:
clang -c -emit-llvm t.c -O2
opt -basicaa
2016 May 27
2
Re: supermin init segfaults when kernel has large modules
Continuing the discussion from:
https://bugzilla.redhat.com/show_bug.cgi?id=1339691#c17
[Luiz: There's no need to subscribe to the mailing list, once I've
moderated your first message the others will go through.]
> IMO, supermin should use the kernel the host is running as a hint and
> try that one first. This shouldn't be hard to do.
>
> This BZ should be enough evidence
2019 May 24
2
Delinearization validity checks in DependenceAnalysis
[CC bollu, mferguson, shil]
Am Do., 23. Mai 2019 um 17:13 Uhr schrieb Bardia Mahjour <
bmahjour at ca.ibm.com>:
> Thanks David and Michael for the clarification.
>
> I think I understand the rational behind those checks in delinearization
> now.
>
> > Some other languages have stronger guarantees about their array
> dimensions accesses being in range. But this being
2017 Nov 03
2
ntfs user mappings?
That looks easier
I was working on ldap to convert but I'll try ldb-tools
I was off on a bash mission here is what I had so far it isn't correct
so I'll keep working on it
#!/bin/bash
if [ "$(echo $1|wc -c)" = "41" ];then
hex=$(echo $1|base64 -d| od -x -w28 --endian=big|head -n1|sed
's/^0000000 //'|sed 's/ //g')
echo ${hex}
hex_chunk=$(echo
2011 Aug 02
0
[LLVMdev] llvm bugzilla broken?
We have had some issues with commenting on bugs in bugzilla. I've attempted to determine the root problem but have been unsuccessful. We are due for an upgrade, so I'll be doing that this month and hopefully that will help this issue.
Sorry for the inconvenience and I agree its annoying.
-Tanya
On Jul 31, 2011, at 2:04 PM, Jack Howarth wrote:
> Is the llvm bugzilla having issues?
2017 Feb 13
2
RFC: Representing unions in TBAA
>
>
> I don't think this fully solves the problem -- you'll also need to fix
> getMostGenericTBAA. That is, even if you implement the above scheme,
> say you started out with:
>
> union U {
> int i;
> float f;
> };
>
> float f(union U *u, int *ii, float *ff, bool c) {
> if (c) {
> *ii = 10;
> *ff = 10.0;
> } else {
>