0N/A/*
2362N/A * Copyright (c) 2003, 2004, Oracle and/or its affiliates. All rights reserved.
0N/A *
0N/A * Redistribution and use in source and binary forms, with or without
0N/A * modification, are permitted provided that the following conditions
0N/A * are met:
0N/A *
0N/A * - Redistributions of source code must retain the above copyright
0N/A * notice, this list of conditions and the following disclaimer.
0N/A *
0N/A * - Redistributions in binary form must reproduce the above copyright
0N/A * notice, this list of conditions and the following disclaimer in the
0N/A * documentation and/or other materials provided with the distribution.
0N/A *
2362N/A * - Neither the name of Oracle nor the names of its
0N/A * contributors may be used to endorse or promote products derived
0N/A * from this software without specific prior written permission.
0N/A *
0N/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
0N/A * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
0N/A * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
0N/A * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
0N/A * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
0N/A * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
0N/A * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
0N/A * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
0N/A * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
0N/A * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
0N/A * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
0N/A */
0N/A
4378N/A/*
4378N/A * This source code is provided to illustrate the usage of a given feature
4378N/A * or technique and has been deliberately simplified. Additional steps
4378N/A * required for a production-quality application, such as security checks,
4378N/A * input validation and proper error handling, might not be present in
4378N/A * this sample code.
4378N/A */
4378N/A
4378N/A
0N/A/* Table of byte arrays (e.g. char* string + NULL byte) */
0N/A
0N/A/*
0N/A * Strings are unique by their own contents, since the string itself
0N/A * is the Key, and the hprof_table.c guarantees that keys don't move,
0N/A * this works out perfect. Any key in this table can be used as
0N/A * an char*.
0N/A *
0N/A * This does mean that this table has dynamically sized keys.
0N/A *
0N/A * Care needs to be taken to make sure the NULL byte is included, not for
0N/A * the sake of hprof_table.c, but so that the key can be used as a char*.
0N/A *
0N/A */
0N/A
0N/A#include "hprof.h"
0N/A
0N/Avoid
0N/Astring_init(void)
0N/A{
0N/A HPROF_ASSERT(gdata->string_table==NULL);
0N/A gdata->string_table = table_initialize("Strings", 4096, 4096, 1024, 0);
0N/A}
0N/A
0N/AStringIndex
0N/Astring_find_or_create(const char *str)
0N/A{
0N/A return table_find_or_create_entry(gdata->string_table,
0N/A (void*)str, (int)strlen(str)+1, NULL, NULL);
0N/A}
0N/A
0N/Astatic void
0N/Alist_item(TableIndex index, void *str, int len, void *info_ptr, void *arg)
0N/A{
0N/A debug_message( "0x%08x: String \"%s\"\n", index, (const char *)str);
0N/A}
0N/A
0N/Avoid
0N/Astring_list(void)
0N/A{
0N/A debug_message(
0N/A "-------------------- String Table ------------------------\n");
0N/A table_walk_items(gdata->string_table, &list_item, NULL);
0N/A debug_message(
0N/A "----------------------------------------------------------\n");
0N/A}
0N/A
0N/Avoid
0N/Astring_cleanup(void)
0N/A{
0N/A table_cleanup(gdata->string_table, NULL, NULL);
0N/A gdata->string_table = NULL;
0N/A}
0N/A
0N/Achar *
0N/Astring_get(StringIndex index)
0N/A{
0N/A void *key;
0N/A int key_len;
0N/A
0N/A table_get_key(gdata->string_table, index, &key, &key_len);
0N/A HPROF_ASSERT(key_len>0);
0N/A return (char*)key;
0N/A}
0N/A
0N/Aint
0N/Astring_get_len(StringIndex index)
0N/A{
0N/A void *key;
0N/A int key_len;
0N/A
0N/A table_get_key(gdata->string_table, index, &key, &key_len);
0N/A HPROF_ASSERT(key_len>0);
0N/A return key_len-1;
0N/A}