<feed xmlns='http://www.w3.org/2005/Atom'>
<title>linux, branch v2.6.20-rc1</title>
<subtitle>Linux kernel source tree</subtitle>
<id>https://git.amat.us/linux/atom/?h=v2.6.20-rc1</id>
<link rel='self' href='https://git.amat.us/linux/atom/?h=v2.6.20-rc1'/>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/'/>
<updated>2006-12-14T01:14:23Z</updated>
<entry>
<title>Linux v2.6.20-rc1</title>
<updated>2006-12-14T01:14:23Z</updated>
<author>
<name>Linus Torvalds</name>
<email>torvalds@woody.osdl.org</email>
</author>
<published>2006-12-14T01:14:23Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=cc016448b0bf0764928275d034e367753bde8162'/>
<id>urn:sha1:cc016448b0bf0764928275d034e367753bde8162</id>
<content type='text'>
.. and so the stabilization phase starts.

Signed-off-by: Linus Torvalds &lt;torvalds@osdl.org&gt;
</content>
</entry>
<entry>
<title>[NETFILTER]: bridge-netfilter: remove deferred hooks</title>
<updated>2006-12-14T00:54:25Z</updated>
<author>
<name>Patrick McHardy</name>
<email>kaber@trash.net</email>
</author>
<published>2006-12-14T00:54:25Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=2bf540b73ed5b304e84bb4d4c390d49d1cfa0ef8'/>
<id>urn:sha1:2bf540b73ed5b304e84bb4d4c390d49d1cfa0ef8</id>
<content type='text'>
Remove the deferred hooks and all related code as scheduled in
feature-removal-schedule.

Signed-off-by: Patrick McHardy &lt;kaber@trash.net&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[IPV6]: Make fib6_node subtree depend on IPV6_SUBTREES</title>
<updated>2006-12-14T00:48:31Z</updated>
<author>
<name>Kim Nordlund</name>
<email>kim.nordlund@nokia.com</email>
</author>
<published>2006-12-14T00:38:29Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=8bce65b95ac167693ae2d706b5341409dca0062d'/>
<id>urn:sha1:8bce65b95ac167693ae2d706b5341409dca0062d</id>
<content type='text'>
Make fib6_node 'subtree' depend on IPV6_SUBTREES.

Signed-off-by: Kim Nordlund &lt;kim.nordlund@nokia.com&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[SCTP]: Add support for SCTP_CONTEXT socket option.</title>
<updated>2006-12-14T00:48:29Z</updated>
<author>
<name>Ivan Skytte Jorgensen</name>
<email>isj-sctp@i1.dk</email>
</author>
<published>2006-12-14T00:34:22Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=6ab792f577012312a760a3a1e679ae8fae012442'/>
<id>urn:sha1:6ab792f577012312a760a3a1e679ae8fae012442</id>
<content type='text'>
Signed-off-by: Ivan Skytte Jorgensen &lt;isj-sctp@i1.dk&gt;
Signed-off-by: Sridhar Samudrala &lt;sri@us.ibm.com&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[SCTP]: Enable auto loading of SCTP when creating an ipv6 SCTP socket.</title>
<updated>2006-12-14T00:48:28Z</updated>
<author>
<name>Sridhar Samudrala</name>
<email>sri@us.ibm.com</email>
</author>
<published>2006-12-14T00:33:35Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=882a382c3e0b432fa91672e1c2754cac3f5a6b4f'/>
<id>urn:sha1:882a382c3e0b432fa91672e1c2754cac3f5a6b4f</id>
<content type='text'>
Signed-off-by: Sridhar Samudrala &lt;sri@us.ibm.com&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[SCTP]: Handle address add/delete events in a more efficient way.</title>
<updated>2006-12-14T00:48:27Z</updated>
<author>
<name>Sridhar Samudrala</name>
<email>sri@us.ibm.com</email>
</author>
<published>2006-12-14T00:26:26Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=29c7cf96186ac14ce7380633f690fc39732ff03a'/>
<id>urn:sha1:29c7cf96186ac14ce7380633f690fc39732ff03a</id>
<content type='text'>
Currently in SCTP, we maintain a local address list by rebuilding the whole
list from the device list whenever we get a address add/delete event.

This patch fixes it by only adding/deleting the address for which we
receive the event.

Also removed the sctp_local_addr_lock() which is no longer needed as we
now use list_for_each_safe() to traverse this list. This fixes the bugs
in sctp_copy_laddrs_xxx() routines where we do copy_to_user() while
holding this lock.

Signed-off-by: Sridhar Samudrala &lt;sri@us.ibm.com&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[TCP]: Fix oops caused by __tcp_put_md5sig_pool()</title>
<updated>2006-12-14T00:48:26Z</updated>
<author>
<name>David S. Miller</name>
<email>davem@sunset.davemloft.net</email>
</author>
<published>2006-12-14T00:25:44Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=6931ba7cef3991fbb970997d33e24139ccdc3c2c'/>
<id>urn:sha1:6931ba7cef3991fbb970997d33e24139ccdc3c2c</id>
<content type='text'>
It should call tcp_free_md5sig_pool() not __tcp_free_md5sig_pool()
so that it does proper refcounting.

Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[IPV6]: Fix IPV6_UNICAST_HOPS getsockopt().</title>
<updated>2006-12-14T00:48:25Z</updated>
<author>
<name>Brian Haley</name>
<email>brian.haley@hp.com</email>
</author>
<published>2006-12-13T01:09:49Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=befffe901649e2cc421d0d150c4379d01658cf6b'/>
<id>urn:sha1:befffe901649e2cc421d0d150c4379d01658cf6b</id>
<content type='text'>
&gt; Relevant standard (RFC 3493) notes:
&gt;
&gt;    The IPV6_UNICAST_HOPS option may be used with getsockopt() to
&gt;    determine the hop limit value that the system will use for subsequent
&gt;    unicast packets sent via that socket.
&gt;
&gt; I don't reckon -1 could be the hop limit value.

-1 means un-initialized.

&gt; IMHO, the value from
&gt; case 1 (if socket is connected to some destination), otherwise case 2
&gt; (if bound to a scope interface) or ultimately the default hop limit
&gt; ought to be returned instead, as it will be most often correct, while
&gt; the current behavior is always wrong, unless setsockopt() has been used
&gt; first. I don't if some people may think doing a route lookup in
&gt; getsockopt might be overly expensive, but at least the two other cases
&gt; should be ok, particularly the last one.

The following patch seems to work for me, but this code has behaved this
way for a while, so don't know if it will break any existing apps.

Signed-off-by: Brian Haley &lt;brian.haley@hp.com&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
<entry>
<title>[DCCP] ccid3: return value in ccid3_hc_rx_calc_first_li</title>
<updated>2006-12-14T00:48:24Z</updated>
<author>
<name>Ian McDonald</name>
<email>ian.mcdonald@jandi.co.nz</email>
</author>
<published>2006-12-12T02:47:59Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=832e3ca62d6ee1893db05f5202c24ae5331e19ba'/>
<id>urn:sha1:832e3ca62d6ee1893db05f5202c24ae5331e19ba</id>
<content type='text'>
In a recent patch we introduced invalid return codes which will result in the
opposite of what is intended (i.e. send more packets in face of peculiar
network conditions).

This fixes it by returning ~0 which means not calculated as per
dccp_li_hist_calc_i_mean.

Signed-off-by: Ian McDonald &lt;ian.mcdonald@jandi.co.nz&gt;
Signed-off-by: Arnaldo Carvalho de Melo &lt;acme@mandriva.com&gt;
</content>
</entry>
<entry>
<title>[NETFILTER]: {ip,ip6,arp}_tables: fix exponential worst-case search for loops</title>
<updated>2006-12-14T00:48:23Z</updated>
<author>
<name>Al Viro</name>
<email>viro@zeniv.linux.org.uk</email>
</author>
<published>2006-12-12T08:29:52Z</published>
<link rel='alternate' type='text/html' href='https://git.amat.us/linux/commit/?id=e1b4b9f3986b80d5785d91dbd8d72cfaf9fd1117'/>
<id>urn:sha1:e1b4b9f3986b80d5785d91dbd8d72cfaf9fd1117</id>
<content type='text'>
If we come to node we'd already marked as seen and it's not a part of path
(i.e. we don't have a loop right there), we already know that it isn't a
part of any loop, so we don't need to revisit it.

That speeds the things up if some chain is refered to from several places
and kills O(exp(table size)) worst-case behaviour (without sleeping,
at that, so if you manage to self-LART that way, you are SOL for a long
time)...

Signed-off-by: Al Viro &lt;viro@zeniv.linux.org.uk&gt;
Signed-off-by: Patrick McHardy &lt;kaber@trash.net&gt;
Signed-off-by: David S. Miller &lt;davem@davemloft.net&gt;
</content>
</entry>
</feed>
