diff options
author | Paul Eggert <eggert@cs.ucla.edu> | 2013-10-03 09:16:31 -0700 |
---|---|---|
committer | Paul Eggert <eggert@cs.ucla.edu> | 2013-10-03 09:16:31 -0700 |
commit | 75273afb0de9e8a8eede149f3afdba0d855e7b5a (patch) | |
tree | 3b3ac5db0ac4bc0dface5305f4edaa07324e4c85 /src/data.c | |
parent | c9358b45b947dd66de05527629511679bb90392a (diff) | |
download | emacs-75273afb0de9e8a8eede149f3afdba0d855e7b5a.tar.gz |
* lisp.h (eassert): Assume that COND is true when optimizing.
In other words, take on the behavior of eassert_and_assume.
This makes Emacs 0.2% smaller on my platform (Fedora 19, x86-64).
(eassert_and_assume): Remove. All uses replaced by eassert.
Diffstat (limited to 'src/data.c')
-rw-r--r-- | src/data.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/data.c b/src/data.c index 79679bae444..b268616fd26 100644 --- a/src/data.c +++ b/src/data.c @@ -2966,7 +2966,7 @@ lowercase l) for small endian machines. */) static size_t bool_vector_spare_mask (ptrdiff_t nr_bits) { - eassert_and_assume (nr_bits > 0); + eassert (nr_bits > 0); return (((size_t) 1) << (nr_bits % BITS_PER_SIZE_T)) - 1; } @@ -3108,7 +3108,7 @@ bool_vector_binop_driver (Lisp_Object op1, nr_bits = min (nr_bits, XBOOL_VECTOR (dest)->size); } - eassert_and_assume (nr_bits >= 0); + eassert (nr_bits >= 0); nr_words = ROUNDUP (nr_bits, BITS_PER_SIZE_T) / BITS_PER_SIZE_T; adata = (size_t *) XBOOL_VECTOR (dest)->data; @@ -3275,7 +3275,7 @@ Return the destination vector. */) bdata = (size_t *) XBOOL_VECTOR (b)->data; adata = (size_t *) XBOOL_VECTOR (a)->data; - eassert_and_assume (nr_bits >= 0); + eassert (nr_bits >= 0); for (i = 0; i < nr_bits / BITS_PER_SIZE_T; i++) bdata[i] = ~adata[i]; @@ -3310,7 +3310,7 @@ A must be a bool vector. B is a generalized bool. */) match = NILP (b) ? (size_t) -1 : 0; adata = (size_t *) XBOOL_VECTOR (a)->data; - eassert_and_assume (nr_bits >= 0); + eassert (nr_bits >= 0); for (i = 0; i < nr_bits / BITS_PER_SIZE_T; ++i) count += popcount_size_t (adata[i] ^ match); |