search for: division

...<result> = sdiv nof <ty> <op1>, <op2> ; yields ty:result <result> = udiv nof <ty> <op1>, <op2> ; yields ty:result Overview: If the keyword is present, the compiler can assume no zero values in the denominator. Moreover, for sdiv the division MIN_INT / -1 is prohibited. Otherwise, undefined behavior. Poison value is returned, in case of division by zero or MIN_INT/-1 if the keyword not present. Motivation: In the current state if the loop-vectorizer decides that it should vectorize a loop which contains a predicated integer div...

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 intrinsics...

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...

[+current llvm-dev address] On 03/15/2017 09:23 AM, Hal Finkel wrote: > Hi Samuel, > > What are you taking about? ;) > > The only way to get a SIGFPE from a floating-point division by zero is > to modify the floating-point environment to enable those exceptions. > We don't support that (*). In the default (supported) environment, > floating point division is well defined for all inputs (dividing by 0 > gives inf, by NaN gives, NaN, etc.). > > Regard...

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_d...

...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...

...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 s...

...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 t...

...ption for this test was: --apply-replaygain-which-is-not-lossless=Ln0) So this hack is really useless today, and the first patch removes fast_float_math_hack.h from the sources. MSVS profiler shows that tanh calculation doesn't require too much CPU resources, the real problem is an integer division (int_64/int_32) in this line: val64 = dither_output_(........) / conv_factor; Since all possible values of conv_factor are powers of 2, it's possible to replace division with shift. The second patch does this. Decoding time decreases from 94.5s to 64.1s for 32-bit ICC compile, and from...

...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]) return(c(x[1],merge(x[-1],y))) > else return(c(y[1],merge(x,y[-1]))) > } > > division <- function(x){ > if (is.na(x[3])) return(cbind(x[1],x[2])) > else > return(cbind(c(x[1],division(x[-c(1,2)])[,1]),c(x[2],division(x[-c(1,2)])[,2]))) > } > > mergesort <- function(x){ > if (is.na(x[2])) return(x) > else{ > print(x) > t=division(x...

...mail at philipreames.com>) wrote: > >> As the discussion has progressed and I've spent more time thinking >> about the topic, I find myself less and less enthused about the >> current proposal. I'm in full support of having idiomatic ways to >> express safe division, but I'm starting to doubt that using an >> intrinsic is the right way at the moment. >> >> One case I find myself thinking about is how one would combine >> profiling information and implicit div-by-zero/overflow checks with >> this proposal. I don't reall...

[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...

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",:inclu...

...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 >> &g...

...eemed just some weirdness in the files. However i just noticed something interesting from today's log, there seems to be something wrong with the capitalization of some filenames > deleting acdc/Back In Black/Back In Black.mp3 > deleting acdc/Back In Black/ > deleting Pink Floyd/The division Bell/Cluster one.mp3 > deleting Pink Floyd/The division bell/Keep tolking.mp3 > deleting Pink Floyd/The division bell/A great day for freedom.mp3 > ... > ACDC/Back In Black/ > ACDC/Back In Black/Back In Black.mp3 > Pink Floyd/The division Bell/A great day for freedom.mp3 > Pink...

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 intimately familiar with the implementation, so > there could be some subtlety that would prevent it.) This would work well for the constant expression division case, since the division by...

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...

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-bi...