|
Java example source code file (GDIHashtable.cpp)
The GDIHashtable.cpp Java example source code/* * Copyright (c) 1999, 2008, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. Oracle designates this * particular file as subject to the "Classpath" exception as provided * by Oracle in the LICENSE file that accompanied this code. * * This code 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 General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ #include "GDIHashtable.h" #include "awt_GDIObject.h" GDIHashtable::BatchDestructionManager GDIHashtable::manager; /* * The order of monitor entrance is BatchDestructionManager->List->Hashtable. * GDIHashtable::put() and GDIHashtable::release() are designed to be called * only when we are synchronized on the BatchDestructionManager lock. */ void* GDIHashtable::put(void* key, void* value) { manager.decrementCounter(); return Hashtable::put(key, value); } void GDIHashtable::release(void* key) { if (!manager.isBatchingEnabled()) { void* value = remove(key); DASSERT(value != NULL); m_deleteProc(value); } } void GDIHashtable::flush() { CriticalSection::Lock l(lock); for (int i = capacity; i-- > 0;) { HashtableEntry* prev = NULL; for (HashtableEntry* e = table[i] ; e != NULL ; ) { AwtGDIObject* pGDIObject = (AwtGDIObject*)e->value; if (pGDIObject->GetRefCount() <= 0) { if (prev != NULL) { prev->next = e->next; } else { table[i] = e->next; } count--; HashtableEntry* next = e->next; if (m_deleteProc) { (*m_deleteProc)(e->value); } delete e; e = next; } else { prev = e; e = e->next; } } } } void GDIHashtable::List::flushAll() { CriticalSection::Lock l(m_listLock); for (ListEntry* e = m_pHead; e != NULL; e = e->next) { e->table->flush(); } } void GDIHashtable::List::add(GDIHashtable* table) { CriticalSection::Lock l(m_listLock); ListEntry* e = new ListEntry; e->table = table; e->next = m_pHead; m_pHead = e; } void GDIHashtable::List::remove(GDIHashtable* table) { CriticalSection::Lock l(m_listLock); ListEntry* prev = NULL; for (ListEntry* e = m_pHead; e != NULL; prev = e, e = e->next) { if (e->table == table) { if (prev != NULL) { prev->next = e->next; } else { m_pHead = e->next; } delete e; return; } } } void GDIHashtable::List::clear() { CriticalSection::Lock l(m_listLock); ListEntry* e = m_pHead; m_pHead = NULL; while (e != NULL) { ListEntry* next = e->next; delete e; e = next; } } GDIHashtable::BatchDestructionManager::BatchDestructionManager(UINT nFirstThreshold, UINT nSecondThreshold, UINT nDestroyPeriod) : m_nFirstThreshold(nFirstThreshold), m_nSecondThreshold(nSecondThreshold), m_nDestroyPeriod(nDestroyPeriod), m_nCounter(0), m_bBatchingEnabled(TRUE) { } Other Java examples (source code examples)Here is a short list of links related to this Java GDIHashtable.cpp source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2021 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.