litmus-rt-budgetable-locks.git/.git - Unnamed repository; edit this file 'description' to name the repository.

diff options

author	Daniel Glöckner <dg@emlix.com>	2011-08-03 19:21:02 -0400
committer	Linus Torvalds <torvalds@linux-foundation.org>	2011-08-03 20:25:20 -0400
commit	12b3e038e5bb4860c17d001e92a6fa9964c0a7b9 (patch)
tree	73bed0f33454932de3bc1d9aa49cc255a4f072fb /arch/arm/vfp
parent	dd48c085c1cdf9446f92826f1fd451167fb6c2fd (diff)

rtc-omap: fix initialization of control register

As the comment explains, the intention of the code is to clear the OMAP_RTC_CTRL_MODE_12_24 bit, but instead it only clears the OMAP_RTC_CTRL_SPLIT and OMAP_RTC_CTRL_AUTO_COMP bits, which should be kept. OMAP_RTC_CTRL_DISABLE, OMAP_RTC_CTRL_SET_32_COUNTER, OMAP_RTC_CTRL_TEST, and OMAP_RTC_CTRL_ROUND_30S are also better off being cleared. Signed-off-by: Daniel Glöckner <dg@emlix.com> Cc: Alessandro Zummo <a.zummo@towertech.it> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>

Diffstat (limited to 'arch/arm/vfp')

0 files changed, 0 insertions, 0 deletions

/* * klist.c - Routines for manipulating klists. * * * This klist interface provides a couple of structures that wrap around * struct list_head to provide explicit list "head" (struct klist) and * list "node" (struct klist_node) objects. For struct klist, a spinlock * is included that protects access to the actual list itself. struct * klist_node provides a pointer to the klist that owns it and a kref * reference count that indicates the number of current users of that node * in the list. * * The entire point is to provide an interface for iterating over a list * that is safe and allows for modification of the list during the * iteration (e.g. insertion and removal), including modification of the * current node on the list. * * It works using a 3rd object type - struct klist_iter - that is declared * and initialized before an iteration. klist_next() is used to acquire the * next element in the list. It returns NULL if there are no more items. * Internally, that routine takes the klist's lock, decrements the reference * count of the previous klist_node and increments the count of the next * klist_node. It then drops the lock and returns. * * There are primitives for adding and removing nodes to/from a klist. * When deleting, klist_del() will simply decrement the reference count. * Only when the count goes to 0 is the node removed from the list. * klist_remove() will try to delete the node from the list and block * until it is actually removed. This is useful for objects (like devices)


context:
space:
mode: