search for: unexecuted

I downloaded Baldur's Gate II but I can't Install it because it's an unexecutabe bit

...07:42, Diego Novillo <dnovillo at google.com> wrote: > > On Tue, May 26, 2015 at 11:47 PM, Lee Hunt <leehu at exchange.microsoft.com> wrote: > >> For example, from reading different pages on how Clang PGO, it’s unclear if >> it does “block reordering” (i.e. moving unexecuted code blocks to a distant >> code page, leaving only ‘hot’ executed code packed together for greater code >> density). I find mention of “hot arc” optimization (-fprofile-arcs) , but >> I’m unclear if this is the same thing. Does Clang PGO do block reordering? > > A small...

...e optimizations that PGO does, but I don't find much from looking at the Clang PGO section: http://clang.llvm.org/docs/UsersManual.html#profile-guided-optimization. For example, from reading different pages on how Clang PGO, it's unclear if it does "block reordering" (i.e. moving unexecuted code blocks to a distant code page, leaving only 'hot' executed code packed together for greater code density). I find mention of "hot arc" optimization (-fprofile-arcs) , but I'm unclear if this is the same thing. Does Clang PGO do block reordering? Thanks, --Lee ---------...

...lo <dnovillo at google.com> wrote: >> >> On Tue, May 26, 2015 at 11:47 PM, Lee Hunt <leehu at exchange.microsoft.com> wrote: >> >>> For example, from reading different pages on how Clang PGO, it’s unclear if >>> it does “block reordering” (i.e. moving unexecuted code blocks to a distant >>> code page, leaving only ‘hot’ executed code packed together for greater code >>> density). I find mention of “hot arc” optimization (-fprofile-arcs) , but >>> I’m unclear if this is the same thing. Does Clang PGO do block reordering? >&gt...

...n time. If it becomes a problem for some, there is a way to handle that -- but at a cost of more memory required (to be conservative). One of the good feature of using dynamic memory is that it allows counter array allocation on the fly which eliminates the need to allocate memory for lots of cold/unexecuted functions. > We also added > dependency on the usage of mutexes to prevent memory leaks in the case > multiple threads trying to insert a new target address for the same IC > site into the linked list. To least impact the performance we only added > mutexes around the pointer assign...

This is yet another problem with the Nabble interface to the list. On Wed, Feb 29, 2012 at 6:21 PM, Richard M. Heiberger <rmh at temple.edu> wrote: > This line > > ?TT <- *Temp*+273.15 > makes it unexecutable. ?that is not the error you mentioned. On nabble, that variable is in bold. When it's reformatted for the plain-text email list, the formatting is converted to **

...allocator etc. [LeeHu]: sorry for naïve question, but what is IPA? And what post-inline optimizations are currently being done? We’re currently using Clang 3.5 if that matters. For example, from reading different pages on how Clang PGO, it’s unclear if it does “block reordering” (i.e. moving unexecuted code blocks to a distant code page, leaving only ‘hot’ executed code packed together for greater code density). LLVM's block placement uses branch probability and frequency data, but there is no function splitting optimization yet. I find mention of “hot arc” optimization (-fprofile-arcs) ,...

...some, there is a way to handle that -- but >> at a cost of more memory required (to be conservative). One of the >> good feature of using dynamic memory is that it allows counter array >> allocation on the fly which eliminates the need to allocate memory for >> lots of cold/unexecuted functions. >> >>> We also added >>> dependency on the usage of mutexes to prevent memory leaks in the case >>> multiple threads trying to insert a new target address for the same IC >>> site into the linked list. To least impact the performance we only >...

I''ve been using RSpec in anger for perhaps a total of a few days and just started playing with Story Runner. Love it. I also started working on a patch, which ought to be simple, to allow for Scenarios without supplied blocks to be treated as pending -- much like "it" in Spec::DSL::ExampleAPI. That said, I noticed something that seemed odd and chatted with Rein

Hi, > > I think he means the lines like: > > > > switch (Opcode) { > > > > default: assert(0 && "Unknown load!"); > > > > > > where the default case is never executed. > > > I would personally appreciate expected to fail tests that ensure the > assertions actually catch the bad inputs that they were designed to

...estion, but what is IPA? Inter-procedural analysis/optimizations. And what post-inline optimizations are currently being done? We’re currently using Clang 3.5 if that matters. For example, from reading different pages on how Clang PGO, it’s unclear if it does “block reordering” (i.e. moving unexecuted code blocks to a distant code page, leaving only ‘hot’ executed code packed together for greater code density). LLVM's block placement uses branch probability and frequency data, but there is no function splitting optimization yet. I find mention of “hot arc” optimization (-fprofile-arcs) ,...

...estion, but what is IPA? Inter-procedural analysis/optimizations. And what post-inline optimizations are currently being done? We’re currently using Clang 3.5 if that matters. For example, from reading different pages on how Clang PGO, it’s unclear if it does “block reordering” (i.e. moving unexecuted code blocks to a distant code page, leaving only ‘hot’ executed code packed together for greater code density). LLVM's block placement uses branch probability and frequency data, but there is no function splitting optimization yet. I find mention of “hot arc” optimization (-fprofile-arcs) ,...

...gt; >>> On Tue, May 26, 2015 at 11:47 PM, Lee Hunt <leehu at exchange.microsoft.com> >>> wrote: >>> >>>> For example, from reading different pages on how Clang PGO, it’s unclear >>>> if >>>> it does “block reordering” (i.e. moving unexecuted code blocks to a >>>> distant >>>> code page, leaving only ‘hot’ executed code packed together for greater >>>> code >>>> density). I find mention of “hot arc” optimization (-fprofile-arcs) , >>>> but >>>> I’m unclear if this...

...that -- but >>>> at a cost of more memory required (to be conservative). One of the >>>> good feature of using dynamic memory is that it allows counter array >>>> allocation on the fly which eliminates the need to allocate memory for >>>> lots of cold/unexecuted functions. >>>> >>>>> We also added >>>>> dependency on the usage of mutexes to prevent memory leaks in the case >>>>> multiple threads trying to insert a new target address for the same IC >>>>> site into the linked list. To l...

...error message? If so where should this go in lit's code? * I've not tested these patches on OSX or Windows. Is anyone on those platforms willing to give them a try? * The behaviour of --max-individual-test-time is a little at odds with the behaviour of --max-time. --max-time will mark unexecuted tests as UNRESOLVED whereas --max-individual-test-time will mark a test that ran out of time as TIMEOUT. Is this okay? * @Chris Matthews. Does the code that emits xunit xml files need to change in anyway? * @Daniel Dunbar. If these changes (in some form) end up being committed would you be happy...

...estion, but what is IPA? Inter-procedural analysis/optimizations. And what post-inline optimizations are currently being done? We’re currently using Clang 3.5 if that matters. For example, from reading different pages on how Clang PGO, it’s unclear if it does “block reordering” (i.e. moving unexecuted code blocks to a distant code page, leaving only ‘hot’ executed code packed together for greater code density). LLVM's block placement uses branch probability and frequency data, but there is no function splitting optimization yet. I find mention of “hot arc” optimization (-fprofile-arcs) ,...

Further to the email below from a few weeks ago, I can announce that Xen/Linux 2.6 handles the TLS problem (-ve accesses into segments) by dynamically rewriting the offending instructions. This is enabled by default in the 2.6 kernels, and reduces the overhead of handling those instructions to almost zero (compared with around 100% overhead when using pure emulation in Xen, when running

Hi, I have set up asterisk to run as non root, and allow admin users to log in to the server as asterisk, which gives them privileges to edit configs in the asterisk home directory. As for connecting to the console with 'asterisk -r' - this by default does not work as asterisk is owned stored in /usr/sbin/asterisk I am reading that the best way to solve this is to use 'visudo' -