net:bluetooth: update code from CAF
brought upto 2012-05-18	Peter Krystad	Bluetooth: Remove holding lock when sending A2MP message

Change-Id: Iac4f06474f0a18fe0c801353f4130ed064313749
Signed-off-by: vorbeth <vorbeth@gmail.com>
Add LagFree CPU Governor
governor: Added CPUfreq governor 'lazy'

From 869cd93f9f8f0159e5e266a5d1b5df9a97f9615a Mon Sep 17 00:00:00 2001
From: Ezekeel <notezekeel@googlemail.com>
Date: Sat, 17 Dec 2011 07:21:14 +0100
Subject: [PATCH] Added CPUfreq governor 'lazy'.

Conflicts:

	drivers/cpufreq/Kconfig

Conflicts:
	drivers/cpufreq/Kconfig
	drivers/cpufreq/Makefile
	include/linux/cpufreq.h
fix misplaced endifs
cpufreq: import badass from bricked
block: add V(R) I/O scheduler
[cpufreq] add smartassV2 governor
cpufreq: import pegasusq governor from sgs3 source
cpufreq: import adaptive governor from sgs3 source
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: add Simple I/O Scheduler
cpufreq: fix compiling with intellidemand
sweep2unlock: Add sweep2unlock v0.1

Thanks to Ezekeel's gladoskernel source which helped me
a lot in understanding how to emulate a virtual powerkey press.
The powerkey emulation is largely inspired by his coding for
Touch2Wake (Galaxy Nexus).
sweep2unlock: check if screen is offline
sweep2unlock: remove lck_reverse & checks
sweep2unlock: change sleep value, correct typo, add comment
sweep2unlock: change conditions

Don't assume unlock/lock is triggered if only one
condition is met. The new implementation includes
checking if 3 barriers are hit before triggering
the lock/unlock.
This assures only intentional triggering.
Also only allow one trigger as long as the finger
still touches the screen. Reset and allow another
trigger if the all fingers are lifted.
sweep2unlock: change barriers for screenoff trigger to avoid taking loads of screenshots :D