Eric Lee / smarc-fsl-linux-kernel

31 May, 2019

1 commit

  • 2874c5fd2   treewide: Replace GPLv2 boilerplate/reference with SPDX - rule 152 ... Browse Code »

    Based on 1 normalized pattern(s):

    this program is free software you can redistribute it and or modify
    it under the terms of the gnu general public license as published by
    the free software foundation either version 2 of the license or at
    your option any later version

    extracted by the scancode license scanner the SPDX license identifier

    GPL-2.0-or-later

    has been chosen to replace the boilerplate/reference in 3029 file(s).

    Signed-off-by: Thomas Gleixner
    Reviewed-by: Allison Randal
    Cc: linux-spdx@vger.kernel.org
    Link: https://lkml.kernel.org/r/20190527070032.746973796@linutronix.de
    Signed-off-by: Greg Kroah-Hartman

    Thomas Gleixner
     

08 Jul, 2008

1 commit

01 Jul, 2008

1 commit

  • aebb6a849   textsearch: fix Boyer-Moore text search bug ... Browse Code »

    The current logic has a bug which cannot find matching pattern, if the
    pattern is matched from the first character of target string.
    for example:
    pattern=abc, string=abcdefg
    pattern=a, string=abcdefg
    Searching algorithm should return 0 for those things.

    Signed-off-by: Joonwoo Park
    Signed-off-by: Patrick McHardy
    Signed-off-by: David S. Miller

    Joonwoo Park
     

23 Aug, 2006

1 commit

  • 3ffaa8c7c   [TEXTSEARCH]: Fix Boyer Moore initialization bug ... Browse Code »

    The pattern is set after trying to compute the prefix table, which tries
    to use it. Initialize it before calling compute_prefix_tbl, make
    compute_prefix_tbl consistently use only the data from struct ts_bm
    and remove the now unnecessary arguments.

    Signed-off-by: Michael Rash
    Signed-off-by: Patrick McHardy
    Signed-off-by: David S. Miller

    Michael Rash
     

01 Jul, 2006

1 commit

03 Feb, 2006

1 commit

  • 3f330317a   [TEXTSEARCH]: Fix broken good shift array calculation in Boyer-Moore ... Browse Code »

    The current logic does not calculate correctly the good shift array:
    Let x be the pattern that is being searched. Let y be the block of data.
    The good shift array aligns the segment:

    x[i+1 ... m-1] = y[i+j+1 ... j+m-1]

    with its rightmost occurrence in x that fulfils x[i] neq y[i+j].

    In previous version, the good shift array for the pattern ANPANMAN is:
    [1, 8, 3, 8, 8, 8, 8, 8]
    and should be:
    [1, 8, 3, 6, 6, 6, 6, 6]

    Signed-off-by: Pablo Neira Ayuso
    Signed-off-by: David S. Miller

    Pablo Neira Ayuso
     

09 Oct, 2005

1 commit

  • dd0fc66fb   [PATCH] gfp flags annotations - part 1 ... Browse Code »

    - added typedef unsigned int __nocast gfp_t;

    - replaced __nocast uses for gfp flags with gfp_t - it gives exactly
    the same warnings as far as sparse is concerned, doesn't change
    generated code (from gcc point of view we replaced unsigned int with
    typedef) and documents what's going on far better.

    Signed-off-by: Al Viro
    Signed-off-by: Linus Torvalds

    Al Viro
     

05 Oct, 2005

1 commit

30 Aug, 2005

1 commit