search for: miv

...e="text/javascript"> Event.observe(''id1'', ''keypress'', function(event) { if (event.keyCode == Event.KEY_RETURN) { event.keyCode = Event.KEY_TAB }}); </script> Any idea appreciable! Best regards Janko -- Janko Mivšek AIDA/Web Smalltalk Web Application Server http://www.aidaweb.si --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Spinoffs" group. To post to this group, send email to rubyonrails-spinoffs-/J...

...t: https://sites.google.com/site/parallelizationforllvm/weak-zero-siv-test - the Weak-Crossing SIV test: https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test - the Exact SIV test: https://sites.google.com/site/parallelizationforllvm/weak-siv-test and our first MIV test: - the RDIV test: https://sites.google.com/site/parallelizationforllvm/rdiv-test If you have any thoughts about this code, I'd be very interested in hearing them. I'm going to take a break from working on these low-level tests and spend some time working top-down on the high-l...

Hi all, Sorry for having been quiet for so long, I have my university exams going on, and will be able to contribute only after the coming Friday. Thanks! -- Sanjoy Das http://playingwithpointers.com

...the xp kind of menus with white background. I don't have any other applications with menus like that, but my guess is that it would happend the same with others. The problem is that the menu opens white and only when I move the mouse over it the text appears. (I have a screenshot at http://miv.directnet.ro/dlm.jpg ) I am running wine 20041019 with IE, DCOM and other libraries installed by WineTools) and fake windows. DvdLab is 1.53 Pro. Note that I don't get absolutely no errors on the console. -- --------------------------------------------------- Besides, I think Slackware soun...

I MAY be able to derive something out of the present example given here : http://blog.codeinmotion.com/index.php/2006/12/22/pdf-generation-in-ruby-on-rails/ but this deals with filling out forms. Is there a simpler example that just allows you to talk to itext , send it some plain text and get back a pdf and then send that pdf to the user as downloadable / renderable data? -- Posted via

...oops or with a user guard like below: if (c) { for (i = 0; i < n; i++) ... } for (j = 0; j < n; j++) ... The specific example that we ran into is described in https://reviews.llvm.org/D75628. Basically we have two triangular loops that are siblings and we'd like to run Banerjee MIV tests on the memory accesses in those loops. The loop looks like: void foo(int *restrict A, int n1, int n2, int n3) { for (int i1 = 0; i1 < n1; i1++) { for (int i2 = 2; i2 < n2; i2++) { for (int i3 = i2 + 1; i3 < n3; i3++) { A[i2 + i3*n2] = 11; } } for (i...

...ALL. Set the Scalar flag for each level. Imagine we're starting simple, with no attempt to take advantage of coupled subscripts. Examine each pair of subscripts in sequence. If a pair is ZIV, we test hoping to prove independence. If we can't, we move on to the next subscript. If a pair is MIV, we ignore it and move on to the next subscript. If a pair is SIV, we check to see if it's something we can handle (strongSIV, weakzeroSIV, ...). If not, skip to next subscript. If we can handle it, compute direction (if StrongSIV, compute distance). Find the appropriate level based on the in...

Hi, I had compiled support for MYSQL_FRIENDS and it works for SIP, but when use tiwh IAX2 I have some problem, I can register with a client, but when I try to make a call I got this error: Jul 17 12:52:03 NOTICE[229387]: chan_iax2.c:5183 socket_read: Rejected connect attempt from <IP-ADRRESS> When I google'ed this problem I can see other users also found this error (bug ?) But no-one

...m/site/parallelizationforllvm/weak-zero-siv-test > * the Weak-Crossing SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test > * the Exact SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-siv-test > > and our first MIV test: > > * the RDIV test: > https://sites.google.com/site/parallelizationforllvm/rdiv-test > > If you have any thoughts about this code, I'd be very interested in > hearing them. One issue: don't use floating-point in LLVM. We want LLVM to behave the same on diffe...

Hi Preston, Thanks for the feedback! > In LoopDependenceAnalysis::AnalyzePair, what's going to happen if we > have something like this > > for (i = 0; i < n; i++) > for (j = 0; j < n; j++) > A[i][j]++; > > versus > > for (i = 0; i < n; i++) > for (j = 0; j < n; j++) > A[j][i]++; I think this can be fixed by ordering the subscripts

...uarded loops or with a user guard like below: if (c) { for (i = 0; i < n; i++) ... } for (j = 0; j < n; j++) ... The specific example that we ran into is described in https://reviews.llvm.org/D75628. Basically we have two triangular loops that are siblings and we'd like to run Banerjee MIV tests on the memory accesses in those loops. The loop looks like: void foo(int *restrict A, int n1, int n2, int n3) { for (int i1 = 0; i1 < n1; i1++) { for (int i2 = 2; i2 < n2; i2++) { for (int i3 = i2 + 1; i3 < n3; i3++) { A[i2 + i3*n2] = 11; } } for (int i4 = 2; i4 < n3; i4++) { for...

Hi Sanjoy & Hal, Looking at LoopDependenceAnalysis::analyzeZIV ... I don't understand much about SCEV, but the code seems inadequate. Consider these three examples: int a = ...; // we can't be sure of the relationship between a and b int b = ...; // perhaps they are parameters, or the result of I/O for (int i = 0; i < n; i++) { v[a][i] = ...; v[a + 1][i] = ...; } for (int i

.../site/parallelizationforllvm/weak-zero-siv-test > - the Weak-Crossing SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-crossing-siv-test > - the Exact SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-siv-test > > and our first MIV test: > > - the RDIV test: > https://sites.google.com/site/parallelizationforllvm/rdiv-test Can you explain this comment: > With minor algebra, this test can also be used for things like [c1 + > a1*i + a2*j][c2]. > > If you have any thoughts about this code, I'd b...

...uarded loops or with a user guard like below: if (c) { for (i = 0; i < n; i++) ... } for (j = 0; j < n; j++) ... The specific example that we ran into is described in https://reviews.llvm.org/D75628. Basically we have two triangular loops that are siblings and we'd like to run Banerjee MIV tests on the memory accesses in those loops. The loop looks like: void foo(int *restrict A, int n1, int n2, int n3) { for (int i1 = 0; i1 < n1; i1++) { for (int i2 = 2; i2 < n2; i2++) { for (int i3 = i2 + 1; i3 < n3; i3++) { A[i2 + i3*n2] = 11; } } for (int i4 = 2; i4 < n3; i4++) { for...

Forwarding to the dev list, in case others ran into similar issues and/or have input on this topic. Bardia Mahjour ----- Forwarded by Bardia Mahjour/Toronto/IBM on 2020/03/30 02:25 PM ----- From: Bardia Mahjour/Toronto/IBM To: listmail at philipreames.com Cc: "Michael Kruse" <llvm at meinersbur.de> Date: 2020/03/26 11:47 AM Subject: Scalar Evolution Expressions Involving Sibling

...review. First off, I agree with his choice to implement the SIV tests. For scientific Fortran, the SIV (and the simpler ZIV) tests cover about 85% of the cases in practice. For C and C++, I expect the percentage will be much higher. Someday we might like to see the general SIV test and handling of MIV subscripts, but we can get a long ways without them. It was my intention to implement exactly these tests, but Sanjoy is way ahead of me. My biggest problem is with the choice (not Sanjoy's, I think) of implementing *Loop*DependenceAnalysis as a *Loop*Pass. Dependence analysis needn't be r...

...0701/179529.html > http://lists.llvm.org/pipermail/llvm-commits/Week-of-Mon-20130701/179570.html > > Loop interchange and any other pass that relies on the current llvm > dependence analysis may generate wrong code. > See https://reviews.llvm.org/D35430 > > Another point, the MIV test in the llvm depednence analysis is not > implemented, and so the scope of the llvm dependence analysis is > rather narrow: i.e., it would not be able to solve the loop > interchange in spec2000/swim. > I am a big fan of the polyhedral model and these are not leading > question...

> On Sep 11, 2017, at 10:47 PM, Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > > On 09/11/2017 12:26 PM, Adam Nemet wrote: >> Hi Hal, Tobias, Michael and others, >> >>> On Sep 1, 2017, at 11:47 AM, Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >>> >>>

On 09/11/2017 12:26 PM, Adam Nemet wrote: > Hi Hal, Tobias, Michael and others, > >> On Sep 1, 2017, at 11:47 AM, Hal Finkel via llvm-dev >> <llvm-dev at lists.llvm.org <mailto:llvm-dev at lists.llvm.org>> wrote: >> >> ** >> >> *Hi everyone,As you may know, stock LLVM does not provide the kind of >> advanced loop transformations

** *Hi everyone,As you may know, stock LLVM does not provide the kind of advanced loop transformations necessary to provide good performance on many applications. LLVM's Polly project provides many of the required capabilities, including loop transformations such as fission, fusion, skewing, blocking/tiling, and interchange, all powered by state-of-the-art dependence analysis. Polly also