From: Ross Zwisler
Add a generic test for multi-order tag verification, and call it using
several different configurations.
This test creates a multi-order radix tree using the given index and order,
and then sets, checks and clears tags using the indices covered
From: Ross Zwisler
radix_tree_for_each_chunk() and radix_tree_for_each_chunk_slot()
have never been used in the kernel since their introduction in 2012,
so remove them.
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
On Wed, Apr 6, 2016 at 2:19 PM, Linus Torvalds
wrote:
> On Wed, Apr 6, 2016 at 10:54 AM, Linus Torvalds
> wrote:
>>
>> So I'd find a patch like the attached to be perfectly acceptable (in
>> fact, we should have done this long ago).
>
On arm64 systems, using /dev/port does not really make sense; this is
historically used for other architectures to access ISA IO ports, which
with any luck do not exist on arm64 platforms. With the following snippet
of perl code (from Jeff Bastian ), we can reliably
panic an
From: Ross Zwisler
Add a generic test for multi-order tag verification, and call it using
several different configurations.
This test creates a multi-order radix tree using the given index and order,
and then sets, checks and clears tags using the indices covered by the
single multi-order radix
From: Ross Zwisler
radix_tree_for_each_chunk() and radix_tree_for_each_chunk_slot()
have never been used in the kernel since their introduction in 2012,
so remove them.
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
include/linux/radix-tree.h | 28
On Wed, Apr 6, 2016 at 2:19 PM, Linus Torvalds
wrote:
> On Wed, Apr 6, 2016 at 10:54 AM, Linus Torvalds
> wrote:
>>
>> So I'd find a patch like the attached to be perfectly acceptable (in
>> fact, we should have done this long ago).
>
> I just committed it, let's see if some odd program uses the
On arm64 systems, using /dev/port does not really make sense; this is
historically used for other architectures to access ISA IO ports, which
with any luck do not exist on arm64 platforms. With the following snippet
of perl code (from Jeff Bastian ), we can reliably
panic an arm64 system with PCI
This enables the macros radix_tree_for_each_slot() and friends to be
used with multi-order entries.
The way that this works is that we treat all entries in a given slots[]
array as a single chunk. If the index given to radix_tree_next_chunk()
happens to point us to a sibling entry, we will back
Use the new multi-order support functions to rewrite __radix_tree_lookup()
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 45 +
1 file changed, 17 insertions(+), 28
Ensure that the tree goes back down to the same height when an item is
inserted & removed from the tree at a higher index.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
tools/testing/radix-tree/multiorder.c | 38
From: Ross Zwisler
Add a unit test to verify that we can iterate over multi-order entries
properly via a radix_tree_for_each_slot() loop.
This was done with a single, somewhat complicated configuration that was
meant to test many of the various corner cases having
From: Ross Zwisler
Use the new multi-order support functions to rewrite radix_tree_tag_set()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 37
This enables the macros radix_tree_for_each_slot() and friends to be
used with multi-order entries.
The way that this works is that we treat all entries in a given slots[]
array as a single chunk. If the index given to radix_tree_next_chunk()
happens to point us to a sibling entry, we will back
Use the new multi-order support functions to rewrite __radix_tree_lookup()
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 45 +
1 file changed, 17 insertions(+), 28 deletions(-)
diff --git a/lib/radix-tree.c
Ensure that the tree goes back down to the same height when an item is
inserted & removed from the tree at a higher index.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
tools/testing/radix-tree/multiorder.c | 38 +++
1 file changed, 38
From: Ross Zwisler
Add a unit test to verify that we can iterate over multi-order entries
properly via a radix_tree_for_each_slot() loop.
This was done with a single, somewhat complicated configuration that was
meant to test many of the various corner cases having to do with
multi-order
From: Ross Zwisler
Use the new multi-order support functions to rewrite radix_tree_tag_set()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 37 +
1 file changed, 17 insertions(+), 20 deletions(-)
diff --git
On Wed, Apr 6, 2016 at 1:56 PM, Linus Torvalds
wrote:
> On Wed, Apr 6, 2016 at 1:17 PM, Pavel Machek wrote:
>>
>> Why is kASLR incompatible with hibernation? We can hibernate have
>> 4.3 kernel resume hibernation image of 4.2 kernel (on x86-64, and I
I've been receiving increasingly concerned notes from 0day about how much
my recent changes have been bloating the radix tree. Make it happier by
only including multiorder support if CONFIG_TRANSPARENT_HUGEPAGES is set.
This is an independent Kconfig option, so other radix tree users can
also set
From: Ross Zwisler
Use the new multi-order support functions to rewrite
radix_tree_tag_clear()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 44
Test suite infrastructure for working with multiorder entries.
The test itself is pretty basic: Add an entry, check that all expected
indices return that entry and that indices around that entry don't return
an entry. Then delete the entry and check no index returns that entry.
Tests a few edge
On Wed, Apr 6, 2016 at 1:56 PM, Linus Torvalds
wrote:
> On Wed, Apr 6, 2016 at 1:17 PM, Pavel Machek wrote:
>>
>> Why is kASLR incompatible with hibernation? We can hibernate have
>> 4.3 kernel resume hibernation image of 4.2 kernel (on x86-64, and I
>> have patches for x86). Resuming kernel
I've been receiving increasingly concerned notes from 0day about how much
my recent changes have been bloating the radix tree. Make it happier by
only including multiorder support if CONFIG_TRANSPARENT_HUGEPAGES is set.
This is an independent Kconfig option, so other radix tree users can
also set
From: Ross Zwisler
Use the new multi-order support functions to rewrite
radix_tree_tag_clear()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 44
1 file changed, 20 insertions(+), 24 deletions(-)
diff --git
Test suite infrastructure for working with multiorder entries.
The test itself is pretty basic: Add an entry, check that all expected
indices return that entry and that indices around that entry don't return
an entry. Then delete the entry and check no index returns that entry.
Tests a few edge
I had previously decided that tagging a single multiorder entry would
count as tagging 2^order entries for the purposes of 'nr_to_tag'.
I now believe that decision to be a mistake, and it should count as a
single entry. That's more likely to be what callers expect.
When walking back up the tree
If the radix tree user attempted to insert a colliding entry with an
existing multiorder entry, then radix_tree_create() could encounter
a sibling entry when walking down the tree to look for a slot.
Use radix_tree_descend() to fix the problem, and add a test-case to make
sure the problem doesn't
From: Ross Zwisler
- Print which indices are covered by every leaf entry
- Print sibling entries
- Print the node pointer instead of the slot entry
- Build by default in userspace, and make it accessible to the test-suite
Signed-off-by: Ross Zwisler
Use the new multi-order support functions to rewrite
radix_tree_locate_item(). Modify the locate tests to test multiorder
entries too.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c| 90
These BUG_ON tests are to ensure that all the tags are clear when
inserting a new entry. If we insert a multiorder entry, we'll end up
looking at the tags for a different node, and so the BUG_ON can end up
triggering spuriously.
Also, we now have three tags, not two, so check all three are
I had previously decided that tagging a single multiorder entry would
count as tagging 2^order entries for the purposes of 'nr_to_tag'.
I now believe that decision to be a mistake, and it should count as a
single entry. That's more likely to be what callers expect.
When walking back up the tree
If the radix tree user attempted to insert a colliding entry with an
existing multiorder entry, then radix_tree_create() could encounter
a sibling entry when walking down the tree to look for a slot.
Use radix_tree_descend() to fix the problem, and add a test-case to make
sure the problem doesn't
From: Ross Zwisler
- Print which indices are covered by every leaf entry
- Print sibling entries
- Print the node pointer instead of the slot entry
- Build by default in userspace, and make it accessible to the test-suite
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
Use the new multi-order support functions to rewrite
radix_tree_locate_item(). Modify the locate tests to test multiorder
entries too.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c| 90 -
These BUG_ON tests are to ensure that all the tags are clear when
inserting a new entry. If we insert a multiorder entry, we'll end up
looking at the tags for a different node, and so the BUG_ON can end up
triggering spuriously.
Also, we now have three tags, not two, so check all three are
Fairly simple tests; add various items to the tree, then make sure we
can find them again. Also check that a pointer that we know isn't in
the tree is not found.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
Fairly simple tests; add various items to the tree, then make sure we
can find them again. Also check that a pointer that we know isn't in
the tree is not found.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
tools/testing/radix-tree/linux/kernel.h | 3 +++
The multiorder support is a sufficiently large feature to be worth adding
copyrigt lines for.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 2 ++
1 file changed, 2 insertions(+)
diff --git a/lib/radix-tree.c
The multiorder support is a sufficiently large feature to be worth adding
copyrigt lines for.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 2 ++
1 file changed, 2 insertions(+)
diff --git a/lib/radix-tree.c b/lib/radix-tree.c
index 0402c4f1a344..edaf4771feb0
Now that sibling pointers are handled explicitly, there is no purpose
served by restricting the order to be >= RADIX_TREE_MAP_SHIFT.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 2 --
1 file changed, 2
Now that sibling pointers are handled explicitly, there is no purpose
served by restricting the order to be >= RADIX_TREE_MAP_SHIFT.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 2 --
1 file changed, 2 deletions(-)
diff --git a/lib/radix-tree.c
All the tree walking functions start with some variant of this code;
centralise it in one place so we're not chasing subtly different bugs
everywhere.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 23
From: Ross Zwisler
Use the new multi-order support functions to rewrite radix_tree_tag_get()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 44
All the tree walking functions start with some variant of this code;
centralise it in one place so we're not chasing subtly different bugs
everywhere.
Signed-off-by: Matthew Wilcox
Reviewed-by: Ross Zwisler
---
lib/radix-tree.c | 23 +++
1 file changed, 23 insertions(+)
From: Ross Zwisler
Use the new multi-order support functions to rewrite radix_tree_tag_get()
Signed-off-by: Ross Zwisler
Signed-off-by: Matthew Wilcox
---
lib/radix-tree.c | 44 ++--
1 file changed, 18 insertions(+), 26 deletions(-)
diff --git
On Wed, Apr 6, 2016 at 10:54 AM, Linus Torvalds
wrote:
>
> So I'd find a patch like the attached to be perfectly acceptable (in
> fact, we should have done this long ago).
I just committed it, let's see if some odd program uses the iomem
data. I doubt it, and I
On Wed, Apr 6, 2016 at 10:54 AM, Linus Torvalds
wrote:
>
> So I'd find a patch like the attached to be perfectly acceptable (in
> fact, we should have done this long ago).
I just committed it, let's see if some odd program uses the iomem
data. I doubt it, and I always enjoy improvements that
On 04/06/2016 06:25 PM, Appana Durga Kedareswara Rao wrote:
> Hi Soren,
>
>
>> -Original Message-
>> From: Sören Brinkmann [mailto:soren.brinkm...@xilinx.com]
>> Sent: Wednesday, April 06, 2016 9:50 PM
>> To: Appana Durga Kedareswara Rao
>> Cc: robh...@kernel.org;
On 04/06/2016 06:25 PM, Appana Durga Kedareswara Rao wrote:
> Hi Soren,
>
>
>> -Original Message-
>> From: Sören Brinkmann [mailto:soren.brinkm...@xilinx.com]
>> Sent: Wednesday, April 06, 2016 9:50 PM
>> To: Appana Durga Kedareswara Rao
>> Cc: robh...@kernel.org; pawel.m...@arm.com;
From: Richard Cochran
If a cpuidle registration error occurs during the hot plug notifier
callback, we should really inform the hot plug machinery instead of
just ignoring the error. This patch changes the callback to properly
return on error.
Signed-off-by: Richard
From: Richard Cochran
If a cpuidle registration error occurs during the hot plug notifier
callback, we should really inform the hot plug machinery instead of
just ignoring the error. This patch changes the callback to properly
return on error.
Signed-off-by: Richard Cochran
Signed-off-by: Len
From: Richard Cochran
The function, intel_idle_cpuidle_driver_init, delivers no error codes
at all. This patch changes the function to return 'void' instead of
returning zero.
Signed-off-by: Richard Cochran
Signed-off-by: Len Brown
From: Richard Cochran
The function, intel_idle_cpuidle_driver_init, delivers no error codes
at all. This patch changes the function to return 'void' instead of
returning zero.
Signed-off-by: Richard Cochran
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 4 +---
1 file changed, 1
On Wed, 2016-04-06 at 22:56 +0300, Andy Shevchenko wrote:
> On Wed, Apr 6, 2016 at 9:56 PM, Vinod Koul
> wrote:
> > On Mon, Apr 04, 2016 at 08:10:54PM +0300, Andy Shevchenko wrote:
> > > On Mon, 2016-04-04 at 10:03 -0700, Vinod Koul wrote:
> > > > On Fri, Mar 18, 2016 at
On Wed, 2016-04-06 at 22:56 +0300, Andy Shevchenko wrote:
> On Wed, Apr 6, 2016 at 9:56 PM, Vinod Koul
> wrote:
> > On Mon, Apr 04, 2016 at 08:10:54PM +0300, Andy Shevchenko wrote:
> > > On Mon, 2016-04-04 at 10:03 -0700, Vinod Koul wrote:
> > > > On Fri, Mar 18, 2016 at 04:24:40PM +0200, Andy
On Wed, Apr 06, 2016 at 11:44:05PM +0800, changbin...@intel.com wrote:
> From: "Du, Changbin"
>
> Signed-off-by: Du, Changbin
> ---
You need a changelog entry in order for a patch to be able to be
accepted.
thanks,
greg k-h
On Wed, Apr 06, 2016 at 11:44:05PM +0800, changbin...@intel.com wrote:
> From: "Du, Changbin"
>
> Signed-off-by: Du, Changbin
> ---
You need a changelog entry in order for a patch to be able to be
accepted.
thanks,
greg k-h
On 04/06/2016 06:11 AM, Alison Schofield wrote:
> Replace the code that guarantees the device stays in direct mode with
> iio_device_{claim|release}_direct_mode() which does same.
>
> Signed-off-by: Alison Schofield
Looks good, thanks.
Acked-by: Lars-Peter Clausen
On 04/06/2016 06:11 AM, Alison Schofield wrote:
> Replace the code that guarantees the device stays in direct mode with
> iio_device_{claim|release}_direct_mode() which does same.
>
> Signed-off-by: Alison Schofield
Looks good, thanks.
Acked-by: Lars-Peter Clausen
> ---
> Changed in v2:
> -
Hi,
I'm getting a kernel oops when I plug some smartphone via USB to my
laptop, which is currently running the v4.6-rc2.
The problem seems to be caused by a81cf9799ad7 ("cdc-acm: implement
put_char() and flush_chars()").
A simple NULL pointer check prevents the crash, but since I have no
use of
Hi,
I'm getting a kernel oops when I plug some smartphone via USB to my
laptop, which is currently running the v4.6-rc2.
The problem seems to be caused by a81cf9799ad7 ("cdc-acm: implement
put_char() and flush_chars()").
A simple NULL pointer check prevents the crash, but since I have no
use of
Yes, sorry about that. It will be in the next RFC or PATCH.
On Wed, Apr 6, 2016 at 1:54 PM, Greg KH wrote:
> On Wed, Apr 06, 2016 at 12:35:48PM -0700, Thomas Garnier wrote:
>> Provide an optional config (CONFIG_FREELIST_RANDOM) to randomize the
>> SLAB freelist. This
Yes, sorry about that. It will be in the next RFC or PATCH.
On Wed, Apr 6, 2016 at 1:54 PM, Greg KH wrote:
> On Wed, Apr 06, 2016 at 12:35:48PM -0700, Thomas Garnier wrote:
>> Provide an optional config (CONFIG_FREELIST_RANDOM) to randomize the
>> SLAB freelist. This security feature reduces the
From: Richard Cochran
This driver sets the broadcast tick quite early on during probe and does
not clean up again in cast of failure. This patch moves the setup call
after the registration, placing the on_each_cpu() calls within the global
CPU lock region.
From: Richard Cochran
This driver sets the broadcast tick quite early on during probe and does
not clean up again in cast of failure. This patch moves the setup call
after the registration, placing the on_each_cpu() calls within the global
CPU lock region.
Signed-off-by: Richard Cochran
From: Richard Cochran
Signed-off-by: Richard Cochran
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 2 --
1 file changed, 2 deletions(-)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index
From: Richard Cochran
Signed-off-by: Richard Cochran
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 2 --
1 file changed, 2 deletions(-)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index 012980a..6638a80 100644
--- a/drivers/idle/intel_idle.c
+++
From: Richard Cochran
In the module_init() method, if the per-CPU allocation fails, then the
active cpuidle registration is not cleaned up. This patch fixes the
issue by attempting the allocation before registration, and then
cleaning it up again on registration failure.
From: Richard Cochran
The helper function, intel_idle_cpu_init, registers one new device
with the cpuidle layer. If the registration should fail, that
function immediately calls intel_idle_cpuidle_devices_uninit() to
unregister every last CPU's device. However, it makes
From: Richard Cochran
In the module_init() method, if the per-CPU allocation fails, then the
active cpuidle registration is not cleaned up. This patch fixes the
issue by attempting the allocation before registration, and then
cleaning it up again on registration failure.
Signed-off-by: Richard
From: Richard Cochran
The helper function, intel_idle_cpu_init, registers one new device
with the cpuidle layer. If the registration should fail, that
function immediately calls intel_idle_cpuidle_devices_uninit() to
unregister every last CPU's device. However, it makes no sense to do
so, when
From: Richard Cochran
This driver registers cpuidle devices when a CPU comes online, but it
leaves the registrations in place when a CPU goes offline. The module
exit code only unregisters the currently online CPUs, leaving the
devices for offline CPUs dangling.
This
From: Richard Cochran
This driver registers cpuidle devices when a CPU comes online, but it
leaves the registrations in place when a CPU goes offline. The module
exit code only unregisters the currently online CPUs, leaving the
devices for offline CPUs dangling.
This patch changes the driver
From: Richard Cochran
In the module_exit() method, this driver first frees its per-CPU
pointer, then unregisters a callback making use of the pointer.
Furthermore, the function, intel_idle_cpuidle_devices_uninit, is racy
against CPU hot plugging as it calls
From: Richard Cochran
The helper function, intel_idle_cpuidle_devices_uninit, frees the
globally allocated per-CPU data. However, this function is invoked
from the hot plug notifier callback at a time when freeing that data
is not safe.
If the call to
From: Len Brown
KBL is similar to SKL
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 2 ++
1 file changed, 2 insertions(+)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index d0ec343..c966492 100644
---
From: Richard Cochran
In the module_exit() method, this driver first frees its per-CPU
pointer, then unregisters a callback making use of the pointer.
Furthermore, the function, intel_idle_cpuidle_devices_uninit, is racy
against CPU hot plugging as it calls for_each_online_cpu().
This patch
From: Richard Cochran
The helper function, intel_idle_cpuidle_devices_uninit, frees the
globally allocated per-CPU data. However, this function is invoked
from the hot plug notifier callback at a time when freeing that data
is not safe.
If the call to cpuidle_register_driver() should fail
From: Len Brown
KBL is similar to SKL
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 2 ++
1 file changed, 2 insertions(+)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index d0ec343..c966492 100644
--- a/drivers/idle/intel_idle.c
+++
From: Richard Cochran
The function, intel_idle_cpuidle_driver_init, makes calls on each CPU
to auto_demotion_disable() and c1e_promotion_disable(). These calls
are redundant, as intel_idle_cpu_init() does the same calls just a bit
later on. They are also premature, as
From: Len Brown
Broxton has all the HSW C-states, except C3.
BXT C-state timing is slightly different.
Here we trust the IRTL MSRs as authority
on maximum C-state latency, and override the driver's tables
with the values found in the associated IRTL MSRs.
Further we set the
From: Len Brown
SKX is similar to BDX
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 34 ++
1 file changed, 34 insertions(+)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index
From: Richard Cochran
The function, intel_idle_cpuidle_driver_init, makes calls on each CPU
to auto_demotion_disable() and c1e_promotion_disable(). These calls
are redundant, as intel_idle_cpu_init() does the same calls just a bit
later on. They are also premature, as the driver registration
From: Len Brown
Broxton has all the HSW C-states, except C3.
BXT C-state timing is slightly different.
Here we trust the IRTL MSRs as authority
on maximum C-state latency, and override the driver's tables
with the values found in the associated IRTL MSRs.
Further we set the target_residency to
From: Len Brown
SKX is similar to BDX
Signed-off-by: Len Brown
---
drivers/idle/intel_idle.c | 34 ++
1 file changed, 34 insertions(+)
diff --git a/drivers/idle/intel_idle.c b/drivers/idle/intel_idle.c
index 7575699..d0ec343 100644
---
Bug fixes, plus add a few more table entires for new model #'s.
Some of the BXT table entries will be replaced by values read
from processor configuration registers at boot-time.
Let me know if you see troubles with any of these patches.
They are all available on this git branch:
Bug fixes, plus add a few more table entires for new model #'s.
Some of the BXT table entries will be replaced by values read
from processor configuration registers at boot-time.
Let me know if you see troubles with any of these patches.
They are all available on this git branch:
On Wed, Apr 6, 2016 at 1:17 PM, Pavel Machek wrote:
>
> Why is kASLR incompatible with hibernation? We can hibernate have
> 4.3 kernel resume hibernation image of 4.2 kernel (on x86-64, and I
> have patches for x86). Resuming kernel with different randomization
> does not look that
On Wed, Apr 6, 2016 at 1:17 PM, Pavel Machek wrote:
>
> Why is kASLR incompatible with hibernation? We can hibernate have
> 4.3 kernel resume hibernation image of 4.2 kernel (on x86-64, and I
> have patches for x86). Resuming kernel with different randomization
> does not look that much
On Wed, Apr 06, 2016 at 04:38:07AM -0700, Manav Batra wrote:
> CHECK: Alignment should match open parenthesis
> WARNING: line over 80 characters
>
> Signed-off-by: Manav Batra
> ---
> drivers/staging/rts5208/ms.c | 66
> ++--
> 1
On Wed, Apr 06, 2016 at 04:38:07AM -0700, Manav Batra wrote:
> CHECK: Alignment should match open parenthesis
> WARNING: line over 80 characters
>
> Signed-off-by: Manav Batra
> ---
> drivers/staging/rts5208/ms.c | 66
> ++--
> 1 file changed, 39
On Wed, Apr 06, 2016 at 12:35:48PM -0700, Thomas Garnier wrote:
> Provide an optional config (CONFIG_FREELIST_RANDOM) to randomize the
> SLAB freelist. This security feature reduces the predictability of
> the kernel slab allocator against heap overflows.
>
> Randomized lists are pre-computed
On Wed, Apr 06, 2016 at 12:35:48PM -0700, Thomas Garnier wrote:
> Provide an optional config (CONFIG_FREELIST_RANDOM) to randomize the
> SLAB freelist. This security feature reduces the predictability of
> the kernel slab allocator against heap overflows.
>
> Randomized lists are pre-computed
From: "Naveen N. Rao"
Date: Tue, 5 Apr 2016 15:32:54 +0530
> Unsigned Jump-if-Greater-Than.
>
> Cc: Alexei Starovoitov
> Cc: Daniel Borkmann
> Cc: "David S. Miller"
> Cc: Ananth N Mavinakayanahalli
From: "Naveen N. Rao"
Date: Tue, 5 Apr 2016 15:32:53 +0530
> JMP_JSET tests incorrectly used BPF_JNE. Fix the same.
>
> Cc: Alexei Starovoitov
> Cc: Daniel Borkmann
> Cc: "David S. Miller"
> Cc: Ananth
From: "Naveen N. Rao"
Date: Tue, 5 Apr 2016 15:32:53 +0530
> JMP_JSET tests incorrectly used BPF_JNE. Fix the same.
>
> Cc: Alexei Starovoitov
> Cc: Daniel Borkmann
> Cc: "David S. Miller"
> Cc: Ananth N Mavinakayanahalli
> Cc: Michael Ellerman
> Cc: Paul Mackerras
> Signed-off-by:
From: "Naveen N. Rao"
Date: Tue, 5 Apr 2016 15:32:54 +0530
> Unsigned Jump-if-Greater-Than.
>
> Cc: Alexei Starovoitov
> Cc: Daniel Borkmann
> Cc: "David S. Miller"
> Cc: Ananth N Mavinakayanahalli
> Cc: Michael Ellerman
> Cc: Paul Mackerras
> Signed-off-by: Naveen N. Rao
Applied.
501 - 600 of 1854 matches
Mail list logo