search for: remainder

I'm not mathematically gifted, but shouldn't 957%60 be 15 remainder 57? Google and my desktop calculator certainly think so. So where am I going wrong here? The following code exten => 7,1,Verbose(Context: ${CONTEXT} Exten:${EXTEN}) same => n,Set(myNum=957) same => n,Set(sec=$[REMAINDER(${myNum},60)]) same => n,Set(sec=$[ABS(${sec})])...

OK, the code for sdivrem in APInt.h is wrong. Here's what's written: static void sdivrem(const APInt &LHS, const APInt &RHS, APInt &Quotient, APInt &Remainder) { if (LHS.isNegative()) { if (RHS.isNegative()) APInt::udivrem(-LHS, -RHS, Quotient, Remainder); else APInt::udivrem(-LHS, RHS, Quotient, Remainder); Quotient = -Quotient; Remainder = -Remainder; } else if (RHS.isNegative()) { APInt::udivrem(LHS, -RHS,...

I wrote the following bit of code static APInt FloorOfQuotient(APInt a, APInt b) { unsigned bits = a.getBitWidth(); APInt q(bits, 1), r(bits, 1); APInt::sdivrem(a, b, q, r); * errs() << "sdivrem(" << a << ", " << b << ") = (" << q << ", " << r << ")\n"; * if (r == 0) return q; else {

Hi Hameeza, Aside from Ashutosh's patch..... When the vector width is that large, we can't keep vectorizing remainder like below. It'll be a huge code size if nothing else ---- hitting ITLB miss because of this is very bad, for example. VF=2048 // main vector loop VF=1024 // vectorized remainder 1 VF=512 // vectorized remainder 2 ... Vectorize remainder until trip count is small enough for scalar execut...

>it cannot afford large size masks for large vectors So, even a standard way of vectorizing remainder in masked or unmasked fashion wouldn’t work, I suppose. Ouch. I suppose VPlan should be able to model this kind of gigantic remainder vector code (when the time comes). Not pretty at all, though. Now, be fully aware that Direction #2 is really a poor (or rather extremely poor) person’s remainder...

Some time ago I tried to find out how to compute remainders in R. I now know that it is done with %%, which is documented in help('+'), but before someone told me that I tried: help('remainder'), help.search('remainder'), apropos('remainder') help('modulo'), help.search('modulo'), and apropos('modulo&...

...ngle_connector_modes], [CONNECTOR:11:VGA-1] [ 5.264489] [drm:drm_helper_probe_single_connector_modes], [CONNECTOR:11:VGA-1] disconnected [ 5.264508] [drm:drm_helper_probe_single_connector_modes], [CONNECTOR:13:LVDS-1] [ 5.302438] [drm:drm_edid_block_valid] *ERROR* EDID checksum is invalid, remainder is 239 [ 5.339425] [drm:drm_edid_block_valid] *ERROR* EDID checksum is invalid, remainder is 239 [ 5.376396] [drm:drm_edid_block_valid] *ERROR* EDID checksum is invalid, remainder is 239 [ 5.414088] [drm:drm_edid_block_valid] *ERROR* EDID checksum is invalid, remainder is 239 [ 5.415422...

...(x){ prefix <- strsplit(x, "[0-9]") prefix <- sapply(prefix, "[", 1) prefix[is.na(prefix)] <- "" suffix <- strsplit(x, "[^0-9]") suffix <- as.numeric(sapply(suffix, "[", 2)) suffix[is.na(suffix)] <- -Inf remainder <- sub("[^0-9]+", "", x) remainder <- sub("[0-9]+", "", remainder) if (all (remainder == "")) list(prefix, suffix) else c(list(prefix, suffix), Recall(remainder)) } ord <- do.call("order", sort.helper(x)) x[ord...

Hello, I m working on a hardware with very large vector width till v2048. Now when I vectorize using llvm default vectorizer maximum 2047 iterations are scalar remainder loop. These are not vectorized by llvm which increases the cost. However these should be vectorized using next available vector width I.e v1024, v512, v256, v128, v64, v32, v16, v8, v4..... The issue of scalar remainder loop has been there in llvm but this issue is enhanced and can't be ignore...

> On Tue, Apr 01, 2014 at 02:53:02PM -0400, Ilia Mirkin wrote: >I believe that ch7006 is the only external encoder that's supposed to >work, so you're in luck. It sounds like it passes the nv04_tv_identify >stage of nv04_tv_create -- perhaps it fails later? Although based on >the prints, it's even doing dpms stuff (but it hits _detect a second >time... odd). Try

hi netters Is there a function in R that can compute the quotient and remainder of a division calculation? such that when 11 is given as the dividend and 5 the divider, the function returns 2(quotient) and 1(remainder). Thanks a lot! _________________________________________________________________ 伱佲伔佈佅伮佋佖 MSN Explorer: http://explorer.msn.com/lccn/

...6 +#define PROTOCOL_VERSION 27 /* We refuse to interoperate with versions that are not in this range. * Note that we assume we'll work with later versions: the onus is on @@ -406,7 +406,8 @@ OFF_T flength; /**< total file length */ size_t count; /**< how many chunks */ size_t remainder; /**< flength % block_length */ - size_t n; /**< block_length */ + size_t blength; /**< block_length */ + size_t s2length; /**< sum2_length */ struct sum_buf *sums; /**< points to info for each chunk */ }; --- proto.h Sat Mar 29 12:18:02 2003 +++ proto.h Sat Mar 29 12:15:38...

...static const char *const *const units_str[] = { > [STRING_UNITS_10] = units_10, > @@ -42,31 +44,58 @@ void string_get_size(u64 size, const enum string_size_units units, > [STRING_UNITS_2] = 1024, > }; > int i, j; > - u32 remainder = 0, sf_cap; > + u32 remainder = 0, sf_cap, exp; > char tmp[8]; > + const char *unit; > > tmp[0] = '\0'; > i = 0; > - if (size >= divisor[units]) { > - while (size >= divisor[units]) { > -...

...static const char *const *const units_str[] = { > [STRING_UNITS_10] = units_10, > @@ -42,31 +44,58 @@ void string_get_size(u64 size, const enum string_size_units units, > [STRING_UNITS_2] = 1024, > }; > int i, j; > - u32 remainder = 0, sf_cap; > + u32 remainder = 0, sf_cap, exp; > char tmp[8]; > + const char *unit; > > tmp[0] = '\0'; > i = 0; > - if (size >= divisor[units]) { > - while (size >= divisor[units]) { > -...

...-- although proving it works may be difficult, > since so little code actually uses exceptions (only TableGen in llvm ?). Peter, I think this will be done lazily to avoid excessive splitting as in: Call1 -> LP Call2 -> LP Call3 -> LP => split Call1 Call1 -> LP-split -> LP-remainder Call2 -> LP-split-merge -> LP-remainder Call3 -> LP-split-merge -> LP-remainder But John will know best. -Andy -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110805/d164804f/attachment.html>

...q0"); + return ret; +} +#undef WORD2INT +#define WORD2INT(x) (saturate_float_to_16bit(x)) + +#define OVERRIDE_INNER_PRODUCT_SINGLE +/* Only works when len % 4 == 0 */ +static inline float inner_product_single(const float *a, const float *b, unsigned int len) +{ + float ret; + uint32_t remainder = len % 16; + len = len - remainder; + + asm volatile (" cmp %[len], #0\n" + " bne 1f\n" + " vld1.32 {q4}, [%[b]]!\n" + " vld1.32 {q8}, [%[a]]!\n" + " subs %[remainder], %[remainder], #4\n" + " vmul.f32 q0, q4, q8\n&q...

...(x){ prefix <- strsplit(x, "[0-9]") prefix <- sapply(prefix, "[", 1) prefix[is.na(prefix)] <- "" suffix <- strsplit(x, "[^0-9]") suffix <- as.numeric(sapply(suffix, "[", 2)) suffix[is.na(suffix)] <- -Inf remainder <- sub("[^0-9]+", "", x) remainder <- sub("[0-9]+", "", remainder) if (all (remainder == "")) list(prefix, suffix) else c(list(prefix, suffix), Recall(remainder)) } ord <- do.call("order", sort.helper(x)) x[ord...

...testing, which should not be the case. Discovered performance was limited by CSUM_CHUNK reads for multiple checksum types. Have observed near 3x performance gains in rsync --checksum from cached files with xxhash on the i7-7700hq. P.S. Wayne, in the xxhash part of file_checksum(), processing the remainder reads CHUNK bytes rather than remainder bytes like the other hashes do. I don't think it matters, but just in case. GitHub: https://github.com/Chainfire/rsync/commit/aa5ddaae5018180952a09ffaffc1ace88a1fe99d (.patch) -- >From aa5ddaae5018180952a09ffaffc1ace88a1fe99d Mon Sep 17 00:00:00 200...

...e. i8 data type with 256bits target register can vectorize with >> vector width 32, with that maximum trip count possibility for >> scalar(epilog) loop is 31, which is significant & worth vectorizing. >> Large vector factor has following challenges: >> 1)Possibility of remainder iteration is substantial. >> 2)Actual trip count at runtime is substantial but not meeting minimum >> trip count to execute vector loop. >> These challenges can be addressed by mask instructions, but these >> instructions are limited and may not be available to all targets...

...PM To: Hal Finkel <hfinkel at anl.gov>; Adam Nemet <anemet at apple.com>; Nema, Ashutosh <Ashutosh.Nema at amd.com> Cc: llvm-dev <llvm-dev at lists.llvm.org> Subject: RE: [llvm-dev] [Proposal][RFC] Epilog loop vectorization +1 for “just rerun the vectorizer” on the scalar remainder loop, as the proposed decision process is broken down into “first determine best VF for main loop, then determine best next EpilogVF for remainder loop” anyhow: const LoopVectorizationCostModel::VectorizationFactor EpilogVF = CM.identifyNextProfitableVF(VF.Width); Raising some aspect...