summary refs log tree commit diff
path: root/posix
diff options
context:
space:
mode:
authorUlrich Drepper <drepper@redhat.com>2005-09-30 15:46:19 +0000
committerUlrich Drepper <drepper@redhat.com>2005-09-30 15:46:19 +0000
commitc0c9615cbb5d62df60ad3e9fe6bf38b50d4e83db (patch)
treeee1a2e67d226f1e95d465b0b19c60afeb318d365 /posix
parentc293f2e542c129215d74effee75a5af7fef481d9 (diff)
downloadglibc-c0c9615cbb5d62df60ad3e9fe6bf38b50d4e83db.tar.gz
glibc-c0c9615cbb5d62df60ad3e9fe6bf38b50d4e83db.tar.xz
glibc-c0c9615cbb5d62df60ad3e9fe6bf38b50d4e83db.zip
* posix/regexec.c (update_cur_sifted_state, check_arrival,
	check_arrival_add_next_nodes): Avoid using uninitialized variable.

	* malloc/memusage.c (dest): Fix a bunch of warnings on 32-bit arches.

	* sysdeps/i386/fpu/libm-test-ulps: Update for GCC 4.0.x.
Diffstat (limited to 'posix')
-rw-r--r--posix/regexec.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/posix/regexec.c b/posix/regexec.c
index 03f705a3a3..74a24867a2 100644
--- a/posix/regexec.c
+++ b/posix/regexec.c
@@ -1798,7 +1798,7 @@ update_cur_sifted_state (mctx, sctx, str_idx, dest_nodes)
      re_node_set *dest_nodes;
 {
   const re_dfa_t *const dfa = mctx->dfa;
-  reg_errcode_t err;
+  reg_errcode_t err = REG_NOERROR;
   const re_node_set *candidates;
   candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
 		: &mctx->state_log[str_idx]->nodes);
@@ -2932,7 +2932,7 @@ check_arrival (mctx, path, top_node, top_str, last_node, last_str,
      int top_node, top_str, last_node, last_str, type;
 {
   const re_dfa_t *const dfa = mctx->dfa;
-  reg_errcode_t err;
+  reg_errcode_t err = REG_NOERROR;
   int subexp_num, backup_cur_idx, str_idx, null_cnt;
   re_dfastate_t *cur_state = NULL;
   re_node_set *cur_nodes, next_nodes;
@@ -3096,7 +3096,7 @@ check_arrival_add_next_nodes (mctx, str_idx, cur_nodes, next_nodes)
   const re_dfa_t *const dfa = mctx->dfa;
   int result;
   int cur_idx;
-  reg_errcode_t err;
+  reg_errcode_t err = REG_NOERROR;
   re_node_set union_set;
   re_node_set_init_empty (&union_set);
   for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx)