File: JSLock.cpp

package info (click to toggle)
webkit 1.0.1-4%2Blenny2
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 68,876 kB
  • ctags: 66,869
  • sloc: cpp: 369,003; ansic: 20,095; perl: 13,548; objc: 13,474; yacc: 2,562; python: 1,092; sh: 611; ruby: 405; makefile: 140; xml: 10
file content (143 lines) | stat: -rw-r--r-- 3,231 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
// -*- mode: c++; c-basic-offset: 4 -*-
/*
 * This file is part of the KDE libraries
 * Copyright (C) 2005 Apple Computer, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Library General Public
 * License as published by the Free Software Foundation; either
 * version 2 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Library General Public License for more details.
 *
 * You should have received a copy of the GNU Library General Public License
 * along with this library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 * Boston, MA 02110-1301, USA 
 *
 */

#include "config.h"
#include "JSLock.h"

#include "collector.h"
#if USE(MULTIPLE_THREADS)
#include <pthread.h>
#endif

namespace KJS {

#if USE(MULTIPLE_THREADS)

// Acquire this mutex before accessing lock-related data.
static pthread_mutex_t JSMutex = PTHREAD_MUTEX_INITIALIZER;

// Thread-specific key that tells whether a thread holds the JSMutex.
pthread_key_t didLockJSMutex;

// Lock nesting count.
static int JSLockCount;

static void createDidLockJSMutex()
{
    pthread_key_create(&didLockJSMutex, 0);
}
pthread_once_t createDidLockJSMutexOnce = PTHREAD_ONCE_INIT;

void JSLock::lock()
{
    pthread_once(&createDidLockJSMutexOnce, createDidLockJSMutex);

    if (!pthread_getspecific(didLockJSMutex)) {
        int result;
        result = pthread_mutex_lock(&JSMutex);
        ASSERT(!result);
        pthread_setspecific(didLockJSMutex, &didLockJSMutex);
    }
    ++JSLockCount;
}

void JSLock::unlock()
{
    ASSERT(JSLockCount);
    ASSERT(!!pthread_getspecific(didLockJSMutex));

    --JSLockCount;
    if (!JSLockCount) {
        pthread_setspecific(didLockJSMutex, 0);
        int result;
        result = pthread_mutex_unlock(&JSMutex);
        ASSERT(!result);
    }
}

bool JSLock::currentThreadIsHoldingLock()
{
    pthread_once(&createDidLockJSMutexOnce, createDidLockJSMutex);
    return !!pthread_getspecific(didLockJSMutex);
}

void JSLock::registerThread()
{
    Collector::registerThread();
}

JSLock::DropAllLocks::DropAllLocks()
    : m_lockCount(0)
{
    pthread_once(&createDidLockJSMutexOnce, createDidLockJSMutex);

    m_lockCount = !!pthread_getspecific(didLockJSMutex) ? JSLock::lockCount() : 0;
    for (int i = 0; i < m_lockCount; i++)
        JSLock::unlock();
}

JSLock::DropAllLocks::~DropAllLocks()
{
    for (int i = 0; i < m_lockCount; i++)
        JSLock::lock();
    m_lockCount = 0;
}

#else

// If threading support is off, set the lock count to a constant value of 1 so assertions
// that the lock is held don't fail
const int JSLockCount = 1;

bool JSLock::currentThreadIsHoldingLock()
{
    return true;
}

void JSLock::lock()
{
}

void JSLock::unlock()
{
}

void JSLock::registerThread()
{
}

JSLock::DropAllLocks::DropAllLocks()
{
}

JSLock::DropAllLocks::~DropAllLocks()
{
}

#endif // USE(MULTIPLE_THREADS)

int JSLock::lockCount()
{
    return JSLockCount;
}

}