QPID-5257 - Removed dispatch code from its old location

git-svn-id: https://svn.apache.org/repos/asf/qpid/trunk@1535460 13f79535-47bb-0310-9956-ffa450edef68

1 files changed, 0 insertions, 285 deletions

diff --git a/qpid/extras/dispatch/src/hash.c b/qpid/extras/dispatch/src/hash.c
deleted file mode 100644
index 0cb32acd05..0000000000
--- a/qpid/extras/dispatch/src/hash.c
+++ /dev/null
@@ -1,285 +0,0 @@
-/*
- * Licensed to the Apache Software Foundation (ASF) under one
- * or more contributor license agreements.  See the NOTICE file
- * distributed with this work for additional information
- * regarding copyright ownership.  The ASF licenses this file
- * to you under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing,
- * software distributed under the License is distributed on an
- * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
- * KIND, either express or implied.  See the License for the
- * specific language governing permissions and limitations
- * under the License.
- */
-
-#include <qpid/dispatch/hash.h>
-#include <qpid/dispatch/ctools.h>
-#include <qpid/dispatch/alloc.h>
-#include <stdio.h>
-#include <string.h>
-
-typedef struct dx_hash_item_t {
-    DEQ_LINKS(struct dx_hash_item_t);
-    unsigned char *key;
-    union {
-        void       *val;
-        const void *val_const;
-    } v;
-} dx_hash_item_t;
-
-ALLOC_DECLARE(dx_hash_item_t);
-ALLOC_DEFINE(dx_hash_item_t);
-DEQ_DECLARE(dx_hash_item_t, items_t);
-
-
-typedef struct bucket_t {
-    items_t items;
-} bucket_t;
-
-
-struct dx_hash_t {
-    bucket_t     *buckets;
-    unsigned int  bucket_count;
-    unsigned int  bucket_mask;
-    int           batch_size;
-    size_t        size;
-    int           is_const;
-};
-
-
-struct dx_hash_handle_t {
-    bucket_t    *bucket;
-    dx_hash_item_t *item;
-};
-
-ALLOC_DECLARE(dx_hash_handle_t);
-ALLOC_DEFINE(dx_hash_handle_t);
-
-
-// djb2 hash algorithm
-static unsigned long dx_hash_function(dx_field_iterator_t *iter)
-{
-    unsigned long hash = 5381;
-    int c;
-
-    dx_field_iterator_reset(iter);
-    while (!dx_field_iterator_end(iter)) {
-        c = (int) dx_field_iterator_octet(iter);
-        hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
-    }
-
-    return hash;
-}
-
-
-dx_hash_t *dx_hash(int bucket_exponent, int batch_size, int value_is_const)
-{
-    int i;
-    dx_hash_t *h = NEW(dx_hash_t);
-
-    if (!h)
-        return 0;
-
-    h->bucket_count = 1 << bucket_exponent;
-    h->bucket_mask  = h->bucket_count - 1;
-    h->batch_size   = batch_size;
-    h->size         = 0;
-    h->is_const     = value_is_const;
-    h->buckets = NEW_ARRAY(bucket_t, h->bucket_count);
-    for (i = 0; i < h->bucket_count; i++) {
-        DEQ_INIT(h->buckets[i].items);
-    }
-
-    return h;
-}
-
-
-void dx_hash_free(dx_hash_t *h)
-{
-    // TODO - Implement this
-}
-
-
-size_t dx_hash_size(dx_hash_t *h)
-{
-    return h ? h->size : 0;
-}
-
-
-static dx_hash_item_t *dx_hash_internal_insert(dx_hash_t *h, dx_field_iterator_t *key, int *exists, dx_hash_handle_t **handle)
-{
-    unsigned long   idx  = dx_hash_function(key) & h->bucket_mask;
-    dx_hash_item_t *item = DEQ_HEAD(h->buckets[idx].items);
-
-    while (item) {
-        if (dx_field_iterator_equal(key, item->key))
-            break;
-        item = item->next;
-    }
-
-    if (item) {
-        *exists = 1;
-        if (handle)
-            *handle = 0;
-        return item;
-    }
-
-    item = new_dx_hash_item_t();
-    if (!item)
-        return 0;
-
-    DEQ_ITEM_INIT(item);
-    item->key = dx_field_iterator_copy(key);
-
-    DEQ_INSERT_TAIL(h->buckets[idx].items, item);
-    h->size++;
-    *exists = 0;
-
-    //
-    // If a pointer to a handle-pointer was supplied, create a handle for this item.
-    //
-    if (handle) {
-        *handle = new_dx_hash_handle_t();
-        (*handle)->bucket = &h->buckets[idx];
-        (*handle)->item   = item;
-    }
-
-    return item;
-}
-
-
-dx_error_t dx_hash_insert(dx_hash_t *h, dx_field_iterator_t *key, void *val, dx_hash_handle_t **handle)
-{
-    int             exists = 0;
-    dx_hash_item_t *item   = dx_hash_internal_insert(h, key, &exists, handle);
-
-    if (!item)
-        return DX_ERROR_ALLOC;
-
-    if (exists)
-        return DX_ERROR_ALREADY_EXISTS;
-
-    item->v.val = val;
-
-    return DX_ERROR_NONE;
-}
-
-
-dx_error_t dx_hash_insert_const(dx_hash_t *h, dx_field_iterator_t *key, const void *val, dx_hash_handle_t **handle)
-{
-    assert(h->is_const);
-
-    int             error = 0;
-    dx_hash_item_t *item  = dx_hash_internal_insert(h, key, &error, handle);
-
-    if (item)
-        item->v.val_const = val;
-    return error;
-}
-
-
-static dx_hash_item_t *dx_hash_internal_retrieve(dx_hash_t *h, dx_field_iterator_t *key)
-{
-    unsigned long   idx  = dx_hash_function(key) & h->bucket_mask;
-    dx_hash_item_t *item = DEQ_HEAD(h->buckets[idx].items);
-
-    while (item) {
-        if (dx_field_iterator_equal(key, item->key))
-            break;
-        item = item->next;
-    }
-
-    return item;
-}
-
-
-dx_error_t dx_hash_retrieve(dx_hash_t *h, dx_field_iterator_t *key, void **val)
-{
-    dx_hash_item_t *item = dx_hash_internal_retrieve(h, key);
-    if (item)
-        *val = item->v.val;
-    else
-        *val = 0;
-
-    return DX_ERROR_NONE;
-}
-
-
-dx_error_t dx_hash_retrieve_const(dx_hash_t *h, dx_field_iterator_t *key, const void **val)
-{
-    assert(h->is_const);
-
-    dx_hash_item_t *item = dx_hash_internal_retrieve(h, key);
-    if (item)
-        *val = item->v.val_const;
-    else
-        *val = 0;
-
-    return DX_ERROR_NONE;
-}
-
-
-dx_error_t dx_hash_remove(dx_hash_t *h, dx_field_iterator_t *key)
-{
-    unsigned long   idx  = dx_hash_function(key) & h->bucket_mask;
-    dx_hash_item_t *item = DEQ_HEAD(h->buckets[idx].items);
-
-    while (item) {
-        if (dx_field_iterator_equal(key, item->key))
-            break;
-        item = item->next;
-    }
-
-    if (item) {
-        free(item->key);
-        DEQ_REMOVE(h->buckets[idx].items, item);
-        free_dx_hash_item_t(item);
-        h->size--;
-        return DX_ERROR_NONE;
-    }
-
-    return DX_ERROR_NOT_FOUND;
-}
-
-
-void dx_hash_handle_free(dx_hash_handle_t *handle)
-{
-    if (handle)
-        free_dx_hash_handle_t(handle);
-}
-
-
-const unsigned char *dx_hash_key_by_handle(const dx_hash_handle_t *handle)
-{
-    if (handle)
-        return handle->item->key;
-    return 0;
-}
-
-
-dx_error_t dx_hash_remove_by_handle(dx_hash_t *h, dx_hash_handle_t *handle)
-{
-    unsigned char *key   = 0;
-    dx_error_t     error = dx_hash_remove_by_handle2(h, handle, &key);
-    if (key)
-        free(key);
-    return error;
-}
-
-
-dx_error_t dx_hash_remove_by_handle2(dx_hash_t *h, dx_hash_handle_t *handle, unsigned char **key)
-{
-    if (!handle)
-        return DX_ERROR_NOT_FOUND;
-    *key = handle->item->key;
-    DEQ_REMOVE(handle->bucket->items, handle->item);
-    free_dx_hash_item_t(handle->item);
-    h->size--;
-    return DX_ERROR_NONE;
-}
-