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
|
/* str.h - XBT string related functions. */
/* Copyright (c) 2007-2025. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#ifndef XBT_STR_H
#define XBT_STR_H
#include <xbt/dict.h>
#include <xbt/dynar.h>
#include <xbt/misc.h>
#include <stdarg.h> /* va_* */
SG_BEGIN_DECL
/** @addtogroup XBT_str
* @brief String manipulation functions
*
* This module defines several string related functions. Looking at the diversity of string manipulation functions that
* are provided, you can see that several SimGrid core developers actually like Perl.
* @{
*/
XBT_PUBLIC long int xbt_str_parse_int(const char* str, const char* error_mesg);
XBT_PUBLIC double xbt_str_parse_double(const char* str, const char* error_mesg);
#define XBT_DJB2_HASH_FUNCTION
//#define XBT_FNV_HASH_FUNCTION
/**
* @brief Returns the hash code of a string.
*/
static inline unsigned int xbt_str_hash_ext(const char* str, int str_len)
{
#ifdef XBT_DJB2_HASH_FUNCTION
/* fast implementation of djb2 algorithm */
unsigned int hash = 5381;
while (str_len--) {
int c = *str++;
hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
}
# elif defined(XBT_FNV_HASH_FUNCTION)
unsigned int hash = 0x811c9dc5;
unsigned char *bp = (unsigned char *) str; /* start of buffer */
unsigned char *be = bp + str_len; /* beyond end of buffer */
while (bp < be) {
/* multiply by the 32 bit FNV magic prime mod 2^32 */
hash +=
(hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) +
(hash << 24);
/* xor the bottom with the current octet */
hash ^= (unsigned int) *bp++;
}
# else
unsigned int hash = 0;
while (str_len--) {
hash += (*str) * (*str);
str++;
}
#endif
return hash;
}
/**
* @brief Returns the hash code of a string.
*/
static inline unsigned int xbt_str_hash(const char *str)
{
#ifdef XBT_DJB2_HASH_FUNCTION
/* fast implementation of djb2 algorithm */
int c;
unsigned int hash = 5381;
while ((c = *str++)) {
hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
}
# elif defined(XBT_FNV_HASH_FUNCTION)
unsigned int hash = 0x811c9dc5;
while (*str) {
/* multiply by the 32 bit FNV magic prime mod 2^32 */
hash += (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) + (hash << 24);
/* xor the bottom with the current byte */
hash ^= (unsigned int) *str++;
}
# else
unsigned int hash = 0;
while (*str) {
hash += (*str) * (*str);
str++;
}
#endif
return hash;
}
/**@}*/
SG_END_DECL
#endif /* XBT_STR_H */
|
