search for: bitwise

Hi, I want to compute the bitwise 'and' between two values of type int1:  %x = and %a, %b  . Which is the LLVM instruction that creates this? I only found the APInt class, whose constructor is:  APInt(unsigned numBits, uint64_t val, bool isSigned = false) and which provides the bitwise AND operation: APInt  llvm::APInt...

Hi Language Lawyers! In PR23827 ( https://llvm.org/bugs/show_bug.cgi?id=23827 ), a bitwise op on booleans is considered equivalent to a logical op: if ((x < 3) & (y > 10)) effectively becomes: if ((x < 3) && (y > 10)) where x and y are of type 'int'. The second statement (&&) requires short-circuit evaluation to bypass the y comparison when...

...location immediately following the def). ''' Few important things to note about "valid GC reference": 1. There is no fixed notion of a valid GC reference. What constitutes a valid GC reference can change at arbitrary points in time. 2. There may not be a runtime bitwise predicate that can reliably distinguish a "valid" GC reference from an invalid one. The validity of a GC reference is a function of its provenance as well as its bitwise content. 3. (Related to the previous point) Arbitrary GEPs off of "valid GC references" ar...

On 03/09/2017 12:57 PM, Krzysztof Parzyszek wrote: > On 3/9/2017 12:47 PM, Hal Finkel wrote: >> >> On 03/09/2017 12:28 PM, Krzysztof Parzyszek via llvm-dev wrote: >>> We could add intrinsics to extract/insert a bitfield, which would >>> simplify a lot of that bitwise logic. >> >> But then you need to teach a bunch of places about how to simply them, >> fold using bitwise logic and other things that reduce demanded bits into >> them, etc. This seems like a difficult tradeoff. > > Bitfield extraction/insertion generally does not simp...

...g about it some more, I'd like to get other opinions about this. Chris and I talked last week about the need to canonicalize the types used for Neon vector shuffles so that they get CSEd. I guess this was an issue that came up for SSE. For pr4731, I changed llvm-gcc to canonicalize a bitwise vector operation to use i32 elements. For these operations, the type doesn't matter since the vector are treated as a bunch of bits. I was thinking that we should do the canonicalization for all the bitwise vector operations. But is llvm-gcc the right place to do that? The changes...

Hi, I would like to xor (bitwise) two matrices filled with binary values (0,1). The result of such XOR is expected to be 0,1. But apparently neither of xor nor bitXor is working in this case. I got ": binary operation on non-conformable arrays" error message when I used xor (M1,M2) . The problem with bitXor(M1,M2) is...

Hi, I have a question about unsigned bitwise shift. According the C99 6.5.7.4 The result of E1 << E2 is E1 left-shifted E2 bit positions; vacated bits are filled with zeros. If E1 has an unsigned type, the value of the result is E1 × 2^E2, reduced modulo one more than the maximum value representable in the result type. So if unsigne...

...vhost.git tags/uaccess_for_upstream for you to fetch changes up to 0795cb1b46e7938ed679ccd48f933e75272b30e3: sparc32: nocheck uaccess coding style tweaks (2015-01-13 15:24:14 +0200) ---------------------------------------------------------------- uaccess: fix sparse warning on get/put_user for bitwise types At the moment, if p and x are both tagged as bitwise types, some of get_user(x, p), put_user(x, p), __get_user(x, p), __put_user(x, p) might produce a sparse warning on many architectures. This is a false positive: *p on these architectures is loaded into long (typically using asm), then cas...

...vhost.git tags/uaccess_for_upstream for you to fetch changes up to 0795cb1b46e7938ed679ccd48f933e75272b30e3: sparc32: nocheck uaccess coding style tweaks (2015-01-13 15:24:14 +0200) ---------------------------------------------------------------- uaccess: fix sparse warning on get/put_user for bitwise types At the moment, if p and x are both tagged as bitwise types, some of get_user(x, p), put_user(x, p), __get_user(x, p), __put_user(x, p) might produce a sparse warning on many architectures. This is a false positive: *p on these architectures is loaded into long (typically using asm), then cas...

Hello, How can I do bitwise AND operations on a variable? I want to check the bits set in the HANGUPCAUSE, but can't find a way to do it. -- Alex Hermann

...ojects/libnftnl/downloads.html ftp://ftp.netfilter.org/pub/libnftnl/ Happy firewalling. -------------- next part -------------- Brett Mastbergen (1): include: Remove buffer.h Florian Westphal (1): expr: meta: add slave device matching Jeremy Sowden (9): Update gitignore. bitwise: fix some incorrect indentation. bitwise: add helper to print boolean expressions. include: update nf_tables.h. bitwise: add support for new netlink attributes. bitwise: add support for left- and right-shifts. tests: bitwise: fix error message. include: update nf...

...nged to #define hypercall_preempt_check() (unlikely( \ softirq_pending(smp_processor_id()) | \ (!(current->vcpu_info->evtchn_upcall_pending & \ current->vcpu_info->evtchn_upcall_mask)) \ )) In a lot of the code in Xen we are using the "!" operator with bitwise operations..this is one of those examples. -- Jerone Young IBM Linux Technology Center jyoung5@us.ibm.com 512-838-1157 (T/L: 678-1157) _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

..." should do that. But some tests proved they do not: > A<- 1 > B <- 2 > A [1] 1 > B [1] 2 > as.numeric(A&B) [1] 1 > as.numeric(A&&B) [1] 1 The binary content of A should be "10000" The binary content of B should be "01000" Therefore the bitwise AND operator should yield 0 ! I do not know how to fore the binary representation of an unsigned integer when writing R code. Do you know how to get around this problem ? Thank you so much. Maura tutti i telefonini TIM! [[alternative HTML version deleted]]

...ut 6 poss types). So an entry could be a Type A and a Type D; a Type C, D, E; just a Type F; etc. Having a join table would seem like it might get rather expensive since I''m going to want to know the types each time I call an entry. Seemed an obvious way would be to use an integer and bitwise ops, so that each bit in the integer represrented a type which could be on or off. Does anyone have any comments re the wisdom or otherwise of doing this? Would the benefits be outweighed by the calculation overhead? Any better way that I haven''t thought of? Cheers in advance Chris T...

...ly still be "<ty> addrspace(k)*" where k is >> specially noted in the datalayout. >> >> Semantics: >> >> 1. GCREF represents an equivalence class of values (equivalence >> relation being "points to a fixed semantic object"). The bitwise >> representation fluctuates constantly outside the compiler's >> control (the dual of `undef`), but may have invariants (in >> particular, we'd like to be able to specify alignment, nonnull >> etc.). At any given point in time all GCREF instance...

Hi, in my person model, I have a enumeration field "role" that take bits like 1, 2, 4, 8, 16, ..... they represent person roles(eg: admin(1), QA(2), manager(4) .... ). Each person can take on multiple roles. say there''s person A that''s both a admin and QA(the role value is "3") so if I search like "Person.find_by_content(''role:(1))", I

Can anyone give a brief, english synopsis of how this works? I must be missing something obvious, or maybe there IS a need to have 2 similarly labelled config options. Or maybe I'm lost in the goldbergian method that this applies permissions (take the real perms, bitwise OR them with the mask, then apply all the permissions NOT given, etc. etc.) Help a dummy? -- Edward Schernau http://www.schernau.com Network Architect mailto:ed@schernau.com Rational Computing Providence, RI, USA

...t; Few important things to note about "valid GC reference": >> >> 1. There is no fixed notion of a valid GC reference. What >> constitutes a valid GC reference can change at arbitrary points in >> time. >> >> 2. There may not be a runtime bitwise predicate that can reliably >> distinguish a "valid" GC reference from an invalid one. The >> validity of a GC reference is a function of its provenance as well >> as its bitwise content. > > I’m not sure what’s being said here, but a GC reference...

Hello all again, I want to do bitwise addition in R. I am trying to generate a matrix 0000 0001 0010 .... .... 1111 I know the other ways of generating this matrix but I need to look at bitwise addition. Any suggestions??? thanks a lot Nameeta ------------------------------------------------- This email is intended only for the...

...ruth" <chandlerc at google.com> > To: "Sanjay Patel" <spatel at rotateright.com>, "Clang" <cfe-dev at cs.uiuc.edu>, llvmdev at cs.uiuc.edu, > joerg at britannica.bec.de > Sent: Friday, June 26, 2015 8:55:22 PM > Subject: Re: [LLVMdev] [cfe-dev] bitwise ops on booleans > > > On Fri, Jun 26, 2015 at 2:01 PM Sanjay Patel < spatel at rotateright.com > > wrote: > > On Fri, Jun 26, 2015 at 2:17 PM, Joerg Sonnenberger < > joerg at britannica.bec.de > wrote: > > On Fri, Jun 26, 2015 at 12:51:38PM -0600, Sanjay...