gecko-dev/modules/libpref/src/prefapi.cpp

983 lines
27 KiB
C++
Raw Normal View History

/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
1998-03-28 02:44:41 +00:00
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
1998-03-28 02:44:41 +00:00
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
1998-03-28 02:44:41 +00:00
*
* The Original Code is mozilla.org code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1998
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
1998-03-28 02:44:41 +00:00
#include "prefapi.h"
#include "prefapi_private_data.h"
#include "PrefTuple.h"
#include "prefread.h"
#include "nsReadableUtils.h"
#include "nsCRT.h"
#define PL_ARENA_CONST_ALIGN_MASK 3
#include "plarena.h"
#ifdef XP_OS2
#include <sys/types.h>
#endif
#ifdef _WIN32
#include "windows.h"
#endif /* _WIN32 */
1998-03-28 02:44:41 +00:00
1998-11-11 22:29:18 +00:00
#include "plstr.h"
#include "pldhash.h"
1998-11-11 22:29:18 +00:00
#include "plbase64.h"
#include "prlog.h"
#include "prmem.h"
#include "prprf.h"
#include "nsQuickSort.h"
#include "nsString.h"
#include "nsPrintfCString.h"
#include "prlink.h"
1998-03-28 02:44:41 +00:00
#ifdef XP_OS2
#define INCL_DOS
#include <os2.h>
#endif
static void
clearPrefEntry(PLDHashTable *table, PLDHashEntryHdr *entry)
1998-03-28 02:44:41 +00:00
{
PrefHashEntry *pref = static_cast<PrefHashEntry *>(entry);
if (pref->flags & PREF_STRING)
{
if (pref->defaultPref.stringVal)
PL_strfree(pref->defaultPref.stringVal);
if (pref->userPref.stringVal)
PL_strfree(pref->userPref.stringVal);
}
// don't need to free this as it's allocated in memory owned by
// gPrefNameArena
pref->key = nsnull;
memset(entry, 0, table->entrySize);
1998-03-28 02:44:41 +00:00
}
static bool
matchPrefEntry(PLDHashTable*, const PLDHashEntryHdr* entry,
const void* key)
1998-03-28 02:44:41 +00:00
{
const PrefHashEntry *prefEntry =
static_cast<const PrefHashEntry*>(entry);
if (prefEntry->key == key) return PR_TRUE;
if (!prefEntry->key || !key) return PR_FALSE;
1998-03-28 02:44:41 +00:00
const char *otherKey = reinterpret_cast<const char*>(key);
return (strcmp(prefEntry->key, otherKey) == 0);
1998-03-28 02:44:41 +00:00
}
PLDHashTable gHashTable = { nsnull };
static PLArenaPool gPrefNameArena;
bool gDirty = false;
static struct CallbackNode* gCallbacks = NULL;
static bool gIsAnyPrefLocked = false;
// These are only used during the call to pref_DoCallback
static bool gCallbacksInProgress = false;
static bool gShouldCleanupDeadNodes = false;
static PLDHashTableOps pref_HashTableOps = {
PL_DHashAllocTable,
PL_DHashFreeTable,
PL_DHashStringKey,
matchPrefEntry,
PL_DHashMoveEntryStub,
clearPrefEntry,
PL_DHashFinalizeStub,
nsnull,
};
// PR_ALIGN_OF_WORD is only defined on some platforms. ALIGN_OF_WORD has
// already been defined to PR_ALIGN_OF_WORD everywhere
#ifndef PR_ALIGN_OF_WORD
#define PR_ALIGN_OF_WORD PR_ALIGN_OF_POINTER
#endif
// making PrefName arena 8k for nice allocation
#define PREFNAME_ARENA_SIZE 8192
#define WORD_ALIGN_MASK (PR_ALIGN_OF_WORD - 1)
// sanity checking
#if (PR_ALIGN_OF_WORD & WORD_ALIGN_MASK) != 0
#error "PR_ALIGN_OF_WORD must be a power of 2!"
#endif
// equivalent to strdup() - does no error checking,
// we're assuming we're only called with a valid pointer
static char *ArenaStrDup(const char* str, PLArenaPool* aArena)
{
void* mem;
PRUint32 len = strlen(str);
PL_ARENA_ALLOCATE(mem, aArena, len+1);
if (mem)
memcpy(mem, str, len+1);
return static_cast<char*>(mem);
}
/*---------------------------------------------------------------------------*/
#define PREF_IS_LOCKED(pref) ((pref)->flags & PREF_LOCKED)
#define PREF_HAS_USER_VALUE(pref) ((pref)->flags & PREF_USERSET)
#define PREF_TYPE(pref) (PrefType)((pref)->flags & PREF_VALUETYPE_MASK)
static bool pref_ValueChanged(PrefValue oldValue, PrefValue newValue, PrefType type);
1998-03-28 02:44:41 +00:00
/* -- Privates */
struct CallbackNode {
char* domain;
// If someone attempts to remove the node from the callback list while
// pref_DoCallback is running, |func| is set to nsnull. Such nodes will
// be removed at the end of pref_DoCallback.
PrefChangedFunc func;
void* data;
struct CallbackNode* next;
1998-03-28 02:44:41 +00:00
};
/* -- Prototypes */
static nsresult pref_DoCallback(const char* changed_pref);
1998-03-28 02:44:41 +00:00
static nsresult pref_HashPref(const char *key, PrefValue value, PrefType type, bool defaultPref);
#define PREF_HASHTABLE_INITIAL_SIZE 2048
nsresult PREF_Init()
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops) {
if (!PL_DHashTableInit(&gHashTable, &pref_HashTableOps, nsnull,
sizeof(PrefHashEntry),
PREF_HASHTABLE_INITIAL_SIZE)) {
gHashTable.ops = nsnull;
return NS_ERROR_OUT_OF_MEMORY;
}
PL_INIT_ARENA_POOL(&gPrefNameArena, "PrefNameArena",
PREFNAME_ARENA_SIZE);
}
return NS_OK;
}
1998-03-28 02:44:41 +00:00
/* Frees the callback list. */
void PREF_Cleanup()
1998-03-28 02:44:41 +00:00
{
NS_ASSERTION(!gCallbacksInProgress,
"PREF_Cleanup was called while gCallbacksInProgress is PR_TRUE!");
struct CallbackNode* node = gCallbacks;
struct CallbackNode* next_node;
while (node)
{
next_node = node->next;
PL_strfree(node->domain);
free(node);
node = next_node;
}
gCallbacks = NULL;
1999-09-20 20:52:48 +00:00
PREF_CleanupPrefs();
1999-08-28 05:19:29 +00:00
}
/* Frees up all the objects except the callback list. */
void PREF_CleanupPrefs()
1999-08-28 05:19:29 +00:00
{
if (gHashTable.ops) {
PL_DHashTableFinish(&gHashTable);
gHashTable.ops = nsnull;
PL_FinishArenaPool(&gPrefNameArena);
}
1998-03-28 02:44:41 +00:00
}
// note that this appends to aResult, and does not assign!
static void str_escape(const char * original, nsAFlatCString& aResult)
{
/* JavaScript does not allow quotes, slashes, or line terminators inside
* strings so we must escape them. ECMAScript defines four line
* terminators, but we're only worrying about \r and \n here. We currently
* feed our pref script to the JS interpreter as Latin-1 so we won't
* encounter \u2028 (line separator) or \u2029 (paragraph separator).
*
* WARNING: There are hints that we may be moving to storing prefs
* as utf8. If we ever feed them to the JS compiler as UTF8 then
* we'll have to worry about the multibyte sequences that would be
* interpreted as \u2028 and \u2029
*/
const char *p;
if (original == NULL)
return;
/* Paranoid worst case all slashes will free quickly */
for (p=original; *p; ++p)
{
switch (*p)
{
case '\n':
aResult.Append("\\n");
break;
case '\r':
aResult.Append("\\r");
break;
1998-03-28 02:44:41 +00:00
case '\\':
aResult.Append("\\\\");
break;
1998-03-28 02:44:41 +00:00
case '\"':
aResult.Append("\\\"");
1999-03-10 20:02:22 +00:00
break;
1998-03-28 02:44:41 +00:00
default:
aResult.Append(*p);
1998-03-28 02:44:41 +00:00
break;
}
}
1998-03-28 02:44:41 +00:00
}
/*
** External calls
*/
nsresult
PREF_SetCharPref(const char *pref_name, const char *value, bool set_default)
1998-03-28 02:44:41 +00:00
{
PrefValue pref;
pref.stringVal = (char*) value;
return pref_HashPref(pref_name, pref, PREF_STRING, set_default);
1998-03-28 02:44:41 +00:00
}
nsresult
PREF_SetIntPref(const char *pref_name, PRInt32 value, bool set_default)
1998-03-28 02:44:41 +00:00
{
PrefValue pref;
pref.intVal = value;
1998-03-28 02:44:41 +00:00
return pref_HashPref(pref_name, pref, PREF_INT, set_default);
1998-03-28 02:44:41 +00:00
}
nsresult
PREF_SetBoolPref(const char *pref_name, bool value, bool set_default)
1998-03-28 02:44:41 +00:00
{
PrefValue pref;
pref.boolVal = value;
1998-03-28 02:44:41 +00:00
return pref_HashPref(pref_name, pref, PREF_BOOL, set_default);
1998-03-28 02:44:41 +00:00
}
nsresult
pref_SetPrefTuple(const PrefTuple &aPref, bool set_default)
{
switch (aPref.type) {
case PrefTuple::PREF_STRING:
return PREF_SetCharPref(aPref.key.get(), aPref.stringVal.get(), set_default);
case PrefTuple::PREF_INT:
return PREF_SetIntPref(aPref.key.get(), aPref.intVal, set_default);
case PrefTuple::PREF_BOOL:
return PREF_SetBoolPref(aPref.key.get(), aPref.boolVal, set_default);
}
NS_NOTREACHED("Unknown type");
return NS_ERROR_INVALID_ARG;
}
PLDHashOperator
pref_savePref(PLDHashTable *table, PLDHashEntryHdr *heh, PRUint32 i, void *arg)
1998-03-28 02:44:41 +00:00
{
pref_saveArgs *argData = static_cast<pref_saveArgs *>(arg);
PrefHashEntry *pref = static_cast<PrefHashEntry *>(heh);
1998-03-28 02:44:41 +00:00
PR_ASSERT(pref);
if (!pref)
return PL_DHASH_NEXT;
nsCAutoString prefValue;
nsCAutoString prefPrefix;
prefPrefix.Assign(NS_LITERAL_CSTRING("user_pref(\""));
// where we're getting our pref from
PrefValue* sourcePref;
if (PREF_HAS_USER_VALUE(pref) &&
(pref_ValueChanged(pref->defaultPref,
pref->userPref,
(PrefType) PREF_TYPE(pref)) ||
!(pref->flags & PREF_HAS_DEFAULT))) {
sourcePref = &pref->userPref;
} else {
if (argData->saveTypes == SAVE_ALL_AND_DEFAULTS) {
prefPrefix.Assign(NS_LITERAL_CSTRING("pref(\""));
sourcePref = &pref->defaultPref;
}
else
// do not save default prefs that haven't changed
return PL_DHASH_NEXT;
}
// strings are in quotes!
if (pref->flags & PREF_STRING) {
prefValue = '\"';
str_escape(sourcePref->stringVal, prefValue);
prefValue += '\"';
}
else if (pref->flags & PREF_INT)
prefValue.AppendInt(sourcePref->intVal);
else if (pref->flags & PREF_BOOL)
prefValue = (sourcePref->boolVal) ? "true" : "false";
nsCAutoString prefName;
str_escape(pref->key, prefName);
argData->prefArray[i] = ToNewCString(prefPrefix +
prefName +
NS_LITERAL_CSTRING("\", ") +
prefValue +
NS_LITERAL_CSTRING(");"));
return PL_DHASH_NEXT;
1998-03-28 02:44:41 +00:00
}
PLDHashOperator
pref_MirrorPrefs(PLDHashTable *table,
PLDHashEntryHdr *heh,
PRUint32 i,
void *arg)
{
if (heh) {
PrefHashEntry *entry = static_cast<PrefHashEntry *>(heh);
PrefTuple *newEntry =
static_cast<nsTArray<PrefTuple> *>(arg)->AppendElement();
pref_GetTupleFromEntry(entry, newEntry);
}
return PL_DHASH_NEXT;
}
void
pref_GetTupleFromEntry(PrefHashEntry *aHashEntry, PrefTuple *aTuple)
{
aTuple->key = aHashEntry->key;
PrefValue *value = PREF_HAS_USER_VALUE(aHashEntry) ?
&(aHashEntry->userPref) : &(aHashEntry->defaultPref);
switch (aHashEntry->flags & PREF_VALUETYPE_MASK) {
case PREF_STRING:
aTuple->stringVal = value->stringVal;
aTuple->type = PrefTuple::PREF_STRING;
return;
case PREF_INT:
aTuple->intVal = value->intVal;
aTuple->type = PrefTuple::PREF_INT;
return;
case PREF_BOOL:
aTuple->boolVal = !!value->boolVal;
aTuple->type = PrefTuple::PREF_BOOL;
return;
}
}
int
pref_CompareStrings(const void *v1, const void *v2, void *unused)
1998-03-28 02:44:41 +00:00
{
char *s1 = *(char**) v1;
char *s2 = *(char**) v2;
1998-03-28 02:44:41 +00:00
if (!s1)
{
if (!s2)
return 0;
else
return -1;
}
else if (!s2)
return 1;
else
return strcmp(s1, s2);
1998-03-28 02:44:41 +00:00
}
bool PREF_HasUserPref(const char *pref_name)
{
if (!gHashTable.ops)
return PR_FALSE;
PrefHashEntry *pref = pref_HashTableLookup(pref_name);
if (!pref) return PR_FALSE;
/* convert PREF_HAS_USER_VALUE to bool */
return (PREF_HAS_USER_VALUE(pref) != 0);
}
nsresult PREF_GetCharPref(const char *pref_name, char * return_buffer, int * length, bool get_default)
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
nsresult rv = NS_ERROR_UNEXPECTED;
char* stringVal;
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
if (pref)
{
if (get_default || PREF_IS_LOCKED(pref) || !PREF_HAS_USER_VALUE(pref))
stringVal = pref->defaultPref.stringVal;
else
stringVal = pref->userPref.stringVal;
if (stringVal)
{
if (*length <= 0)
*length = PL_strlen(stringVal) + 1;
else
{
PL_strncpy(return_buffer, stringVal, NS_MIN<size_t>(*length - 1, PL_strlen(stringVal) + 1));
return_buffer[*length - 1] = '\0';
}
rv = NS_OK;
}
}
return rv;
1998-03-28 02:44:41 +00:00
}
nsresult
PREF_CopyCharPref(const char *pref_name, char ** return_buffer, bool get_default)
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
1998-03-28 02:44:41 +00:00
nsresult rv = NS_ERROR_UNEXPECTED;
char* stringVal;
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
1998-03-28 02:44:41 +00:00
if (pref && (pref->flags & PREF_STRING))
{
if (get_default || PREF_IS_LOCKED(pref) || !PREF_HAS_USER_VALUE(pref))
stringVal = pref->defaultPref.stringVal;
else
stringVal = pref->userPref.stringVal;
if (stringVal) {
*return_buffer = NS_strdup(stringVal);
rv = NS_OK;
}
}
return rv;
1998-03-28 02:44:41 +00:00
}
nsresult PREF_GetIntPref(const char *pref_name,PRInt32 * return_int, bool get_default)
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
1998-03-28 02:44:41 +00:00
nsresult rv = NS_ERROR_UNEXPECTED;
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
if (pref && (pref->flags & PREF_INT))
{
if (get_default || PREF_IS_LOCKED(pref) || !PREF_HAS_USER_VALUE(pref))
{
PRInt32 tempInt = pref->defaultPref.intVal;
/* check to see if we even had a default */
if (!(pref->flags & PREF_HAS_DEFAULT))
return NS_ERROR_UNEXPECTED;
*return_int = tempInt;
}
else
*return_int = pref->userPref.intVal;
rv = NS_OK;
}
return rv;
1998-03-28 02:44:41 +00:00
}
nsresult PREF_GetBoolPref(const char *pref_name, bool * return_value, bool get_default)
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
1998-03-28 02:44:41 +00:00
nsresult rv = NS_ERROR_UNEXPECTED;
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
//NS_ASSERTION(pref, pref_name);
if (pref && (pref->flags & PREF_BOOL))
{
if (get_default || PREF_IS_LOCKED(pref) || !PREF_HAS_USER_VALUE(pref))
{
bool tempBool = pref->defaultPref.boolVal;
/* check to see if we even had a default */
if (pref->flags & PREF_HAS_DEFAULT) {
*return_value = tempBool;
rv = NS_OK;
}
}
else {
*return_value = pref->userPref.boolVal;
rv = NS_OK;
}
}
return rv;
1998-03-28 02:44:41 +00:00
}
/* Delete a branch. Used for deleting mime types */
static PLDHashOperator
pref_DeleteItem(PLDHashTable *table, PLDHashEntryHdr *heh, PRUint32 i, void *arg)
1998-03-28 02:44:41 +00:00
{
PrefHashEntry* he = static_cast<PrefHashEntry*>(heh);
const char *to_delete = (const char *) arg;
int len = PL_strlen(to_delete);
/* note if we're deleting "ldap" then we want to delete "ldap.xxx"
and "ldap" (if such a leaf node exists) but not "ldap_1.xxx" */
if (to_delete && (PL_strncmp(he->key, to_delete, (PRUint32) len) == 0 ||
(len-1 == (int)PL_strlen(he->key) && PL_strncmp(he->key, to_delete, (PRUint32)(len-1)) == 0)))
return PL_DHASH_REMOVE;
return PL_DHASH_NEXT;
1998-03-28 02:44:41 +00:00
}
nsresult
1998-03-28 02:44:41 +00:00
PREF_DeleteBranch(const char *branch_name)
{
int len = (int)PL_strlen(branch_name);
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
1998-03-28 02:44:41 +00:00
/* The following check insures that if the branch name already has a "."
* at the end, we don't end up with a "..". This fixes an incompatibility
* between nsIPref, which needs the period added, and nsIPrefBranch which
* does not. When nsIPref goes away this function should be fixed to
* never add the period at all.
*/
nsCAutoString branch_dot(branch_name);
if ((len > 1) && branch_name[len - 1] != '.')
branch_dot += '.';
PL_DHashTableEnumerate(&gHashTable, pref_DeleteItem,
(void*) branch_dot.get());
gDirty = PR_TRUE;
return NS_OK;
1998-03-28 02:44:41 +00:00
}
nsresult
1998-03-28 02:44:41 +00:00
PREF_ClearUserPref(const char *pref_name)
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
if (pref && PREF_HAS_USER_VALUE(pref))
{
pref->flags &= ~PREF_USERSET;
if (!(pref->flags & PREF_HAS_DEFAULT)) {
PL_DHashTableOperate(&gHashTable, pref_name, PL_DHASH_REMOVE);
}
pref_DoCallback(pref_name);
gDirty = PR_TRUE;
}
return NS_OK;
1998-03-28 02:44:41 +00:00
}
static PLDHashOperator
pref_ClearUserPref(PLDHashTable *table, PLDHashEntryHdr *he, PRUint32,
void *arg)
{
PrefHashEntry *pref = static_cast<PrefHashEntry*>(he);
PLDHashOperator nextOp = PL_DHASH_NEXT;
if (PREF_HAS_USER_VALUE(pref))
{
pref->flags &= ~PREF_USERSET;
if (!(pref->flags & PREF_HAS_DEFAULT)) {
nextOp = PL_DHASH_REMOVE;
}
pref_DoCallback(pref->key);
}
return nextOp;
}
nsresult
PREF_ClearAllUserPrefs()
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
PL_DHashTableEnumerate(&gHashTable, pref_ClearUserPref, nsnull);
gDirty = PR_TRUE;
return NS_OK;
}
nsresult PREF_LockPref(const char *key, bool lockit)
{
if (!gHashTable.ops)
return NS_ERROR_NOT_INITIALIZED;
PrefHashEntry* pref = pref_HashTableLookup(key);
if (!pref)
return NS_ERROR_UNEXPECTED;
if (lockit) {
if (!PREF_IS_LOCKED(pref))
{
pref->flags |= PREF_LOCKED;
gIsAnyPrefLocked = PR_TRUE;
pref_DoCallback(key);
}
}
else
{
if (PREF_IS_LOCKED(pref))
{
pref->flags &= ~PREF_LOCKED;
pref_DoCallback(key);
}
}
return NS_OK;
}
1998-03-28 02:44:41 +00:00
/*
* Hash table functions
*/
static bool pref_ValueChanged(PrefValue oldValue, PrefValue newValue, PrefType type)
{
bool changed = true;
if (type & PREF_STRING)
{
if (oldValue.stringVal && newValue.stringVal)
changed = (strcmp(oldValue.stringVal, newValue.stringVal) != 0);
}
else if (type & PREF_INT)
changed = oldValue.intVal != newValue.intVal;
else if (type & PREF_BOOL)
changed = oldValue.boolVal != newValue.boolVal;
return changed;
1998-03-28 02:44:41 +00:00
}
static void pref_SetValue(PrefValue* oldValue, PrefValue newValue, PrefType type)
{
switch (type & PREF_VALUETYPE_MASK)
{
case PREF_STRING:
PR_ASSERT(newValue.stringVal);
if (oldValue->stringVal)
PL_strfree(oldValue->stringVal);
oldValue->stringVal = newValue.stringVal ? PL_strdup(newValue.stringVal) : NULL;
break;
default:
*oldValue = newValue;
}
gDirty = PR_TRUE;
1998-03-28 02:44:41 +00:00
}
PrefHashEntry* pref_HashTableLookup(const void *key)
{
PrefHashEntry* result =
static_cast<PrefHashEntry*>(PL_DHashTableOperate(&gHashTable, key, PL_DHASH_LOOKUP));
if (PL_DHASH_ENTRY_IS_FREE(result))
return nsnull;
return result;
}
nsresult pref_HashPref(const char *key, PrefValue value, PrefType type, bool set_default)
1998-03-28 02:44:41 +00:00
{
if (!gHashTable.ops)
return NS_ERROR_OUT_OF_MEMORY;
PrefHashEntry* pref = static_cast<PrefHashEntry*>(PL_DHashTableOperate(&gHashTable, key, PL_DHASH_ADD));
if (!pref)
return NS_ERROR_OUT_OF_MEMORY;
// new entry, better intialize
if (!pref->key) {
// initialize the pref entry
pref->flags = type;
pref->key = ArenaStrDup(key, &gPrefNameArena);
memset(&pref->defaultPref, 0, sizeof(pref->defaultPref));
memset(&pref->userPref, 0, sizeof(pref->userPref));
1998-03-28 02:44:41 +00:00
}
else if ((((PrefType)(pref->flags)) & PREF_VALUETYPE_MASK) !=
(type & PREF_VALUETYPE_MASK))
{
NS_WARNING(nsPrintfCString(192, "Trying to set pref %s to with the wrong type!", key).get());
return NS_ERROR_UNEXPECTED;
1998-03-28 02:44:41 +00:00
}
bool valueChanged = false;
if (set_default)
{
if (!PREF_IS_LOCKED(pref))
{ /* ?? change of semantics? */
if (pref_ValueChanged(pref->defaultPref, value, type) ||
!(pref->flags & PREF_HAS_DEFAULT))
{
pref_SetValue(&pref->defaultPref, value, type);
pref->flags |= PREF_HAS_DEFAULT;
if (!PREF_HAS_USER_VALUE(pref))
valueChanged = PR_TRUE;
}
}
}
else
{
/* If new value is same as the default value, then un-set the user value.
Otherwise, set the user value only if it has changed */
if (!pref_ValueChanged(pref->defaultPref, value, type) &&
pref->flags & PREF_HAS_DEFAULT)
{
if (PREF_HAS_USER_VALUE(pref))
{
pref->flags &= ~PREF_USERSET;
if (!PREF_IS_LOCKED(pref))
valueChanged = PR_TRUE;
}
}
else if ( !PREF_HAS_USER_VALUE(pref) ||
pref_ValueChanged(pref->userPref, value, type) )
{
pref_SetValue(&pref->userPref, value, type);
pref->flags |= PREF_USERSET;
if (!PREF_IS_LOCKED(pref))
valueChanged = PR_TRUE;
}
}
1998-03-28 02:44:41 +00:00
nsresult rv = NS_OK;
if (valueChanged) {
gDirty = PR_TRUE;
nsresult rv2 = pref_DoCallback(key);
if (NS_FAILED(rv2))
rv = rv2;
1998-03-28 02:44:41 +00:00
}
return rv;
1998-03-28 02:44:41 +00:00
}
PrefType
1998-03-28 02:44:41 +00:00
PREF_GetPrefType(const char *pref_name)
{
if (gHashTable.ops)
{
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
if (pref)
{
if (pref->flags & PREF_STRING)
return PREF_STRING;
else if (pref->flags & PREF_INT)
return PREF_INT;
else if (pref->flags & PREF_BOOL)
return PREF_BOOL;
}
}
return PREF_INVALID;
1998-03-28 02:44:41 +00:00
}
/* -- */
bool
1998-03-28 02:44:41 +00:00
PREF_PrefIsLocked(const char *pref_name)
{
bool result = false;
if (gIsAnyPrefLocked && gHashTable.ops) {
PrefHashEntry* pref = pref_HashTableLookup(pref_name);
if (pref && PREF_IS_LOCKED(pref))
result = PR_TRUE;
}
return result;
1998-03-28 02:44:41 +00:00
}
/* Adds a node to the beginning of the callback list. */
void
1998-03-28 02:44:41 +00:00
PREF_RegisterCallback(const char *pref_node,
PrefChangedFunc callback,
void * instance_data)
1998-03-28 02:44:41 +00:00
{
NS_PRECONDITION(pref_node, "pref_node must not be nsnull");
NS_PRECONDITION(callback, "callback must not be nsnull");
struct CallbackNode* node = (struct CallbackNode*) malloc(sizeof(struct CallbackNode));
if (node)
{
node->domain = PL_strdup(pref_node);
node->func = callback;
node->data = instance_data;
node->next = gCallbacks;
gCallbacks = node;
}
return;
1998-03-28 02:44:41 +00:00
}
/* Removes |node| from gCallbacks list.
Returns the node after the deleted one. */
struct CallbackNode*
pref_RemoveCallbackNode(struct CallbackNode* node,
struct CallbackNode* prev_node)
{
NS_PRECONDITION(!prev_node || prev_node->next == node, "invalid params");
NS_PRECONDITION(prev_node || gCallbacks == node, "invalid params");
NS_ASSERTION(!gCallbacksInProgress,
"modifying the callback list while gCallbacksInProgress is PR_TRUE");
struct CallbackNode* next_node = node->next;
if (prev_node)
prev_node->next = next_node;
else
gCallbacks = next_node;
PL_strfree(node->domain);
free(node);
return next_node;
}
/* Deletes a node from the callback list or marks it for deletion. */
nsresult
1998-03-28 02:44:41 +00:00
PREF_UnregisterCallback(const char *pref_node,
PrefChangedFunc callback,
void * instance_data)
{
nsresult rv = NS_ERROR_FAILURE;
struct CallbackNode* node = gCallbacks;
struct CallbackNode* prev_node = NULL;
while (node != NULL)
{
if ( node->func == callback &&
node->data == instance_data &&
strcmp(node->domain, pref_node) == 0)
{
if (gCallbacksInProgress)
{
// postpone the node removal until after
// gCallbacks enumeration is finished.
node->func = nsnull;
gShouldCleanupDeadNodes = PR_TRUE;
prev_node = node;
node = node->next;
}
else
{
node = pref_RemoveCallbackNode(node, prev_node);
}
rv = NS_OK;
}
else
{
prev_node = node;
node = node->next;
}
}
return rv;
1998-03-28 02:44:41 +00:00
}
static nsresult pref_DoCallback(const char* changed_pref)
1998-03-28 02:44:41 +00:00
{
nsresult rv = NS_OK;
struct CallbackNode* node;
bool reentered = gCallbacksInProgress;
gCallbacksInProgress = PR_TRUE;
// Nodes must not be deleted while gCallbacksInProgress is PR_TRUE.
// Nodes that need to be deleted are marked for deletion by nulling
// out the |func| pointer. We release them at the end of this function
// if we haven't reentered.
for (node = gCallbacks; node != NULL; node = node->next)
{
if ( node->func &&
PL_strncmp(changed_pref,
node->domain,
PL_strlen(node->domain)) == 0 )
{
nsresult rv2 = (*node->func) (changed_pref, node->data);
if (NS_FAILED(rv2))
rv = rv2;
}
}
gCallbacksInProgress = reentered;
if (gShouldCleanupDeadNodes && !gCallbacksInProgress)
{
struct CallbackNode* prev_node = NULL;
node = gCallbacks;
while (node != NULL)
{
if (!node->func)
{
node = pref_RemoveCallbackNode(node, prev_node);
}
else
{
prev_node = node;
node = node->next;
}
}
gShouldCleanupDeadNodes = PR_FALSE;
}
return rv;
1998-03-28 02:44:41 +00:00
}
void PREF_ReaderCallback(void *closure,
const char *pref,
PrefValue value,
PrefType type,
bool isDefault)
{
pref_HashPref(pref, value, type, isDefault);
1998-03-28 02:44:41 +00:00
}