Mercurial > hg > xemacs-beta

comparison src/fns.c @ 2286:04bc9d2f42c7

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[xemacs-hg @ 2004-09-20 19:18:55 by james] Mark all unused parameters as unused. Also eliminate some unneeded local variables.
author james
date Mon, 20 Sep 2004 19:20:08 +0000
parents 61855263cb07
children ecf1ebac70d8
comparison
equal deleted inserted replaced
2285:914c5afaac33 2286:04bc9d2f42c7
63 63
64 static int internal_old_equal (Lisp_Object, Lisp_Object, int); 64 static int internal_old_equal (Lisp_Object, Lisp_Object, int);
65 Lisp_Object safe_copy_tree (Lisp_Object arg, Lisp_Object vecp, int depth); 65 Lisp_Object safe_copy_tree (Lisp_Object arg, Lisp_Object vecp, int depth);
66 66
67 static Lisp_Object 67 static Lisp_Object
68 mark_bit_vector (Lisp_Object obj) 68 mark_bit_vector (Lisp_Object UNUSED (obj))
69 { 69 {
70 return Qnil; 70 return Qnil;
71 } 71 }
72 72
73 static void 73 static void
74 print_bit_vector (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag) 74 print_bit_vector (Lisp_Object obj, Lisp_Object printcharfun,
75 int UNUSED (escapeflag))
75 { 76 {
76 Elemcount i; 77 Elemcount i;
77 Lisp_Bit_Vector *v = XBIT_VECTOR (obj); 78 Lisp_Bit_Vector *v = XBIT_VECTOR (obj);
78 Elemcount len = bit_vector_length (v); 79 Elemcount len = bit_vector_length (v);
79 Elemcount last = len; 80 Elemcount last = len;
92 if (last != len) 93 if (last != len)
93 write_c_string (printcharfun, "..."); 94 write_c_string (printcharfun, "...");
94 } 95 }
95 96
96 static int 97 static int
97 bit_vector_equal (Lisp_Object obj1, Lisp_Object obj2, int depth) 98 bit_vector_equal (Lisp_Object obj1, Lisp_Object obj2, int UNUSED (depth))
98 { 99 {
99 Lisp_Bit_Vector *v1 = XBIT_VECTOR (obj1); 100 Lisp_Bit_Vector *v1 = XBIT_VECTOR (obj1);
100 Lisp_Bit_Vector *v2 = XBIT_VECTOR (obj2); 101 Lisp_Bit_Vector *v2 = XBIT_VECTOR (obj2);
101 102
102 return ((bit_vector_length (v1) == bit_vector_length (v2)) && 103 return ((bit_vector_length (v1) == bit_vector_length (v2)) &&
104 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v1)) * 105 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v1)) *
105 sizeof (long))); 106 sizeof (long)));
106 } 107 }
107 108
108 static Hashcode 109 static Hashcode
109 bit_vector_hash (Lisp_Object obj, int depth) 110 bit_vector_hash (Lisp_Object obj, int UNUSED (depth))
110 { 111 {
111 Lisp_Bit_Vector *v = XBIT_VECTOR (obj); 112 Lisp_Bit_Vector *v = XBIT_VECTOR (obj);
112 return HASH2 (bit_vector_length (v), 113 return HASH2 (bit_vector_length (v),
113 memory_hash (v->bits, 114 memory_hash (v->bits,
114 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v)) * 115 BIT_VECTOR_LONG_STORAGE (bit_vector_length (v)) *