aboutsummaryrefslogtreecommitdiffstats
path: root/src/profiler.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/profiler.c')
-rw-r--r--src/profiler.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/src/profiler.c b/src/profiler.c
index 3d8f7243d2f..0a0a4d0bc57 100644
--- a/src/profiler.c
+++ b/src/profiler.c
@@ -1,6 +1,6 @@
1/* Profiler implementation. 1/* Profiler implementation.
2 2
3Copyright (C) 2012 Free Software Foundation, Inc. 3Copyright (C) 2012-2013 Free Software Foundation, Inc.
4 4
5This file is part of GNU Emacs. 5This file is part of GNU Emacs.
6 6
@@ -55,7 +55,7 @@ make_log (int heap_size, int max_stack_depth)
55 /* What is special about our hash-tables is that the keys are pre-filled 55 /* What is special about our hash-tables is that the keys are pre-filled
56 with the vectors we'll put in them. */ 56 with the vectors we'll put in them. */
57 int i = ASIZE (h->key_and_value) / 2; 57 int i = ASIZE (h->key_and_value) / 2;
58 while (0 < i) 58 while (i > 0)
59 set_hash_key_slot (h, --i, 59 set_hash_key_slot (h, --i,
60 Fmake_vector (make_number (max_stack_depth), Qnil)); 60 Fmake_vector (make_number (max_stack_depth), Qnil));
61 return log; 61 return log;
@@ -247,7 +247,7 @@ handle_profiler_signal (int signal)
247 if (profiler_timer_ok) 247 if (profiler_timer_ok)
248 { 248 {
249 int overruns = timer_getoverrun (profiler_timer); 249 int overruns = timer_getoverrun (profiler_timer);
250 eassert (0 <= overruns); 250 eassert (overruns >= 0);
251 count += overruns; 251 count += overruns;
252 } 252 }
253#endif 253#endif
@@ -560,7 +560,7 @@ hashfn_profiler (struct hash_table_test *ht, Lisp_Object bt)
560 ? XHASH (XCDR (XCDR (f))) : XHASH (f)); 560 ? XHASH (XCDR (XCDR (f))) : XHASH (f));
561 hash = sxhash_combine (hash, hash1); 561 hash = sxhash_combine (hash, hash1);
562 } 562 }
563 return (hash & INTMASK); 563 return SXHASH_REDUCE (hash);
564 } 564 }
565 else 565 else
566 return XHASH (bt); 566 return XHASH (bt);