search for: counter1

...${loadbalance} = 1 ]?balance) ;at dial decide if we want to load balance exten => _XXX.,n,goto(50) ;if no balance then outbound call initiated with failover exten => _XXX.,n(balance),NoOp("Load Balancing Active") ;NoOp - display Load balancing status exten => _XXX.,n,Set(counter1=${DB(data/counter)}) ;retrieve counter value from astdb exten => _XXX.,n,NoOp(${counter1}) ;display value of counter exten => _XXX.,n,Set(counter=${MATH(${counter1}+1,int)}) ; increment counter exten => _XXX.,n,Set(DB(data/counter)=${counter}) ;write incremented value back to...

...of nftables.py leaking memory System: Gentoo 5.3.10 x86_64 nft up to date from GIT as of 12.11.2019 Overwiew: nft commands which change ruleset leak memory when running through nftables.py if ruleset contain rule like this: add rule ip table1 chain1 counter name ip length map { 0-65535: "counter1" } But no leaking happens when rule is changed to: add rule ip table1 chain1 counter name ip length map { 0-65534: "counter1" } Detailed info: Consider this ruleset: add table ip table1 add set ip table1 set1 { type ipv4_addr; } add chain ip table1 chain1 { type filter hook for...

...o 5.4.1 x86_64 nft up to date from GIT as of 4.12.2019 CPython 3.6.9 Overview: nft commands which read named counters actually read counter values only first time, subsequent reads returns values from first read. Detailed info: Consider this ruleset: add table ip table1 add counter ip table1 counter1 add chain ip table1 chain1 { type filter hook input priority 0; } add rule ip table1 chain1 counter name counter1 Then ping several times localhost, after that call nftables.py cmd: list counter table1 counter1 and you will see some packets added to this counter. Ping localhost several times aga...

...ore abstractly. We've also adapted the operator <<- so that it works back up through the environment stack and carries out the assigment on the first variable it finds with the right name. mk.counter <- function(count=0) function() { count <<- count + 1 count } counter1 <- mk.counter() # each has its own count counter2 <- mk.counter() counter1() # -> returns 1 counter1() # -> returns 2 counter2() # -> returns 1 ... This gives functions what is called "mutable state" and could be used to create a real object system (the instance vari...

...to the next Value. However, output returns "NULL", no matter how I've modified the syntax. Thanks in advance for any help. Zack ############################# x <- c(5,5,7,6,5,4,3) x <- data.frame(x) y <-length(x)-2counter <- 1 output = c() while(counter <= y) { counter1 <- counter+1counter2 <- counter+2 if(x[counter,1] > x[counter1,1]|| x[counter1,1] > x[counter2,1]){output = x[counter, ] } else { counter = counter+1 } counter = y}######################################## [[alternative HTML version deleted]]

...either (a) use debug info as is or add some > extra (valid) debug info to support this, or (b) add an extra > debug-info-like section to instrumented binaries with the information we > need. > I'd try this data format (binary equivalent): /path/to/binary/or/dso1 num_counters1 pc1 counter1 pc2 counter2 pc3 counter3 ... /path/to/binary/or/dso2 num_counters2 pc1 counter1 pc2 counter2 pc3 counter3 ... I don't see a straightforward way to produce such data today because individual Instructions do not work as labels. But I think this can be supported in LLVM codegen. Here is a *raw*...

I've built chromium with " -fprofile-instr-generate -fsanitize=address" -- the performance looks good! The file format from r198638 is indeed rudimentary. Do you already know how the real output format will look like? Just to summarize what I think is important: - minimal size on disk, minimal amount of files - minimal i/o while writing to disk, no lockf or some such -