/usr/include/vanessa_adt.h is in libvanessa-adt-dev 0.0.9-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 | /***********************************************************************
* vanessa_adt.h December 1999
* Simon Horman horms@verge.net.au
*
* Abstract data types
*
* vanessa_adt
* Library of Abstract Data Types
* Copyright (C) 1999-2008 Simon Horman <horms@verge.net.au>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation; either version 2 of
* the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
* 02111-1307 USA
*
**********************************************************************/
#ifndef _VANESSA_ADT_H
#define _VANESSA_ADT_H
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include <syslog.h>
#include <sys/types.h>
#include <vanessa_logger.h>
typedef unsigned int vanessa_adt_flag_t;
/**********************************************************************
* Data independent queue
**********************************************************************/
typedef struct vanessa_queue_member_t_struct vanessa_queue_member_t;
typedef struct vanessa_queue_t_struct vanessa_queue_t;
/**********************************************************************
* vanessa_queue_create
* Create a new, empty vanessa_queue
* pre: e_destroy: pointer to a function to destroy elements of the queue
* If null, then elements will not be freed on calls
* to vanessa_queue_destroy or on errors
* post: memory is allocated for queue and values are initialised
* return: new, empty vanessa_queue
* NULL on error
**********************************************************************/
vanessa_queue_t *vanessa_queue_create(void (*e_destroy) (const void *));
/**********************************************************************
* vanessa_queue_push
* push an element onto the beginning of a vanessa_queue
* pre: q: vanessa_queue
* value: element to push onto the vanessa_queue
* post: element is added to queue
* return: vanessa_queue with element added
* NULL on error. On error, where possible the vanessa_queue is
* destroyed.
**********************************************************************/
vanessa_queue_t *vanessa_queue_push(vanessa_queue_t * q, void *value);
/**********************************************************************
* vanessa_queue_pop
* Pop an element off the end of a vanessa_queue
* pre: q: vanessa_queue to pop the element off
* value: element removed from the vanessa_queue is assigned to
* *value
* post: element is removed from queue
* return: vanessa_queue with element removed
* Note: popping an empty vanessa_queue results in NULL being returned
**********************************************************************/
vanessa_queue_t *vanessa_queue_pop(vanessa_queue_t * q, void **value);
/**********************************************************************
* vanessa_queue_peek_last
* Retrieve the last element from a vanessa_queue without removing it
* from the vanessa_queue
* pre: q: vanessa_queue to peek at
* value: element removed from the vanessa_queue is assigned to
* *value
* post: none
* return: pointer to an element from the vanessa_queue
* Note: peeking at an empty vanessa_queue results in NULL being returned
* value may be NULL
**********************************************************************/
void *vanessa_queue_peek_last(const vanessa_queue_t * q);
#define vanessa_queue_peek vanessa_queue_peek_last
/**********************************************************************
* vanessa_queue_peek_first
* Retrieve the first element from a vanessa_queue without removing it
* from the * vanessa_queue
* pre: q: vanessa_queue to peek at
* value: element removed from the vanessa_queue is assigned to
* *value
* post: none
* return: pointer to an element from the vanessa_queue
* Note: peeking at an empty vanessa_queue results in NULL being returned
* value may be NULL
**********************************************************************/
void *vanessa_queue_peek_first(const vanessa_queue_t * q);
/**********************************************************************
* vanessa_queue_destroy
* Destroy a vanessa_queue, destroying each element present in the
* vanessa_queue first
* pre: q: vanessa_queue to destroy
* element
* post: vanessa_queue and all elements in the vanessa_queue are destroyed
* return: none
**********************************************************************/
void vanessa_queue_destroy(vanessa_queue_t * q);
/**********************************************************************
* vanessa_queue_length
* Return the number of elements in the vanessa_queue
* pre: q: vanessa_queue to find the number of elements in
* post: none
* return: number of elements in the vanessa_queue
* -1 on error
**********************************************************************/
ssize_t vanessa_queue_length(const vanessa_queue_t * q);
/**********************************************************************
* Dynamic array, to store all your flims in.
*
* The primitive type for the array is void *. Thus, providing your own
* duplicate_primitive, destroy_primitive, display_primitive and
* length_primitive functions will allow you to use the
* vanessa_dynamic_array API to have a dynamic array containing any
* primitive
*
* Includes macros required to create an array of strings or integers.
**********************************************************************/
/*
* Default blocking size for dynamic array
* can be overridden when array is created
*/
#define VANESSA_DEFAULT_DYNAMIC_ARRAY_BLOCK_SIZE (size_t)7
/* #defines to destroy and duplicate strings */
#define VANESSA_DESTROY_STR (void (*)(void *s))free
#define VANESSA_DUPLICATE_STR (void *(*)(void *s))strdup
#define VANESSA_DISPLAY_STR (void (*)(char *d, void *s))strcpy
#define VANESSA_LENGTH_STR (size_t (*)(void *s))strlen
#define VANESSA_MATCH_STR (size_t (*)(void *s))strcmp
#define VANESSA_SORT_STR VANESSA_MATCH_STR
/* Sort versions */
#define VANESSA_DESS VANESSA_DESTROY_STR
#define VANESSA_DUPS VANESSA_DUPLICATE_STR
#define VANESSA_DISS VANESSA_DISPLAY_STR
#define VANESSA_LENS VANESSA_LENGTH_STR
#define VANESSA_MATS VANESSA_MATCH_STR
#define VANESSA_SORS VANESSA_MATCH_STR
typedef struct vanessa_dynamic_array_t_struct vanessa_dynamic_array_t;
/**********************************************************************
* vanessa_dynamic_array_create
* Create a dynamic array
* pre: block_size: blocking size to use.
* DEFAULT_DYNAMIC_ARRAY_BLOCK_SIZE is used if
* block_size is 0.
* Block size refers to how many elements are
* preallocated each time the array is grown.
* element_destroy: Pointer to a function to destroy an element
* Function should take an argument of a pointer
* and free the memory allocated to the structure
* pointed to.
* element_duplicate: Pointer to a function to duplicate an element
* Function should take a pointer to an element to
* duplicate as the only element and return a copy
* of the element Any memory allocation required
* should be done by this function.
* element_display: Pointer to a function to display an element
* Function should take a pointer to char and a
* pointer to an element as arguments. An ASCII
* representation of the element should be placed
* in the character buffer given as the first
* argument. May be NULL in which case
* vanessa_dynamic_array_display will return an empty
* string ("\0");
* element_length: Pointer to a function to find the length of an
* ASCII representation of the element not
* including the trailing '\0'. Used to guard
* against buffer over runs when using
* element_display. May be NULL, in which case
* vanessa_dynamic_array_display will return an
* empty string ("");
*
* post: Dynamic array is allocated and initialised.
* return: An empty dynamic array
* NULL on error
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_create(size_t block_size,
void (*element_destroy) (void *), void *(*element_duplicate)
(void *s), void (*element_display) (char *, void *),
size_t(*element_size) (void *));
/**********************************************************************
* vanessa_dynamic_array_destroy
* Free an array an all the elements held within
* pre: a: array to destroy
* post: array is freed and element_destroy as passed to
* vanessa_dynamic_array_create is called for all elements of
* the array.
* Nothing if a is NULL
**********************************************************************/
void vanessa_dynamic_array_destroy(vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_add_element
* Add an element to a dynamic array
* pre: a: dynamic array to add element to
* e: element to add
* post: element in inserted in the first unused position in the array
* array size is increased by block_size, as passed to
* vanessa_dynamic_array_create,if there is insufficient room in
* the array to add the element.
* Nothing is done if e is NULL
* return: a on success
* NULL if a is NULL or an error occurs
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_add_element(
vanessa_dynamic_array_t * a, void *e);
/**********************************************************************
* vanessa_dynamic_array_delete_element
* Delete an element from a dynamic array
* pre: a: dynamic array to delete element from
* index: index of element to delete
* post: Element is destroyed and removed from array. Subsequent
* elements in the array are shuffled up to fill the gap.
* array size is decreased by block_size, as passed to
* vanessa_dynamic_array_create, if there number if used elements in
* the array falls below a block boundary.
* Nothing is done if e is NULL or index is not a valid element
* in the array.
* return: a on success
* NULL if a is NULL, index is out of bounds or an error occurs
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_delete_element(
vanessa_dynamic_array_t * a, const ssize_t index);
/**********************************************************************
* vanessa_dynamic_array_duplicate
* Duplicate a dynamic array
* pre: a: Dynamic Array to duplicate
* return: An empty dynamic array
* NULL on error
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_duplicate(
vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_length
* Find the length of an ASCII representation of a dynamic array.
* Not including a terminating '\0'.
* pre: a: dynamic array to find the length of
* post: If a is NULL or there are no elements in a then the
* length is 0
* If element_length, as passed to vanessa_dynamic_array_create,
* is NULL, then 0 is returned.
* Else the cumulative lenth of the elemements as per the
* element_length function, plus one character per
* element for a delimiter between elements.
* The trailing '\0' is not counted.
* It is up to the user to free this buffer.
* return: Cumulative length of the elements.
* 0 if a is NULL or there are no elements in a or if
* element_length passed to vanessa_list_create is NULL.
**********************************************************************/
size_t vanessa_dynamic_array_length(vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_display
* Make an ASCII representation of a dynamic array.
* pre: a: dynamic array to display
* delimiter: character to place between elements of the array
* post: If a is NULL or there are no elements in a then nothing is
* done
* If element_display or element_length, as passed to
* vanessa_dynamic_array_create, are NULL, then an empty
* string ("") is returned.
* Else a character buffer is allocated and an ASCII
* representation of of each array element, as determined by
* element_display, separated by delimiter is placed in the
* '\0' terminated buffer that is returned.
* It is up to the user to free this buffer.
* return: Allocated buffer as above
* NULL on error,
* NULL a or empty a
**********************************************************************/
char *vanessa_dynamic_array_display(vanessa_dynamic_array_t * a,
char delimiter);
/**********************************************************************
* vanessa_dynamic_array_get_element
* Get an element from an array
* pre: a: array to retrieve element from
* elementno: index element in array to retrieve
* post: no change is made to a
* return: element requested
* NULL if element is beyond the number of elements in the array
* N.B. element may actually be NULL. You can check if an
* overflow has occured using by comparing elemntno to the output * of vanessa_dynamic_array_get_count()
**********************************************************************/
void * vanessa_dynamic_array_get_element(vanessa_dynamic_array_t * a,
ssize_t elementno);
/**********************************************************************
* vanessa_dynamic_array_get_count
* Get the number of elements in the array
* pre: array to find the number of elements in
* return: number of elements in the array
* -1 if a is NULL
**********************************************************************/
ssize_t vanessa_dynamic_array_get_count(vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_get_vector
* Get the array contained in the dynamic array
* pre: array to find the vector of
* return: vector
* NULL if a is NULL
**********************************************************************/
void **vanessa_dynamic_array_get_vector(vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_reverse
* Reverse the order of the elements in a dynamic array
* pre: a: dynamic array to reverse
* post: Elements of a are in the reverse order
* return: none
**********************************************************************/
void vanessa_dynamic_array_reverse(vanessa_dynamic_array_t * a);
/**********************************************************************
* vanessa_dynamic_array_split_str
* Split a string into substrings on a delimiter
* pre: str: string to split
* delimiter: character to split string on
* post: string is split.
* Note: The string is modified.
* return: dynamic array containing sub_strings
* NULL on error
* string being NULL is an error state
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_split_str(char *string,
const char
delimiter);
/**********************************************************************
* vanessa_dynamic_array_split_str_to_int
* Split a string into substrings on a delimiter
* The substrings are converted into the integers that they represent
* and the integers are stored.
* pre: str: string to split
* delimiter: character to split string on
* post: string is split.
* Note: The string is modified.
* return: dynamic array containing integers
* NULL on error
* string being NULL is an error state
**********************************************************************/
vanessa_dynamic_array_t *vanessa_dynamic_array_split_str_to_int(char
*string,
const char
delimiter);
/**********************************************************************
* vanessa_destroy_int
* function to destroy an pointer to an int.
* pre: i: int to "destroy"
* post: none
* return: none
**********************************************************************/
void vanessa_destroy_int(int *i);
/**********************************************************************
* vanessa_dup_int
* function to duplicate pointer to an int.
* pre: i: int to duplicate
* post: new int is alocated and value of i is copied into it
* return: pointer to new integer
* NULL on error
**********************************************************************/
int *vanessa_dup_int(int *i);
/**********************************************************************
* vanessa_display_int
* Display an int in ASCII as a decimal.
* pre: d: buffer to display ASCII represetation of int to
* i: pointer to int to display
* post: an ASCII representation of i is in d
* return: none
**********************************************************************/
void vanessa_display_int(char *d, int *i);
/**********************************************************************
* vanessa_length_int
* Return the length in bytes of an ASCII representation of the in as a
* decimal.
* pre: i: pointer to int to find the "length" of
* post: none
* return: length is returned
**********************************************************************/
size_t vanessa_length_int(int *i);
/**********************************************************************
* vanessa_match_int
* Compare two integers. Return the difference. That is < 1 if a < b,
* 0 if a == b and > 1 if a > b.
* Analogous to strcmp(3)
* pre: a: pointer to int to compare
* b: pointer to other int to compare
* post: none
* return: difference between a and b
**********************************************************************/
int vanessa_match_int(int *a, int *b);
/* #defines to destroy and duplicate integers */
#define VANESSA_DESTROY_INT (void (*)(void *s))free
#define VANESSA_DUPLICATE_INT \
(void *(*)(void *s))vanessa_dup_int
#define VANESSA_DISPLAY_INT \
(void (*)(char *d, void *s))vanessa_display_int
#define VANESSA_LENGTH_INT \
(size_t (*)(void *s))vanessa_length_int
#define VANESSA_MATCH_INT \
(int (*)(void *e, void *k))vanessa_match_int
#define VANESSA_SORT_INT VANESSA_MATCH_INT
/* ... and shorter versions */
#define VANESSA_DESI VANESSA_DESTROY_INT
#define VANESSA_DUPI VANESSA_DUPLICATE_INT
#define VANESSA_DISI VANESSA_DISPLAY_INT
#define VANESSA_LENI VANESSA_LENGTH_INT
#define VANESSA_MATI VANESSA_MATCH_INT
#define VANESSA_SORI VANESSA_MATCH_INT
/**********************************************************************
* Key value pair
**********************************************************************/
typedef struct vanessa_key_value_t_struct vanessa_key_value_t;
/**********************************************************************
* vanessa_key_value_create
* Create a new vanessa_key_value structure
* pre: none
* post: a new vanessa_key_value structure is allocated and elements
* are initialised
* return: pointer to vanessa_key_value_t
* NULL on error
**********************************************************************/
vanessa_key_value_t *vanessa_key_value_create(void);
/**********************************************************************
* vanessa_key_value_destroy
* Destroy a vanessa_key_value and its contents
* pre: kv: vanessa_key_value structure to destroy
* post: kv and its contents are freed
* return: none
**********************************************************************/
void vanessa_key_value_destroy(vanessa_key_value_t * kv);
/**********************************************************************
* vanessa_key_value_duplicate
* Make a copy of a vanessa_key_value_structure
* pre: kv: vanessa_key_value structure to duplicate
* post:
**********************************************************************/
vanessa_key_value_t *vanessa_key_value_duplicate(vanessa_key_value_t * kv);
/**********************************************************************
* vanessa_key_value_assign
* Assign a key and value to a vanessa_key_value structure
* pre: kv: key_value_structure to assign key and value to
* key: key to assign
* key_destroy: pointer to a function to destroy key
* Use NULL if you do not want the key destroyed
* when the vanessa_key_value_destroy is called
* key_duplicate: pointer to a function to duplicate key
* Use NULL if you want the key duplicated
* using new_key=old_key
* value: value to assign
* value_destroy: pointer to a function to destroy value
* Use NULL if you do not want the value destroyed
* when the value_value_destroy is called
* value_duplicate: pointer to a function to duplicate value
* Use NULL if you want the value duplicated
* using new_value=old_value
* post: key and value are assigned and destroy functions are registered
* return: pointer to vanessa_key_value structure
* NULL if kv is NULL
**********************************************************************/
vanessa_key_value_t *vanessa_key_value_assign(vanessa_key_value_t * kv,
void *key,
void (*destroy_key) (void *),
void *(*dup_key) (void *),
void *value,
void (*destroy_value) (void
*),
void *(*dup_value) (void *)
);
/**********************************************************************
* vanessa_key_value_unassign
* Unassign values in vanessa_key_values structure
* Useful if you want to destroy the vanessa_key_value structure
* without freeing the contents
* pre: kv: key_value structure to unassign values of
* post: All elements in vanessa_key_value structure are set to NULL
* return: pointer to vanessa_key_value structure
* NULL if kv is NULL
**********************************************************************/
vanessa_key_value_t *vanessa_key_value_unassign(vanessa_key_value_t * kv);
/**********************************************************************
* vanessa_key_value_key_get_key
* Get the key from a vanessa_key_value structure
* pre: kv: key value structure to get the key of
* return: key of kv
* NULL if kv is NULL
**********************************************************************/
void *vanessa_key_value_get_key(vanessa_key_value_t * kv);
/**********************************************************************
* vanessa_key_value_key_get_value
* Get the value from a vanessa_key_value structure
* pre: kv: key value structure to get the value of
* return: value of kv
* NULL if kv is NULL
**********************************************************************/
void *vanessa_key_value_get_value(vanessa_key_value_t * kv);
#define VANESSA_DESTROY_KV (void (*)(void *s))vanessa_key_value_destroy
#define VANESSA_DUPLICATE_KV (void *(*)(void *s))vanessa_key_value_duplicate
/**********************************************************************
* Logging functionality
*
* Depreciated, but provided for backwards compatibility.
* Call vanessa_logger_set() and vanessa_logger_unset() instead.
*
**********************************************************************/
/**********************************************************************
* vanessa_adt_logger_set
*
* Depreciated, but provided for backwards compatibility.
* Call vanessa_logger_set() instead.
*
* set the logger function to use
* No logging will take place if logger is set to NULL (default)
* That is you _must_ call this function to enable logging.
* pre: logger: pointer to a vanessa_logger
* post: logger for vanessa_adt is set to logger
* return: none
**********************************************************************/
#define vanessa_adt_logger_set(_vl) vanessa_logger_set(_vl)
/**********************************************************************
* vanessa_adt_logger_unset
*
* Depreciated, but provided for backwards compatibility.
* Call vanessa_logger_unset() instead.
*
* set logger to NULL
* That is no logging will take place
* pre: none
* post: logger is NULL
* return: none
**********************************************************************/
#define vanessa_adt_logger_unset() vanessa_logger_unset()
/**********************************************************************
* Linked List to store all your flims in.
*
* The primitive type for the array is void *. Thus, providing your own
* duplicate_primitive, destroy_primitive, match_primative,
* display_primitive and length_primitive functions will allow you to use
* the vanessa_list API to have a listcontaining any primitive
*
* Includes macros required to create an array of strings or integers.
**********************************************************************/
typedef struct vanessa_list_elem_struct vanessa_list_elem_t;
typedef struct {
vanessa_list_elem_t *first;
vanessa_list_elem_t *last;
vanessa_list_elem_t **recent;
int norecent;
size_t recent_offset;
void (*e_destroy) (void *e);
void *(*e_duplicate) (void *e);
void (*e_display) (char *s, void *e);
size_t(*e_length) (void *e);
int (*e_match) (void *e, void *key);
int (*e_sort) (void *a, void *b);
} vanessa_list_t;
#define VANESSA_LIST_REORDER -1
/**********************************************************************
* vanessa_list_create
* Create a new, empty list
* pre: norecent: number of elements for recent list.
* If VANESSA_LIST_REORDER then no recent list is used
* but elements are moved to the front of the list
* as they are retrieved using vanessa_list_get_element
* element_destroy: Pointer to a function to destroy an element
* Function should take an argument of a pointer
* and free the memory allocated to the structure
* pointed to.
* element_duplicate: Pointer to a function to duplicate an element
* Function should take a pointer to an element to
* duplicate as the only element and return a copy
* of the element Any memory allocation required
* should be done by this function.
* element_display: Pointer to a function to display an element
* Function should take a pointer to char and a
* pointer to an element as arguments. An ASCII
* representation of the element should be placed
* in the character buffer given as the first
* argument. May be NULL in which case
* vanessa_dynamic_array_display will return an empty
* string ("\0");
* element_size: Pointer to a function to find the length of an
* ASCII representation of the element not
* including the trailing '\0'. Used to guard
* against buffer over runs when using
* element_display. May be NULL, in which case
* vanessa_dynamic_array_display will return an
* empty string ("");
* element_match: Pointer to a function to match an element
* by a key.
* element_sort: Pointer to a function that will compare
* two elements and and b. Will return < 0 if a
* should be before b in the list > 0 if a should
* be after b in the list. 0 if they are equal.
* Used in vanessa_list_add_element
*
* post: list structure is alocated, and values initialised to NULL
* return: pointer to list
* NULL on error
**********************************************************************/
vanessa_list_t *vanessa_list_create(int norecent,
void (*element_destroy) (void *e),
void *(*element_duplicate) (void *e),
void (*element_display) (char *s, void *e),
size_t(*element_size) (void *e),
int (*element_match) (void *e, void *key),
int (*element_sort) (void *a, void *b));
/**********************************************************************
* vanessa_list_destroy
* Destroy a list and all the data contained in the list
* pre: l: list
* post: all elements of l are destroyed
**********************************************************************/
void vanessa_list_destroy(vanessa_list_t * l);
/**********************************************************************
* vanessa_list_length
* Find the length of an ASCII representation of a dynamic array.
* Not including a terminating '\0'.
* pre: l: list to find the length of
* post: If l is NULL or there are no elements in l then the
* length is 0
* If element_length, as passed to vanessa_list_create,
* is NULL, then 0 is returned.
* Else the cumulative lenth of the elemements as per the
* element_length function, plus one character per element
* for a delimiter between elements.
* The trailing '\0' is not counted.
* It is up to the user to free this buffer.
* return: Cumulative length of the elements.
* 0 if a is NULL or there are no elements in a or if
* element_length passed to vanessa_list_create is NULL.
**********************************************************************/
size_t vanessa_list_length(vanessa_list_t * l);
/**********************************************************************
* vanessa_list_display
* Make an ASCII representation of the list
* pre: l: list to display
* delimiter: character to place between elements of the list
* post: If l is NULL or there are no elements in l then nothing is
* done
* If element_display or element_length, as passed to
* vanessa_list_create, are NULL, then an empty string
* ("") is returned.
* Else a character buffer is allocated and an ASCII
* representation of each list element, as determined by
* element_display, separated by delimiter is placed in
* the '\0' terminated buffer that is returned.
* It is up to the user to free this buffer.
* return: Allocated buffer as above
* NULL on error,
* NULL l or empty l
**********************************************************************/
char *vanessa_list_display(vanessa_list_t * l, char delimiter);
/**********************************************************************
* vanessa_list_get_element
* Find an element in the list by key using the element_match function
* passed to vanessa_list_create
* pre: l: list to search
* key: key to match
* post: none
* return: value it is found
* NULL if l or key is NULL or if value matching key is not found
**********************************************************************/
void *vanessa_list_get_element(vanessa_list_t *l, void *key);
/**********************************************************************
* vanessa_list_get_count
* Count the number of elements in the list
* pre: l: list to count
* post: none
* return: number of elements in the list
* 0 if l is NULL
**********************************************************************/
size_t vanessa_list_get_count(vanessa_list_t *l);
/**********************************************************************
* vanessa_list_add_element
* Insert element into a list
* pre: l: list to insert value into
* value: value to insert
* post: value is inserted into the list
* if element_sort passed to vanessa_list_create is non-NULL
* then the element will be inserted in order. Otherwise
* the element will be inserted at the begining of the list.
* return: NULL if l is NULL
* l, unchanged if value is NULL
**********************************************************************/
vanessa_list_t *vanessa_list_add_element(vanessa_list_t * l, void *value);
/**********************************************************************
* vanessa_list_remove_element
* Insert element into a list
* pre: l: list to insert value into
* value: value to insert
* post: value is removed from the list
* return: NULL if l is NULL
* l, unchanged if value is null
**********************************************************************/
void vanessa_list_remove_element(vanessa_list_t *l, void *key);
/**********************************************************************
* vanessa_list_duplicate
* Duplicate a list
* pre: l: list to duplicate
* post: list is duplicated
* return: NULL if l is NULL or on error
* duplicated list
**********************************************************************/
vanessa_list_t *vanessa_list_duplicate(vanessa_list_t *l);
/**********************************************************************
* vanessa_list_iterate
* Run a fucntion over each element in the list
* pre: l: list run the function over
* action: function to run
* action should return < 0 if an error occurs,
* which indicates that processing will be stopped
* data: data passed to action
* post: action is run with the value of each element as its first argument
* return: 0 on success
* < 0 if action returns < 0
**********************************************************************/
int vanessa_list_iterate(vanessa_list_t *l, int(* action)(void *e, void *data),
void *data);
/**********************************************************************
* Hash to put your flims in.
*
* The primitive type for the array is void *. Thus, providing your
* own duplicate_primitive, destroy_primitive, match_primative,
* display_primitive, length_primitive and hash_primitive, functions
* will allow you to use the vanessa_hash API to have a
* hash containing any primitive
*
* Includes macros, excluding hash_primitive, required to create an
* list of strings or integers.
**********************************************************************/
typedef struct vanessa_hash_t_struct vanessa_hash_t;
/**********************************************************************
* vanessa_hash_create
* Create a new, empty hash
* pre: nobucket: number of buckets in the hash
* element_destroy: Pointer to a function to destroy an element
* Function should take an argument of a pointer
* and free the memory allocated to the structure
* pointed to.
* element_duplicate: Pointer to a function to duplicate an element
* Function should take a pointer to an element to
* duplicate as the only element and return a copy
* of the element Any memory allocation required
* should be done by this function.
* element_match: Pointer to a function to match an element
* by a key.
* element_display: Pointer to a function to display an element
* Function should take a pointer to char and a
* pointer to an element as arguments. An ASCII
* representation of the element should be placed
* in the character buffer given as the first
* argument. May be NULL in which case
* vanessa_dynamic_array_display will return an empty
* string ("\0");
* element_length: Pointer to a function to find the length of an
* ASCII representation of the element not
* including the trailing '\0'. Used to guard
* against buffer over runs when using
* element_display. May be NULL, in which case
* vanessa_dynamic_array_display will return an
* empty string ("");
* element_hash: Pointer to a function that return the hash
* bucket index, a number >= 0 && < nobucket,
* for an element.
*
* post: hash structure is alocated, and values initialised to NULL
* note that the hash buckets are linked lists and are created
* on demand.
* return: pointer to hash
* NULL on error
**********************************************************************/
vanessa_hash_t *vanessa_hash_create(size_t nobucket,
void (*element_destroy) (void *e),
void *(*element_duplicate) (void *e),
int (*element_match) (void *e, void *key),
void (*element_display) (char *s, void *e),
size_t(*element_length) (void *e),
size_t (*element_hash) (void *e));
/**********************************************************************
* vanessa_hash_destroy
* Destroy a hash and all the data contained in the hash
* pre: h: hash
* post: all elements of h are destroyed
**********************************************************************/
void vanessa_hash_destroy(vanessa_hash_t *h);
/**********************************************************************
* vanessa_hash_length
* Find the length of an ASCII representation of a dynamic array.
* Not including a terminating '\0'.
* pre: h: hash to find the length of
* post: If h is NULL or there are no elements in h then the
* length is 0
* If element_length, as passed to vanessa_hash_create,
* is NULL, then 0 is returned.
* Else the cumulative lenth of the elemements as per the
* element_length, plus one character per element for a
* delimiter between elements.
* The trailing '\0' is not counted.
* It is up to the user to free this buffer.
* return: Cumulative length of the elements.
* 0 if a is NULL or there are no elements in a or if
* element_length passed to vanessa_hash_create is NULL.
**********************************************************************/
size_t vanessa_hash_length(vanessa_hash_t *h) ;
/**********************************************************************
* vanessa_hash_display
* Make an ASCII representation of the hash
* pre: h: hash to display
* delimiter: character to place between elements of the hash
* post: If h is NULL or there are no elements in h then nothing is
* done
* If element_display or element_length, as passed to
* vanessa_hash_create, are NULL, then an empty string
* ("") is returned.
* Else a character buffer is allocated and an ASCII
* representation of each hashed element, as determined by
* element_display, separated by delimiter is placed in the
* '\0' terminated buffer that is returned.
* It is up to the user to free this buffer.
* return: Allocated buffer as above
* NULL on error,
* NULL h or empty h
**********************************************************************/
char *vanessa_hash_display(vanessa_hash_t *h, const char delimiter);
/**********************************************************************
* vanessa_hash_get_element
* Get the number of elements stored in the hash
* pre: h: hash to count the elements of
* post: none
* return: Number of elements stored in the hash
* 0 if h is NULL or empty
**********************************************************************/
size_t vanessa_hash_get_count(vanessa_hash_t *h) ;
/**********************************************************************
* vanessa_hash_get_element
* Retrieve an element from the hash by value
* passed to vanessa_list_create
* pre: h: hash to search
* value: value to match
* post: none
* return: element if found
* NULL if h or value is NULL or if the element is in the hash
**********************************************************************/
void *vanessa_hash_get_element(vanessa_hash_t *h, void *value);
/**********************************************************************
* vanessa_hash_add_element
* Insert element into a hash
* pre: h: hash to insert value into
* value: value to insert
* post: value is inserted into the hash
* return: NULL if h is NULL
* h, unchanged if value is NULL
**********************************************************************/
vanessa_hash_t *vanessa_hash_add_element(vanessa_hash_t *h, void *value);
/**********************************************************************
* vanessa_hash_remove_element
* Insert element into a hash
* pre: h: hash to insert value into
* value: value to insert
* post: value is removed from the hash
* return: NULL if h is NULL
* h, unchanged if value is null
**********************************************************************/
vanessa_hash_t *vanessa_hash_remove_element(vanessa_hash_t *h, void *value);
/**********************************************************************
* vanessa_hash_duplicate
* Duplicate a hash
* pre: h: hash to duplicate
* post: hash is duplicated
* return: NULL if h is NULL or on error
* duplicated hash
**********************************************************************/
vanessa_hash_t *vanessa_hash_duplicate(vanessa_hash_t *h);
/**********************************************************************
* vanessa_hash_iterate
* Run a fucntion over each element in the hash
* pre: h: hash run the function over
* action: function to run
* action should return < 0 if an error occurs,
* which indicates that processing will be stopped
* data: data passed to action
* post: action is run with the value of each element as its first argument
* return: 0 on success
* < 0 if action returns < 0
**********************************************************************/
int vanessa_hash_iterate(vanessa_hash_t *h, int(* action)(void *e, void *data),
void *data);
/**********************************************************************
* Make handling configuration files just a little bit easier
**********************************************************************/
#define VANESSA_CONFIG_FILE_NONE 0x0
#define VANESSA_CONFIG_FILE_MULTI_VALUE 0x1
#define VANESSA_CONFIG_FILE_X 0x2
#define VANESSA_CONFIG_FILE_BLANK 0x4
typedef struct {
char mode_str[11];
} vanessa_mode_str_t;
typedef struct {
char mode_str[5];
} vanessa_mode_num_str_t;
#define VANESSA_CONFIG_FILE_CHECK_UID 0x1
#define VANESSA_CONFIG_FILE_CHECK_GID 0x2
#define VANESSA_CONFIG_FILE_CHECK_MODE 0x4
#define VANESSA_CONFIG_FILE_CHECK_FILE 0x8
#define VANESSA_CONFIG_FILE_CHECK_ALL \
VANESSA_CONFIG_FILE_CHECK_UID| \
VANESSA_CONFIG_FILE_CHECK_GID| \
VANESSA_CONFIG_FILE_CHECK_MODE| \
VANESSA_CONFIG_FILE_CHECK_FILE
/**********************************************************************
* vanessa_config_file_read_fd
* Reads a configuration file from an file descriptor
* that has been opend for reading.
* pre: filename: file to read configuration from
* flags: logical or of VANESSA_CONFIG_FILE_MULTI_VALUE,
* VANESSA_CONFIG_FILE_X and VANESSA_CONFIG_FILE_BLANK.
* VANESSA_CONFIG_FILE_NONE for no flags.
* VANESSA_CONFIG_FILE_X and VANESSA_CONFIG_FILE_BLANK
* may not be used together.
* post: The file is parsed according to the following rules.
* Escaping and quoting is intended to be analogous to
* how a shell (bash) handles these.
* o Each line begins with a key, optionally followed
* by some whitespace and a value
* If flag is VANESSA_CONFIG_FILE_MULTI_VALUE
* then there may be multiple white-space delimited values
* Otherwise everything after the key and delimiting whitespace
* is considerd as one value
* o Leading whitespace is ignored
* o Blank lines are ignored
* o Anything after a # (hash) on a line is ignored
* o If a \ precedes a new line then the lines will be concatenated
* o If a \ precedes any other character, including a # (hash)
* it will be treated as a literal
* o Anything inside single quotes (') will be treated as a litreal.
* o Anything other than a (') inside double quotes (") will be
* treated as a litreal.
* o Whitespace in keys must be escaped or quoted.
* o Whitespace in values need not be escaped or quoted.
* o If flag includes VANESSA_CONFIG_FILE_BLANK
* key is not prefixed
* If flag includes VANESSA_CONFIG_FILE_X
* key is prefixed with a "-"
* Otherwise
* If a key is a single letter it is prefixed by a "-"
* Else the key is prefixed with "--"
* Note if flag contains both VANESSA_CONFIG_FILE_BLANK and
* VANESSA_CONFIG_FILE_X then the behaviour is undefined
* * If flag is VANESSA_CONFIG_FILE_MULTI_VALUE
* a NULL entry is inserted after each line
* Otherwise
* a "" entry is inserted as the first element in the
* dynamic array. This is intended to be a dummy argv[0]
* return: dynamic array containin elements
* NULL on error
**********************************************************************/
vanessa_dynamic_array_t *vanessa_config_file_read_fd(int fd,
vanessa_adt_flag_t flag);
/**********************************************************************
* vanessa_config_file_read
* Read in a config file and put elements in a dynamic array
* pre: filename: file to read configuration from
* flags: unused
* post: File is opened read only
* File is parsed, see vanessa_config_file_read for details
* File is closed
* return: dynamic array containin elements
* NULL on error
**********************************************************************/
vanessa_dynamic_array_t *vanessa_config_file_read(const char *filename,
vanessa_adt_flag_t flag);
/**********************************************************************
* vanessa_mode_str
* Make an asscii representation of a mode in "rwx" form.
* e.g. -rwx------
* pre: mode: mode to format
* mode_num: format to fill in, really just a string
* post: mode_num is filled in
* return: mode_num on success
* NULL on error (there are no errors)
**********************************************************************/
vanessa_mode_str_t *vanessa_mode_str(mode_t mode,
vanessa_mode_str_t *mode_str);
/**********************************************************************
* vanessa_mode_num_str
* Make an asscii representation of a mode in numerical form.
* e.g. 0600
* pre: mode: mode to format
* mode_num_str: format to fill in, really just a string
* post: mode_num_str is filled in
* return: mode_num_str on success
* NULL on error (there are no errors)
**********************************************************************/
vanessa_mode_num_str_t *vanessa_mode_num_str(mode_t mode,
vanessa_mode_num_str_t *mode_num_str);
/**********************************************************************
* vanessa_config_file_check_permission_fd
* Check the permissions, ownership and mode of a file
* Intended for use on files whose permissions need
* to be strictly enforced for some reason.
* pre: fd: Open file discriptor to file to check
* uid: desired uid
* gid: desired gid
* mode: desired mode
* flag: logical or of:
* VANESSA_CONFIG_FILE_CHECK_UID to check uid
* VANESSA_CONFIG_FILE_CHECK_GID to check gid
* VANESSA_CONFIG_FILE_CHECK_MODE to check mode
* VANESSA_CONFIG_FILE_CHECK_FILE to check that it is
* a regular file
* VANESSA_CONFIG_FILE_CHECK_ALL all of the above
* post: checks are performed
* return: 0 if the file pases the checks
* -1 otherwise
**********************************************************************/
int vanessa_config_file_check_permission_fd(int fd, uid_t uid, gid_t gid,
mode_t mode, vanessa_adt_flag_t flag);
/**********************************************************************
* vanessa_config_file_check_permission
* Check the permissions, ownership and mode of a file
* pre: filename: file to check
* see vanessa_config_file_check() for other arguments
* post: File is opened read only
* File is parsed, see vanessa_config_file_check() for details
* File is closed
* return: 0 if file passes checks
* N.B: you must have permision to open the file for reading
* -1 on error
**********************************************************************/
int vanessa_config_file_check_permission(const char *filename,
uid_t uid, gid_t gid, mode_t mode, vanessa_adt_flag_t flag);
/**********************************************************************
* vanessa_config_file_check_exits_fd
* Check the that file exists and is a regular file or
* a symlink to a regular file.
* pre: fd: Open file discriptor to file to check
* post: checks are performed
* return: 0 if the file pases the checks
* -1 otherwise
**********************************************************************/
int vanessa_config_file_check_exits_fd(int fd);
/**********************************************************************
* vanessa_config_file_check_exits
* Check that a file exists and is a regular file or
* a symlink to a regular file.
* pre: filename: file to check
* see vanessa_config_file_check_exits_fd() for other arguments
* post: File is opened read only
* File is checked, see vanessa_config_file_check_exits_fd() for details
* File is closed
* return: 0 if file passes checks
* N.B: you must have permision to open the file for reading
* -1 on error
**********************************************************************/
int vanessa_config_file_check_exits(const char *filename);
#endif /* _VANESSA_ADT_H */
|