Edit

kc3-lang/libxkbcommon/src/atom.c

Branch :

  • Show log

    Commit

  • Author : Ran Benita
    Date : 2012-05-30 15:55:21
    Hash : 57f184e2
    Message : darray: tweak parameters a bit for better memory usage Here are some quick numbers from valgrind, running rulescomp only with a simple, common "us,de" rule set: before darray: cb047bb total heap usage: 44,924 allocs, 44,924 frees, 3,162,342 bytes allocated after darray: c87468e total heap usage: 52,670 allocs, 52,670 frees, 2,844,517 bytes allocated tweaking specific inital allocation sizes: total heap usage: 52,652 allocs, 52,652 frees, 2,841,814 bytes allocated changing initial alloc = 2 globally total heap usage: 47,802 allocs, 47,802 frees, 2,833,614 bytes allocated changing initial alloc = 3 globally total heap usage: 47,346 allocs, 47,346 frees, 3,307,110 bytes allocated changing initial alloc = 4 globally total heap usage: 44,643 allocs, 44,643 frees, 2,853,646 bytes allocated [ Changing the geometric progression constant from 2 only made things worse. I tried the golden ratio - not so golden :) ] The last one is obviously the best, so it was chosen, with the specific tweaks thrown in as well (these were there before but don't make much difference). Overall it seems to do better than the previous manual allocations which is a bit surprising. Signed-off-by: Ran Benita <ran234@gmail.com>

  • src/atom.c
  • /***********************************************************
    Copyright 1987, 1998  The Open Group
    
    Permission to use, copy, modify, distribute, and sell this software and its
    documentation for any purpose is hereby granted without fee, provided that
    the above copyright notice appear in all copies and that both that
    copyright notice and this permission notice appear in supporting
    documentation.
    
    The above copyright notice and this permission notice shall be included in
    all copies or substantial portions of the Software.
    
    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
    OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
    AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
    CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
    
    Except as contained in this notice, the name of The Open Group shall not be
    used in advertising or otherwise to promote the sale, use or other dealings
    in this Software without prior written authorization from The Open Group.
    
    
    Copyright 1987 by Digital Equipment Corporation, Maynard, Massachusetts.
    
                            All Rights Reserved
    
    Permission to use, copy, modify, and distribute this software and its
    documentation for any purpose and without fee is hereby granted,
    provided that the above copyright notice appear in all copies and that
    both that copyright notice and this permission notice appear in
    supporting documentation, and that the name of Digital not be
    used in advertising or publicity pertaining to distribution of the
    software without specific, written prior permission.
    
    DIGITAL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
    ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL
    DIGITAL BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR
    ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
    WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
    ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
    SOFTWARE.
    
    ******************************************************************/
    
    /************************************************************
     Copyright 1994 by Silicon Graphics Computer Systems, Inc.
    
     Permission to use, copy, modify, and distribute this
     software and its documentation for any purpose and without
     fee is hereby granted, provided that the above copyright
     notice appear in all copies and that both that copyright
     notice and this permission notice appear in supporting
     documentation, and that the name of Silicon Graphics not be
     used in advertising or publicity pertaining to distribution
     of the software without specific prior written permission.
     Silicon Graphics makes no representation about the suitability
     of this software for any purpose. It is provided "as is"
     without any express or implied warranty.
    
     SILICON GRAPHICS DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
     SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
     AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL SILICON
     GRAPHICS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
     DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
     DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
     OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION  WITH
     THE USE OR PERFORMANCE OF THIS SOFTWARE.
    
     ********************************************************/
    
    #include "atom.h"
    
    struct atom_node {
        struct atom_node *left, *right;
        uint32_t a;
        unsigned int fingerprint;
        char *string;
    };
    
    struct atom_table {
        struct atom_node *root;
        darray(struct atom_node *) table;
    };
    
    struct atom_table *
    atom_table_new(void)
    {
        struct atom_table *table;
    
        table = calloc(1, sizeof(*table));
        if (!table)
            return NULL;
    
        darray_init(table->table);
        darray_growalloc(table->table, 100);
        darray_append(table->table, NULL);
    
        return table;
    }
    
    static void
    free_atom(struct atom_node *patom)
    {
        if (!patom)
            return;
    
        free_atom(patom->left);
        free_atom(patom->right);
        free(patom->string);
        free(patom);
    }
    
    void
    atom_table_free(struct atom_table *table)
    {
        if (!table)
            return;
    
        free_atom(table->root);
        darray_free(table->table);
        free(table);
    }
    
    const char *
    atom_text(struct atom_table *table, xkb_atom_t atom)
    {
        if (atom >= darray_size(table->table) ||
            darray_item(table->table, atom) == NULL)
            return NULL;
    
        return darray_item(table->table, atom)->string;
    }
    
    char *
    atom_strdup(struct atom_table *table, xkb_atom_t atom)
    {
        const char *ret = atom_text(table, atom);
        return ret ? strdup(ret) : NULL;
    }
    
    xkb_atom_t
    atom_intern(struct atom_table *table, const char *string)
    {
        struct atom_node **np;
        struct atom_node *nd;
        unsigned i;
        int comp;
        unsigned int fp = 0;
        size_t len;
    
        if (!string)
            return XKB_ATOM_NONE;
    
        len = strlen(string);
        np = &table->root;
        for (i = 0; i < (len + 1) / 2; i++) {
            fp = fp * 27 + string[i];
            fp = fp * 27 + string[len - 1 - i];
        }
    
        while (*np) {
            if (fp < (*np)->fingerprint)
                np = &((*np)->left);
            else if (fp > (*np)->fingerprint)
                np = &((*np)->right);
            else {
                /* now start testing the strings */
                comp = strncmp(string, (*np)->string, len);
                if ((comp < 0) || ((comp == 0) && (len < strlen((*np)->string))))
                    np = &((*np)->left);
                else if (comp > 0)
                    np = &((*np)->right);
                else
                    return(*np)->a;
                }
        }
    
        nd = malloc(sizeof(*nd));
        if (!nd)
            return XKB_ATOM_NONE;
    
        nd->string = malloc(len + 1);
        if (!nd->string) {
            free(nd);
            return XKB_ATOM_NONE;
        }
        strncpy(nd->string, string, len);
        nd->string[len] = 0;
    
        *np = nd;
        nd->left = nd->right = NULL;
        nd->fingerprint = fp;
        nd->a = darray_size(table->table);
        darray_append(table->table, nd);
    
        return nd->a;
    }