cpufreq: Do not forget min/max clock frequency on cpu hotplug
crc32c: Implement CRC32c with slicing-by-8 algorithm
block: prepare I/O context code for BFQ-v3r2 for 3.0

BFQ uses struct cfq_io_context to store its per-process per-device data,
reusing the same code for cic handling of CFQ.  The code is not shared
ATM to minimize the impact of these patches.

This patch introduces a new hlist to each io_context to store all the
cic's allocated by BFQ to allow calling the right destructor on module
unload; the radix tree used for cic lookup needs to be duplicated
because it can contain dead keys inserted by a scheduler and later
retrieved by the other one.

Update the io_context exit and free paths to take care also of
the BFQ cic's.

Change the type of cfqq inside struct cfq_io_context to void *
to use it also for BFQ per-queue data.

A new bfq-specific ioprio_changed field is necessary, too, to avoid
clobbering cfq's one, so switch ioprio_changed to a bitmap, with one
element per scheduler.

Signed-off-by: Fabio Checconi <fabio@gandalf.sssup.it>
Signed-off-by: Paolo Valente <paolo.valente@unimore.it>
Signed-off-by: Arianna Avanzini <avanzini.arianna@gmail.com>
block: cgroups, kconfig, build bits for BFQ-v3r2-3.0

Add a Kconfig option and do the related Makefile changes to compile
the BFQ I/O scheduler.  Also let the cgroups subsystem know about the
BFQ I/O controller.

Signed-off-by: Fabio Checconi <fabio@gandalf.sssup.it>
Signed-off-by: Paolo Valente <paolo.valente@unimore.it>
Signed-off-by: Arianna Avanzini <avanzini.arianna@gmail.com>
block: introduce the BFQ-v3r2 I/O sched for 3.0

Add the BFQ-v3r2 I/O scheduler to 3.0.
The general structure is borrowed from CFQ, as much of the code. A (bfq_)queue
is associated to each task doing I/O on a device, and each time a scheduling
decision has to be taken a queue is selected and it is served until it expires.

The main differences are:
    - Slices are given in the service domain: tasks are assigned budgets,
      measured in number of sectors. Once got the disk, a task must
      however consume its assigned budget within a configurable maximum time
      (by default, the maximum possible value of the budgets is automaticall
      computed to comply with this timeout). This allows the desired latency
      vs "throughput boosting" tradeoff to be set.

    - Budgets are scheduled according to a variant of WF2Q+, implemented
      using an augmented rb-tree to take eligibility into account while
      preserving an O(log N) overall complexity.

    - A low-latency tunable is provided; if enabled, both interactive and soft
      real-time applications are guaranteed very low latency.

    - Latency guarantees are preserved also in presence of NCQ.

    - Useful features borrowed from CFQ: cooperating-queues merging (with
      some additional optimizations with respect to the original CFQ version),
      static fallback queue for OOM.

    - BFQ supports full hierarchical scheduling, exporting a cgroups
      interface.  Each node has a full scheduler, so each group can
      be assigned its own ioprio and an ioprio_class.

    - If the cgroups interface is used, weights can be explictly assigned,
      otherwise ioprio values are mapped to weights using the relation
      weight = IOPRIO_BE_NR - ioprio.

    - ioprio classes are served in strict priority order, i.e., lower
      priority queues are not served as long as there are higher priority
      queues.  Among queues in the same class the bandwidth is distributed
      in proportion to the weights of each queue. A very thin extra bandwidth
      is however guaranteed to the Idle class, to prevent it from starving.

Regarding what has not changed it is worth noting:
    - the handling of cfq_io_contexts to associate queues to tasks.
      Much of the code has been reused just renaming it.  (There is room for
      code sharing with CFQ but we wanted to minimize the impact of this
      patch.)

    - The handling of async queues.

    - The handling of idle windows.

    - The handling of merging.

    - The heuristics to assert that a task is worth an idle window (with
      minor modifications to hw_tag/CIC_SEEKY detection).

Signed-off-by: Paolo Valente <paolo.valente@unimore.it>
Signed-off-by: Arianna Avanzini <avanzini.arianna@gmail.com>
block: Enable BFQ I/O scheduler
block: Add Simple IO scheduler
block: Enable sio
mach-u1: Move touchscreen values where they belong

Thanks to gm for the heads up.
mach-u1: implemented android ramconsole
enable sec log feature (last_kmsg)
config: Enable SEC_LOG_LAST_KMSG
cpufreq: Inform notifiers about new policy by calling exynos_target

This patch ensures that the policy's new frequencies stay within
the intended minimum and maximum limits.

Thanks to gokhanmoral and Entropy512 for giving me the last kick
that I needed.
cpufreq: Make CPUFREQ_NOTIFY workaround conditional
Revert cpufreq commits
mach-exynos: cpufreq: Prevent bogus old_index caused by policy change

For the purposes of deciding whether to completely reset the APLL,
or just change the s divisor, exynos_target determines the old
frequency index for the current frequency.

Unfortunately, as it uses the standard cpufreq table lookup code,
which does policy enforcement, this will cause a wrong index_old
if the current CPU frequency is outside of the policy limits,
for example immediately after a policy min/max frequency change.

This ensures that the current frequency is included within the
policy limits used to determine old_index, and also ensures
that the current frequency is correct by getting it from the
hardware instead of using freqs.cur.

This solves the issue on GT-I9100 and SGH-I777 kernels where
policy changes (such as SetCPU screen-off profiles) cause crashes.

This patch in its original form was written by:
Gokhan Moral <gm@alumni.bilkent.edu.tr>

Small cleanups of the patch (changing only min or max) by:
Andrew Dodd <atd7@cornell.edu>

Signed-off-by: Andrew Dodd <atd7@cornell.edu>
exynos-cpufreq: Ensure that scaling_available_frequencies is populated

Based on patches by netarchy

Signed-off-by: Andrew Dodd <atd7@cornell.edu>
mach-exynos: stand-hotplug: Improve CPU0 turnoff protection logic

After reading the code further, it turns out the previous fix
may have prevented onlining CPU1 in some or all circumstances.

This changes the CPU0 turnoff protection logic such that it
ONLY skips the hotplugging if CPU0 is chosen for hotplugging out.

Signed-off-by: Andrew Dodd <atd7@cornell.edu>
cm3663: Set initial state of proximity sensor to "far"
Linux 3.0.27

Changelog:
http://www.kernel.org/pub/linux/kernel/v3.0/ChangeLog-3.0.27