search for: divisor

...+ while (mask && !(mask & 1)) { + mask >>= 1; + hash >>= 1; + } + hash &= 0xFF; + } htid = ((hash<<12)&0xFF000)|(htid&0xFFF00000); sample_ok = 1; continue; PATCH 3 ======= "tc" does not allow you to specify the divisor for the "sample" clause, it always assumes a divisor of 256. If the divisor isn''t 256, (ie it is something less), the kernel will usually whinge because the bucket given to it by "tc" is typically too big. This patch adds a "divisor" option to tc''s...

What is the difference between lines below? $TC filter add dev imq0 parent 1:0 prio 5 handle 1: protocol ip u32 divisor 1 $TC filter add dev imq0 parent 1:0 prio 5 handle 2: protocol ip u32 divisor 256 What divisor is doing? And the last problem... $TC filter add dev imq0 protocol ip parent 1:0 prio 5 u32 ht 800:: match ip src 10.0.0.0/16 hashkey mask 0x000000ff at 12 link 2: Why after ht should be 800? When 8...

Hello, I have a vector of 1,000,000 numbers and another vector of 1,000 divisors. What I'd like to do is to divide the first 1,000 numbers of the first vector by the first divisor, then the next 1,000 by the second divisor and so on. I came up with this, but I was wondering if there is a more idiomatic, R-like way to write it: x <- ... divs <- ... for (i in seq(fro...

Hello, Is there a function in R with which we could find the greatest common divisor directly? Or is there a funciton, which could help us to find the remainder of a division directly? Best wishes! Thank you! Your truly, Qing -- View this message in context: http://r.789695.n4.nabble.com/greatest-common-divisor-tp2326262p2326262.html Sent from the R help mailing list archive...

...[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]) { > - remainder = do_div(size, divisor[units]); > - i++; > - } > + if (!size) > + goto out; > > - sf_cap = size; > -...

...[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]) { > - remainder = do_div(size, divisor[units]); > - i++; > - } > + if (!size) > + goto out; > > - sf_cap = size; > -...

...ed poking at them with 'setserial'? > Thanks for the suggestion. I looked at them with setserial, but I have no familiarity with the program to know what to change. setserial -ag /dev/ttyS* /dev/ttyS0, Line 0, UART: 16550A, Port: 0x03f8, IRQ: 4 ??? Baud_base: 115200, close_delay: 50, divisor: 0 ??? closing_wait: 3000 ??? Flags: spd_normal skip_test /dev/ttyS1, Line 1, UART: 16550A, Port: 0x8000, IRQ: 17 ??? Baud_base: 115200, close_delay: 50, divisor: 0 ??? closing_wait: none ??? Flags: spd_normal skip_test /dev/ttyS2, Line 2, UART: 16550A, Port: 0x8400, IRQ: 17 ??? Baud_base:...

...ynamically attacched classes/qdiscs/filters. There is a hashing filter that maps the last octet of an user''s IP address to a class (and associated qdisc). The "empty" filter looks like this: filter parent 1: protocol ip pref 5 u32 filter parent 1: protocol ip pref 5 u32 fh 2: ht divisor 256 filter parent 1: protocol ip pref 5 u32 fh 800: ht divisor 1 filter parent 1: protocol ip pref 5 u32 fh 800::800 order 2048 key ht 800 bkt 0 link 2: (rule hit 0 success 0) match 00000000/00000000 at 12 (success 0 ) hash mask 000000ff at 16 I''m adding the hash entries dynamical...

...l 1Mbit # tc filter add dev eth0 protocol ip parent 1:0 prio 130 u32 match ip dst \ > 1.1.1.10 flowid 1:130 The output of "tc -d filter show dev eth0" makes sense to me and looks like this: filter parent 1: protocol ip pref 130 u32 filter parent 1: protocol ip pref 130 u32 fh 800: ht divisor 1 filter parent 1: protocol ip pref 130 u32 fh 800::800 order 2048 key ht 800 bkt 0 flowid 1:130 match 0101010a/ffffffff at 16 If I add a third class and a filter for it, things start looking weird to me: # tc filter add dev eth0 protocol ip parent 1:0 prio 131 u32 match ip dst 1.1.1.11 \ >...

...q0 filter parent 1: protocol ip pref 1 fw filter parent 1: protocol ip pref 1 fw handle 0x28 classid 1:3 PREF 1 = PRIO 1 filter parent 1: protocol ip pref 49151 u32 PREF 49151 = PRIO 0 !! then PRIO 0 has low prio that PRIO 1. filter parent 1: protocol ip pref 49151 u32 fh 802: ht divisor 1 filter parent 1: protocol ip pref 49151 u32 fh 802::800 order 2048 key ht 802 bkt 0 flowid 1:1020 match ac100a0c/ffffffff at 12 filter parent 1: protocol ip pref 49151 u32 fh 801: ht divisor 1 filter parent 1: protocol ip pref 49151 u32 fh 801::800 order 2048 key ht 801 bkt 0 flowid 1:1010 ma...

Hello, I wonder if there is a way to have a divisor bigger than 256 when creating hash tables with u32. It would really be great. Thanks

...st argument allocated by the caller, NOT in XMM0! Demo/proof: from this source --- llvm-bug.c --- #ifndef __clang__ typedef struct { unsigned __int64 low; unsigned __int64 high; } __uint128_t; #else __attribute__((ms_abi)) #endif __uint128_t __udivmodti4(__uint128_t dividend, __uint128_t divisor, __uint128_t *remainder) { if (remainder != 0) *remainder = divisor; return dividend; } --- EOF --- clang -c -O1 generates the following INCOMPATIBLE and WRONG code: __udivmodti4 proc public movaps xmm0, xmmword ptr [rcx] test r8, r8 jz 0f...

Hi again, I was just looking around for ESFQ sources, and I see that the main site is down, and only has kernel 2.6.4 patches. Is ESFQ maintained? If so, where can I find patches for 2.6.10? Thanks, -justin _______________________________________________ LARTC mailing list / LARTC@mailman.ds9a.nl http://mailman.ds9a.nl/mailman/listinfo/lartc HOWTO: http://lartc.org/

...stions I''m just trying to understand how it all works. Thank you for your time. Is the following configuration possible? where ht 800 links to 3: for the 3rd Octet in the IP and then 3: links to 4: for the fourth Octet? tc filter add dev eth0 parent 1:0 prio 10 handle 3: protocol ip u32 divisor 256 tc filter add dev eth0 protocol ip parent 1:0 prio 10 u32 ht 800:: match ip dst 10.1.0.0/16 hashkey mask 0x0000ff00 at 16 link 3: tc filter add dev eth0 parent 1:0 prio 10 handle 4: protocol ip u32 divisor 256 tc filter add dev eth0 protocol ip parent 1:0 prio 10 u32 ht 3:01: match ip dst 10...

Hi, please could you recommend a R package that computes a 2 sample z-test ? thanks, Bogdan [[alternative HTML version deleted]]

...icts whether x%%0.1 will give an answer of 0 or 0.1. I could find no explanation of the way that %% works in the R manuals. So, I have 3 questions:- 1) Why is the modulus of 0.3%%0.1 (and 0.5%%0.1 and 0.6%%0.1...) not zero? 2) Are there any algorithms in R that use the %% operator with fractional divisors in this way, and do they know about its apparently inconsistent behaviour? 3) If %% is not intended for use with fractional divisors, then would it be a good idea to trap attempts to use them? Thanks, in advance, for your help Jonathan Williams

Hi, I am trying to put together a hashing filter based on example provided in LARTC how-to document. I want to link two hashing filters together where first one will use 3rd octet of an IP address as hashkey and second one will use 4th octet as hash key. How do I tell mask the address so that u32 filter uses 3rd octet as hashkey? Venkatesh K _______________________________________________

...C) - Priority: High tc filter add dev eth0 parent 1:0 prio 0 protocol ip u32 match ip src <ip net> match ip protocol 50 0xff flowid 1:22 # tc -s filter show dev eth0 ---------------------------------- filter parent 1: protocol ip pref 2 u32 filter parent 1: protocol ip pref 2 u32 fh 800: ht divisor 1 filter parent 1: protocol ip pref 2 u32 fh 800::802 order 2050 key ht 800 bkt 0 flowid 1:21 (rule hit 428 success 426) match c0000000/e0000000 at 16 (success 426 ) match 00000000/00000000 at 12 (success 426 ) filter parent 1: protocol ip pref 49151 u32 filter parent 1: protocol ip pref 49151...

...e any fix available on the net. Sample Script: #! /bin/sh tc qdisc add dev eth1 root handle 1:0 htb r2q 1 tc class add dev eth1 parent 1:0 classid 1:fffe htb rate 100mbit tc filter add dev eth1 parent 1:0 prio 1 protocol ip u32 tc filter add dev eth1 parent 1:0 prio 1 handle ffe:0 protocol ip u32 divisor 256 tc filter add dev eth1 parent 1:0 prio 1 protocol ip u32 ht 800:: match u32 \ 0x00000800 0x0000FFFF at -4 hashkey mask 0x00ff0000 at -8 link ffe: tc class add dev eth1 parent 1:fffe classid 1:13E htb rate 100mbit tc qdisc add dev eth1 parent 1:13E handle 13E:0 htb r2q 1 tc class add dev...

...hash tables, and I am feeling that the last line in lartc''s document page "12.4. Hashing filters for very fast massive filtering" which says "Note that this example could be improved to the ideal case where each chain contains 1 filter!" is a little misleading since no divisor above 256 works. On first reading, I ''m thinking, yeh, I''ll just put a divisor of 16777216 and my problems are solved... nope.. wrong answer. I haven''t even gotten to the point where I issue 32 million filter rules to tc and see if it chokes. I hate to have to ask, I a...