2005-04-16 22:20:36 +00:00
|
|
|
#
|
|
|
|
|
# Makefile for the linux kernel.
|
|
|
|
|
#
|
|
|
|
|
|
|
|
|
|
obj-y = sched.o fork.o exec_domain.o panic.o printk.o profile.o \
|
2008-05-29 18:17:02 +00:00
|
|
|
cpu.o exit.o itimer.o time.o softirq.o resource.o \
|
2008-02-08 12:18:23 +00:00
|
|
|
sysctl.o capability.o ptrace.o timer.o user.o \
|
2005-04-16 22:20:36 +00:00
|
|
|
signal.o sys.o kmod.o workqueue.o pid.o \
|
2008-01-25 20:08:24 +00:00
|
|
|
rcupdate.o extable.o params.o posix-timers.o \
|
2006-01-10 04:52:32 +00:00
|
|
|
kthread.o wait.o kfifo.o sys_ni.o posix-cpu-timers.o mutex.o \
|
2008-03-08 02:55:58 +00:00
|
|
|
hrtimer.o rwsem.o nsproxy.o srcu.o semaphore.o \
|
2008-05-03 16:29:28 +00:00
|
|
|
notifier.o ksysfs.o pm_qos_params.o sched_clock.o
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2008-07-11 00:58:11 +00:00
|
|
|
CFLAGS_REMOVE_sched.o = -mno-spe
|
2008-05-15 01:30:30 +00:00
|
|
|
|
2008-05-12 19:20:55 +00:00
|
|
|
ifdef CONFIG_FTRACE
|
2008-05-15 01:30:30 +00:00
|
|
|
# Do not trace debug files and internal ftrace files
|
|
|
|
|
CFLAGS_REMOVE_lockdep.o = -pg
|
|
|
|
|
CFLAGS_REMOVE_lockdep_proc.o = -pg
|
|
|
|
|
CFLAGS_REMOVE_mutex-debug.o = -pg
|
|
|
|
|
CFLAGS_REMOVE_rtmutex-debug.o = -pg
|
|
|
|
|
CFLAGS_REMOVE_cgroup-debug.o = -pg
|
|
|
|
|
CFLAGS_REMOVE_sched_clock.o = -pg
|
2008-05-12 19:20:55 +00:00
|
|
|
endif
|
|
|
|
|
|
2008-04-29 08:02:36 +00:00
|
|
|
obj-$(CONFIG_SYSCTL_SYSCALL_CHECK) += sysctl_check.o
|
2006-07-03 07:24:38 +00:00
|
|
|
obj-$(CONFIG_STACKTRACE) += stacktrace.o
|
2006-06-26 07:25:06 +00:00
|
|
|
obj-y += time/
|
2006-01-09 23:59:20 +00:00
|
|
|
obj-$(CONFIG_DEBUG_MUTEXES) += mutex-debug.o
|
[PATCH] lockdep: core
Do 'make oldconfig' and accept all the defaults for new config options -
reboot into the kernel and if everything goes well it should boot up fine and
you should have /proc/lockdep and /proc/lockdep_stats files.
Typically if the lock validator finds some problem it will print out
voluminous debug output that begins with "BUG: ..." and which syslog output
can be used by kernel developers to figure out the precise locking scenario.
What does the lock validator do? It "observes" and maps all locking rules as
they occur dynamically (as triggered by the kernel's natural use of spinlocks,
rwlocks, mutexes and rwsems). Whenever the lock validator subsystem detects a
new locking scenario, it validates this new rule against the existing set of
rules. If this new rule is consistent with the existing set of rules then the
new rule is added transparently and the kernel continues as normal. If the
new rule could create a deadlock scenario then this condition is printed out.
When determining validity of locking, all possible "deadlock scenarios" are
considered: assuming arbitrary number of CPUs, arbitrary irq context and task
context constellations, running arbitrary combinations of all the existing
locking scenarios. In a typical system this means millions of separate
scenarios. This is why we call it a "locking correctness" validator - for all
rules that are observed the lock validator proves it with mathematical
certainty that a deadlock could not occur (assuming that the lock validator
implementation itself is correct and its internal data structures are not
corrupted by some other kernel subsystem). [see more details and conditionals
of this statement in include/linux/lockdep.h and
Documentation/lockdep-design.txt]
Furthermore, this "all possible scenarios" property of the validator also
enables the finding of complex, highly unlikely multi-CPU multi-context races
via single single-context rules, increasing the likelyhood of finding bugs
drastically. In practical terms: the lock validator already found a bug in
the upstream kernel that could only occur on systems with 3 or more CPUs, and
which needed 3 very unlikely code sequences to occur at once on the 3 CPUs.
That bug was found and reported on a single-CPU system (!). So in essence a
race will be found "piecemail-wise", triggering all the necessary components
for the race, without having to reproduce the race scenario itself! In its
short existence the lock validator found and reported many bugs before they
actually caused a real deadlock.
To further increase the efficiency of the validator, the mapping is not per
"lock instance", but per "lock-class". For example, all struct inode objects
in the kernel have inode->inotify_mutex. If there are 10,000 inodes cached,
then there are 10,000 lock objects. But ->inotify_mutex is a single "lock
type", and all locking activities that occur against ->inotify_mutex are
"unified" into this single lock-class. The advantage of the lock-class
approach is that all historical ->inotify_mutex uses are mapped into a single
(and as narrow as possible) set of locking rules - regardless of how many
different tasks or inode structures it took to build this set of rules. The
set of rules persist during the lifetime of the kernel.
To see the rough magnitude of checking that the lock validator does, here's a
portion of /proc/lockdep_stats, fresh after bootup:
lock-classes: 694 [max: 2048]
direct dependencies: 1598 [max: 8192]
indirect dependencies: 17896
all direct dependencies: 16206
dependency chains: 1910 [max: 8192]
in-hardirq chains: 17
in-softirq chains: 105
in-process chains: 1065
stack-trace entries: 38761 [max: 131072]
combined max dependencies: 2033928
hardirq-safe locks: 24
hardirq-unsafe locks: 176
softirq-safe locks: 53
softirq-unsafe locks: 137
irq-safe locks: 59
irq-unsafe locks: 176
The lock validator has observed 1598 actual single-thread locking patterns,
and has validated all possible 2033928 distinct locking scenarios.
More details about the design of the lock validator can be found in
Documentation/lockdep-design.txt, which can also found at:
http://redhat.com/~mingo/lockdep-patches/lockdep-design.txt
[bunk@stusta.de: cleanups]
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Arjan van de Ven <arjan@linux.intel.com>
Signed-off-by: Adrian Bunk <bunk@stusta.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2006-07-03 07:24:50 +00:00
|
|
|
obj-$(CONFIG_LOCKDEP) += lockdep.o
|
2006-07-03 07:24:52 +00:00
|
|
|
ifeq ($(CONFIG_PROC_FS),y)
|
|
|
|
|
obj-$(CONFIG_LOCKDEP) += lockdep_proc.o
|
|
|
|
|
endif
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_FUTEX) += futex.o
|
2006-03-27 09:16:24 +00:00
|
|
|
ifeq ($(CONFIG_COMPAT),y)
|
|
|
|
|
obj-$(CONFIG_FUTEX) += futex_compat.o
|
|
|
|
|
endif
|
2006-06-27 09:54:53 +00:00
|
|
|
obj-$(CONFIG_RT_MUTEXES) += rtmutex.o
|
2006-06-27 09:54:55 +00:00
|
|
|
obj-$(CONFIG_DEBUG_RT_MUTEXES) += rtmutex-debug.o
|
2006-06-27 09:54:56 +00:00
|
|
|
obj-$(CONFIG_RT_MUTEX_TESTER) += rtmutex-tester.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_GENERIC_ISA_DMA) += dma.o
|
2008-06-26 09:21:34 +00:00
|
|
|
obj-$(CONFIG_USE_GENERIC_SMP_HELPERS) += smp.o
|
2008-05-29 18:17:02 +00:00
|
|
|
obj-$(CONFIG_SMP) += spinlock.o
|
[PATCH] spinlock consolidation
This patch (written by me and also containing many suggestions of Arjan van
de Ven) does a major cleanup of the spinlock code. It does the following
things:
- consolidates and enhances the spinlock/rwlock debugging code
- simplifies the asm/spinlock.h files
- encapsulates the raw spinlock type and moves generic spinlock
features (such as ->break_lock) into the generic code.
- cleans up the spinlock code hierarchy to get rid of the spaghetti.
Most notably there's now only a single variant of the debugging code,
located in lib/spinlock_debug.c. (previously we had one SMP debugging
variant per architecture, plus a separate generic one for UP builds)
Also, i've enhanced the rwlock debugging facility, it will now track
write-owners. There is new spinlock-owner/CPU-tracking on SMP builds too.
All locks have lockup detection now, which will work for both soft and hard
spin/rwlock lockups.
The arch-level include files now only contain the minimally necessary
subset of the spinlock code - all the rest that can be generalized now
lives in the generic headers:
include/asm-i386/spinlock_types.h | 16
include/asm-x86_64/spinlock_types.h | 16
I have also split up the various spinlock variants into separate files,
making it easier to see which does what. The new layout is:
SMP | UP
----------------------------|-----------------------------------
asm/spinlock_types_smp.h | linux/spinlock_types_up.h
linux/spinlock_types.h | linux/spinlock_types.h
asm/spinlock_smp.h | linux/spinlock_up.h
linux/spinlock_api_smp.h | linux/spinlock_api_up.h
linux/spinlock.h | linux/spinlock.h
/*
* here's the role of the various spinlock/rwlock related include files:
*
* on SMP builds:
*
* asm/spinlock_types.h: contains the raw_spinlock_t/raw_rwlock_t and the
* initializers
*
* linux/spinlock_types.h:
* defines the generic type and initializers
*
* asm/spinlock.h: contains the __raw_spin_*()/etc. lowlevel
* implementations, mostly inline assembly code
*
* (also included on UP-debug builds:)
*
* linux/spinlock_api_smp.h:
* contains the prototypes for the _spin_*() APIs.
*
* linux/spinlock.h: builds the final spin_*() APIs.
*
* on UP builds:
*
* linux/spinlock_type_up.h:
* contains the generic, simplified UP spinlock type.
* (which is an empty structure on non-debug builds)
*
* linux/spinlock_types.h:
* defines the generic type and initializers
*
* linux/spinlock_up.h:
* contains the __raw_spin_*()/etc. version of UP
* builds. (which are NOPs on non-debug, non-preempt
* builds)
*
* (included on UP-non-debug builds:)
*
* linux/spinlock_api_up.h:
* builds the _spin_*() APIs.
*
* linux/spinlock.h: builds the final spin_*() APIs.
*/
All SMP and UP architectures are converted by this patch.
arm, i386, ia64, ppc, ppc64, s390/s390x, x64 was build-tested via
crosscompilers. m32r, mips, sh, sparc, have not been tested yet, but should
be mostly fine.
From: Grant Grundler <grundler@parisc-linux.org>
Booted and lightly tested on a500-44 (64-bit, SMP kernel, dual CPU).
Builds 32-bit SMP kernel (not booted or tested). I did not try to build
non-SMP kernels. That should be trivial to fix up later if necessary.
I converted bit ops atomic_hash lock to raw_spinlock_t. Doing so avoids
some ugly nesting of linux/*.h and asm/*.h files. Those particular locks
are well tested and contained entirely inside arch specific code. I do NOT
expect any new issues to arise with them.
If someone does ever need to use debug/metrics with them, then they will
need to unravel this hairball between spinlocks, atomic ops, and bit ops
that exist only because parisc has exactly one atomic instruction: LDCW
(load and clear word).
From: "Luck, Tony" <tony.luck@intel.com>
ia64 fix
Signed-off-by: Ingo Molnar <mingo@elte.hu>
Signed-off-by: Arjan van de Ven <arjanv@infradead.org>
Signed-off-by: Grant Grundler <grundler@parisc-linux.org>
Cc: Matthew Wilcox <willy@debian.org>
Signed-off-by: Hirokazu Takata <takata@linux-m32r.org>
Signed-off-by: Mikael Pettersson <mikpe@csd.uu.se>
Signed-off-by: Benoit Boissinot <benoit.boissinot@ens-lyon.org>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-09-10 07:25:56 +00:00
|
|
|
obj-$(CONFIG_DEBUG_SPINLOCK) += spinlock.o
|
2006-07-03 07:24:54 +00:00
|
|
|
obj-$(CONFIG_PROVE_LOCKING) += spinlock.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_UID16) += uid16.o
|
|
|
|
|
obj-$(CONFIG_MODULES) += module.o
|
|
|
|
|
obj-$(CONFIG_KALLSYMS) += kallsyms.o
|
|
|
|
|
obj-$(CONFIG_PM) += power/
|
|
|
|
|
obj-$(CONFIG_BSD_PROCESS_ACCT) += acct.o
|
2005-06-25 21:57:52 +00:00
|
|
|
obj-$(CONFIG_KEXEC) += kexec.o
|
2008-01-30 12:33:08 +00:00
|
|
|
obj-$(CONFIG_BACKTRACE_SELF_TEST) += backtracetest.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_COMPAT) += compat.o
|
Task Control Groups: basic task cgroup framework
Generic Process Control Groups
--------------------------
There have recently been various proposals floating around for
resource management/accounting and other task grouping subsystems in
the kernel, including ResGroups, User BeanCounters, NSProxy
cgroups, and others. These all need the basic abstraction of being
able to group together multiple processes in an aggregate, in order to
track/limit the resources permitted to those processes, or control
other behaviour of the processes, and all implement this grouping in
different ways.
This patchset provides a framework for tracking and grouping processes
into arbitrary "cgroups" and assigning arbitrary state to those
groupings, in order to control the behaviour of the cgroup as an
aggregate.
The intention is that the various resource management and
virtualization/cgroup efforts can also become task cgroup
clients, with the result that:
- the userspace APIs are (somewhat) normalised
- it's easier to test e.g. the ResGroups CPU controller in
conjunction with the BeanCounters memory controller, or use either of
them as the resource-control portion of a virtual server system.
- the additional kernel footprint of any of the competing resource
management systems is substantially reduced, since it doesn't need
to provide process grouping/containment, hence improving their
chances of getting into the kernel
This patch:
Add the main task cgroups framework - the cgroup filesystem, and the
basic structures for tracking membership and associating subsystem state
objects to tasks.
Signed-off-by: Paul Menage <menage@google.com>
Cc: Serge E. Hallyn <serue@us.ibm.com>
Cc: "Eric W. Biederman" <ebiederm@xmission.com>
Cc: Dave Hansen <haveblue@us.ibm.com>
Cc: Balbir Singh <balbir@in.ibm.com>
Cc: Paul Jackson <pj@sgi.com>
Cc: Kirill Korotaev <dev@openvz.org>
Cc: Herbert Poetzl <herbert@13thfloor.at>
Cc: Srivatsa Vaddagiri <vatsa@in.ibm.com>
Cc: Cedric Le Goater <clg@fr.ibm.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2007-10-19 06:39:30 +00:00
|
|
|
obj-$(CONFIG_CGROUPS) += cgroup.o
|
2007-10-19 06:39:43 +00:00
|
|
|
obj-$(CONFIG_CGROUP_DEBUG) += cgroup_debug.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_CPUSETS) += cpuset.o
|
2007-10-19 06:39:45 +00:00
|
|
|
obj-$(CONFIG_CGROUP_NS) += ns_cgroup.o
|
2008-02-08 12:18:23 +00:00
|
|
|
obj-$(CONFIG_UTS_NS) += utsname.o
|
|
|
|
|
obj-$(CONFIG_USER_NS) += user_namespace.o
|
2008-02-08 12:18:24 +00:00
|
|
|
obj-$(CONFIG_PID_NS) += pid_namespace.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_IKCONFIG) += configs.o
|
2008-02-07 08:13:49 +00:00
|
|
|
obj-$(CONFIG_RESOURCE_COUNTERS) += res_counter.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_STOP_MACHINE) += stop_machine.o
|
2008-01-30 12:32:53 +00:00
|
|
|
obj-$(CONFIG_KPROBES_SANITY_TEST) += test_kprobes.o
|
2005-12-15 18:33:52 +00:00
|
|
|
obj-$(CONFIG_AUDIT) += audit.o auditfilter.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_AUDITSYSCALL) += auditsc.o
|
[PATCH] audit: watching subtrees
New kind of audit rule predicates: "object is visible in given subtree".
The part that can be sanely implemented, that is. Limitations:
* if you have hardlink from outside of tree, you'd better watch
it too (or just watch the object itself, obviously)
* if you mount something under a watched tree, tell audit
that new chunk should be added to watched subtrees
* if you umount something in a watched tree and it's still mounted
elsewhere, you will get matches on events happening there. New command
tells audit to recalculate the trees, trimming such sources of false
positives.
Note that it's _not_ about path - if something mounted in several places
(multiple mount, bindings, different namespaces, etc.), the match does
_not_ depend on which one we are using for access.
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
2007-07-22 12:04:18 +00:00
|
|
|
obj-$(CONFIG_AUDIT_TREE) += audit_tree.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_KPROBES) += kprobes.o
|
2008-04-17 18:05:37 +00:00
|
|
|
obj-$(CONFIG_KGDB) += kgdb.o
|
2005-09-06 22:16:27 +00:00
|
|
|
obj-$(CONFIG_DETECT_SOFTLOCKUP) += softlockup.o
|
2005-04-16 22:20:36 +00:00
|
|
|
obj-$(CONFIG_GENERIC_HARDIRQS) += irq/
|
|
|
|
|
obj-$(CONFIG_SECCOMP) += seccomp.o
|
2005-10-30 23:03:12 +00:00
|
|
|
obj-$(CONFIG_RCU_TORTURE_TEST) += rcutorture.o
|
2008-01-25 20:08:24 +00:00
|
|
|
obj-$(CONFIG_CLASSIC_RCU) += rcuclassic.o
|
|
|
|
|
obj-$(CONFIG_PREEMPT_RCU) += rcupreempt.o
|
|
|
|
|
ifeq ($(CONFIG_PREEMPT_RCU),y)
|
|
|
|
|
obj-$(CONFIG_RCU_TRACE) += rcupreempt_trace.o
|
|
|
|
|
endif
|
2006-03-23 18:56:55 +00:00
|
|
|
obj-$(CONFIG_RELAY) += relay.o
|
2007-02-14 08:33:58 +00:00
|
|
|
obj-$(CONFIG_SYSCTL) += utsname_sysctl.o
|
2006-07-14 07:24:36 +00:00
|
|
|
obj-$(CONFIG_TASK_DELAY_ACCT) += delayacct.o
|
2006-10-01 06:28:55 +00:00
|
|
|
obj-$(CONFIG_TASKSTATS) += taskstats.o tsacct.o
|
2007-10-19 06:41:06 +00:00
|
|
|
obj-$(CONFIG_MARKERS) += marker.o
|
2008-01-25 20:08:34 +00:00
|
|
|
obj-$(CONFIG_LATENCYTOP) += latencytop.o
|
2008-05-12 19:20:42 +00:00
|
|
|
obj-$(CONFIG_FTRACE) += trace/
|
2008-05-12 19:20:42 +00:00
|
|
|
obj-$(CONFIG_TRACING) += trace/
|
2008-05-12 19:21:01 +00:00
|
|
|
obj-$(CONFIG_SMP) += sched_cpupri.o
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2005-05-05 23:15:11 +00:00
|
|
|
ifneq ($(CONFIG_SCHED_NO_NO_OMIT_FRAME_POINTER),y)
|
2005-04-16 22:20:36 +00:00
|
|
|
# According to Alan Modra <alan@linuxcare.com.au>, the -fno-omit-frame-pointer is
|
|
|
|
|
# needed for x86 only. Why this used to be enabled for all architectures is beyond
|
|
|
|
|
# me. I suspect most platforms don't need this, but until we know that for sure
|
|
|
|
|
# I turn this off for IA-64 only. Andreas Schwab says it's also needed on m68k
|
|
|
|
|
# to get a correct value for the wait-channel (WCHAN in ps). --davidm
|
|
|
|
|
CFLAGS_sched.o := $(PROFILING) -fno-omit-frame-pointer
|
|
|
|
|
endif
|
|
|
|
|
|
|
|
|
|
$(obj)/configs.o: $(obj)/config_data.h
|
|
|
|
|
|
|
|
|
|
# config_data.h contains the same information as ikconfig.h but gzipped.
|
|
|
|
|
# Info from config_data can be extracted from /proc/config*
|
|
|
|
|
targets += config_data.gz
|
|
|
|
|
$(obj)/config_data.gz: .config FORCE
|
|
|
|
|
$(call if_changed,gzip)
|
|
|
|
|
|
|
|
|
|
quiet_cmd_ikconfiggz = IKCFG $@
|
|
|
|
|
cmd_ikconfiggz = (echo "static const char kernel_config_data[] = MAGIC_START"; cat $< | scripts/bin2c; echo "MAGIC_END;") > $@
|
|
|
|
|
targets += config_data.h
|
|
|
|
|
$(obj)/config_data.h: $(obj)/config_data.gz FORCE
|
|
|
|
|
$(call if_changed,ikconfiggz)
|
avoid overflows in kernel/time.c
When the conversion factor between jiffies and milli- or microseconds is
not a single multiply or divide, as for the case of HZ == 300, we currently
do a multiply followed by a divide. The intervening result, however, is
subject to overflows, especially since the fraction is not simplified (for
HZ == 300, we multiply by 300 and divide by 1000).
This is exposed to the user when passing a large timeout to poll(), for
example.
This patch replaces the multiply-divide with a reciprocal multiplication on
32-bit platforms. When the input is an unsigned long, there is no portable
way to do this on 64-bit platforms there is no portable way to do this
since it requires a 128-bit intermediate result (which gcc does support on
64-bit platforms but may generate libgcc calls, e.g. on 64-bit s390), but
since the output is a 32-bit integer in the cases affected, just simplify
the multiply-divide (*3/10 instead of *300/1000).
The reciprocal multiply used can have off-by-one errors in the upper half
of the valid output range. This could be avoided at the expense of having
to deal with a potential 65-bit intermediate result. Since the intent is
to avoid overflow problems and most of the other time conversions are only
semiexact, the off-by-one errors were considered an acceptable tradeoff.
At Ralf Baechle's suggestion, this version uses a Perl script to compute
the necessary constants. We already have dependencies on Perl for kernel
compiles. This does, however, require the Perl module Math::BigInt, which
is included in the standard Perl distribution starting with version 5.8.0.
In order to support older versions of Perl, include a table of canned
constants in the script itself, and structure the script so that
Math::BigInt isn't required if pulling values from said table.
Running the script requires that the HZ value is available from the
Makefile. Thus, this patch also adds the Kconfig variable CONFIG_HZ to the
architectures which didn't already have it (alpha, cris, frv, h8300, m32r,
m68k, m68knommu, sparc, v850, and xtensa.) It does *not* touch the sh or
sh64 architectures, since Paul Mundt has dealt with those separately in the
sh tree.
Signed-off-by: H. Peter Anvin <hpa@zytor.com>
Cc: Ralf Baechle <ralf@linux-mips.org>,
Cc: Sam Ravnborg <sam@ravnborg.org>,
Cc: Paul Mundt <lethal@linux-sh.org>,
Cc: Richard Henderson <rth@twiddle.net>,
Cc: Michael Starvik <starvik@axis.com>,
Cc: David Howells <dhowells@redhat.com>,
Cc: Yoshinori Sato <ysato@users.sourceforge.jp>,
Cc: Hirokazu Takata <takata@linux-m32r.org>,
Cc: Geert Uytterhoeven <geert@linux-m68k.org>,
Cc: Roman Zippel <zippel@linux-m68k.org>,
Cc: William L. Irwin <sparclinux@vger.kernel.org>,
Cc: Chris Zankel <chris@zankel.net>,
Cc: H. Peter Anvin <hpa@zytor.com>,
Cc: Jan Engelhardt <jengelh@computergmbh.de>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2008-02-08 12:21:26 +00:00
|
|
|
|
|
|
|
|
$(obj)/time.o: $(obj)/timeconst.h
|
|
|
|
|
|
|
|
|
|
quiet_cmd_timeconst = TIMEC $@
|
|
|
|
|
cmd_timeconst = $(PERL) $< $(CONFIG_HZ) > $@
|
|
|
|
|
targets += timeconst.h
|
|
|
|
|
$(obj)/timeconst.h: $(src)/timeconst.pl FORCE
|
|
|
|
|
$(call if_changed,timeconst)
|
