rxvt-unicode/src/rxvtutil.h

#ifndef RXVT_UTIL_H
#define RXVT_UTIL_H

#include <cstdlib>
#include <cstring>

#define PP_CONCAT_(a, b) a ## b
#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
#define PP_STRINGIFY_(a) #a
#define PP_STRINGIFY(a) PP_STRINGIFY_(a)

// actually, some gcc-3.x versions work, too
#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
#define HAVE_GCC_BUILTINS 0

extern class byteorder {
  static unsigned int e; // at least 32 bits
public:
  byteorder ();

  static bool big_endian    () { return e == 0x11223344; };
  static bool network       () { return e == 0x11223344; };
  static bool little_endian () { return e == 0x44332211; };
  static bool vax           () { return e == 0x44332211; };
} byteorder;

// various utility functions
template<typename T, typename U> static inline T    min    (T  a, U b) { return a < (T)b ? a : (T)b; }
template<typename T, typename U> static inline void min_it (T &a, U b) {    a = a < (T)b ? a : (T)b; }
template<typename T, typename U> static inline T    max    (T  a, U b) { return a > (T)b ? a : (T)b; }
template<typename T, typename U> static inline void max_it (T &a, U b) {    a = a > (T)b ? a : (T)b; }

template<typename T, typename U, typename V> static inline T    clamp    (T  v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) {    v = v < (T)a ? a : v >(T)b ? b : v; }

template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }

// linear interpolation
template<typename T, typename U, typename P>
static inline
T lerp (T a, U b, P p)
{
  return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
}

// some bit functions, xft fuck me plenty
#if HAVE_GCC_BUILTINS
static inline int ctz      (unsigned int x) { return __builtin_ctz      (x); }
static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
#else
// count trailing zero bits and count # of one bits
int ctz      (unsigned int x);
int popcount (unsigned int x);
#endif

// in range including end
#define IN_RANGE_INC(val,beg,end) \
  ((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))

// in range excluding end
#define IN_RANGE_EXC(val,beg,end) \
  ((unsigned int)(val) - (unsigned int)(beg) <  (unsigned int)(end) - (unsigned int)(beg))

// makes dynamically allocated objects zero-initialised
struct zero_initialized {
  void *operator new (size_t s);
  void operator delete (void *p, size_t s);
};

/* simplevec taken (and heavily modified), from:
 * 
 *  MICO --- a free CORBA implementation
 *  Copyright (C) 1997-98 Kay Roemer & Arno Puder
 */
template<class T>
struct simplevec {
    typedef T* iterator;
    typedef const T* const_iterator;
    typedef unsigned long size_type;

private:
    size_type _last, _size;
    T *_buf;

public:
    const_iterator begin () const
    {
        return &_buf[0];
    }
    iterator begin ()
    {
        return &_buf[0];
    }
    const_iterator end () const
    {
        return &_buf[_last];
    }
    iterator end ()
    {
        return &_buf[_last];
    }
    size_type capacity () const
    {
        return _size;
    }
    size_type size () const
    {
        return _last;
    }

private:
    static T *alloc (size_type n)
    {
        return (T *)::operator new ((size_t) (n * sizeof (T)));
    }
    static void dealloc (T *buf)
    {
        if (buf)
            ::operator delete (buf);
    }

    void reserve (iterator where, size_type n)
    {
        if (_last + n <= _size) {
            memmove (where+n, where, (end ()-where)*sizeof (T));
        } else {
            size_type sz = _last+n;
            sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
            T *nbuf = alloc (sz);
            if (_buf) {
                memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
                memcpy (nbuf + (where-begin ()) + n, where,
                        (end ()-where)*sizeof (T));
                dealloc (_buf);
            }
            _buf = nbuf;
            _size = sz;
        }
    }

public:
    void reserve (size_type sz)
    {
        if (_size < sz) {
            sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
            T *nbuf = alloc (sz);
            if (_buf) {
                memcpy (nbuf, begin (), size ()*sizeof (T));
                dealloc (_buf);
            }
            _buf = nbuf;
            _size = sz;
        }
    }
    simplevec ()
    : _last(0), _size(0), _buf(0)
    {
    }
    simplevec (size_type n, const T& t = T ())
    : _last(0), _size(0), _buf(0)
    {
        insert (begin (), n, t);
    }
    simplevec (const_iterator first, const_iterator last)
    : _last(0), _size(0), _buf(0)
    {
        insert (begin (), first, last);
    }
    simplevec (const simplevec<T> &v)
    : _last(0), _size(0), _buf(0)
    {
        reserve (v._last);
        memcpy (_buf, v.begin (), v.size ()*sizeof (T));
        _last = v._last;
    }
    simplevec<T> &operator= (const simplevec<T> &v)
    {
        if (this != &v) {
            _last = 0;
            reserve (v._last);
            memcpy (_buf, v.begin (), v.size ()*sizeof (T));
            _last = v._last;
        }
        return *this;
    }
    ~simplevec ()
    {
        dealloc (_buf);
    }
    const T &front () const
    {
        //ministl_assert (size () > 0);
        return _buf[0];
    }
    T &front ()
    {
        //ministl_assert (size () > 0);
        return _buf[0];
    }
    const T &back () const
    {
        //ministl_assert (size () > 0);
        return _buf[_last-1];
    }
    T &back ()
    {
        //ministl_assert (size () > 0);
        return _buf[_last-1];
    }
    bool empty () const
    {
        return _last == 0;
    }
    void clear ()
    {
        _last = 0;
    }
    void push_back (const T &t)
    {
        reserve (_last+1);
        *end () = t;
        ++_last;
    }
    void push_back (T &t)
    {
        reserve (_last+1);
        *end () = t;
        ++_last;
    }
    void pop_back ()
    {
        //ministl_assert (size () > 0);
        --_last;
    }
    const T &operator[] (size_type idx) const
    {
        //ministl_assert (idx < size ());
        return _buf[idx];
    }
    T &operator[] (size_type idx)
    {
        //ministl_assert (idx < size ());
        return _buf[idx];
    }
    iterator insert (iterator pos, const T &t)
    {
        //ministl_assert (pos <= end ());
        long at = pos - begin ();
        reserve (pos, 1);
        pos = begin ()+at;
        *pos = t;
        ++_last;
        return pos;
    }
    iterator insert (iterator pos, const_iterator first, const_iterator last)
    {
        //ministl_assert (pos <= end ());
        long n = last - first;
        long at = pos - begin ();
        if (n > 0) {
            reserve (pos, n);
            pos = begin ()+at;
            memcpy (pos, first, (last-first)*sizeof (T));
            _last += n;
        }
        return pos;
    }
    iterator insert (iterator pos, size_type n, const T &t)
    {
        //ministl_assert (pos <= end ());
        long at = pos - begin ();
        if (n > 0) {
            reserve (pos, n);
            pos = begin ()+at;
            for (int i = 0; i < n; ++i)
                pos[i] = t;
            _last += n;
        }
        return pos;
    }
    void erase (iterator first, iterator last)
    {
        if (last != first) {
            memmove (first, last, (end () - last) * sizeof (T));
            _last -= last - first;
        }
    }
    void erase (iterator pos)
    {
        if (pos != end ()) {
            memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
            --_last;
        }
    }
    void swap (simplevec<T> &t)
    {
        ::swap(_last, t._last);
        ::swap(_size, t._size);
        ::swap(_buf, t._buf);
    }
};

template<class T>
bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
{
    if (v1.size () != v2.size ())
        return false;
    return !v1.size () || !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
}

template<class T>
bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
{
    unsigned long minlast = min (v1.size (), v2.size ());
    for (unsigned long i = 0; i < minlast; ++i) {
        if (v1[i] < v2[i])
            return true;
        if (v2[i] < v1[i])
            return false;
    }
    return v1.size () < v2.size ();
}


template<typename T>
struct vector : simplevec<T>
{ };

#if 0
template<typename T>
struct rxvt_vec : simplevec<void *> {
  typedef T *iterator;

  void push_back (T d) { simplevec<void *>::push_back ((void *)d); }
  T pop_back () { return (T*)simplevec<void *>::pop_back (); }
  void erase (int i) { erase (begin () + i); }
  void erase (iterator i) { simplevec<void *>::erase ((void **)i); }
  iterator begin () const { return (iterator)simplevec<void *>::begin (); }
  iterator end () const { return (iterator)simplevec<void *>::end (); }
  T &operator [] (int i) { return * (T *) (& ((* (simplevec<void *> *)this)[i])); }
  const T &operator [] (int i) const { return * (const T *) (& ((* (const simplevec<void *> *)this)[i])); }
};
#endif

template <typename I, typename T>
I find (I first, I last, const T& value)
{
  while (first != last && *first != value)
    ++first;

  return first;
}

template<typename T>
struct auto_ptr {
  T *p;

  auto_ptr () : p (0) { }
  auto_ptr (T *a) : p (a) { }

  auto_ptr (auto_ptr<T> &a)
  {
    p = a.p;
    a.p = 0;
  }

  template<typename A>
  auto_ptr (auto_ptr<A> &a)
  {
    p = a.p;
    a.p = 0;
  }

  ~auto_ptr ()
  {
    delete p;
  }

  // void because it makes sense in our context
  void operator = (T *a)
  {
    delete p;
    p = a;
  }

  void operator = (auto_ptr &a)
  {
    *this = a.p;
    a.p = 0;
  }

  template<typename A>
  void operator = (auto_ptr<A> &a)
  {
    *this = a.p;
    a.p = 0;
  }

  operator T * () const { return p; }

  T *operator -> () const { return p; }
  T &operator * () const { return *p; }

  T *get ()
  {
    T *r = p;
    p = 0;
    return r;
  }
};

typedef auto_ptr<char> auto_str;

struct stringvec : simplevec<char *>
{
  ~stringvec ()
  {
    for (char **c = begin (); c != end (); c++)
      free (*c);
  }
};

// return a very temporary (and never deallocated) buffer. keep small.
void *rxvt_temp_buf (int len);

template<typename T>
inline T *
rxvt_temp_buf (int len)
{
  return (T *)rxvt_temp_buf (len * sizeof (T));
}

#endif

Revision:	1.22
Committed:	Sun Jan 29 22:27:04 2006 UTC (18 years, 3 months ago) by root
Content type:	text/plain
Branch:	MAIN
Changes since 1.21:	+14 -0 lines
Log Message:	* empty log message *
#	User	Rev	Content
1	root	1.1	#ifndef RXVT_UTIL_H
2			#define RXVT_UTIL_H
3
4	root	1.19	#include <cstdlib>
5	root	1.4	#include <cstring>
6
7	root	1.15	#define PP_CONCAT_(a, b) a ## b
8			#define PP_CONCAT(a, b) PP_CONCAT_(a, b)
9			#define PP_STRINGIFY_(a) #a
10			#define PP_STRINGIFY(a) PP_STRINGIFY_(a)
11
12	root	1.22	// actually, some gcc-3.x versions work, too
13			#define HAVE_GCC_BUILTINS (__GNUC__ >= 4)
14			#define HAVE_GCC_BUILTINS 0
15
16	root	1.1	extern class byteorder {
17			static unsigned int e; // at least 32 bits
18			public:
19			byteorder ();
20
21			static bool big_endian () { return e == 0x11223344; };
22			static bool network () { return e == 0x11223344; };
23			static bool little_endian () { return e == 0x44332211; };
24			static bool vax () { return e == 0x44332211; };
25			} byteorder;
26
27	root	1.16	// various utility functions
28	root	1.13	template<typename T, typename U> static inline T min (T a, U b) { return a < (T)b ? a : (T)b; }
29			template<typename T, typename U> static inline void min_it (T &a, U b) { a = a < (T)b ? a : (T)b; }
30			template<typename T, typename U> static inline T max (T a, U b) { return a > (T)b ? a : (T)b; }
31			template<typename T, typename U> static inline void max_it (T &a, U b) { a = a > (T)b ? a : (T)b; }
32
33			template<typename T, typename U, typename V> static inline T clamp (T v, U a, V b) { return v < (T)a ? a : v >(T)b ? b : v; }
34			template<typename T, typename U, typename V> static inline void clamp_it (T &v, U a, V b) { v = v < (T)a ? a : v >(T)b ? b : v; }
35
36	root	1.14	template<typename T, typename U> static inline void swap (T& a, U& b) { T t=a; a=(T)b; b=(U)t; }
37	root	1.8
38	root	1.21	// linear interpolation
39			template<typename T, typename U, typename P>
40			static inline
41			T lerp (T a, U b, P p)
42			{
43			return (int(a) * int(p) + int(b) * int(100 - p)) / 100;
44			}
45
46	root	1.22	// some bit functions, xft fuck me plenty
47			#if HAVE_GCC_BUILTINS
48			static inline int ctz (unsigned int x) { return __builtin_ctz (x); }
49			static inline int popcount (unsigned int x) { return __builtin_popcount (x); }
50			#else
51			// count trailing zero bits and count # of one bits
52			int ctz (unsigned int x);
53			int popcount (unsigned int x);
54			#endif
55
56	root	1.11	// in range including end
57			#define IN_RANGE_INC(val,beg,end) \
58	root	1.9	((unsigned int)(val) - (unsigned int)(beg) <= (unsigned int)(end) - (unsigned int)(beg))
59	root	1.1
60	root	1.11	// in range excluding end
61			#define IN_RANGE_EXC(val,beg,end) \
62			((unsigned int)(val) - (unsigned int)(beg) < (unsigned int)(end) - (unsigned int)(beg))
63
64	root	1.16	// makes dynamically allocated objects zero-initialised
65	root	1.4	struct zero_initialized {
66			void *operator new (size_t s);
67			void operator delete (void *p, size_t s);
68			};
69
70			/* simplevec taken (and heavily modified), from:
71			*
72			* MICO --- a free CORBA implementation
73			* Copyright (C) 1997-98 Kay Roemer & Arno Puder
74			*/
75			template<class T>
76			struct simplevec {
77			typedef T* iterator;
78			typedef const T* const_iterator;
79			typedef unsigned long size_type;
80
81			private:
82			size_type _last, _size;
83			T *_buf;
84
85			public:
86			const_iterator begin () const
87			{
88	root	1.8	return &_buf[0];
89	root	1.4	}
90			iterator begin ()
91			{
92	root	1.8	return &_buf[0];
93	root	1.4	}
94			const_iterator end () const
95			{
96	root	1.8	return &_buf[_last];
97	root	1.4	}
98			iterator end ()
99			{
100	root	1.8	return &_buf[_last];
101	root	1.4	}
102			size_type capacity () const
103			{
104	root	1.8	return _size;
105	root	1.4	}
106			size_type size () const
107			{
108	root	1.8	return _last;
109	root	1.4	}
110
111			private:
112			static T *alloc (size_type n)
113			{
114	root	1.8	return (T )::operator new ((size_t) (n sizeof (T)));
115	root	1.4	}
116			static void dealloc (T *buf)
117			{
118	root	1.8	if (buf)
119			::operator delete (buf);
120	root	1.4	}
121
122			void reserve (iterator where, size_type n)
123			{
124	root	1.8	if (_last + n <= _size) {
125			memmove (where+n, where, (end ()-where)*sizeof (T));
126			} else {
127			size_type sz = _last+n;
128			sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
129			T *nbuf = alloc (sz);
130			if (_buf) {
131			memcpy (nbuf, begin (), (where-begin ())*sizeof (T));
132			memcpy (nbuf + (where-begin ()) + n, where,
133			(end ()-where)*sizeof (T));
134			dealloc (_buf);
135			}
136			_buf = nbuf;
137			_size = sz;
138			}
139	root	1.4	}
140
141			public:
142			void reserve (size_type sz)
143			{
144	root	1.8	if (_size < sz) {
145			sz = (_size == 0) ? max (sz, 5) : max (sz, 2*_size);
146			T *nbuf = alloc (sz);
147			if (_buf) {
148			memcpy (nbuf, begin (), size ()*sizeof (T));
149			dealloc (_buf);
150			}
151			_buf = nbuf;
152			_size = sz;
153			}
154	root	1.4	}
155			simplevec ()
156			: _last(0), _size(0), _buf(0)
157			{
158			}
159			simplevec (size_type n, const T& t = T ())
160			: _last(0), _size(0), _buf(0)
161			{
162	root	1.8	insert (begin (), n, t);
163	root	1.4	}
164			simplevec (const_iterator first, const_iterator last)
165			: _last(0), _size(0), _buf(0)
166			{
167	root	1.8	insert (begin (), first, last);
168	root	1.4	}
169			simplevec (const simplevec<T> &v)
170			: _last(0), _size(0), _buf(0)
171			{
172	root	1.8	reserve (v._last);
173			memcpy (_buf, v.begin (), v.size ()*sizeof (T));
174			_last = v._last;
175	root	1.4	}
176			simplevec<T> &operator= (const simplevec<T> &v)
177			{
178	root	1.8	if (this != &v) {
179			_last = 0;
180			reserve (v._last);
181			memcpy (_buf, v.begin (), v.size ()*sizeof (T));
182			_last = v._last;
183			}
184	root	1.4	return *this;
185			}
186			~simplevec ()
187			{
188	root	1.8	dealloc (_buf);
189	root	1.4	}
190			const T &front () const
191			{
192	root	1.8	//ministl_assert (size () > 0);
193			return _buf[0];
194	root	1.4	}
195			T &front ()
196			{
197	root	1.8	//ministl_assert (size () > 0);
198			return _buf[0];
199	root	1.4	}
200			const T &back () const
201			{
202	root	1.8	//ministl_assert (size () > 0);
203			return _buf[_last-1];
204	root	1.4	}
205			T &back ()
206			{
207	root	1.8	//ministl_assert (size () > 0);
208			return _buf[_last-1];
209	root	1.4	}
210			bool empty () const
211			{
212	root	1.8	return _last == 0;
213	root	1.4	}
214			void clear ()
215			{
216	root	1.8	_last = 0;
217	root	1.4	}
218			void push_back (const T &t)
219			{
220	root	1.8	reserve (_last+1);
221			*end () = t;
222			++_last;
223	root	1.4	}
224			void push_back (T &t)
225			{
226	root	1.8	reserve (_last+1);
227			*end () = t;
228			++_last;
229	root	1.4	}
230			void pop_back ()
231			{
232	root	1.8	//ministl_assert (size () > 0);
233			--_last;
234	root	1.4	}
235			const T &operator[] (size_type idx) const
236			{
237	root	1.8	//ministl_assert (idx < size ());
238			return _buf[idx];
239	root	1.4	}
240			T &operator[] (size_type idx)
241			{
242	root	1.8	//ministl_assert (idx < size ());
243			return _buf[idx];
244	root	1.4	}
245			iterator insert (iterator pos, const T &t)
246			{
247	root	1.8	//ministl_assert (pos <= end ());
248			long at = pos - begin ();
249			reserve (pos, 1);
250			pos = begin ()+at;
251			*pos = t;
252			++_last;
253			return pos;
254	root	1.4	}
255			iterator insert (iterator pos, const_iterator first, const_iterator last)
256			{
257			//ministl_assert (pos <= end ());
258	root	1.8	long n = last - first;
259			long at = pos - begin ();
260			if (n > 0) {
261			reserve (pos, n);
262			pos = begin ()+at;
263			memcpy (pos, first, (last-first)*sizeof (T));
264			_last += n;
265			}
266			return pos;
267	root	1.4	}
268			iterator insert (iterator pos, size_type n, const T &t)
269			{
270			//ministl_assert (pos <= end ());
271	root	1.8	long at = pos - begin ();
272			if (n > 0) {
273			reserve (pos, n);
274			pos = begin ()+at;
275			for (int i = 0; i < n; ++i)
276			pos[i] = t;
277			_last += n;
278			}
279			return pos;
280	root	1.4	}
281			void erase (iterator first, iterator last)
282			{
283	root	1.8	if (last != first) {
284	root	1.18	memmove (first, last, (end () - last) * sizeof (T));
285	root	1.8	_last -= last - first;
286			}
287	root	1.4	}
288			void erase (iterator pos)
289			{
290			if (pos != end ()) {
291	root	1.18	memmove (pos, pos+1, (end () - (pos+1)) * sizeof (T));
292	root	1.4	--_last;
293			}
294			}
295	root	1.8	void swap (simplevec<T> &t)
296			{
297			::swap(_last, t._last);
298			::swap(_size, t._size);
299			::swap(_buf, t._buf);
300			}
301	root	1.4	};
302
303			template<class T>
304			bool operator== (const simplevec<T> &v1, const simplevec<T> &v2)
305			{
306			if (v1.size () != v2.size ())
307	root	1.8	return false;
308	root	1.4	return !v1.size () \|\| !memcmp (&v1[0], &v2[0], v1.size ()*sizeof (T));
309			}
310
311			template<class T>
312			bool operator< (const simplevec<T> &v1, const simplevec<T> &v2)
313			{
314			unsigned long minlast = min (v1.size (), v2.size ());
315			for (unsigned long i = 0; i < minlast; ++i) {
316			if (v1[i] < v2[i])
317	root	1.8	return true;
318			if (v2[i] < v1[i])
319			return false;
320	root	1.4	}
321			return v1.size () < v2.size ();
322			}
323
324	root	1.1
325			template<typename T>
326			struct vector : simplevec<T>
327			{ };
328
329			#if 0
330			template<typename T>
331			struct rxvt_vec : simplevec<void *> {
332			typedef T *iterator;
333
334			void push_back (T d) { simplevec<void >::push_back ((void )d); }
335			T pop_back () { return (T)simplevec<void >::pop_back (); }
336			void erase (int i) { erase (begin () + i); }
337			void erase (iterator i) { simplevec<void >::erase ((void *)i); }
338			iterator begin () const { return (iterator)simplevec<void *>::begin (); }
339			iterator end () const { return (iterator)simplevec<void *>::end (); }
340			T &operator [] (int i) { return * (T ) (& (( (simplevec<void > )this)[i])); }
341			const T &operator [] (int i) const { return * (const T ) (& (( (const simplevec<void > )this)[i])); }
342			};
343			#endif
344
345			template <typename I, typename T>
346			I find (I first, I last, const T& value)
347			{
348			while (first != last && *first != value)
349			++first;
350
351			return first;
352			}
353
354			template<typename T>
355			struct auto_ptr {
356			T *p;
357
358			auto_ptr () : p (0) { }
359			auto_ptr (T *a) : p (a) { }
360
361			auto_ptr (auto_ptr<T> &a)
362			{
363			p = a.p;
364			a.p = 0;
365			}
366
367			template<typename A>
368			auto_ptr (auto_ptr<A> &a)
369			{
370			p = a.p;
371			a.p = 0;
372			}
373
374			~auto_ptr ()
375			{
376			delete p;
377			}
378
379			// void because it makes sense in our context
380			void operator = (T *a)
381			{
382			delete p;
383			p = a;
384			}
385
386			void operator = (auto_ptr &a)
387			{
388			*this = a.p;
389			a.p = 0;
390			}
391
392			template<typename A>
393			void operator = (auto_ptr<A> &a)
394			{
395			*this = a.p;
396			a.p = 0;
397			}
398
399			operator T * () const { return p; }
400
401			T *operator -> () const { return p; }
402			T &operator * () const { return *p; }
403
404			T *get ()
405			{
406			T *r = p;
407			p = 0;
408			return r;
409			}
410			};
411
412			typedef auto_ptr<char> auto_str;
413
414			struct stringvec : simplevec<char *>
415			{
416			~stringvec ()
417			{
418			for (char **c = begin (); c != end (); c++)
419	root	1.19	free (*c);
420	root	1.1	}
421			};
422	root	1.3
423	root	1.20	// return a very temporary (and never deallocated) buffer. keep small.
424			void *rxvt_temp_buf (int len);
425
426			template<typename T>
427			inline T *
428			rxvt_temp_buf (int len)
429			{
430			return (T )rxvt_temp_buf (len sizeof (T));
431			}
432
433	root	1.1	#endif
434