Loading...
  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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
/*
 * Copyright (c) 2000-2016 Apple Inc. All rights reserved.
 *
 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
 *
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. The rights granted to you under the License
 * may not be used to create, or enable the creation or redistribution of,
 * unlawful or unlicensed copies of an Apple operating system, or to
 * circumvent, violate, or enable the circumvention or violation of, any
 * terms of an Apple operating system software license agreement.
 *
 * Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this file.
 *
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 *
 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
 */
/* IOSymbol.cpp created by gvdl on Fri 1998-11-17 */

#define IOKIT_ENABLE_SHARED_PTR

#include <string.h>
#include <sys/cdefs.h>

#include <kern/locks.h>

#include <libkern/c++/OSSymbol.h>
#include <libkern/c++/OSSharedPtr.h>
#include <libkern/c++/OSLib.h>
#include <os/cpp_util.h>
#include <string.h>

#define super OSString

typedef struct { unsigned int i, j; } OSSymbolPoolState;

#define INITIAL_POOL_SIZE  ((unsigned int)((exp2ml(1 + log2(kInitBucketCount)))))

#define GROW_FACTOR   (1)
#define SHRINK_FACTOR (3)

#define GROW_POOL()     do \
    if (count * GROW_FACTOR > nBuckets) { \
	reconstructSymbols(true); \
    } \
while (0)

#define SHRINK_POOL()     do \
    if (count * SHRINK_FACTOR < nBuckets && \
	nBuckets > INITIAL_POOL_SIZE) { \
	reconstructSymbols(false); \
    } \
while (0)

class OSSymbolPool
{
private:
	static const unsigned int kInitBucketCount = 16;

	typedef struct { unsigned int count; OSSymbol **symbolP; } Bucket;

	Bucket *buckets;
	unsigned int nBuckets;
	unsigned int count;
	lck_rw_t *poolGate;

	static inline void
	hashSymbol(const char *s,
	    unsigned int *hashP,
	    unsigned int *lenP)
	{
		unsigned int hash = 0;
		unsigned int len = 0;

		/* Unroll the loop. */
		for (;;) {
			if (!*s) {
				break;
			}
			len++; hash ^= (unsigned int)(unsigned char) *s++;
			if (!*s) {
				break;
			}
			len++; hash ^= ((unsigned int)(unsigned char) *s++) <<  8;
			if (!*s) {
				break;
			}
			len++; hash ^= ((unsigned int)(unsigned char) *s++) << 16;
			if (!*s) {
				break;
			}
			len++; hash ^= ((unsigned int)(unsigned char) *s++) << 24;
		}
		*lenP = len;
		*hashP = hash;
	}

	static unsigned long log2(unsigned int x);
	static unsigned long exp2ml(unsigned long x);

	void reconstructSymbols(void);
	void reconstructSymbols(bool grow);

public:
	static void *operator new(size_t size);
	static void operator delete(void *mem, size_t size);

	OSSymbolPool()
	{
	}
	OSSymbolPool(const OSSymbolPool *old);
	virtual
	~OSSymbolPool();

	bool init();

	inline void
	closeReadGate()
	{
		lck_rw_lock(poolGate, LCK_RW_TYPE_SHARED);
	}

	inline void
	openReadGate()
	{
		lck_rw_unlock(poolGate, LCK_RW_TYPE_SHARED);
	}


	inline void
	closeWriteGate()
	{
		lck_rw_lock(poolGate, LCK_RW_TYPE_EXCLUSIVE);
	}

	inline void
	openWriteGate()
	{
		lck_rw_unlock(poolGate, LCK_RW_TYPE_EXCLUSIVE);
	}

	OSSharedPtr<OSSymbol> findSymbol(const char *cString) const;
	OSSharedPtr<OSSymbol> insertSymbol(OSSymbol *sym);
	void removeSymbol(OSSymbol *sym);

	OSSymbolPoolState initHashState();
	LIBKERN_RETURNS_NOT_RETAINED OSSymbol * nextHashState(OSSymbolPoolState *stateP);
};

void *
OSSymbolPool::operator new(size_t size)
{
	void *mem = (void *)kalloc_tag(size, VM_KERN_MEMORY_LIBKERN);
	OSMETA_ACCUMSIZE(size);
	assert(mem);
	bzero(mem, size);

	return mem;
}

void
OSSymbolPool::operator delete(void *mem, size_t size)
{
	kfree(mem, size);
	OSMETA_ACCUMSIZE(-size);
}

extern lck_grp_t *IOLockGroup;

bool
OSSymbolPool::init()
{
	count = 0;
	nBuckets = INITIAL_POOL_SIZE;
	buckets = (Bucket *) kalloc_tag(nBuckets * sizeof(Bucket), VM_KERN_MEMORY_LIBKERN);
	OSMETA_ACCUMSIZE(nBuckets * sizeof(Bucket));
	if (!buckets) {
		return false;
	}
	bzero(buckets, nBuckets * sizeof(Bucket));

	poolGate = lck_rw_alloc_init(IOLockGroup, LCK_ATTR_NULL);

	return poolGate != NULL;
}

OSSymbolPool::OSSymbolPool(const OSSymbolPool *old)
{
	count = old->count;
	nBuckets = old->nBuckets;
	buckets = old->buckets;

	poolGate = NULL; // Do not duplicate the poolGate
}

OSSymbolPool::~OSSymbolPool()
{
	if (buckets) {
		Bucket *thisBucket;
		for (thisBucket = &buckets[0]; thisBucket < &buckets[nBuckets]; thisBucket++) {
			if (thisBucket->count > 1) {
				kfree(thisBucket->symbolP, thisBucket->count * sizeof(OSSymbol *));
				OSMETA_ACCUMSIZE(-(thisBucket->count * sizeof(OSSymbol *)));
			}
		}
		kfree(buckets, nBuckets * sizeof(Bucket));
		OSMETA_ACCUMSIZE(-(nBuckets * sizeof(Bucket)));
	}

	if (poolGate) {
		lck_rw_free(poolGate, IOLockGroup);
	}
}

unsigned long
OSSymbolPool::log2(unsigned int x)
{
	unsigned long i;

	for (i = 0; x > 1; i++) {
		x >>= 1;
	}
	return i;
}

unsigned long
OSSymbolPool::exp2ml(unsigned long x)
{
	return (1 << x) - 1;
}

OSSymbolPoolState
OSSymbolPool::initHashState()
{
	OSSymbolPoolState newState = { nBuckets, 0 };
	return newState;
}

OSSymbol *
OSSymbolPool::nextHashState(OSSymbolPoolState *stateP)
{
	Bucket *thisBucket = &buckets[stateP->i];

	while (!stateP->j) {
		if (!stateP->i) {
			return NULL;
		}
		stateP->i--;
		thisBucket--;
		stateP->j = thisBucket->count;
	}

	stateP->j--;
	if (thisBucket->count == 1) {
		return (OSSymbol *) thisBucket->symbolP;
	} else {
		return thisBucket->symbolP[stateP->j];
	}
}

void
OSSymbolPool::reconstructSymbols(void)
{
	this->reconstructSymbols(true);
}

void
OSSymbolPool::reconstructSymbols(bool grow)
{
	unsigned int new_nBuckets = nBuckets;
	OSSymbol *insert;
	OSSymbolPoolState state;

	if (grow) {
		new_nBuckets += new_nBuckets + 1;
	} else {
		/* Don't shrink the pool below the default initial size.
		 */
		if (nBuckets <= INITIAL_POOL_SIZE) {
			return;
		}
		new_nBuckets = (new_nBuckets - 1) / 2;
	}

	/* Create old pool to iterate after doing above check, cause it
	 * gets finalized at return.
	 */
	OSSymbolPool old(this);

	count = 0;
	nBuckets = new_nBuckets;
	buckets = (Bucket *) kalloc_tag(nBuckets * sizeof(Bucket), VM_KERN_MEMORY_LIBKERN);
	OSMETA_ACCUMSIZE(nBuckets * sizeof(Bucket));
	/* @@@ gvdl: Zero test and panic if can't set up pool */
	bzero(buckets, nBuckets * sizeof(Bucket));

	state = old.initHashState();
	while ((insert = old.nextHashState(&state))) {
		insertSymbol(insert);
	}
}

OSSharedPtr<OSSymbol>
OSSymbolPool::findSymbol(const char *cString) const
{
	Bucket *thisBucket;
	unsigned int j, inLen, hash;
	OSSymbol *probeSymbol, **list;
	OSSharedPtr<OSSymbol> ret;

	hashSymbol(cString, &hash, &inLen); inLen++;
	thisBucket = &buckets[hash % nBuckets];
	j = thisBucket->count;

	if (!j) {
		return NULL;
	}

	if (j == 1) {
		probeSymbol = (OSSymbol *) thisBucket->symbolP;

		if (inLen == probeSymbol->length
		    && strncmp(probeSymbol->string, cString, probeSymbol->length) == 0
		    && probeSymbol->taggedTryRetain(nullptr)) {
			ret.reset(probeSymbol, OSNoRetain);
			return ret;
		}
		return NULL;
	}

	for (list = thisBucket->symbolP; j--; list++) {
		probeSymbol = *list;
		if (inLen == probeSymbol->length
		    && strncmp(probeSymbol->string, cString, probeSymbol->length) == 0
		    && probeSymbol->taggedTryRetain(nullptr)) {
			ret.reset(probeSymbol, OSNoRetain);
			return ret;
		}
	}

	return NULL;
}

OSSharedPtr<OSSymbol>
OSSymbolPool::insertSymbol(OSSymbol *sym)
{
	const char *cString = sym->string;
	Bucket *thisBucket;
	unsigned int j, inLen, hash;
	OSSymbol *probeSymbol, **list;
	OSSharedPtr<OSSymbol> ret;

	hashSymbol(cString, &hash, &inLen); inLen++;
	thisBucket = &buckets[hash % nBuckets];
	j = thisBucket->count;

	if (!j) {
		thisBucket->symbolP = (OSSymbol **) sym;
		thisBucket->count++;
		count++;
		return nullptr;
	}

	if (j == 1) {
		probeSymbol = (OSSymbol *) thisBucket->symbolP;

		if (inLen == probeSymbol->length
		    && strncmp(probeSymbol->string, cString, probeSymbol->length) == 0
		    && probeSymbol->taggedTryRetain(nullptr)) {
			ret.reset(probeSymbol, OSNoRetain);
			return ret;
		}

		list = (OSSymbol **) kalloc_tag(2 * sizeof(OSSymbol *), VM_KERN_MEMORY_LIBKERN);
		OSMETA_ACCUMSIZE(2 * sizeof(OSSymbol *));
		/* @@@ gvdl: Zero test and panic if can't set up pool */
		list[0] = sym;
		list[1] = probeSymbol;
		thisBucket->symbolP = list;
		thisBucket->count++;
		count++;
		GROW_POOL();

		return nullptr;
	}

	for (list = thisBucket->symbolP; j--; list++) {
		probeSymbol = *list;
		if (inLen == probeSymbol->length
		    && strncmp(probeSymbol->string, cString, probeSymbol->length) == 0
		    && probeSymbol->taggedTryRetain(nullptr)) {
			ret.reset(probeSymbol, OSNoRetain);
			return ret;
		}
	}

	j = thisBucket->count++;
	count++;
	list = (OSSymbol **) kalloc_tag(thisBucket->count * sizeof(OSSymbol *), VM_KERN_MEMORY_LIBKERN);
	OSMETA_ACCUMSIZE(thisBucket->count * sizeof(OSSymbol *));
	/* @@@ gvdl: Zero test and panic if can't set up pool */
	list[0] = sym;
	bcopy(thisBucket->symbolP, list + 1, j * sizeof(OSSymbol *));
	kfree(thisBucket->symbolP, j * sizeof(OSSymbol *));
	OSMETA_ACCUMSIZE(-(j * sizeof(OSSymbol *)));
	thisBucket->symbolP = list;
	GROW_POOL();

	return nullptr;
}

void
OSSymbolPool::removeSymbol(OSSymbol *sym)
{
	Bucket *thisBucket;
	unsigned int j, inLen, hash;
	OSSymbol *probeSymbol, **list;

	hashSymbol(sym->string, &hash, &inLen); inLen++;
	thisBucket = &buckets[hash % nBuckets];
	j = thisBucket->count;
	list = thisBucket->symbolP;

	if (!j) {
		// couldn't find the symbol; probably means string hash changed
		panic("removeSymbol %s count %d ", sym->string ? sym->string : "no string", count);
		return;
	}

	if (j == 1) {
		probeSymbol = (OSSymbol *) list;

		if (probeSymbol == sym) {
			thisBucket->symbolP = NULL;
			count--;
			thisBucket->count--;
			SHRINK_POOL();
			return;
		}
		// couldn't find the symbol; probably means string hash changed
		panic("removeSymbol %s count %d ", sym->string ? sym->string : "no string", count);
		return;
	}

	if (j == 2) {
		probeSymbol = list[0];
		if (probeSymbol == sym) {
			thisBucket->symbolP = (OSSymbol **) list[1];
			kfree(list, 2 * sizeof(OSSymbol *));
			OSMETA_ACCUMSIZE(-(2 * sizeof(OSSymbol *)));
			count--;
			thisBucket->count--;
			SHRINK_POOL();
			return;
		}

		probeSymbol = list[1];
		if (probeSymbol == sym) {
			thisBucket->symbolP = (OSSymbol **) list[0];
			kfree(list, 2 * sizeof(OSSymbol *));
			OSMETA_ACCUMSIZE(-(2 * sizeof(OSSymbol *)));
			count--;
			thisBucket->count--;
			SHRINK_POOL();
			return;
		}
		// couldn't find the symbol; probably means string hash changed
		panic("removeSymbol %s count %d ", sym->string ? sym->string : "no string", count);
		return;
	}

	for (; j--; list++) {
		probeSymbol = *list;
		if (probeSymbol == sym) {
			list = (OSSymbol **)
			    kalloc_tag((thisBucket->count - 1) * sizeof(OSSymbol *), VM_KERN_MEMORY_LIBKERN);
			OSMETA_ACCUMSIZE((thisBucket->count - 1) * sizeof(OSSymbol *));
			if (thisBucket->count - 1 != j) {
				bcopy(thisBucket->symbolP, list,
				    (thisBucket->count - 1 - j) * sizeof(OSSymbol *));
			}
			if (j) {
				bcopy(thisBucket->symbolP + thisBucket->count - j,
				    list + thisBucket->count - 1 - j,
				    j * sizeof(OSSymbol *));
			}
			kfree(thisBucket->symbolP, thisBucket->count * sizeof(OSSymbol *));
			OSMETA_ACCUMSIZE(-(thisBucket->count * sizeof(OSSymbol *)));
			thisBucket->symbolP = list;
			count--;
			thisBucket->count--;
			return;
		}
	}
	// couldn't find the symbol; probably means string hash changed
	panic("removeSymbol %s count %d ", sym->string ? sym->string : "no string", count);
}

/*
 *********************************************************************
 * From here on we are actually implementing the OSSymbol class
 *********************************************************************
 */
OSDefineMetaClassAndStructorsWithInitAndZone(OSSymbol, OSString,
    OSSymbol::initialize(), ZC_ZFREE_CLEARMEM)
OSMetaClassDefineReservedUnused(OSSymbol, 0);
OSMetaClassDefineReservedUnused(OSSymbol, 1);
OSMetaClassDefineReservedUnused(OSSymbol, 2);
OSMetaClassDefineReservedUnused(OSSymbol, 3);
OSMetaClassDefineReservedUnused(OSSymbol, 4);
OSMetaClassDefineReservedUnused(OSSymbol, 5);
OSMetaClassDefineReservedUnused(OSSymbol, 6);
OSMetaClassDefineReservedUnused(OSSymbol, 7);

static OSSymbolPool *pool;

void
OSSymbol::initialize()
{
	pool = new OSSymbolPool;
	assert(pool);

	if (pool && !pool->init()) {
		delete pool;
		assert(false);
	}
	;
}

bool
OSSymbol::initWithCStringNoCopy(const char *)
{
	return false;
}
bool
OSSymbol::initWithCString(const char *)
{
	return false;
}
bool
OSSymbol::initWithString(const OSString *)
{
	return false;
}

OSSharedPtr<const OSSymbol>
OSSymbol::withString(const OSString *aString)
{
	// This string may be a OSSymbol already, cheap check.
	if (OSDynamicCast(OSSymbol, aString)) {
		OSSharedPtr<const OSSymbol> aStringNew((const OSSymbol *)aString, OSRetain);
		return aStringNew;
	} else if (((const OSSymbol *) aString)->flags & kOSStringNoCopy) {
		return OSSymbol::withCStringNoCopy(aString->getCStringNoCopy());
	} else {
		return OSSymbol::withCString(aString->getCStringNoCopy());
	}
}

OSSharedPtr<const OSSymbol>
OSSymbol::withCString(const char *cString)
{
	OSSharedPtr<const OSSymbol> symbol;

	// Check if the symbol exists already, we don't need to take a lock here,
	// since existingSymbolForCString will take the shared lock.
	symbol = OSSymbol::existingSymbolForCString(cString);
	if (symbol) {
		return symbol;
	}

	OSSharedPtr<OSSymbol> newSymb = OSMakeShared<OSSymbol>();
	if (!newSymb) {
		return os::move(newSymb);
	}

	if (newSymb->OSString::initWithCString(cString)) {
		pool->closeWriteGate();
		symbol = pool->insertSymbol(newSymb.get());
		pool->openWriteGate();

		if (symbol) {
			// Somebody must have inserted the new symbol so free our copy
			newSymb.detach()->OSString::free();
			return symbol;
		}
	}

	return os::move(newSymb); // return the newly created & inserted symbol.
}

OSSharedPtr<const OSSymbol>
OSSymbol::withCStringNoCopy(const char *cString)
{
	OSSharedPtr<const OSSymbol> symbol;
	OSSharedPtr<OSSymbol> newSymb;

	// Check if the symbol exists already, we don't need to take a lock here,
	// since existingSymbolForCString will take the shared lock.
	symbol = OSSymbol::existingSymbolForCString(cString);
	if (symbol) {
		return symbol;
	}

	newSymb = OSMakeShared<OSSymbol>();
	if (!newSymb) {
		return os::move(newSymb);
	}

	if (newSymb->OSString::initWithCStringNoCopy(cString)) {
		pool->closeWriteGate();
		symbol = pool->insertSymbol(newSymb.get());
		pool->openWriteGate();

		if (symbol) {
			newSymb.detach()->OSString::free();
			// Somebody must have inserted the new symbol so free our copy
			return symbol;
		}
	}

	return os::move(newSymb); // return the newly created & inserted symbol.
}

OSSharedPtr<const OSSymbol>
OSSymbol::existingSymbolForString(const OSString *aString)
{
	if (OSDynamicCast(OSSymbol, aString)) {
		OSSharedPtr<const OSSymbol> aStringNew((const OSSymbol *)aString, OSRetain);
		return aStringNew;
	}

	return OSSymbol::existingSymbolForCString(aString->getCStringNoCopy());
}

OSSharedPtr<const OSSymbol>
OSSymbol::existingSymbolForCString(const char *cString)
{
	OSSharedPtr<OSSymbol> symbol;

	pool->closeReadGate();
	symbol = pool->findSymbol(cString);
	pool->openReadGate();

	return os::move(symbol);
}

void
OSSymbol::checkForPageUnload(void *startAddr, void *endAddr)
{
	OSSymbol *probeSymbol;
	OSSymbolPoolState state;

	pool->closeWriteGate();
	state = pool->initHashState();
	while ((probeSymbol = pool->nextHashState(&state))) {
		if (probeSymbol->string >= startAddr && probeSymbol->string < endAddr) {
			probeSymbol->OSString::initWithCString(probeSymbol->string);
		}
	}
	pool->openWriteGate();
}

void
OSSymbol::taggedRelease(const void *tag) const
{
	super::taggedRelease(tag);
}

void
OSSymbol::taggedRelease(const void *tag, const int when) const
{
	super::taggedRelease(tag, when);
}

void
OSSymbol::free()
{
	pool->closeWriteGate();
	pool->removeSymbol(this);
	pool->openWriteGate();
	super::free();
}

bool
OSSymbol::isEqualTo(const char *aCString) const
{
	return super::isEqualTo(aCString);
}

bool
OSSymbol::isEqualTo(const OSSymbol *aSymbol) const
{
	return aSymbol == this;
}

bool
OSSymbol::isEqualTo(const OSMetaClassBase *obj) const
{
	OSSymbol *  sym;
	OSString *  str;

	if ((sym = OSDynamicCast(OSSymbol, obj))) {
		return isEqualTo(sym);
	} else if ((str = OSDynamicCast(OSString, obj))) {
		return super::isEqualTo(str);
	} else {
		return false;
	}
}

unsigned int
OSSymbol::bsearch(
	const void *  key,
	const void *  array,
	unsigned int  arrayCount,
	size_t        memberSize)
{
	const void **p;
	unsigned int baseIdx = 0;
	unsigned int lim;

	for (lim = arrayCount; lim; lim >>= 1) {
		p = (typeof(p))(((uintptr_t) array) + (baseIdx + (lim >> 1)) * memberSize);
		if (key == *p) {
			return baseIdx + (lim >> 1);
		}
		if (key > *p) {
			// move right
			baseIdx += (lim >> 1) + 1;
			lim--;
		}
		// else move left
	}
	// not found, insertion point here
	return baseIdx + (lim >> 1);
}