- 27 Jul, 2005 40 commits
-
-
Hal Rosenstock authored
Add automatic retries to MAD layer. Signed-off-by:
Sean Hefty <sean.hefty@intel.com> Signed-off-by:
Hal Rosenstock <halr@voltaire.com> Cc: Roland Dreier <rolandd@cisco.com> Signed-off-by:
Andrew Morton <akpm@osdl.org> Signed-off-by:
Linus Torvalds <torvalds@osdl.org>
-
Hal Rosenstock authored
Add implementation for ib_coalesce_recv_mad. Also, clear allocated MAD data buffer in ib_create_send_mad. Signed-off-by:
-
Hal Rosenstock authored
Minor cleanup during startup and shutdown Signed-off-by:
-
Hal Rosenstock authored
Fixes an issue processing a sent MAD after it has timed out or been canceled. The race occurs when a response MAD matches with the send request. The request could time out or be canceled after the response MAD matches with the request, but before the request completion can be processed. Signed-off-by:
-
Hal Rosenstock authored
Have ib_mad_send_wr_private reference the private agent structure directly, rather than the exposed agent definition. Remove unneeded parameters to functions and simplify code were possible from this change. Signed-off-by:
-
Hal Rosenstock authored
Move saving of user's send wr_id to better match layering of received response handling. Signed-off-by:
-
Hal Rosenstock authored
Combine response_mad() and solicited_mad() routines into a single function and simplify/encapsulate its usage. Signed-off-by:
-
Hal Rosenstock authored
Add new helper routines for allocating MADs for sending and formatting a send WR. Signed-off-by:
-
Hal Rosenstock authored
Automatically allocate a MR when registering a MAD agent. MAD clients are modified to use this updated API. Signed-off-by:
-
Hal Rosenstock authored
Change some functions to return void rather than an int since they are always returning 0, thus making checking return values rather pointless. Signed-off-by:
Tom Duffy <tduffy@sun.com> Signed-off-by:
Libor Michalek <libor@topspin.com> Signed-off-by:
-
Kurt Wall authored
The emergence of so-called "dot releases" that are non-incremental patches against a base kernel requires different handling of patches (revert previous patches before applying the newest one). This patch adds a paragrach to $TOPDIR/README explaining how to do deal with dot release patches. Signed-off-by:
Kurt Wall <kwall@kurtwerks.com> Signed-off-by:
-
Ralf Baechle authored
Use tabs for formatting like anywhere else in this file. Cc: Russell King <rmk@arm.linux.org.uk> Signed-off-by:
-
Blaisorblade authored
sys_get_thread_area does not memset to 0 its struct user_desc info before copying it to user space... since sizeof(struct user_desc) is 16 while the actual datas which are filled are only 12 bytes + 9 bits (across the bitfields), there is a (small) information leak. Signed-off-by:
Paolo 'Blaisorblade' Giarrusso <blaisorblade@yahoo.it> Signed-off-by:
-
Olaf Hering authored
turn many #if $undefined_string into #ifdef $undefined_string to fix some warnings after -Wno-def was added to global CFLAGS Signed-off-by:
Olaf Hering <olh@suse.de> Signed-off-by:
-
Andreas Gruenbacher authored
reiserfs doesn't use the mbcache, so this can go. Signed-off-by:
-
Adrian Bunk authored
Document that udev 058 is required. Signed-off-by:
Adrian Bunk <bunk@stusta.de> Signed-off-by:
-
Andreas Gruenbacher authored
The cache parameter to mb_cache_shrink isn't used. We may as well remove it. Signed-off-by:
Andreas Gruenbacher <agruen@suse.de> Signed-off-by:
-
Andrew Morton authored
ppc64 uses symbol `DAR', as does the TPM driver, causing a build failure. Change the TPM name. Cc: Marcel Selhorst <selhorst@crypto.rub.de> Signed-off-by:
-
Marcel Selhorst authored
This patch provides a new device driver for the Infineon SLD 9630 TT Trusted Platform Module (TPM 1.1b) [1] which is embedded on Intel- mainboards or in HP/ Fujitsu-Siemens / Toshiba-Notebooks. A nearly complete list where this module is integrated in can be found in [2]. This kernel module acts as a communication gateway between the linux kernel and the hardware chip and fits the TPM-specific interfaces created by IBM in drivers/char/tpm/tpm.h Further information about this module and a list of succesfully tested and therefore supported hardware can be found at our project page [3]. [1] http://www.infineon.com/cgi/ecrm.dll/ecrm/scripts/public_download.jsp?oid=114135&parent_oid=29049 [2] http://www.tonymcfadden.net/tpmvendors.htm [3] http://www.prosec.rub.de/tpmSigned-off-by:
Marcel Selhorst <selhorst@crypto.rub.de> Acked-by:
Kylene Jo Hall <kjhall@us.ibm.com> Signed-off-by:
-
Randy Dunlap authored
Add kerneldoc to kernel/crash_dump.c Signed-off-by:
Randy Dunlap <rdunlap@xenotime.net> Signed-off-by:
-
Randy Dunlap authored
Add kerneldoc to kernel/cpuset.c Fix cpuset typos in init/Kconfig Signed-off-by:
Paul Jackson <pj@sgi.com> Signed-off-by:
-
Randy Dunlap authored
Add kerneldoc to kernel/capability.c Signed-off-by:
-
Peter Staubach authored
I believe that there is a problem with the handling of POSIX locks, which the attached patch should address. The problem appears to be a race between fcntl(2) and close(2). A multithreaded application could close a file descriptor at the same time as it is trying to acquire a lock using the same file descriptor. I would suggest that that multithreaded application is not providing the proper synchronization for itself, but the OS should still behave correctly. SUS3 (Single UNIX Specification Version 3, read: POSIX) indicates that when a file descriptor is closed, that all POSIX locks on the file, owned by the process which closed the file descriptor, should be released. The trick here is when those locks are released. The current code releases all locks which exist when close is processing, but any locks in progress are handled when the last reference to the open file is released. There are three cases to consider. One is the simple case, a multithreaded (mt) process has a file open and races to close it and acquire a lock on it. In this case, the close will release one reference to the open file and when the fcntl is done, it will release the other reference. For this situation, no locks should exist on the file when both the close and fcntl operations are done. The current system will handle this case because the last reference to the open file is being released. The second case is when the mt process has dup(2)'d the file descriptor. The close will release one reference to the file and the fcntl, when done, will release another, but there will still be at least one more reference to the open file. One could argue that the existence of a lock on the file after the close has completed is okay, because it was acquired after the close operation and there is still a way for the application to release the lock on the file, using an existing file descriptor. The third case is when the mt process has forked, after opening the file and either before or after becoming an mt process. In this case, each process would hold a reference to the open file. For each process, this degenerates to first case above. However, the lock continues to exist until both processes have released their references to the open file. This lock could block other lock requests. The changes to release the lock when the last reference to the open file aren't quite right because they would allow the lock to exist as long as there was a reference to the open file. This is too long. The new proposed solution is to add support in the fcntl code path to detect a race with close and then to release the lock which was just acquired when such as race is detected. This causes locks to be released in a timely fashion and for the system to conform to the POSIX semantic specification. This was tested by instrumenting a kernel to detect the handling locks and then running a program which generates case #3 above. A dangling lock could be reliably generated. When the changes to detect the close/fcntl race were added, a dangling lock could no longer be generated. Cc: Matthew Wilcox <willy@debian.org> Cc: Trond Myklebust <trond.myklebust@fys.uio.no> Signed-off-by:
-
Christian Borntraeger authored
vmcp_write uses GPF_DMA for the memory allocation of the response buffer, so it can use the low level function __cpcmd directly, no need to call the wrapper. Signed-off-by:
Martin Schwidefsky <schwidefsky@de.ibm.com> Signed-off-by:
-
Heiko Carstens authored
Fix wrong move direction of timer values for cpu accounting in case of a machine check that indicates a broken cpu timer. Signed-off-by:
-
Heiko Carstens authored
Limit reported memory size to 2GB if running in 31 bit mode. Signed-off-by:
-
Stefan Bader authored
Tape driver fixes: - Added deferred condition handling to tape driver core. - Added ability to handle busy conditions. - Code cleanup. Signed-off-by:
-
Horst Hummel authored
Free dasd slab cache on module unload. Signed-off-by:
-
Horst Hummel authored
The FBA discipline does not use retries for failed requests. A request fails after the first unsuccessful start attempt. There are some rare conditions (e.g. CIO path recovery) in which the start of an i/o on a fba device can fail. A tiny amount of retries is therefore reasonable. Signed-off-by:
-
Cornelia Huck authored
When processing resource accessibility events, continue searching for further affected subchannels if a link address is provided in the event information. Signed-off-by:
-
Cornelia Huck authored
Fix debug data in case of an interface-control or channel-control check: don't log the not yet accumulated interrupt-response-block, but the one we just received. Signed-off-by:
-
Heiko Carstens authored
The kernel uses the SIGP external call order code to signal other CPUs. When running with dedicated CPUs external calls don't get delivered immediately but within a fixed polling invervall. This can lead to delays where the system appears to do nothing. Replace the SIGP external call order with the SIGP emergency call order since this one gets delivered immediately. Signed-off-by:
-
Heiko Carstens authored
The atomic64 primitives are supposed to have 64-bit parameters instead of int. Signed-off-by:
-
Martin Schwidefsky authored
The find_next_{zero}_bit primitives on s390* should never return a bit number bigger then the bit field size. In the case of a bitfield that doesn't end on a word boundary, an offset that makes the search start at the last word of the bit field and the last word doesn't contain any zero/one bits the search is continued with a call to find_first_bit with a negative size. The search normally ends pretty quickly because the words following the bit field contain a mix of zeros and ones. But the bit number that is returned in this case is too big. To fix this and additional if to check for this case is needed. To make the code easier to read I removed the assembler parts from the find_next_{zero}_bit functions, the C-ified code is as good. Signed-off-by: -
Martin Schwidefsky authored
Split spin lock and r/w lock implementation into a single try which is done inline and an out of line function that repeatedly tries to get the lock before doing the cpu_relax(). Add a system control to set the number of retries before a cpu is yielded. The reason for the spin lock retry is that the diagnose 0x44 that is used to give up the virtual cpu is quite expensive. For spin locks that are held only for a short period of time the costs of the diagnoses outweights the savings for spin locks that are held for a longer timer. The default retry count is 1000. Signed-off-by:
-
Miles Bader authored
Signed-off-by:
Miles Bader <miles@gnu.org> Signed-off-by:
-
Miles Bader authored
These changes are untested (I no longer have the hardware). Signed-off-by:
-
Miles Bader authored
Signed-off-by:
-
Miles Bader authored
Signed-off-by:
-
Miles Bader authored
Signed-off-by:
-
