aboutsummaryrefslogtreecommitdiff
path: root/src/datastore
diff options
context:
space:
mode:
authorWillow Liquorice <willow@howhill.com>2022-08-28 17:17:06 +0100
committerMartin Schanzenbach <schanzen@gnunet.org>2022-08-30 09:42:14 +0200
commit2c1409aaf76938f30dc526c4d2f0c6142aba8120 (patch)
treef69d5ae9a4572b148730bffe1122ece7bd75a518 /src/datastore
parent1824ffe4572eabd9aded862457c2b99f7f94670f (diff)
downloadgnunet-2c1409aaf76938f30dc526c4d2f0c6142aba8120.tar.gz
gnunet-2c1409aaf76938f30dc526c4d2f0c6142aba8120.zip
-DOC: Second pass through DATASTORE
Diffstat (limited to 'src/datastore')
-rw-r--r--src/datastore/datastore_api.c61
1 files changed, 0 insertions, 61 deletions
diff --git a/src/datastore/datastore_api.c b/src/datastore/datastore_api.c
index 4e42726e8..4b4a76eea 100644
--- a/src/datastore/datastore_api.c
+++ b/src/datastore/datastore_api.c
@@ -941,31 +941,6 @@ drop_status_cont (void *cls,
941} 941}
942 942
943 943
944/**
945 * Store an item in the datastore. If the item is already present,
946 * the priorities are summed up and the higher expiration time and
947 * lower anonymity level is used.
948 *
949 * @param h handle to the datastore
950 * @param rid reservation ID to use (from "reserve"); use 0 if no
951 * prior reservation was made
952 * @param key key for the value
953 * @param size number of bytes in data
954 * @param data content stored
955 * @param type type of the content
956 * @param priority priority of the content
957 * @param anonymity anonymity-level for the content
958 * @param replication how often should the content be replicated to other peers?
959 * @param expiration expiration time for the content
960 * @param queue_priority ranking of this request in the priority queue
961 * @param max_queue_size at what queue size should this request be dropped
962 * (if other requests of higher priority are in the queue)
963 * @param cont continuation to call when done
964 * @param cont_cls closure for @a cont
965 * @return NULL if the entry was not queued, otherwise a handle that can be used to
966 * cancel; note that even if NULL is returned, the callback will be invoked
967 * (or rather, will already have been invoked)
968 */
969struct GNUNET_DATASTORE_QueueEntry * 944struct GNUNET_DATASTORE_QueueEntry *
970GNUNET_DATASTORE_put (struct GNUNET_DATASTORE_Handle *h, 945GNUNET_DATASTORE_put (struct GNUNET_DATASTORE_Handle *h,
971 uint32_t rid, 946 uint32_t rid,
@@ -1142,26 +1117,6 @@ GNUNET_DATASTORE_release_reserve (struct GNUNET_DATASTORE_Handle *h,
1142} 1117}
1143 1118
1144 1119
1145/**
1146 * Explicitly remove some content from the database.
1147 * The @a cont continuation will be called with `status`
1148 * #GNUNET_OK" if content was removed, #GNUNET_NO
1149 * if no matching entry was found and #GNUNET_SYSERR
1150 * on all other types of errors.
1151 *
1152 * @param h handle to the datastore
1153 * @param key key for the value
1154 * @param size number of bytes in data
1155 * @param data content stored
1156 * @param queue_priority ranking of this request in the priority queue
1157 * @param max_queue_size at what queue size should this request be dropped
1158 * (if other requests of higher priority are in the queue)
1159 * @param cont continuation to call when done
1160 * @param cont_cls closure for @a cont
1161 * @return NULL if the entry was not queued, otherwise a handle that can be used to
1162 * cancel; note that even if NULL is returned, the callback will be invoked
1163 * (or rather, will already have been invoked)
1164 */
1165struct GNUNET_DATASTORE_QueueEntry * 1120struct GNUNET_DATASTORE_QueueEntry *
1166GNUNET_DATASTORE_remove (struct GNUNET_DATASTORE_Handle *h, 1121GNUNET_DATASTORE_remove (struct GNUNET_DATASTORE_Handle *h,
1167 const struct GNUNET_HashCode *key, 1122 const struct GNUNET_HashCode *key,
@@ -1279,22 +1234,6 @@ GNUNET_DATASTORE_get_for_replication (struct GNUNET_DATASTORE_Handle *h,
1279} 1234}
1280 1235
1281 1236
1282/**
1283 * Get a single zero-anonymity value from the datastore.
1284 *
1285 * @param h handle to the datastore
1286 * @param next_uid return the result with lowest uid >= next_uid
1287 * @param queue_priority ranking of this request in the priority queue
1288 * @param max_queue_size at what queue size should this request be dropped
1289 * (if other requests of higher priority are in the queue)
1290 * @param type allowed type for the operation (never zero)
1291 * @param proc function to call on a random value; it
1292 * will be called once with a value (if available)
1293 * or with NULL if none value exists.
1294 * @param proc_cls closure for @a proc
1295 * @return NULL if the entry was not queued, otherwise a handle that can be used to
1296 * cancel
1297 */
1298struct GNUNET_DATASTORE_QueueEntry * 1237struct GNUNET_DATASTORE_QueueEntry *
1299GNUNET_DATASTORE_get_zero_anonymity (struct GNUNET_DATASTORE_Handle *h, 1238GNUNET_DATASTORE_get_zero_anonymity (struct GNUNET_DATASTORE_Handle *h,
1300 uint64_t next_uid, 1239 uint64_t next_uid,