A
lgorithmique
N
umérique
D
istribuée
Public GIT Repository
projects
/
simgrid.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Remove unused variables.
[simgrid.git]
/
src
/
xbt
/
dict.c
diff --git
a/src/xbt/dict.c
b/src/xbt/dict.c
index
7f1c91a
..
5bf48fa
100644
(file)
--- a/
src/xbt/dict.c
+++ b/
src/xbt/dict.c
@@
-323,7
+323,7
@@
XBT_INLINE void *xbt_dict_get_ext(xbt_dict_t dict, const char *key,
}
if (current == NULL)
}
if (current == NULL)
- THROW
2
(not_found_error, 0, "key %.*s not found", key_len, key);
+ THROW
F
(not_found_error, 0, "key %.*s not found", key_len, key);
return current->content;
}
return current->content;
}
@@
-401,7
+401,7
@@
XBT_INLINE void *xbt_dict_get(xbt_dict_t dict, const char *key)
current = current->next;
if (current == NULL)
current = current->next;
if (current == NULL)
- THROW
1
(not_found_error, 0, "key %s not found", key);
+ THROW
F
(not_found_error, 0, "key %s not found", key);
return current->content;
}
return current->content;
}
@@
-457,7
+457,7
@@
XBT_INLINE void xbt_dict_remove_ext(xbt_dict_t dict, const char *key,
}
if (current == NULL)
}
if (current == NULL)
- THROW
2
(not_found_error, 0, "key %.*s not found", key_len, key);
+ THROW
F
(not_found_error, 0, "key %.*s not found", key_len, key);
if (previous != NULL) {
previous->next = current->next;
if (previous != NULL) {
previous->next = current->next;
@@
-591,7
+591,7
@@
XBT_INLINE void xbt_dicti_remove(xbt_dict_t dict, uintptr_t key)
}
if (current == NULL)
}
if (current == NULL)
- THROW
1
(not_found_error, 0, "key %zu not found", key);
+ THROW
F
(not_found_error, 0, "key %zu not found", key);
if (previous != NULL) {
previous->next = current->next;
if (previous != NULL) {
previous->next = current->next;
@@
-939,7
+939,7
@@
static void search_not_found(xbt_dict_t head, const char *data)
TRY {
data = xbt_dict_get(head, data);
TRY {
data = xbt_dict_get(head, data);
- THROW
1
(unknown_error, 0,
+ THROW
F
(unknown_error, 0,
"Found something which shouldn't be there (%s)", data);
} CATCH(e) {
if (e.category != not_found_error)
"Found something which shouldn't be there (%s)", data);
} CATCH(e) {
if (e.category != not_found_error)
@@
-989,7
+989,7
@@
static void count_check_get_key(xbt_dict_t dict, int length)
xbt_dict_foreach(dict, cursor, key, data) {
effective++;
key2 = xbt_dict_get_key(dict, data);
xbt_dict_foreach(dict, cursor, key, data) {
effective++;
key2 = xbt_dict_get_key(dict, data);
- xbt_assert
2
(!strcmp(key, key2),
+ xbt_assert(!strcmp(key, key2),
"The data was registered under %s instead of %s as expected",
key2, key);
}
"The data was registered under %s instead of %s as expected",
key2, key);
}
@@
-1248,7
+1248,7
@@
static int countelems(xbt_dict_t head)
XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
{
xbt_dict_t head = NULL;
XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
{
xbt_dict_t head = NULL;
- int i, j, k
, nb
;
+ int i, j, k;
char *key;
void *data;
char *key;
void *data;
@@
-1263,7
+1263,6
@@
XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
SIZEOFKEY);
head = xbt_dict_new();
/* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
SIZEOFKEY);
head = xbt_dict_new();
/* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
- nb = 0;
for (j = 0; j < 1000; j++) {
char *data = NULL;
key = xbt_malloc(SIZEOFKEY);
for (j = 0; j < 1000; j++) {
char *data = NULL;
key = xbt_malloc(SIZEOFKEY);