Unix进程间的通信:读写锁，自旋锁，屏障

1.读写锁

       #include <pthread.h>

       int pthread_rwlock_destroy(pthread_rwlock_t *rwlock);
       int pthread_rwlock_init(pthread_rwlock_t *rwlock,const pthread_rwlockattr_t *attr);
       pthread_rwlock_t rwlock= PTHREAD_RWLOCK_INITIALIZER;
       int pthread_rwlock_rdlock(pthread_rwlock_t *rwlock);
       int pthread_rwlock_tryrdlock(pthread_rwlock_t *rwlock);
       int pthread_rwlock_trywrlock(pthread_rwlock_t *rwlock);
       int pthread_rwlock_wrlock(pthread_rwlock_t *rwlock);
       int pthread_rwlock_unlock(pthread_rwlock_t *rwlock);
       int pthread_rwlock_timedrdlock(pthread_rwlock_t *rwlock,const struct timespec *abs_timeout);
       int pthread_rwlock_timedwrlock(pthread_rwlock_t *rwlock,const struct timespec *abs_timeout);

2.自旋锁

       #include <pthread.h>

       int pthread_spin_destroy(pthread_spinlock_t *spin);
       int pthread_spin_init(pthread_spinlock_t *spin,int pshared);
       int pthread_spin_lock(pthread_spinlock_t *spin);
       int pthread_spin_trylock(pthread_spinlock_t *spin);
       int pthread_spin_unlock(pthread_spinlock_t *spin);

init初始化中，自旋锁pshared可以取的值为PTHREAD_PROCESS_SHARED(表示可以用于进程间共享)，或者PTHREAD_PROCESS_PRIVATE;自旋锁跟互斥锁类似，不同之处是，在等待锁的期间，它不是通过休眠使得线程阻塞，而是通过忙等，类似while循环而阻塞，它通常运用于锁持有的时间短，且线程并不希望在重新调度上花费太多成本。自旋锁一般运用于内核来实现其他类型的同步对象，如互斥锁，在用户层很少使用，我们也改尽量避免使用自旋锁。

3.屏障

       #include <pthread.h>

       int pthread_barrier_destroy(pthread_barrier_t *barrier);
       int pthread_barrier_init(pthread_barrier_t *barrier,const pthread_barrierattr_t *attr,unsigned count);
       int pthread_barrier_wait(pthread_barrier_t *barrier);

屏障的作用是等待多个线程的完成，屏障允许任意线程的等待，直到所有的线程完成处理工作，我们只需要在准备等待的线程中调用pthread_barrier_wait函数，pthread_barrier_init函数中指定了等待线程的个数。

下面是一个使用屏障对800万个数进行排序的例子，我们创建8个线程，每个线程调用c库自带的堆排序函数完成其中100万个数的排序，在主线程中，我们等待这8个线程完成排序工作，最后主线程调用merge对这8个100万条记录进行归并排序，代码如下：

#include "apue.h"
#include <pthread.h>
#include <limits.h>
#include <sys/time.h>

#define NTHR   8				/* number of threads */
#define NUMNUM 8000000L			/* number of numbers to sort */
#define TNUM   (NUMNUM/NTHR)	/* number to sort per thread */

long nums[NUMNUM];
long snums[NUMNUM];

pthread_barrier_t b;

#ifdef SOLARIS
#define heapsort qsort
#else
extern int heapsort(void *, size_t, size_t,
                    int (*)(const void *, const void *));
#endif

/*
 * Compare two long integers (helper function for heapsort)
 */
int complong(const void *arg1, const void *arg2)
{
	long l1 = *(long *)arg1;
	long l2 = *(long *)arg2;

	if (l1 == l2)
		return 0;
	else if (l1 < l2)
		return -1;
	else
		return 1;
}

/*
 * Worker thread to sort a portion of the set of numbers.
 */
void *thr_fn(void *arg)
{
	long	idx = (long)arg;

	heapsort(&nums[idx], TNUM, sizeof(long), complong);
	pthread_barrier_wait(&b);

	/*
	 * Go off and perform more work ...
	 */
	return((void *)0);
}

/*
 * Merge the results of the individual sorted ranges.
 */
void merge()
{
	long	idx[NTHR];
	long	i, minidx, sidx, num;

	for (i = 0; i < NTHR; i++)
		idx[i] = i * TNUM;
	for (sidx = 0; sidx < NUMNUM; sidx++) {
		num = LONG_MAX;
		for (i = 0; i < NTHR; i++) {
			if ((idx[i] < (i+1)*TNUM) && (nums[idx[i]] < num)) {
				num = nums[idx[i]];
				minidx = i;
			}
		}
		snums[sidx] = nums[idx[minidx]];
		idx[minidx]++;
	}
}

int main()
{
	unsigned long	i;
	struct timeval	start, end;
	long long		startusec, endusec;
	double			elapsed;
	int				err;
	pthread_t		tid;

	/*
	 * Create the initial set of numbers to sort.
	 */
	srandom(1);
	for (i = 0; i < NUMNUM; i++)
		nums[i] = random();

	/*
	 * Create 8 threads to sort the numbers.
	 */
	gettimeofday(&start, NULL);
	pthread_barrier_init(&b, NULL, NTHR+1);
	for (i = 0; i < NTHR; i++) {
		err = pthread_create(&tid, NULL, thr_fn, (void *)(i * TNUM));
		if (err != 0)
			err_exit(err, "can't create thread");
	}
	pthread_barrier_wait(&b);
	merge();
	gettimeofday(&end, NULL);

	/*
	 * Print the sorted list.
	 */
	startusec = start.tv_sec * 1000000 + start.tv_usec;
	endusec = end.tv_sec * 1000000 + end.tv_usec;
	elapsed = (double)(endusec - startusec) / 1000000.0;
	printf("sort took %.4f seconds\n", elapsed);
	for (i = 0; i < NUMNUM; i++)
		printf("%ld\n", snums[i]);
	exit(0);
}