(gl_linked_iterator_from_to): Initialize struct completely.
* gl_anytree_list2.h [lint] (gl_tree_iterator): Likewise.
(gl_tree_iterator_from_to): Likewise
* gl_anytree_oset.h [lint] (gl_tree_iterator): Likewise.
* gl_array_list.c [lint] (gl_array_iterator)
(gl_array_iterator_from_to): Likewise.
* gl_array_oset.c [lint] (gl_array_iterator): Likewise.
* gl_carray_list.c [lint] (gl_carray_iterator)
(gl_carray_iterator_from_to): Likewise.
2006-09-22 Ralf Wildenhues <Ralf.Wildenhues@gmx.de>
+ * gl_anylinked_list2.h [lint] (gl_linked_iterator)
+ (gl_linked_iterator_from_to): Initialize struct completely.
+ * gl_anytree_list2.h [lint] (gl_tree_iterator): Likewise.
+ (gl_tree_iterator_from_to): Likewise
+ * gl_anytree_oset.h [lint] (gl_tree_iterator): Likewise.
+ * gl_array_list.c [lint] (gl_array_iterator)
+ (gl_array_iterator_from_to): Likewise.
+ * gl_array_oset.c [lint] (gl_array_iterator): Likewise.
+ * gl_carray_list.c [lint] (gl_carray_iterator)
+ (gl_carray_iterator_from_to): Likewise.
+
* gc-gnulib.c [GC_USE_HMAC_SHA1]: include hmac.h for hmac_sha1.
* md4.c (md4_process_block): Remove unused variable.
* rijndael-api-fst.c (rijndaelBlockDecrypt): GCC suggests
result.list = list;
result.p = list->root.next;
result.q = &list->root;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+ result.count = 0;
+#endif
return result;
}
result.q = node;
}
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+ result.count = 0;
+#endif
+
return result;
}
result.p = node;
/* End point is past the rightmost node. */
result.q = NULL;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+ result.count = 0;
+#endif
return result;
}
result.p = (start_index < count ? node_at (list->root, start_index) : NULL);
/* End point is the node at position end_index. */
result.q = (end_index < count ? node_at (list->root, end_index) : NULL);
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+ result.count = 0;
+#endif
return result;
}
result.p = node;
/* End point is past the rightmost node. */
result.q = NULL;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+ result.count = 0;
+#endif
return result;
}
result.count = list->count;
result.p = list->elements + 0;
result.q = list->elements + list->count;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+#endif
return result;
}
result.count = list->count;
result.p = list->elements + start_index;
result.q = list->elements + end_index;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+#endif
return result;
}
result.count = set->count;
result.p = set->elements + 0;
result.q = set->elements + set->count;
+#ifdef lint
+ result.i = 0;
+ result.j = 0;
+#endif
return result;
}
result.count = list->count;
result.i = 0;
result.j = list->count;
+#ifdef lint
+ result.p = 0;
+ result.q = 0;
+#endif
return result;
}
result.count = list->count;
result.i = start_index;
result.j = end_index;
+#ifdef lint
+ result.p = 0;
+ result.q = 0;
+#endif
return result;
}