License cleanup: add SPDX GPL-2.0 license identifier to files with no license
Many source files in the tree are missing licensing information, which
makes it harder for compliance tools to determine the correct license.
By default all files without license information are under the default
license of the kernel, which is GPL version 2.
Update the files which contain no license information with the 'GPL-2.0'
SPDX license identifier. The SPDX identifier is a legally binding
shorthand, which can be used instead of the full boiler plate text.
This patch is based on work done by Thomas Gleixner and Kate Stewart and
Philippe Ombredanne.
How this work was done:
Patches were generated and checked against linux-4.14-rc6 for a subset of
the use cases:
- file had no licensing information it it.
- file was a */uapi/* one with no licensing information in it,
- file was a */uapi/* one with existing licensing information,
Further patches will be generated in subsequent months to fix up cases
where non-standard license headers were used, and references to license
had to be inferred by heuristics based on keywords.
The analysis to determine which SPDX License Identifier to be applied to
a file was done in a spreadsheet of side by side results from of the
output of two independent scanners (ScanCode & Windriver) producing SPDX
tag:value files created by Philippe Ombredanne. Philippe prepared the
base worksheet, and did an initial spot review of a few 1000 files.
The 4.13 kernel was the starting point of the analysis with 60,537 files
assessed. Kate Stewart did a file by file comparison of the scanner
results in the spreadsheet to determine which SPDX license identifier(s)
to be applied to the file. She confirmed any determination that was not
immediately clear with lawyers working with the Linux Foundation.
Criteria used to select files for SPDX license identifier tagging was:
- Files considered eligible had to be source code files.
- Make and config files were included as candidates if they contained >5
lines of source
- File already had some variant of a license header in it (even if <5
lines).
All documentation files were explicitly excluded.
The following heuristics were used to determine which SPDX license
identifiers to apply.
- when both scanners couldn't find any license traces, file was
considered to have no license information in it, and the top level
COPYING file license applied.
For non */uapi/* files that summary was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 11139
and resulted in the first patch in this series.
If that file was a */uapi/* path one, it was "GPL-2.0 WITH
Linux-syscall-note" otherwise it was "GPL-2.0". Results of that was:
SPDX license identifier # files
---------------------------------------------------|-------
GPL-2.0 WITH Linux-syscall-note 930
and resulted in the second patch in this series.
- if a file had some form of licensing information in it, and was one
of the */uapi/* ones, it was denoted with the Linux-syscall-note if
any GPL family license was found in the file or had no licensing in
it (per prior point). Results summary:
SPDX license identifier # files
---------------------------------------------------|------
GPL-2.0 WITH Linux-syscall-note 270
GPL-2.0+ WITH Linux-syscall-note 169
((GPL-2.0 WITH Linux-syscall-note) OR BSD-2-Clause) 21
((GPL-2.0 WITH Linux-syscall-note) OR BSD-3-Clause) 17
LGPL-2.1+ WITH Linux-syscall-note 15
GPL-1.0+ WITH Linux-syscall-note 14
((GPL-2.0+ WITH Linux-syscall-note) OR BSD-3-Clause) 5
LGPL-2.0+ WITH Linux-syscall-note 4
LGPL-2.1 WITH Linux-syscall-note 3
((GPL-2.0 WITH Linux-syscall-note) OR MIT) 3
((GPL-2.0 WITH Linux-syscall-note) AND MIT) 1
and that resulted in the third patch in this series.
- when the two scanners agreed on the detected license(s), that became
the concluded license(s).
- when there was disagreement between the two scanners (one detected a
license but the other didn't, or they both detected different
licenses) a manual inspection of the file occurred.
- In most cases a manual inspection of the information in the file
resulted in a clear resolution of the license that should apply (and
which scanner probably needed to revisit its heuristics).
- When it was not immediately clear, the license identifier was
confirmed with lawyers working with the Linux Foundation.
- If there was any question as to the appropriate license identifier,
the file was flagged for further research and to be revisited later
in time.
In total, over 70 hours of logged manual review was done on the
spreadsheet to determine the SPDX license identifiers to apply to the
source files by Kate, Philippe, Thomas and, in some cases, confirmation
by lawyers working with the Linux Foundation.
Kate also obtained a third independent scan of the 4.13 code base from
FOSSology, and compared selected files where the other two scanners
disagreed against that SPDX file, to see if there was new insights. The
Windriver scanner is based on an older version of FOSSology in part, so
they are related.
Thomas did random spot checks in about 500 files from the spreadsheets
for the uapi headers and agreed with SPDX license identifier in the
files he inspected. For the non-uapi files Thomas did random spot checks
in about 15000 files.
In initial set of patches against 4.14-rc6, 3 files were found to have
copy/paste license identifier errors, and have been fixed to reflect the
correct identifier.
Additionally Philippe spent 10 hours this week doing a detailed manual
inspection and review of the 12,461 patched files from the initial patch
version early this week with:
- a full scancode scan run, collecting the matched texts, detected
license ids and scores
- reviewing anything where there was a license detected (about 500+
files) to ensure that the applied SPDX license was correct
- reviewing anything where there was no detection but the patch license
was not GPL-2.0 WITH Linux-syscall-note to ensure that the applied
SPDX license was correct
This produced a worksheet with 20 files needing minor correction. This
worksheet was then exported into 3 different .csv files for the
different types of files to be modified.
These .csv files were then reviewed by Greg. Thomas wrote a script to
parse the csv files and add the proper SPDX tag to the file, in the
format that the file expected. This script was further refined by Greg
based on the output to detect more types of files automatically and to
distinguish between header and source .c files (which need different
comment types.) Finally Greg ran the script using the .csv files to
generate the patches.
Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org>
Reviewed-by: Philippe Ombredanne <pombredanne@nexb.com>
Reviewed-by: Thomas Gleixner <tglx@linutronix.de>
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2017-11-01 22:07:57 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2013-06-14 06:41:22 +08:00
|
|
|
#define _GNU_SOURCE
|
|
|
|
#include <pthread.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <dlfcn.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <sysexits.h>
|
2017-05-25 20:58:46 +08:00
|
|
|
#include <unistd.h>
|
2013-06-14 06:41:22 +08:00
|
|
|
#include "include/liblockdep/mutex.h"
|
2015-08-25 13:19:45 +08:00
|
|
|
#include "../../include/linux/rbtree.h"
|
2013-06-14 06:41:22 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* struct lock_lookup - liblockdep's view of a single unique lock
|
|
|
|
* @orig: pointer to the original pthread lock, used for lookups
|
|
|
|
* @dep_map: lockdep's dep_map structure
|
|
|
|
* @key: lockdep's key structure
|
|
|
|
* @node: rb-tree node used to store the lock in a global tree
|
|
|
|
* @name: a unique name for the lock
|
|
|
|
*/
|
|
|
|
struct lock_lookup {
|
|
|
|
void *orig; /* Original pthread lock, used for lookups */
|
|
|
|
struct lockdep_map dep_map; /* Since all locks are dynamic, we need
|
|
|
|
* a dep_map and a key for each lock */
|
|
|
|
/*
|
|
|
|
* Wait, there's no support for key classes? Yup :(
|
|
|
|
* Most big projects wrap the pthread api with their own calls to
|
|
|
|
* be compatible with different locking methods. This means that
|
|
|
|
* "classes" will be brokes since the function that creates all
|
|
|
|
* locks will point to a generic locking function instead of the
|
|
|
|
* actual code that wants to do the locking.
|
|
|
|
*/
|
|
|
|
struct lock_class_key key;
|
|
|
|
struct rb_node node;
|
|
|
|
#define LIBLOCKDEP_MAX_LOCK_NAME 22
|
|
|
|
char name[LIBLOCKDEP_MAX_LOCK_NAME];
|
|
|
|
};
|
|
|
|
|
|
|
|
/* This is where we store our locks */
|
|
|
|
static struct rb_root locks = RB_ROOT;
|
|
|
|
static pthread_rwlock_t locks_rwlock = PTHREAD_RWLOCK_INITIALIZER;
|
|
|
|
|
|
|
|
/* pthread mutex API */
|
|
|
|
|
|
|
|
#ifdef __GLIBC__
|
|
|
|
extern int __pthread_mutex_init(pthread_mutex_t *mutex, const pthread_mutexattr_t *attr);
|
|
|
|
extern int __pthread_mutex_lock(pthread_mutex_t *mutex);
|
|
|
|
extern int __pthread_mutex_trylock(pthread_mutex_t *mutex);
|
|
|
|
extern int __pthread_mutex_unlock(pthread_mutex_t *mutex);
|
|
|
|
extern int __pthread_mutex_destroy(pthread_mutex_t *mutex);
|
|
|
|
#else
|
|
|
|
#define __pthread_mutex_init NULL
|
|
|
|
#define __pthread_mutex_lock NULL
|
|
|
|
#define __pthread_mutex_trylock NULL
|
|
|
|
#define __pthread_mutex_unlock NULL
|
|
|
|
#define __pthread_mutex_destroy NULL
|
|
|
|
#endif
|
|
|
|
static int (*ll_pthread_mutex_init)(pthread_mutex_t *mutex,
|
|
|
|
const pthread_mutexattr_t *attr) = __pthread_mutex_init;
|
|
|
|
static int (*ll_pthread_mutex_lock)(pthread_mutex_t *mutex) = __pthread_mutex_lock;
|
|
|
|
static int (*ll_pthread_mutex_trylock)(pthread_mutex_t *mutex) = __pthread_mutex_trylock;
|
|
|
|
static int (*ll_pthread_mutex_unlock)(pthread_mutex_t *mutex) = __pthread_mutex_unlock;
|
|
|
|
static int (*ll_pthread_mutex_destroy)(pthread_mutex_t *mutex) = __pthread_mutex_destroy;
|
|
|
|
|
|
|
|
/* pthread rwlock API */
|
|
|
|
|
|
|
|
#ifdef __GLIBC__
|
|
|
|
extern int __pthread_rwlock_init(pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr);
|
|
|
|
extern int __pthread_rwlock_destroy(pthread_rwlock_t *rwlock);
|
|
|
|
extern int __pthread_rwlock_wrlock(pthread_rwlock_t *rwlock);
|
|
|
|
extern int __pthread_rwlock_trywrlock(pthread_rwlock_t *rwlock);
|
|
|
|
extern int __pthread_rwlock_rdlock(pthread_rwlock_t *rwlock);
|
|
|
|
extern int __pthread_rwlock_tryrdlock(pthread_rwlock_t *rwlock);
|
|
|
|
extern int __pthread_rwlock_unlock(pthread_rwlock_t *rwlock);
|
|
|
|
#else
|
|
|
|
#define __pthread_rwlock_init NULL
|
|
|
|
#define __pthread_rwlock_destroy NULL
|
|
|
|
#define __pthread_rwlock_wrlock NULL
|
|
|
|
#define __pthread_rwlock_trywrlock NULL
|
|
|
|
#define __pthread_rwlock_rdlock NULL
|
|
|
|
#define __pthread_rwlock_tryrdlock NULL
|
|
|
|
#define __pthread_rwlock_unlock NULL
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static int (*ll_pthread_rwlock_init)(pthread_rwlock_t *rwlock,
|
|
|
|
const pthread_rwlockattr_t *attr) = __pthread_rwlock_init;
|
|
|
|
static int (*ll_pthread_rwlock_destroy)(pthread_rwlock_t *rwlock) = __pthread_rwlock_destroy;
|
|
|
|
static int (*ll_pthread_rwlock_rdlock)(pthread_rwlock_t *rwlock) = __pthread_rwlock_rdlock;
|
|
|
|
static int (*ll_pthread_rwlock_tryrdlock)(pthread_rwlock_t *rwlock) = __pthread_rwlock_tryrdlock;
|
|
|
|
static int (*ll_pthread_rwlock_trywrlock)(pthread_rwlock_t *rwlock) = __pthread_rwlock_trywrlock;
|
|
|
|
static int (*ll_pthread_rwlock_wrlock)(pthread_rwlock_t *rwlock) = __pthread_rwlock_wrlock;
|
|
|
|
static int (*ll_pthread_rwlock_unlock)(pthread_rwlock_t *rwlock) = __pthread_rwlock_unlock;
|
|
|
|
|
|
|
|
enum { none, prepare, done, } __init_state;
|
|
|
|
static void init_preload(void);
|
|
|
|
static void try_init_preload(void)
|
|
|
|
{
|
2014-05-30 08:37:28 +08:00
|
|
|
if (__init_state != done)
|
2013-06-14 06:41:22 +08:00
|
|
|
init_preload();
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct rb_node **__get_lock_node(void *lock, struct rb_node **parent)
|
|
|
|
{
|
|
|
|
struct rb_node **node = &locks.rb_node;
|
|
|
|
struct lock_lookup *l;
|
|
|
|
|
|
|
|
*parent = NULL;
|
|
|
|
|
|
|
|
while (*node) {
|
|
|
|
l = rb_entry(*node, struct lock_lookup, node);
|
|
|
|
|
|
|
|
*parent = *node;
|
|
|
|
if (lock < l->orig)
|
|
|
|
node = &l->node.rb_left;
|
|
|
|
else if (lock > l->orig)
|
|
|
|
node = &l->node.rb_right;
|
|
|
|
else
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef LIBLOCKDEP_STATIC_ENTRIES
|
|
|
|
#define LIBLOCKDEP_STATIC_ENTRIES 1024
|
|
|
|
#endif
|
|
|
|
|
|
|
|
static struct lock_lookup __locks[LIBLOCKDEP_STATIC_ENTRIES];
|
|
|
|
static int __locks_nr;
|
|
|
|
|
|
|
|
static inline bool is_static_lock(struct lock_lookup *lock)
|
|
|
|
{
|
|
|
|
return lock >= __locks && lock < __locks + ARRAY_SIZE(__locks);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct lock_lookup *alloc_lock(void)
|
|
|
|
{
|
|
|
|
if (__init_state != done) {
|
|
|
|
/*
|
|
|
|
* Some programs attempt to initialize and use locks in their
|
|
|
|
* allocation path. This means that a call to malloc() would
|
|
|
|
* result in locks being initialized and locked.
|
|
|
|
*
|
|
|
|
* Why is it an issue for us? dlsym() below will try allocating
|
|
|
|
* to give us the original function. Since this allocation will
|
|
|
|
* result in a locking operations, we have to let pthread deal
|
|
|
|
* with it, but we can't! we don't have the pointer to the
|
|
|
|
* original API since we're inside dlsym() trying to get it
|
|
|
|
*/
|
|
|
|
|
|
|
|
int idx = __locks_nr++;
|
|
|
|
if (idx >= ARRAY_SIZE(__locks)) {
|
2017-05-25 20:58:46 +08:00
|
|
|
dprintf(STDERR_FILENO,
|
2013-06-14 06:41:22 +08:00
|
|
|
"LOCKDEP error: insufficient LIBLOCKDEP_STATIC_ENTRIES\n");
|
|
|
|
exit(EX_UNAVAILABLE);
|
|
|
|
}
|
|
|
|
return __locks + idx;
|
|
|
|
}
|
|
|
|
|
|
|
|
return malloc(sizeof(struct lock_lookup));
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void free_lock(struct lock_lookup *lock)
|
|
|
|
{
|
|
|
|
if (likely(!is_static_lock(lock)))
|
|
|
|
free(lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* __get_lock - find or create a lock instance
|
|
|
|
* @lock: pointer to a pthread lock function
|
|
|
|
*
|
|
|
|
* Try to find an existing lock in the rbtree using the provided pointer. If
|
|
|
|
* one wasn't found - create it.
|
|
|
|
*/
|
|
|
|
static struct lock_lookup *__get_lock(void *lock)
|
|
|
|
{
|
|
|
|
struct rb_node **node, *parent;
|
|
|
|
struct lock_lookup *l;
|
|
|
|
|
|
|
|
ll_pthread_rwlock_rdlock(&locks_rwlock);
|
|
|
|
node = __get_lock_node(lock, &parent);
|
|
|
|
ll_pthread_rwlock_unlock(&locks_rwlock);
|
|
|
|
if (*node) {
|
|
|
|
return rb_entry(*node, struct lock_lookup, node);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* We didn't find the lock, let's create it */
|
|
|
|
l = alloc_lock();
|
|
|
|
if (l == NULL)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
l->orig = lock;
|
|
|
|
/*
|
|
|
|
* Currently the name of the lock is the ptr value of the pthread lock,
|
|
|
|
* while not optimal, it makes debugging a bit easier.
|
|
|
|
*
|
|
|
|
* TODO: Get the real name of the lock using libdwarf
|
|
|
|
*/
|
|
|
|
sprintf(l->name, "%p", lock);
|
|
|
|
lockdep_init_map(&l->dep_map, l->name, &l->key, 0);
|
|
|
|
|
|
|
|
ll_pthread_rwlock_wrlock(&locks_rwlock);
|
|
|
|
/* This might have changed since the last time we fetched it */
|
|
|
|
node = __get_lock_node(lock, &parent);
|
|
|
|
rb_link_node(&l->node, parent, node);
|
|
|
|
rb_insert_color(&l->node, &locks);
|
|
|
|
ll_pthread_rwlock_unlock(&locks_rwlock);
|
|
|
|
|
|
|
|
return l;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __del_lock(struct lock_lookup *lock)
|
|
|
|
{
|
|
|
|
ll_pthread_rwlock_wrlock(&locks_rwlock);
|
|
|
|
rb_erase(&lock->node, &locks);
|
|
|
|
ll_pthread_rwlock_unlock(&locks_rwlock);
|
|
|
|
free_lock(lock);
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_mutex_init(pthread_mutex_t *mutex,
|
|
|
|
const pthread_mutexattr_t *attr)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We keep trying to init our preload module because there might be
|
|
|
|
* code in init sections that tries to touch locks before we are
|
|
|
|
* initialized, in that case we'll need to manually call preload
|
|
|
|
* to get us going.
|
|
|
|
*
|
|
|
|
* Funny enough, kernel's lockdep had the same issue, and used
|
|
|
|
* (almost) the same solution. See look_up_lock_class() in
|
|
|
|
* kernel/locking/lockdep.c for details.
|
|
|
|
*/
|
|
|
|
try_init_preload();
|
|
|
|
|
|
|
|
r = ll_pthread_mutex_init(mutex, attr);
|
|
|
|
if (r == 0)
|
|
|
|
/*
|
|
|
|
* We do a dummy initialization here so that lockdep could
|
|
|
|
* warn us if something fishy is going on - such as
|
|
|
|
* initializing a held lock.
|
|
|
|
*/
|
|
|
|
__get_lock(mutex);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_mutex_lock(pthread_mutex_t *mutex)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
try_init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(mutex)->dep_map, 0, 0, 0, 1, NULL,
|
2013-06-14 06:41:22 +08:00
|
|
|
(unsigned long)_RET_IP_);
|
|
|
|
/*
|
|
|
|
* Here's the thing with pthread mutexes: unlike the kernel variant,
|
|
|
|
* they can fail.
|
|
|
|
*
|
|
|
|
* This means that the behaviour here is a bit different from what's
|
|
|
|
* going on in the kernel: there we just tell lockdep that we took the
|
|
|
|
* lock before actually taking it, but here we must deal with the case
|
|
|
|
* that locking failed.
|
|
|
|
*
|
|
|
|
* To do that we'll "release" the lock if locking failed - this way
|
|
|
|
* we'll get lockdep doing the correct checks when we try to take
|
|
|
|
* the lock, and if that fails - we'll be back to the correct
|
|
|
|
* state by releasing it.
|
|
|
|
*/
|
|
|
|
r = ll_pthread_mutex_lock(mutex);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(mutex)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_mutex_trylock(pthread_mutex_t *mutex)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
try_init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(mutex)->dep_map, 0, 1, 0, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
r = ll_pthread_mutex_trylock(mutex);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(mutex)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_mutex_unlock(pthread_mutex_t *mutex)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
try_init_preload();
|
|
|
|
|
|
|
|
lock_release(&__get_lock(mutex)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
/*
|
|
|
|
* Just like taking a lock, only in reverse!
|
|
|
|
*
|
|
|
|
* If we fail releasing the lock, tell lockdep we're holding it again.
|
|
|
|
*/
|
|
|
|
r = ll_pthread_mutex_unlock(mutex);
|
|
|
|
if (r)
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(mutex)->dep_map, 0, 0, 0, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_mutex_destroy(pthread_mutex_t *mutex)
|
|
|
|
{
|
|
|
|
try_init_preload();
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Let's see if we're releasing a lock that's held.
|
|
|
|
*
|
|
|
|
* TODO: Hook into free() and add that check there as well.
|
|
|
|
*/
|
2014-12-08 19:07:59 +08:00
|
|
|
debug_check_no_locks_freed(mutex, sizeof(*mutex));
|
2013-06-14 06:41:22 +08:00
|
|
|
__del_lock(__get_lock(mutex));
|
|
|
|
return ll_pthread_mutex_destroy(mutex);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* This is the rwlock part, very similar to what happened with mutex above */
|
|
|
|
int pthread_rwlock_init(pthread_rwlock_t *rwlock,
|
|
|
|
const pthread_rwlockattr_t *attr)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
try_init_preload();
|
|
|
|
|
|
|
|
r = ll_pthread_rwlock_init(rwlock, attr);
|
|
|
|
if (r == 0)
|
|
|
|
__get_lock(rwlock);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_destroy(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
try_init_preload();
|
|
|
|
|
2014-12-08 19:07:59 +08:00
|
|
|
debug_check_no_locks_freed(rwlock, sizeof(*rwlock));
|
2013-06-14 06:41:22 +08:00
|
|
|
__del_lock(__get_lock(rwlock));
|
|
|
|
return ll_pthread_rwlock_destroy(rwlock);
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_rdlock(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(rwlock)->dep_map, 0, 0, 2, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
r = ll_pthread_rwlock_rdlock(rwlock);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(rwlock)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_tryrdlock(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(rwlock)->dep_map, 0, 1, 2, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
r = ll_pthread_rwlock_tryrdlock(rwlock);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(rwlock)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_trywrlock(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(rwlock)->dep_map, 0, 1, 0, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
r = ll_pthread_rwlock_trywrlock(rwlock);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(rwlock)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_wrlock(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
init_preload();
|
|
|
|
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(rwlock)->dep_map, 0, 0, 0, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
r = ll_pthread_rwlock_wrlock(rwlock);
|
|
|
|
if (r)
|
|
|
|
lock_release(&__get_lock(rwlock)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
int pthread_rwlock_unlock(pthread_rwlock_t *rwlock)
|
|
|
|
{
|
|
|
|
int r;
|
|
|
|
|
|
|
|
init_preload();
|
|
|
|
|
|
|
|
lock_release(&__get_lock(rwlock)->dep_map, 0, (unsigned long)_RET_IP_);
|
|
|
|
r = ll_pthread_rwlock_unlock(rwlock);
|
|
|
|
if (r)
|
2014-07-07 15:17:33 +08:00
|
|
|
lock_acquire(&__get_lock(rwlock)->dep_map, 0, 0, 0, 1, NULL, (unsigned long)_RET_IP_);
|
2013-06-14 06:41:22 +08:00
|
|
|
|
|
|
|
return r;
|
|
|
|
}
|
|
|
|
|
|
|
|
__attribute__((constructor)) static void init_preload(void)
|
|
|
|
{
|
2014-02-01 07:30:54 +08:00
|
|
|
if (__init_state == done)
|
2013-06-14 06:41:22 +08:00
|
|
|
return;
|
|
|
|
|
|
|
|
#ifndef __GLIBC__
|
|
|
|
__init_state = prepare;
|
|
|
|
|
|
|
|
ll_pthread_mutex_init = dlsym(RTLD_NEXT, "pthread_mutex_init");
|
|
|
|
ll_pthread_mutex_lock = dlsym(RTLD_NEXT, "pthread_mutex_lock");
|
|
|
|
ll_pthread_mutex_trylock = dlsym(RTLD_NEXT, "pthread_mutex_trylock");
|
|
|
|
ll_pthread_mutex_unlock = dlsym(RTLD_NEXT, "pthread_mutex_unlock");
|
|
|
|
ll_pthread_mutex_destroy = dlsym(RTLD_NEXT, "pthread_mutex_destroy");
|
|
|
|
|
|
|
|
ll_pthread_rwlock_init = dlsym(RTLD_NEXT, "pthread_rwlock_init");
|
|
|
|
ll_pthread_rwlock_destroy = dlsym(RTLD_NEXT, "pthread_rwlock_destroy");
|
|
|
|
ll_pthread_rwlock_rdlock = dlsym(RTLD_NEXT, "pthread_rwlock_rdlock");
|
|
|
|
ll_pthread_rwlock_tryrdlock = dlsym(RTLD_NEXT, "pthread_rwlock_tryrdlock");
|
|
|
|
ll_pthread_rwlock_wrlock = dlsym(RTLD_NEXT, "pthread_rwlock_wrlock");
|
|
|
|
ll_pthread_rwlock_trywrlock = dlsym(RTLD_NEXT, "pthread_rwlock_trywrlock");
|
|
|
|
ll_pthread_rwlock_unlock = dlsym(RTLD_NEXT, "pthread_rwlock_unlock");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
__init_state = done;
|
|
|
|
}
|