Mercurial > hg > xemacs-beta
view src/profile.h @ 5327:d1b17a33450b
Move the heavy lifting from cl-seq.el to C.
src/ChangeLog addition:
2010-12-30 Aidan Kehoe <kehoea@parhasard.net>
Move the heavy lifting from cl-seq.el to C, finally making those
functions first-class XEmacs citizens, with circularity checking,
built-in support for tests other than #'eql, and as much
compatibility with current Common Lisp as Paul Dietz' tests require.
* fns.c (check_eq_nokey, check_eq_key, check_eql_nokey)
(check_eql_key, check_equal_nokey, check_equal_key)
(check_equalp_nokey, check_equalp_key, check_string_match_nokey)
(check_string_match_key, check_other_nokey, check_other_key)
(check_if_nokey, check_if_key, check_match_eq_key)
(check_match_eql_key, check_match_equal_key)
(check_match_equalp_key, check_match_other_key): New. These are
basically to provide function pointers to be used by Lisp
functions that take TEST, TEST-NOT and KEY arguments.
(get_check_match_function_1, get_check_test_function)
(get_check_match_function): These functions work out which of the
previous list of functions to use, given the keywords supplied by
the user.
(count_with_tail): New. This is the bones of #'count.
(list_count_from_end, string_count_from_end): Utility functions
for #'count.
(Fcount): New, moved from cl-seq.el.
(list_position_cons_before): New. The implementation of #'member*,
and important in implementing various other functions.
(FmemberX, Fadjoin, FassocX, FrassocX, Fposition, Ffind)
(FdeleteX, FremoveX, Fdelete_duplicates, Fremove_duplicates)
(Fnsubstitute, Fsubstitute, Fsublis, Fnsublis, Fsubst, Fnsubst)
(Ftree_equal, Fmismatch, Fsearch, Fintersection, Fnintersection)
(Fsubsetp, Fset_difference, Fnset_difference, Fnunion, Funion)
(Fset_exclusive_or, Fnset_exclusive_or): New, moved here from
cl-seq.el.
(position): New. The implementation of #'find and #'position.
(list_delete_duplicates_from_end, subst, sublis, nsublis)
(tree_equal, mismatch_from_end, mismatch_list_list)
(mismatch_list_string, mismatch_list_array)
(mismatch_string_array, mismatch_string_string)
(mismatch_array_array, get_mismatch_func): Helper C functions for
the Lisp-visible functions.
(venn, nvenn): New. The implementation of the main Lisp functions that
treat lists as sets.
lisp/ChangeLog addition:
2010-12-30 Aidan Kehoe <kehoea@parhasard.net>
* cl-seq.el:
Move the heavy lifting from this file to C. Dump the
cl-parsing-keywords macro, but don't use defun* for the functions
we define that do take keywords, dynamic scope lossage makes that
not practical.
* subr.el (sort, fillarray): Move these aliases here.
(map-plist): #'nsublis is now built-in, but at this point #'eql
isn't necessarily available as a test; use #'eq.
* obsolete.el (cl-delete-duplicates): Make this available for old
compiler macros and old code.
(memql): Document that this is equivalent to #'member*, and worse.
* cl.el (adjoin, subst): Removed. These are in C.
author | Aidan Kehoe <kehoea@parhasard.net> |
---|---|
date | Thu, 30 Dec 2010 01:59:52 +0000 |
parents | 8f6a825eb3d3 |
children | 308d34e9f07d |
line wrap: on
line source
/* Profiling. Copyright (C) 2003, 2005 Ben Wing. This file is part of XEmacs. XEmacs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. XEmacs is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with XEmacs; see the file COPYING. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* Synched up with: Not in FSF. */ /* Authorship: Ben Wing: Feb 2003. */ #include "backtrace.h" void mark_profiling_info (void); void profile_record_unwind (struct backtrace *); void profile_record_about_to_call (struct backtrace *); void profile_record_just_called (struct backtrace *); void profile_record_consing (EMACS_INT size); void profile_record_unconsing (EMACS_INT size); extern int profiling_active; /* We call about_to_call() and just_called() depending on the current *dynamic* value of profiling_active (which could change as a result of calling the function) but if we push a backtrace, we must pop it later, so we need to remember the status of this. */ #define PROFILE_DECLARE() \ int do_backtrace = profiling_active || backtrace_with_internal_sections; \ struct backtrace backtrace /* As just mentioned, we rely on the dynamic value of profiling_active. This ensures correct behavior (e.g. we never modify the profiling info when profiling is not active) because we seed and reap all functions currently on the stack when starting and stopping. See `start-profiling'. We check do_backtrace to make sure that the backtrace structure is initialised. If it isn't, we can enter a function with profiling turned off, and exit it with it turned on, with the consequence that an unitialised backtrace structure is passed to profile_record_just_called. Since do_backtrace is function-local (apart from in the garbage collector) this avoids that. */ #define PROFILE_ENTER_FUNCTION() \ do \ { \ if (profiling_active && do_backtrace) \ profile_record_about_to_call (&backtrace); \ } \ while (0) #define PROFILE_EXIT_FUNCTION() \ do \ { \ if (profiling_active && do_backtrace) \ profile_record_just_called (&backtrace); \ } \ while (0) /* We are entering a section that we would like to record profile information about. We put this information into the backtrace list, just like normal functions do. That is one easy way to make sure that we always record info on the innermost section or function, whether section or function. (To do this, we always need some sort of collusion between profile and eval; this is one way.) */ /* Or, we could call xzero() to zero the whole thing, and avoid four of the statements below; or we could create a global backtrace object, uninitialized (i.e. it will be initialized to all 0), and do structure copy to initialize. It's not clear it will make much difference here, but someone who really cared about counting cycles could implement it. */ #define PROFILE_RECORD_ENTERING_SECTION(var) \ do \ { \ if (do_backtrace) \ { \ backtrace.function = &var; \ backtrace.args = NULL; \ backtrace.nargs = UNEVALLED; \ backtrace.evalargs = 0; \ backtrace.pdlcount = specpdl_depth (); \ backtrace.debug_on_exit = 0; \ backtrace.function_being_called = 0; \ PUSH_BACKTRACE (backtrace); \ } \ PROFILE_ENTER_FUNCTION (); \ } while (0) #define PROFILE_RECORD_EXITING_SECTION(var) \ do \ { \ PROFILE_EXIT_FUNCTION (); \ if (do_backtrace) \ POP_BACKTRACE (backtrace); \ } while (0) #define RETURN_EXIT_PROFILING(tag, type, expr) \ do \ { \ type _ret_exitpr_ = (expr); \ PROFILE_RECORD_EXITING_SECTION (tag); \ RETURN_SANS_WARNINGS _ret_exitpr_; \ } while (0) #define RETURN_LISP_EXIT_PROFILING(tag, expr) \ RETURN_EXIT_PROFILING (tag, Lisp_Object, expr) #define RETURN_UNGCPRO_EXIT_PROFILING(tag, expr) \ do \ { \ Lisp_Object ret_ungc_val = (expr); \ UNGCPRO; \ PROFILE_RECORD_EXITING_SECTION (tag); \ RETURN_SANS_WARNINGS ret_ungc_val; \ } while (0) #ifdef DEBUG_XEMACS extern Lisp_Object QSin_temp_spot_1; extern Lisp_Object QSin_temp_spot_2; extern Lisp_Object QSin_temp_spot_3; extern Lisp_Object QSin_temp_spot_4; extern Lisp_Object QSin_temp_spot_5; #endif /* DEBUG_XEMACS */