idl_shim.c 5.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166
  1. /** BEGIN COPYRIGHT BLOCK
  2. * This Program is free software; you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation; version 2 of the License.
  5. *
  6. * This Program is distributed in the hope that it will be useful, but WITHOUT
  7. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  8. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  9. *
  10. * You should have received a copy of the GNU General Public License along with
  11. * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
  12. * Place, Suite 330, Boston, MA 02111-1307 USA.
  13. *
  14. * In addition, as a special exception, Red Hat, Inc. gives You the additional
  15. * right to link the code of this Program with code not covered under the GNU
  16. * General Public License ("Non-GPL Code") and to distribute linked combinations
  17. * including the two, subject to the limitations in this paragraph. Non-GPL Code
  18. * permitted under this exception must only link to the code of this Program
  19. * through those well defined interfaces identified in the file named EXCEPTION
  20. * found in the source code files (the "Approved Interfaces"). The files of
  21. * Non-GPL Code may instantiate templates or use macros or inline functions from
  22. * the Approved Interfaces without causing the resulting work to be covered by
  23. * the GNU General Public License. Only Red Hat, Inc. may make changes or
  24. * additions to the list of Approved Interfaces. You must obey the GNU General
  25. * Public License in all respects for all of the Program code and other code used
  26. * in conjunction with the Program except the Non-GPL Code covered by this
  27. * exception. If you modify this file, you may extend this exception to your
  28. * version of the file, but you are not obligated to do so. If you do not wish to
  29. * provide this exception without modification, you must delete this exception
  30. * statement from your version and license this file solely under the GPL without
  31. * exception.
  32. *
  33. *
  34. * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
  35. * Copyright (C) 2005 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /* Shim which forwards IDL calls to the appropriate implementation */
  42. #include "back-ldbm.h"
  43. static int idl_new = 0; /* non-zero if we're doing new IDL style */
  44. void idl_old_set_tune(int val);
  45. int idl_old_get_tune();
  46. int idl_old_init_private(backend *be, struct attrinfo *a);
  47. int idl_old_release_private(struct attrinfo *a);
  48. size_t idl_old_get_allidslimit(struct attrinfo *a);
  49. IDList * idl_old_fetch( backend *be, DB* db, DBT *key, DB_TXN *txn, struct attrinfo *a, int *err );
  50. int idl_old_insert_key( backend *be, DB* db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a,int *disposition );
  51. int idl_old_delete_key( backend *be, DB *db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a );
  52. int idl_old_store_block( backend *be,DB *db,DBT *key,IDList *idl,DB_TXN *txn,struct attrinfo *a);
  53. void idl_new_set_tune(int val);
  54. int idl_new_get_tune();
  55. int idl_new_init_private(backend *be, struct attrinfo *a);
  56. int idl_new_release_private(struct attrinfo *a);
  57. size_t idl_new_get_allidslimit(struct attrinfo *a, int allidslimit);
  58. IDList * idl_new_fetch( backend *be, DB* db, DBT *key, DB_TXN *txn, struct attrinfo *a, int *err, int allidslimit );
  59. int idl_new_insert_key( backend *be, DB* db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a,int *disposition );
  60. int idl_new_delete_key( backend *be, DB *db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a );
  61. int idl_new_store_block( backend *be,DB *db,DBT *key,IDList *idl,DB_TXN *txn,struct attrinfo *a);
  62. int idl_get_idl_new()
  63. {
  64. return idl_new;
  65. }
  66. void idl_set_tune(int val)
  67. {
  68. /* Catch idl_tune requests to use new idl code */
  69. if (4096 == val) {
  70. idl_new = 1;
  71. } else {
  72. idl_new = 0;
  73. }
  74. if (idl_new) {
  75. idl_new_set_tune(val);
  76. } else {
  77. idl_old_set_tune(val);
  78. }
  79. }
  80. int idl_get_tune()
  81. {
  82. if (idl_new) {
  83. return idl_new_get_tune();
  84. } else {
  85. return idl_old_get_tune();
  86. }
  87. }
  88. int idl_init_private(backend *be, struct attrinfo *a)
  89. {
  90. if (idl_new) {
  91. return idl_new_init_private(be,a);
  92. } else {
  93. return idl_old_init_private(be,a);
  94. }
  95. }
  96. int idl_release_private(struct attrinfo *a)
  97. {
  98. if (idl_new) {
  99. return idl_new_release_private(a);
  100. } else {
  101. return idl_old_release_private(a);
  102. }
  103. }
  104. size_t idl_get_allidslimit(struct attrinfo *a, int allidslimit)
  105. {
  106. if (idl_new) {
  107. return idl_new_get_allidslimit(a, allidslimit);
  108. } else {
  109. return idl_old_get_allidslimit(a);
  110. }
  111. }
  112. IDList * idl_fetch_ext( backend *be, DB* db, DBT *key, DB_TXN *txn, struct attrinfo *a, int *err, int allidslimit )
  113. {
  114. if (idl_new) {
  115. return idl_new_fetch(be,db,key,txn,a,err,allidslimit);
  116. } else {
  117. return idl_old_fetch(be,db,key,txn,a,err);
  118. }
  119. }
  120. IDList * idl_fetch( backend *be, DB* db, DBT *key, DB_TXN *txn, struct attrinfo *a, int *err )
  121. {
  122. return idl_fetch_ext(be, db, key, txn, a, err, 0);
  123. }
  124. int idl_insert_key( backend *be, DB* db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a,int *disposition )
  125. {
  126. if (idl_new) {
  127. return idl_new_insert_key(be,db,key,id,txn,a,disposition);
  128. } else {
  129. return idl_old_insert_key(be,db,key,id,txn,a,disposition);
  130. }
  131. }
  132. int idl_delete_key(backend *be, DB *db, DBT *key, ID id, DB_TXN *txn, struct attrinfo *a )
  133. {
  134. if (idl_new) {
  135. return idl_new_delete_key(be,db,key,id,txn,a);
  136. } else {
  137. return idl_old_delete_key(be,db,key,id,txn,a);
  138. }
  139. }
  140. int idl_store_block(backend *be,DB *db,DBT *key,IDList *idl,DB_TXN *txn,struct attrinfo *a)
  141. {
  142. if (idl_new) {
  143. return idl_new_store_block(be,db,key,idl,txn,a);
  144. } else {
  145. return idl_old_store_block(be,db,key,idl,txn,a);
  146. }
  147. }