search for: divisions

Introduction: We would like to add new keyword to 'sdiv'\'udiv' instructions i.e. 'no-overflow'. This is the updated solution devised in the discussion: http://lists.llvm.org/pipermail/llvm-dev/2017-October/118257.html The proposed keywords: "nof" stands for 'no-overflow' Syntax: <result> = sdiv nof <ty> <op1>,

Introduction ========== We would like to add support for masked vector signed/unsigned integer division and remainder in the LLVM IR by introducing new target-independent intrinsics. This follows similar work which was done already for masked vector loads and stores - http://lists.llvm.org/pipermail/llvm-dev/2014-October/078059.html. Another relevant reference is the masked scatter/gather

I have a nice hierarchical table structure like this: divisions has_many groups groups belongs_to division has_many subgroups subgroups belongs_to group has_many units units belongs_to subgroup I have a report which is based on units, but i want to be able to filter the units by which subgroup, or which group, or which division. I also want to sort them b...

...;> get a SIGFPE signal. The code that drives the change in the optimizer >> relies on `llvm::isSafeToSpeculativelyExecute` to decide whether the >> division should be performed speculatively. Right now, this function >> returns true. One could do something similar to integer divisions and >> add a case there (this solved the issue for me): >> ``` >> diff --git a/lib/Analysis/ValueTracking.cpp >> b/lib/Analysis/ValueTracking.cpp >> index 1761dac..c61fefd 100644 >> --- a/lib/Analysis/ValueTracking.cpp >> +++ b/lib/Analysis/ValueTracking....

It seems division with numbers bigger than 10 000 000 doesn't work 20000000/21 [1] 952381 > 55555555/23 [1] 2415459 Thank you

...t timesheets.employee, sum(items.hours) as hours, sum(items.hours*timesheets.cost) as cost, sum(items.hours*timesheets.charge*decode(activities.chargetype,0,1,0)) as charge, sum(items.hours*decode(activities.chargetype,0,1,0)) as chargehours from timesheets, contacts, items, activities, employees, divisions where contacts.com_branch_id = 241 and employees.contact_id = contacts.CONTACT_ID and contacts.expired=0 and timesheets.id = items.timesheet and activities.id = items.activity and employees.id=timesheets.employee and divisions.id=employees.division and timesheets.status = 3 and timesheets.start_da...

...e potentially >> unsound. But I don't have data to actually show this (yet). > > I *think* I may have been unclear about my assumptions; in particular, > my claims with respect to deoptimization are probably more subtle than > they appeared. WebKit can use LLVM and it has divisions and we do all > possible deoptimization/profiling/etc tricks for it, so this is > grounded in experience. Forgive me if the rest of this e-mail > contains a lecture on things that are obvious - I'll try to err on the > side of clarity and completeness since this discussion is s...

...n are potentially unsound. But  > I don't have data to actually show this (yet).  >  > I *think* I may have been unclear about my assumptions; in particular, my  > claims with respect to deoptimization are probably more subtle than they  > appeared. WebKit can use LLVM and it has divisions and we do all possible  > deoptimization/profiling/etc tricks for it, so this is grounded in  > experience. Forgive me if the rest of this e-mail contains a lecture on  > things that are obvious - I'll try to err on the side of clarity and  > completeness since this discussion is su...

...9;t have data to actually show this (yet). >>> >>> I *think* I may have been unclear about my assumptions; in >>> particular, my claims with respect to deoptimization are probably >>> more subtle than they appeared. WebKit can use LLVM and it has >>> divisions and we do all possible deoptimization/profiling/etc tricks >>> for it, so this is grounded in experience. Forgive me if the rest >>> of this e-mail contains a lecture on things that are obvious - I'll >>> try to err on the side of clarity and completeness since th...

The file src/share/replaygain_synthesis/include/private/fast_float_math_hack.h redefines 'tanh' as 'tanhf'. This file is intended for Intel Compiler only, but it includes outdated mathf.h and doesn't work with current versions of ICC. The fixes are trivial though, and I compiled 2 versions of flac.exe: with this 'hack' turned off an on. The difference in decoding speed

Hello everyone, I am learning R since recently, and as a small exercise I wanted to write a recursive mergesort. I was extremely surprised to discover that my sorting, although operational, is deeply inefficient in time. Here is my code : > merge <- function(x,y){ > if (is.na(x[1])) return(y) > else if (is.na(y[1])) return(x) > else if (x[1]<y[1])

On 04/29/2014 10:44 AM, Filip Pizlo wrote: > LD;DR: Your desire to use trapping on x86 only further convinces me > that Michael's proposed intrinsics are the best way to go. I'm still not convinced, but am not going to actively oppose it either. I'm leery of designing a solution with major assumptions we don't have data to backup. I worry your assumptions about

[I was dropped from cc in the initial response but I'd appreciate if you could keep it this time around since I'm not subscribed to this list. Thanks!] Ady wrote: > I do not know the exact complete procedure that the TAILS team is using > to build the original ISO image, and how it is transformed into an > isohybrid image (there are multiple tools for each, sometimes >

Hi Team, I observer that division of __int128 bit is very heavy operation. It internally call a routine '__udivti3', which internally call ' __udivmodti4'. Due to it the overall performance is much much slower (almost 15 time slower than if I do it via a combination of 64-bit or microsoft '_udiv128'). Also what to know if I can directly call below routine directly from

Each Timesheet has an employee. An employee has a division and a location. I want to find all the timesheets with a status of 2. I then iterate over the timesheet collection and print the timesheet name, employee name, employee divison name, and employee location name. Like so: for t in Timesheet.find(:all,:conditions=>"status=2",:include=>:employee) puts timesheet.date

...e data to actually show this (yet). >> > >> > I *think* I may have been unclear about my assumptions; in >> particular, my >> > claims with respect to deoptimization are probably more subtle than >> they >> > appeared. WebKit can use LLVM and it has divisions and we do all >> possible >> > deoptimization/profiling/etc tricks for it, so this is grounded in >> > experience. Forgive me if the rest of this e-mail contains a lecture on >> > things that are obvious - I'll try to err on the side of clarity and >> &gt...

Hi everybody, i've been using rsync for quite some time to sync files between my laptop and my desktop for example i use the following to backup the music library (from Mac to Linux) > rsync -rvzu --exclude=.DS_Store --delete --exclude 'Podcasts/*' > $LOCAL_MUSI $REMOTE_MUSIC >> $LOGFILE An odd thing i always noticed is that some files were always copied, even

Hey Jeffrey, Thanks for the suggestion. A few comments... On Sun, Apr 7, 2013 at 12:31 PM, Jeffrey Yasskin <jyasskin at googlers.com>wrote: ... > > If you can find a way to implement -fsanitize=undefined to use the FP > trap instead of a branch when checking floating division by 0, I > suspect such a patch would stand a good chance of being accepted. > (Although I'm not

Dear R gurus. Is there an R function equivalent to octaves / (Right division) withouth forming the inverse of Y' using solve ? [snip - from octave docu] Right division. This is conceptually equivalent to the expression (inverse (y') * x')' but it is computed without forming the inverse of Y'. If the system is not square, or if the coefficient matrix

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