similar to: [compiler-rt] Use of ESR context in AArch64 sigframe

Displaying 20 results from an estimated 5000 matches similar to: "[compiler-rt] Use of ESR context in AArch64 sigframe"

2018 Mar 07
1
[compiler-rt] Use of ESR context in AArch64 sigframe
On 03/06/2018 08:58 PM, Will Deacon wrote: > Hi all, > > As part of some recent work to harden the Kernel Address Space Layout > Randomisation (KASLR) implementation in arm64 Linux, I've proposed a > patch for the kernel which omits the ESR context from the signal frame > if the faulting virtual address is outside the range of addresses which > can be mapped by userspace.
2018 Mar 07
2
[compiler-rt] Use of ESR context in AArch64 sigframe
On Wed, Mar 7, 2018 at 7:48 AM, Dmitry Vyukov <dvyukov at google.com> wrote: > On Wed, Mar 7, 2018 at 4:39 PM, Andrey Ryabinin <aryabinin at virtuozzo.com> wrote: >> On 03/06/2018 08:58 PM, Will Deacon wrote: >>> Hi all, >>> >>> As part of some recent work to harden the Kernel Address Space Layout >>> Randomisation (KASLR) implementation in
2018 Mar 07
0
[compiler-rt] Use of ESR context in AArch64 sigframe
On Wed, Mar 7, 2018 at 4:39 PM, Andrey Ryabinin <aryabinin at virtuozzo.com> wrote: > On 03/06/2018 08:58 PM, Will Deacon wrote: >> Hi all, >> >> As part of some recent work to harden the Kernel Address Space Layout >> Randomisation (KASLR) implementation in arm64 Linux, I've proposed a >> patch for the kernel which omits the ESR context from the signal
2018 Mar 08
0
[compiler-rt] Use of ESR context in AArch64 sigframe
Thanks for the replies. Some comments below. On Wed, Mar 07, 2018 at 11:40:41AM -0800, Evgenii Stepanov wrote: > On Wed, Mar 7, 2018 at 7:48 AM, Dmitry Vyukov <dvyukov at google.com> wrote: > > On Wed, Mar 7, 2018 at 4:39 PM, Andrey Ryabinin <aryabinin at virtuozzo.com> wrote: > >> On 03/06/2018 08:58 PM, Will Deacon wrote: > >>> Hi all, > >>>
2018 Mar 09
1
[compiler-rt] Use of ESR context in AArch64 sigframe
On Thu, Mar 8, 2018 at 9:11 AM, Will Deacon <will.deacon at arm.com> wrote: > Thanks for the replies. Some comments below. > > On Wed, Mar 07, 2018 at 11:40:41AM -0800, Evgenii Stepanov wrote: >> On Wed, Mar 7, 2018 at 7:48 AM, Dmitry Vyukov <dvyukov at google.com> wrote: >> > On Wed, Mar 7, 2018 at 4:39 PM, Andrey Ryabinin <aryabinin at virtuozzo.com>
2020 Mar 03
4
[PATCH v11 00/11] x86: PIE support to extend KASLR randomization
On Thu, Feb 27, 2020 at 04:00:45PM -0800, Thomas Garnier wrote: > Minor changes based on feedback and rebase from v10. > > Splitting the previous serie in two. This part contains assembly code > changes required for PIE but without any direct dependencies with the > rest of the patchset. > > Note: Using objtool to detect non-compliant PIE relocations is not yet > possible
2020 Mar 03
4
[PATCH v11 00/11] x86: PIE support to extend KASLR randomization
On Thu, Feb 27, 2020 at 04:00:45PM -0800, Thomas Garnier wrote: > Minor changes based on feedback and rebase from v10. > > Splitting the previous serie in two. This part contains assembly code > changes required for PIE but without any direct dependencies with the > rest of the patchset. > > Note: Using objtool to detect non-compliant PIE relocations is not yet > possible
2011 Apr 07
1
Randomisation tests
Hi, I want to ue a randomisation test, to compare two sample means, for a small set of data, I've looked at towt.permutation, perm.test and permtest, as well as permTS(), which is the best one to use for such a simple purpose? I know perm.test package isn't used anymore and coins recommended, but reading the manual I couldnt find the function most like it, ore more likely I
2009 Apr 08
1
Genstat into R - Randomisation test
Hello everybody, I have a question. I would like to get a correlation between constitutive and induced plant defence which I messured on 30 plant species. So I have table with Species, Induced defence (ID), and constitutive defence (CD). Since Induced and constitutive defence are not independant (so called spurious correlation) I should do a randomisation test. I have a syntax of my
2007 Aug 06
1
data analysis
Dear all, I have a factorial design where the response is an ordered categorical response. treatment (two levels: 1 and 2) time (four levels: 30, 60,90 and 120) ordered response (0,1,2,3) could someone suggest a correct analysis or some references? Best regards subject treatment time response 1 1 30 3 2 1 30 3 3 1 30 1 4 1 30
2007 Nov 26
1
Unweighted meta-analysis
Hello I'm very much a beginner on meta-analysis, so apologies if this is a trivial posting. I've been sent a set data from separate experimental studies, Treatment and Control, but no measure of the variance of effect sizes, numbers of replicates etc. Instead, for each study, all I have is the mean value for the treatment and control (but not the SD). As far as I can tell, this forces
2005 Feb 09
6
randomisation
Dear useRs I am looking for a way to randomise the values within a matrix: the conditions are that the sums of the rows and the sums of the columns should remain the same as in the original matrix. Any help would be appreciated Cheers Yann
2010 Jul 28
1
randomisation for matrix
Hi to all, I am looking for a randomisation procedure for a single matrix, including a possibility to set the number of randomisations and the to set the number of row and columns . Knut
2014 Sep 19
4
Standardizing an MSR or other hypercall to get an RNG seed?
On Fri, Sep 19, 2014 at 09:40:07AM -0700, H. Peter Anvin wrote: > On 09/19/2014 09:37 AM, Gleb Natapov wrote: > > > > Linux detects what hypervior it runs on very early > > Not anywhere close to early enough. We're talking for uses like kASLR. > Still to early to do: h = cpuid(HYPERVIOR_SIGNATURE) if (h == KVMKVMKVM) { if (cpuid(kvm_features) &
2014 Sep 19
4
Standardizing an MSR or other hypercall to get an RNG seed?
On Fri, Sep 19, 2014 at 09:40:07AM -0700, H. Peter Anvin wrote: > On 09/19/2014 09:37 AM, Gleb Natapov wrote: > > > > Linux detects what hypervior it runs on very early > > Not anywhere close to early enough. We're talking for uses like kASLR. > Still to early to do: h = cpuid(HYPERVIOR_SIGNATURE) if (h == KVMKVMKVM) { if (cpuid(kvm_features) &
2018 May 25
2
[PATCH v3 09/27] x86/acpi: Adapt assembly for PIE support
On Thu 2018-05-24 09:35:42, Thomas Garnier wrote: > On Thu, May 24, 2018 at 4:03 AM Pavel Machek <pavel at ucw.cz> wrote: > > > On Wed 2018-05-23 12:54:03, Thomas Garnier wrote: > > > Change the assembly code to use only relative references of symbols for > the > > > kernel to be PIE compatible. > > > > > > Position Independent Executable
2018 May 25
2
[PATCH v3 09/27] x86/acpi: Adapt assembly for PIE support
On Thu 2018-05-24 09:35:42, Thomas Garnier wrote: > On Thu, May 24, 2018 at 4:03 AM Pavel Machek <pavel at ucw.cz> wrote: > > > On Wed 2018-05-23 12:54:03, Thomas Garnier wrote: > > > Change the assembly code to use only relative references of symbols for > the > > > kernel to be PIE compatible. > > > > > > Position Independent Executable
2011 Feb 27
4
[PATCH] Add minimal mkstemp(3) implementation.
This uses time, ASLR and pid for randomisation. (Closes: #516774) Signed-off-by: Thorsten Glaser <tg at mirbsd.org> --- usr/include/stdlib.h | 2 + usr/klibc/Kbuild | 2 +- usr/klibc/mkstemp.c | 93 ++++++++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 96 insertions(+), 1 deletions(-) create mode 100644 usr/klibc/mkstemp.c diff --git a/usr/include/stdlib.h
2014 Sep 19
3
Standardizing an MSR or other hypercall to get an RNG seed?
On Fri, Sep 19, 2014 at 10:08:20AM -0700, H. Peter Anvin wrote: > On 09/19/2014 09:53 AM, Gleb Natapov wrote: > > On Fri, Sep 19, 2014 at 09:40:07AM -0700, H. Peter Anvin wrote: > >> On 09/19/2014 09:37 AM, Gleb Natapov wrote: > >>> > >>> Linux detects what hypervior it runs on very early > >> > >> Not anywhere close to early enough.
2014 Sep 19
3
Standardizing an MSR or other hypercall to get an RNG seed?
On Fri, Sep 19, 2014 at 10:08:20AM -0700, H. Peter Anvin wrote: > On 09/19/2014 09:53 AM, Gleb Natapov wrote: > > On Fri, Sep 19, 2014 at 09:40:07AM -0700, H. Peter Anvin wrote: > >> On 09/19/2014 09:37 AM, Gleb Natapov wrote: > >>> > >>> Linux detects what hypervior it runs on very early > >> > >> Not anywhere close to early enough.