Line data    Source code

       1             : /*
       2             :  * SPDX-License-Identifier: MPL-2.0
       3             :  *
       4             :  * This Source Code Form is subject to the terms of the Mozilla Public
       5             :  * License, v. 2.0.  If a copy of the MPL was not distributed with this
       6             :  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
       7             :  *
       8             :  * Copyright 2024 MonetDB Foundation;
       9             :  * Copyright August 2008 - 2023 MonetDB B.V.;
      10             :  * Copyright 1997 - July 2008 CWI.
      11             :  */
      12             : 
      13             : #include "monetdb_config.h"
      14             : #include "sql_catalog.h"
      15             : #include "sql_storage.h"
      16             : 
      17             : #include "gdk_atoms.h"
      18             : 
      19             : static inline int
      20        1173 : node_key( node *n )
      21             : {
      22        1173 :         sql_base *b = n->data;
      23           0 :         return hash_key(b->name);
      24             : }
      25             : 
      26             : objlist *
      27      370328 : ol_new(allocator *sa, destroy_fptr destroy, sql_store store)
      28             : {
      29      370328 :         objlist *ol = SA_NEW(sa, objlist);
      30      740656 :         *ol = (objlist) {
      31      370328 :                 .l = list_new(sa, (fdestroy)destroy),
      32      370328 :                 .h = hash_new(sa, 16, (fkeyvalue)&node_key),
      33             :                 .store = store
      34             :         };
      35      370328 :         return ol;
      36             : }
      37             : 
      38             : void
      39      223380 : ol_destroy(objlist *ol, sql_store store)
      40             : {
      41      223380 :         if (!ol->l->sa) {
      42      223380 :                 hash_destroy(ol->h);
      43      223380 :                 list_destroy2(ol->l, store);
      44      223380 :                 _DELETE(ol);
      45             :         }
      46      223380 : }
      47             : 
      48             : int
      49      767987 : ol_add(objlist *ol, sql_base *data)
      50             : {
      51      767987 :         list *l = list_append(ol->l, data);
      52      767987 :         if (!l) {
      53           0 :                 if (ol->l->destroy)
      54           0 :                         ol->l->destroy(ol->store, data);
      55           0 :                 return -1;
      56             :         }
      57      767987 :         node *n = l->t;
      58      767987 :         assert(n->data == data);
      59      767987 :         int sz = list_length(ol->l);
      60      767987 :         if (ol->h->size <= sz) {
      61        6953 :                 hash_destroy(ol->h);
      62        6953 :                 ol->h = hash_new(ol->l->sa, 4*sz, (fkeyvalue)&node_key);
      63        6953 :                 if (ol->h == NULL)
      64             :                         return -1;
      65      188329 :                 for (node *n = ol->l->h; n; n = n->next) {
      66      181376 :                         if (hash_add(ol->h, base_key(n->data), n) == NULL)
      67             :                                 /* No need to clean, ie expect a full transaction rollback */
      68             :                                 return -1;
      69             :                 }
      70             :         } else {
      71      761034 :                 if (hash_add(ol->h, base_key(data), n) == NULL)
      72             :                         /* No need to clean, ie expect a full transaction rollback */
      73             :                         return -1;
      74             :         }
      75             :         return 0;
      76             : }
      77             : 
      78             : void
      79        1160 : ol_del(objlist *ol, sql_store store, node *n)
      80             : {
      81        2320 :         hash_del(ol->h, node_key(n), n);
      82        1160 :         list_remove_node(ol->l, store, n);
      83        1160 : }
      84             : 
      85             : node *
      86          13 : ol_rehash(objlist *ol, const char *oldname, node *n)
      87             : {
      88          26 :         hash_del(ol->h, hash_key(oldname), n);
      89          26 :         if (hash_add(ol->h, node_key(n), n) == NULL)
      90           0 :                 return NULL;
      91             :         return n;
      92             : }
      93             : 
      94             : node *
      95    13738250 : ol_find_name(objlist *ol, const char *name)
      96             : {
      97    13738250 :         int key = hash_key(name);
      98    13738250 :         sql_hash_e *he = ol->h->buckets[key&(ol->h->size-1)];
      99             : 
     100    15907834 :         for (; he; he = he->chain) {
     101    12411231 :                 node *n = he->value;
     102    12411231 :                 sql_base *b = n->data;
     103             : 
     104    12411231 :                 if (b->name && strcmp(b->name, name) == 0)
     105    10241647 :                         return n;
     106             :         }
     107             :         return NULL;
     108             : }
     109             : 
     110       36964 : node *ol_find_id(objlist *ol, sqlid id)
     111             : {
     112             :         /* if needed we could add hash on id's as well */
     113     1371070 :         for (node *n = ol->l->h; n; n = n->next) {
     114     1370972 :                 sql_base *b = n->data;
     115     1370972 :                 if (b->id == id)
     116       36866 :                         return n;
     117             :         }
     118             :         return NULL;
     119             : }