search for: counter

...> > >> > >> > Summary >> > ======= >> > >> > 1. We should teach GlobalDCE to strip out instrumented functions which >> the >> > inliner cannot delete. >> > >> > 2. Sean suggests adding metadata to loads/stores of counters to convey >> that >> > they do not alias normal program data. >> > >> > I'm not familiar with AA, but off-hand this seems like a good idea. >> > >> > 3. Sean also suggests improving the optimizer to registerize counters >> when &gt...

Hi, I''m trying to execute something like this method in a model: def self.sql_for_rankings() sql = "SET @counter:=0;" sql << " SET @counter:=0; SELECT *, @counter:=@counter+1 AS rank FROM testscores. " find_by_sql(sql) end Where the new rank column is a kind of autoincrementer inside of this query. Ignore for the moment that I c...

...l try to summarize the thread and respond > to some of the questions/feedback. > > > Summary > ======= > > 1. We should teach GlobalDCE to strip out instrumented functions which the > inliner cannot delete. > > 2. Sean suggests adding metadata to loads/stores of counters to convey that > they do not alias normal program data. > > I'm not familiar with AA, but off-hand this seems like a good idea. > > 3. Sean also suggests improving the optimizer to registerize counters when > possible. > > Ditto, seems like a good idea. &...

There have been a lot of responses. I'll try to summarize the thread and respond to some of the questions/feedback. Summary ======= 1. We should teach GlobalDCE to strip out instrumented functions which the inliner cannot delete. 2. Sean suggests adding metadata to loads/stores of counters to convey that they do not alias normal program data. I'm not familiar with AA, but off-hand this seems like a good idea. 3. Sean also suggests improving the optimizer to registerize counters when possible. Ditto, seems like a good idea. 4. Sean has an alternate proposal for co...

...e a new 'bucket' variable called combined. Which is the sum of the control and the exposed metric values This combined variable is a many to many matching as values only appear in the file if they have a value > 0. conversion.type filteredID bucketID Metric Value counter true control a 1 counter true control b 1 counter true control c 2 counter true control d 3 co...

Hi, The current design of -fprofile-instr-generate has the same fundamental flaw as the old gcc's gcov instrumentation: it has contention on counters. A trivial synthetic test case was described here: http://lists.cs.uiuc.edu/pipermail/llvmdev/2013-October/066116.html For the problem to appear we need to have a hot function that is simultaneously executed by multiple threads -- then we will have high contention on the racy profile counters. S...

I am acquiring some sampled data that is time-stamped (with a POSIXct). Some of the data is in the form of "counters" -- that is, what is interesting isn't value of a given counter at a given time, but the change in the counter from one sample to a later one. As the counters are only incremented, they would be perceived to be monotonically increasing -- ideally. Unfortunately, the counters can "w...

On Thu, Apr 17, 2014 at 6:10 PM, Yaron Keren <yaron.keren at gmail.com> wrote: > If accuracy is not critical, incrementing the counters without any guards > might be good enough. > No. Contention on the counters leads to 5x-10x slowdown. This is never good enough. --kcc Hot areas will still be hot and cold areas will not be affected. > > Yaron > > > > 2014-04-17 15:21 GMT+03:00 Kostya Serebryany <kcc...

Hi, I'd like to add a new pass to LLVM which removes redundant profile counter updates. The goal is to speed up code coverage testing and profile generation for PGO. I'm sending this email out to describe my approach, share some early results, and gather feedback. Problem Overview ================ A profile counter is redundant if it's incremented in exactly the...

...g all of its data to JSON (see CoverageExporterJson.cpp <https://github.com/llvm-mirror/llvm/blob/master/tools/llvm-cov/CoverageExporterJson.cpp>). If you are interested in working on these features, I would be happy to work with you on design issues and on code review. 3. Optimizing profile counter placement >From Eli's notes: > I remember we also spent some time discussing the counter intrinsics, and whether we could produce a different set of intrinsics in the frontend, and produce the counters later in the pipeline to avoid duplicate counters. I didn't completely follow t...

Googling for this finds me a ton of stuff that doesn't actually do what I'm looking for. I want a simple hit counter cgi script of some kind that will increment a counter on every page load but I want to access the counter from a different page. In other words, I don't want to have a visible hit counter on the webpage itself. I want to have a different webpage that will show me the number. -- MELVILLE TH...

...t; >>> >>> On Thu, Mar 10, 2016 at 7:21 PM, Vedant Kumar via llvm-dev < >>> llvm-dev at lists.llvm.org> wrote: >>> >>>> Hi, >>>> >>>> I'd like to add a new pass to LLVM which removes redundant profile >>>> counter >>>> updates. The goal is to speed up code coverage testing and profile >>>> generation >>>> for PGO. >>>> >>> >>> We may want to have a focused discussion about this goal, rather than a >>> particular suggestion. There are...

...M, Sean Silva via llvm-dev < llvm-dev at lists.llvm.org> wrote: > > > On Thu, Mar 10, 2016 at 7:21 PM, Vedant Kumar via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > >> Hi, >> >> I'd like to add a new pass to LLVM which removes redundant profile counter >> updates. The goal is to speed up code coverage testing and profile >> generation >> for PGO. >> > > We may want to have a focused discussion about this goal, rather than a > particular suggestion. There are a lot of things we can do. Off the top of > my head,...

On Fri, Apr 18, 2014 at 12:13 AM, Dmitry Vyukov <dvyukov at google.com> wrote: > Hi, > > This is long thread, so I will combine several comments into single email. > > > >> - 8-bit per-thread counters, dumping into central counters on overflow. > >The overflow will happen very quickly with 8bit counter. > > Yes, but it reduces contention by 256x (a thread must execute at least 256 > loop iterations between increments). In practice, if you reduce contention > below some thresho...

I''m working on a RESTful app, and I''ve hit a snag. Here''s a simplified example of the problem. (Excuse me if this example code isn''t strictly correct; I''m typing from memory.) Suppose I have a table which models a simple counter. It has a single column, "count": class CreateCounters < ActiveRecord::Migration def self.up create_table :counters do |t| t.column :count, :integer end end def self.down drop_table :counters end I''ve created a RESTful controller using the scaff...

...My import function is attached below. It works fine for only some entries but is deadly slow when trying to read the complete set. Does anybody has some pointers for me for improving the import or handling such large data sets? Thanks in advance! Uli read.DET.data <- function ( f ) { counter <- 1 spk.v <- c() imp.v <- c() score.v <- c() th.v <- c() ses.v <- c() rec.v <- c() type.v <- c() fid <- file( f ,"rb") tempi <- readBin(fid , integer(), size=1, signed=FALSE) while ( length(tempi) != 0) { spk.v[ counter ] <- tempi imp.v[ cou...

...t; [ 02 01 01 d5 ] < Supervisory frame: < SAPI: 00 C/R: 1 EA: 0 < TEI: 000 EA: 1 < Zero: 0 S: 0 01: 1 [ RR (receive ready) ] < N(R): 106 P/F: 1 < 0 bytes of data -- ACKing all packets from 105 to (but not including) 106 -- Since there was nothing left, stopping T200 counter -- Stopping T203 counter since we got an ACK -- Nothing left, starting T203 counter -- Unsolicited RR with P/F bit, responding Sending Receiver Ready (13) > [ 02 01 01 1b ] > Supervisory frame: > SAPI: 00 C/R: 1 EA: 0 > TEI: 000 EA: 1 > Zero: 0 S: 0 01: 1 [ RR (receiv...

https://bugzilla.netfilter.org/show_bug.cgi?id=1267 Bug ID: 1267 Summary: unable to use limit with counter in meters Product: nftables Version: unspecified Hardware: x86_64 OS: Gentoo Status: NEW Severity: enhancement Priority: P5 Component: nft Assignee: pablo at netfilter.org Reporter: karel at...

...d better, I wish to use just a block of code that is able to query multiple DNS servers, instead of repeating like in the following example the same code for each DNS server I wish to lookup for: ; Start first with e164.arpa zone: exten => _X.,1,Set(sipcount=${ENUMLOOKUP(+${EXTEN},sip,c)}|counter=0) exten => _X.,2,GotoIf($["${counter}"<"${sipcount}"]?3:6) exten => _X.,3,Set(counter=$[${counter}+1]) exten => _X.,4,Dial(SIP/${ENUMLOOKUP(+${EXTEN},sip,${counter})}) exten => _X.,5,GotoIf($["${counter}"<"${sipcount}"]?3:6) ; ...then also...

...>> On Fri, Apr 18, 2014 at 11:13 AM, Dmitry Vyukov <dvyukov at google.com>wrote: >> >>> Hi, >>> >>> This is long thread, so I will combine several comments into single >>> email. >>> >>> >>> >> - 8-bit per-thread counters, dumping into central counters on >>> overflow. >>> >The overflow will happen very quickly with 8bit counter. >>> >>> Yes, but it reduces contention by 256x (a thread must execute at least >>> 256 loop iterations between increments). In practice, if...