summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authordkf <donal.k.fellows@manchester.ac.uk>2010-02-28 21:15:11 (GMT)
committerdkf <donal.k.fellows@manchester.ac.uk>2010-02-28 21:15:11 (GMT)
commit1592955d3d971dec6ac19643471d60ecb1240bab (patch)
treed731ea1d34e12d5a83506df0655a068b89194bde
parent294846060a28508a5a5c4d42a5b1dd7770b7f4c7 (diff)
downloadtcl-1592955d3d971dec6ac19643471d60ecb1240bab.zip
tcl-1592955d3d971dec6ac19643471d60ecb1240bab.tar.gz
tcl-1592955d3d971dec6ac19643471d60ecb1240bab.tar.bz2
Oops! [Bug 2960852]
-rw-r--r--generic/tclCmdIL.c21
1 files changed, 12 insertions, 9 deletions
diff --git a/generic/tclCmdIL.c b/generic/tclCmdIL.c
index 2a4a260..85f9696 100644
--- a/generic/tclCmdIL.c
+++ b/generic/tclCmdIL.c
@@ -16,7 +16,7 @@
* See the file "license.terms" for information on usage and redistribution of
* this file, and for a DISCLAIMER OF ALL WARRANTIES.
*
- * RCS: @(#) $Id: tclCmdIL.c,v 1.178 2010/02/28 20:12:48 dkf Exp $
+ * RCS: @(#) $Id: tclCmdIL.c,v 1.179 2010/02/28 21:15:11 dkf Exp $
*/
#include "tclInt.h"
@@ -977,7 +977,8 @@ InfoDefaultCmd(
procPtr = TclFindProc(iPtr, procName);
if (procPtr == NULL) {
Tcl_AppendResult(interp, "\"", procName, "\" isn't a procedure",NULL);
- Tcl_SetErrorCode(interp, "TCL", "LOOKUP", "PROCEDURE", name, NULL);
+ Tcl_SetErrorCode(interp, "TCL", "LOOKUP", "PROCEDURE", procName,
+ NULL);
return TCL_ERROR;
}
@@ -1133,7 +1134,7 @@ InfoFrameCmd(
Tcl_AppendResult(interp, "bad level \"", TclGetString(objv[1]), "\"",
NULL);
Tcl_SetErrorCode(interp, "TCL", "LOOKUP", "STACK_FRAME",
- TclGetString(obj[1]), NULL);
+ TclGetString(objv[1]), NULL);
return TCL_ERROR;
}
@@ -3995,12 +3996,14 @@ Tcl_LsortObjCmd(
* "repeated" elements in each of the left and right lists. In that case,
* if any element of the left list is equivalent to one in the right list
* it is omitted from the merged list.
- * This simplified mechanism works because of the special way
- * our MergeSort creates the sublists to be merged and will fail to
- * eliminate all repeats in the general case where they are already
- * present in either the left or right list. A general code would need to
- * skip adjacent initial repeats in the left and right lists before
- * comparing their initial elements, at each step.
+ *
+ * This simplified mechanism works because of the special way our
+ * MergeSort creates the sublists to be merged and will fail to eliminate
+ * all repeats in the general case where they are already present in
+ * either the left or right list. A general code would need to skip
+ * adjacent initial repeats in the left and right lists before comparing
+ * their initial elements, at each step.
+ *
*----------------------------------------------------------------------
*/