search for: laundered

...st be stripped first, because we want the comparison to provide information about the address equality, and not about invariant group equality- likewise, whenever a pointer is to be cast to an integer type, it must be stripped first- whenever an integer is cast to a pointer type, the result must be laundered before it is used, to prevent reasoning about the equality of integers to provide any information about equality of invariant groupsNote that adding calls to strip and launder related to pointer comparisons and integer<->pointer conversions will not cause any semantic information to be lost:...

...ripped first, because we want the comparison to provide information about the address equality, and not about invariant group equality > likewise, whenever a pointer is to be cast to an integer type, it must be stripped first > whenever an integer is cast to a pointer type, the result must be laundered before it is used, to prevent reasoning about the equality of integers to provide any information about equality of invariant groups > > Note that adding calls to strip and launder related to pointer comparisons and integer<->pointer conversions will not cause any semantic information...

..., > because we want the comparison to provide information about the address > equality, and not about invariant group equality- likewise, whenever a > pointer is to be cast to an integer type, it must be stripped first- > whenever an integer is cast to a pointer type, the result must be laundered > before it is used, to prevent reasoning about the equality of integers to > provide any information about equality of invariant groupsNote that adding > calls to strip and launder related to pointer comparisons and > integer<->pointer conversions will not cause any semantic info...

Hi folks, please check out our RFC: Supported Optimizations attribute https://docs.google.com/document/d/1s0n-JVaSNML1Z9SCZVg2bgisxswIJAK2Tp9DahucW10/edit?usp=sharing Pasting it here for the record: RFC: supported_optimizations attribute Piotr Padlewski - piotr.padlewski at gmail.com Krzysztof Pszeniczny - kpszeniczny at google.com December 2018 Introduction Sometimes a possible class of

...till doesn't solve some of the problems I personally need to solve with invariant loads. :) > > I take it that the actual devirtualization here is ultimately still done by forwarding a visible store of the v-table pointer to an invariant load, just by noticing that they occur to the same laundered pointer and therefore must involve the same value. There's no way of saying "I know what the value of the v-table pointer is even if you can't see a store" when creating a laundered pointer. For example, in Swift we have constructor functions that are known to return a complete...

...>> problems I personally need to solve with invariant loads. :) >> >> I take it that the actual devirtualization here is ultimately still done >> by forwarding a visible store of the v-table pointer to an invariant load, >> just by noticing that they occur to the same laundered pointer and >> therefore must involve the same value. There's no way of saying "I know >> what the value of the v-table pointer is even if you can't see a store" >> when creating a laundered pointer. For example, in Swift we have >> constructor functions...

On Sat, Jul 25, 2015 at 12:39 PM, Hal Finkel <hfinkel at anl.gov> wrote: > Hi Piotr, > > Thanks for posting this! First, a question. When you say, regarding i8* > @llvm.invariant.group.barrier(i8*): > > "Required to handle destructors, placement new and std::launder. Call of > this function will be put on the end of each of this functions" > > I

Hi Piotr, Thanks for posting this! First, a question. When you say, regarding i8* @llvm.invariant.group.barrier(i8*): "Required to handle destructors, placement new and std::launder. Call of this function will be put on the end of each of this functions" I completely understand placement new and std::launder. I don't understand destructors, could you explain? Also, am I correct

...sn't solve some of the problems I personally need to solve with invariant loads. :) >> >> I take it that the actual devirtualization here is ultimately still done by forwarding a visible store of the v-table pointer to an invariant load, just by noticing that they occur to the same laundered pointer and therefore must involve the same value. There's no way of saying "I know what the value of the v-table pointer is even if you can't see a store" when creating a laundered pointer. For example, in Swift we have constructor functions that are known to return a complete...

śr., 5 gru 2018 o 00:22 John McCall via cfe-dev <cfe-dev at lists.llvm.org> napisał(a): > On 4 Dec 2018, at 17:50, Philip Reames wrote: > > Skimming along, apologies if I'm repeating something which already got > said. > > If I understand this correctly, the basic problem we're trying to solve is > to use a local hint (the invariant.group) to make a global

Hi I have just installed Dovecot (Moved from Courier-IMAP) and have just about everything running well thanks to some great docs in the wiki (Thank you to all those who contributed!) however I have not managed to get the quota warnings working yet. I have done much Googling and come back with some oldish posts which help me to understand how the quota warnings work but having looked at

Hurray! Hopefully, he'll get put away for a while. Charged with SPAMming, money laundering, fraud, etc. Mike -- p="p=%c%s%c;main(){printf(p,34,p,34);}";main(){printf(p,34,p,34);} Oppose globalization and One World Governments like the UN. This message made from 100% recycled bits. You have found the bank of Larn. I can explain it for you, but I can't understand it for you. I

On Wed, Feb 03, 2016 at 01:17:42PM +0100, Pino Toscano wrote: > Introduce a new read-only API to get a path where to store temporary > sockets: this is different from tmpdir, as we need short paths for > sockets (due to sockaddr_un::sun_path), and it is either > XDG_RUNTIME_DIR if set, or /tmp; adapt guestfs_int_create_socketname > to create sockets in that location. > >

Working on a downstream optimization which uses CaptureTracking (CT) I came across a coupling problem. It looks like optimizations and analyses which use CT often need to be in sync with CT implementation. Analyzing the uses of the given pointer CT handles three kinds of uses: * Simple non-capturing use. When one is encountered, CT just moves on. * Non-capturing, but produces another value,

Hello, I was trying to compile Flac on MinGW/Msys but got an error stating SIZE_T_MAX is undefined. To fix this error I edited the file "flac-1.2.1/include/share/alloc.h" and made the following change: Starting at line #36 I changed: #ifndef SIZE_MAX # ifndef SIZE_T_MAX # ifdef _MSC_VER # define SIZE_T_MAX UINT_MAX # else # error # endif # endif # define SIZE_MAX SIZE_T_MAX

I think we should have some bounds on how "badly" a supported_optimizations tag on a function can affect its semantics. For instance, can a "supported_optimizations" invariant be that "the CFG is always structured"? Or (exaggerating to illustrate the point) "the function has an equal number of loads and stores"? -- Sanjoy On Mon, Dec 3, 2018 at 8:52 PM

Hi folks, this summer I will work with Richard Smith on clang devirtualization. Check out our proposal: https://docs.google.com/document/d/1f2SGa4TIPuBGm6y6YO768GrQsA8awNfGEJSBFukLhYA/edit?usp=sharing And modified LangRef http://reviews.llvm.org/D11399 You can also check out previous disscussion that was started before our proposal was ready -

On Monday 08 February 2016 19:34:10 Richard W.M. Jones wrote: > On Wed, Feb 03, 2016 at 01:17:42PM +0100, Pino Toscano wrote: > > Introduce a new read-only API to get a path where to store temporary > > sockets: this is different from tmpdir, as we need short paths for > > sockets (due to sockaddr_un::sun_path), and it is either > > XDG_RUNTIME_DIR if set, or /tmp; adapt

The attached patch is needed to make flac build on Solaris. Can some/all of these changes go upstream? Brian -------------- next part -------------- A non-text attachment was scrubbed... Name: flac-01-forte.diff Type: text/x-patch Size: 3186 bytes Desc: not available Url : http://lists.xiph.org/pipermail/flac-dev/attachments/20070124/c752fe5e/flac-01-forte-0001.bin

will surgent wrote: > Hello, I was trying to compile Flac on MinGW/Msys but got an error stating > SIZE_T_MAX is undefined. > To fix this error I edited the file "flac-1.2.1/include/share/alloc.h" and > made the following change: <snip> > #ifndef SIZE_MAX > # ifndef SIZE_T_MAX > # ifdef _MSC_VER > # define SIZE_T_MAX UINT_MAX > # elif