thread.c revision 1.1 1 1.1 christos /* $NetBSD: thread.c,v 1.1 2006/11/28 18:45:32 christos Exp $ */
2 1.1 christos
3 1.1 christos /*-
4 1.1 christos * Copyright (c) 2006 The NetBSD Foundation, Inc.
5 1.1 christos * All rights reserved.
6 1.1 christos *
7 1.1 christos * This code is derived from software contributed to The NetBSD Foundation
8 1.1 christos * by Anon Ymous.
9 1.1 christos *
10 1.1 christos * Redistribution and use in source and binary forms, with or without
11 1.1 christos * modification, are permitted provided that the following conditions
12 1.1 christos * are met:
13 1.1 christos * 1. Redistributions of source code must retain the above copyright
14 1.1 christos * notice, this list of conditions and the following disclaimer.
15 1.1 christos * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 christos * notice, this list of conditions and the following disclaimer in the
17 1.1 christos * documentation and/or other materials provided with the distribution.
18 1.1 christos * 3. All advertising materials mentioning features or use of this software
19 1.1 christos * must display the following acknowledgement:
20 1.1 christos * This product includes software developed by the NetBSD
21 1.1 christos * Foundation, Inc. and its contributors.
22 1.1 christos * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.1 christos * contributors may be used to endorse or promote products derived
24 1.1 christos * from this software without specific prior written permission.
25 1.1 christos *
26 1.1 christos * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.1 christos * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.1 christos * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.1 christos * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.1 christos * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.1 christos * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.1 christos * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.1 christos * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.1 christos * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.1 christos * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.1 christos * POSSIBILITY OF SUCH DAMAGE.
37 1.1 christos */
38 1.1 christos
39 1.1 christos /*
40 1.1 christos * This module contains the threading and sorting routines.
41 1.1 christos */
42 1.1 christos
43 1.1 christos #ifdef THREAD_SUPPORT
44 1.1 christos
45 1.1 christos #include <sys/cdefs.h>
46 1.1 christos #ifndef __lint__
47 1.1 christos __RCSID("$NetBSD: thread.c,v 1.1 2006/11/28 18:45:32 christos Exp $");
48 1.1 christos #endif /* not __lint__ */
49 1.1 christos
50 1.1 christos #include <assert.h>
51 1.1 christos #include <ctype.h>
52 1.1 christos #include <stdio.h>
53 1.1 christos #include <stdlib.h>
54 1.1 christos #include <util.h>
55 1.1 christos
56 1.1 christos #include "def.h"
57 1.1 christos #include "glob.h"
58 1.1 christos #include "extern.h"
59 1.1 christos #include "format.h"
60 1.1 christos #include "thread.h"
61 1.1 christos
62 1.1 christos
63 1.1 christos struct thread_s {
64 1.1 christos struct message *t_head; /* head of the thread */
65 1.1 christos struct message **t_msgtbl; /* message array indexed by msgnum */
66 1.1 christos int t_msgCount; /* count of messages in thread */
67 1.1 christos };
68 1.1 christos #define THREAD_INIT {NULL, NULL, 0}
69 1.1 christos
70 1.1 christos typedef int state_t;
71 1.1 christos #define S_STATE_INIT 0
72 1.1 christos #define S_EXPOSE 1 /* flag to expose the thread */
73 1.1 christos #define S_RESTRICT 2 /* flag to restrict to tagged messages */
74 1.1 christos #define S_IS_EXPOSE(a) ((a) & S_EXPOSE)
75 1.1 christos #define S_IS_RESTRICT(a) ((a) & S_RESTRICT)
76 1.1 christos
77 1.1 christos /* XXX - this isn't really a thread */
78 1.1 christos static struct thread_s message_array = THREAD_INIT; /* the basic message array */
79 1.1 christos static struct thread_s current_thread = THREAD_INIT; /* the current thread */
80 1.1 christos
81 1.1 christos static state_t state = S_STATE_INIT; /* the current state */
82 1.1 christos
83 1.1 christos /*
84 1.1 christos * A state hook used by the format module.
85 1.1 christos */
86 1.1 christos PUBLIC int
87 1.1 christos thread_hidden(void)
88 1.1 christos {
89 1.1 christos return !S_IS_EXPOSE(state);
90 1.1 christos }
91 1.1 christos
92 1.1 christos /************************************************************************
93 1.1 christos * Debugging stuff that should evaporate eventually.
94 1.1 christos */
95 1.1 christos #ifdef THREAD_DEBUG
96 1.1 christos static void
97 1.1 christos show_msg(struct message *mp)
98 1.1 christos {
99 1.1 christos if (mp == NULL)
100 1.1 christos return;
101 1.1 christos /*
102 1.1 christos * Arg! '%p' doesn't like the '0' modifier.
103 1.1 christos */
104 1.1 christos (void)printf("%3d (0x%08x):"
105 1.1 christos " flink=0x%08x blink=0x%08x clink=0x%08x plink=0x%08x"
106 1.1 christos " depth=%d flags=0x%03x\n",
107 1.1 christos mp->m_index,
108 1.1 christos (unsigned)mp,
109 1.1 christos (unsigned)mp->m_flink,
110 1.1 christos (unsigned)mp->m_blink,
111 1.1 christos (unsigned)mp->m_clink,
112 1.1 christos (unsigned)mp->m_plink,
113 1.1 christos mp->m_depth,
114 1.1 christos mp->m_flag);
115 1.1 christos }
116 1.1 christos
117 1.1 christos #ifndef __lint__
118 1.1 christos __unused
119 1.1 christos static void
120 1.1 christos show_thread(struct message *mp)
121 1.1 christos {
122 1.1 christos (void)printf("current_thread.t_head=%p\n", current_thread.t_head);
123 1.1 christos for (/*EMPTY*/; mp; mp = next_message(mp))
124 1.1 christos show_msg(mp);
125 1.1 christos }
126 1.1 christos #endif
127 1.1 christos
128 1.1 christos PUBLIC int
129 1.1 christos thread_showcmd(void *v)
130 1.1 christos {
131 1.1 christos int *ip;
132 1.1 christos
133 1.1 christos (void)printf("current_thread.t_head=%p\n", current_thread.t_head);
134 1.1 christos for (ip = v; *ip; ip++)
135 1.1 christos show_msg(get_message(*ip));
136 1.1 christos
137 1.1 christos return 0;
138 1.1 christos }
139 1.1 christos #endif /* THREAD_DEBUG */
140 1.1 christos
141 1.1 christos /*************************************************************************
142 1.1 christos * tag/restrict routines
143 1.1 christos */
144 1.1 christos
145 1.1 christos /*
146 1.1 christos * Return TRUE iff all messages forward or below this one are tagged.
147 1.1 christos */
148 1.1 christos static int
149 1.1 christos is_tagged_core(struct message *mp)
150 1.1 christos {
151 1.1 christos for (/*EMPTY*/; mp; mp = mp->m_flink)
152 1.1 christos if ((mp->m_flag & MTAGGED) == 0 ||
153 1.1 christos is_tagged_core(mp->m_clink) == 0)
154 1.1 christos return 0;
155 1.1 christos return 1;
156 1.1 christos }
157 1.1 christos
158 1.1 christos static int
159 1.1 christos is_tagged(struct message *mp)
160 1.1 christos {
161 1.1 christos return (mp->m_flag & MTAGGED) && is_tagged_core(mp->m_clink);
162 1.1 christos }
163 1.1 christos
164 1.1 christos /************************************************************************
165 1.1 christos * These are the core routines to access messages via the links used
166 1.1 christos * everywhere outside this module and fio.c.
167 1.1 christos */
168 1.1 christos
169 1.1 christos static int
170 1.1 christos has_parent(struct message *mp)
171 1.1 christos {
172 1.1 christos return mp->m_plink != NULL &&
173 1.1 christos mp->m_plink->m_clink != current_thread.t_head;
174 1.1 christos }
175 1.1 christos
176 1.1 christos static struct message *
177 1.1 christos next_message1(struct message *mp)
178 1.1 christos {
179 1.1 christos if (mp == NULL)
180 1.1 christos return NULL;
181 1.1 christos
182 1.1 christos if (S_IS_EXPOSE(state) == 0)
183 1.1 christos return mp->m_flink;
184 1.1 christos
185 1.1 christos if (mp->m_clink)
186 1.1 christos return mp->m_clink;
187 1.1 christos
188 1.1 christos while (mp->m_flink == NULL && has_parent(mp))
189 1.1 christos mp = mp->m_plink;
190 1.1 christos
191 1.1 christos return mp->m_flink;
192 1.1 christos }
193 1.1 christos
194 1.1 christos static struct message *
195 1.1 christos prev_message1(struct message *mp)
196 1.1 christos {
197 1.1 christos if (mp == NULL)
198 1.1 christos return NULL;
199 1.1 christos
200 1.1 christos if (S_IS_EXPOSE(state) && mp->m_blink == NULL && has_parent(mp))
201 1.1 christos return mp->m_plink;
202 1.1 christos
203 1.1 christos return mp->m_blink;
204 1.1 christos }
205 1.1 christos
206 1.1 christos PUBLIC struct message *
207 1.1 christos next_message(struct message *mp)
208 1.1 christos {
209 1.1 christos if (S_IS_RESTRICT(state) == 0)
210 1.1 christos return next_message1(mp);
211 1.1 christos
212 1.1 christos while ((mp = next_message1(mp)) != NULL && is_tagged(mp))
213 1.1 christos continue;
214 1.1 christos
215 1.1 christos return mp;
216 1.1 christos }
217 1.1 christos
218 1.1 christos PUBLIC struct message *
219 1.1 christos prev_message(struct message *mp)
220 1.1 christos {
221 1.1 christos if (S_IS_RESTRICT(state) == 0)
222 1.1 christos return prev_message1(mp);
223 1.1 christos
224 1.1 christos while ((mp = prev_message1(mp)) != NULL && is_tagged(mp))
225 1.1 christos continue;
226 1.1 christos
227 1.1 christos return mp;
228 1.1 christos }
229 1.1 christos
230 1.1 christos static struct message *
231 1.1 christos first_message(struct message *mp)
232 1.1 christos {
233 1.1 christos if (S_IS_RESTRICT(state) && is_tagged(mp))
234 1.1 christos mp = next_message(mp);
235 1.1 christos return mp;
236 1.1 christos }
237 1.1 christos
238 1.1 christos PUBLIC struct message *
239 1.1 christos get_message(int msgnum)
240 1.1 christos {
241 1.1 christos struct message *mp;
242 1.1 christos
243 1.1 christos if (msgnum < 1 || msgnum > current_thread.t_msgCount)
244 1.1 christos return NULL;
245 1.1 christos mp = current_thread.t_msgtbl[msgnum - 1];
246 1.1 christos assert(mp->m_index == msgnum);
247 1.1 christos return mp;
248 1.1 christos }
249 1.1 christos
250 1.1 christos PUBLIC int
251 1.1 christos get_msgnum(struct message *mp)
252 1.1 christos {
253 1.1 christos return mp ? mp->m_index : 0;
254 1.1 christos }
255 1.1 christos
256 1.1 christos PUBLIC int
257 1.1 christos get_msgCount(void)
258 1.1 christos {
259 1.1 christos return current_thread.t_msgCount;
260 1.1 christos }
261 1.1 christos
262 1.1 christos PUBLIC int
263 1.1 christos get_abs_msgCount(void)
264 1.1 christos {
265 1.1 christos return message_array.t_msgCount;
266 1.1 christos }
267 1.1 christos
268 1.1 christos PUBLIC struct message *
269 1.1 christos get_abs_message(int msgnum)
270 1.1 christos {
271 1.1 christos if (msgnum < 1 || msgnum > message_array.t_msgCount)
272 1.1 christos return NULL;
273 1.1 christos
274 1.1 christos return &message_array.t_head[msgnum - 1];
275 1.1 christos }
276 1.1 christos
277 1.1 christos PUBLIC struct message *
278 1.1 christos next_abs_message(struct message *mp)
279 1.1 christos {
280 1.1 christos int i;
281 1.1 christos
282 1.1 christos i = mp - message_array.t_head;
283 1.1 christos
284 1.1 christos if (i < 0 || i + 1 >= message_array.t_msgCount)
285 1.1 christos return NULL;
286 1.1 christos
287 1.1 christos return &message_array.t_head[i + 1];
288 1.1 christos }
289 1.1 christos
290 1.1 christos /************************************************************************/
291 1.1 christos /*
292 1.1 christos * routines to handle the recursion of commands.
293 1.1 christos */
294 1.1 christos PUBLIC int
295 1.1 christos do_recursion(void)
296 1.1 christos {
297 1.1 christos return S_IS_EXPOSE(state) == 0 && value(ENAME_RECURSIVE_CMDS) != NULL;
298 1.1 christos }
299 1.1 christos
300 1.1 christos static int
301 1.1 christos thread_recursion_flist(struct message *mp, int (*fn)(struct message *, void *), void *args)
302 1.1 christos {
303 1.1 christos int retval;
304 1.1 christos for (/*EMPTY*/; mp; mp = mp->m_flink) {
305 1.1 christos if (S_IS_RESTRICT(state) && is_tagged(mp))
306 1.1 christos continue;
307 1.1 christos if ((retval = fn(mp, args)) != 0 ||
308 1.1 christos (retval = thread_recursion_flist(mp->m_clink, fn, args)) != 0)
309 1.1 christos return retval;
310 1.1 christos }
311 1.1 christos
312 1.1 christos return 0;
313 1.1 christos }
314 1.1 christos
315 1.1 christos PUBLIC int
316 1.1 christos thread_recursion(struct message *mp, int (*fn)(struct message *, void *), void *args)
317 1.1 christos {
318 1.1 christos int retval;
319 1.1 christos
320 1.1 christos assert(mp != NULL);
321 1.1 christos
322 1.1 christos if ((retval = fn(mp, args)) != 0)
323 1.1 christos return retval;
324 1.1 christos
325 1.1 christos if (do_recursion() &&
326 1.1 christos (retval = thread_recursion_flist(mp->m_clink, fn, args)) != 0)
327 1.1 christos return retval;
328 1.1 christos
329 1.1 christos return 0;
330 1.1 christos }
331 1.1 christos
332 1.1 christos /************************************************************************
333 1.1 christos * A hook for sfmtfield() in format.c. It is the only place outside
334 1.1 christos * this module that the m_depth is known.
335 1.1 christos */
336 1.1 christos PUBLIC int
337 1.1 christos thread_depth(void)
338 1.1 christos {
339 1.1 christos return current_thread.t_head ? current_thread.t_head->m_depth : 0;
340 1.1 christos }
341 1.1 christos
342 1.1 christos /************************************************************************/
343 1.1 christos
344 1.1 christos static int
345 1.1 christos reindex_core(struct message *mp)
346 1.1 christos {
347 1.1 christos int i;
348 1.1 christos assert(mp->m_blink == NULL);
349 1.1 christos
350 1.1 christos i = 0;
351 1.1 christos for (mp = mp; mp; mp = mp->m_flink) {
352 1.1 christos assert(mp->m_flink == NULL || mp == mp->m_flink->m_blink);
353 1.1 christos assert(mp->m_blink == NULL || mp == mp->m_blink->m_flink);
354 1.1 christos
355 1.1 christos if (S_IS_RESTRICT(state) == 0 || !is_tagged(mp))
356 1.1 christos mp->m_index = ++i;
357 1.1 christos
358 1.1 christos if (mp->m_clink)
359 1.1 christos (void)reindex_core(mp->m_clink);
360 1.1 christos }
361 1.1 christos return i;
362 1.1 christos }
363 1.1 christos
364 1.1 christos
365 1.1 christos static void
366 1.1 christos reindex(struct thread_s *tp)
367 1.1 christos {
368 1.1 christos struct message *mp;
369 1.1 christos int i;
370 1.1 christos
371 1.1 christos assert(tp->t_head->m_blink == NULL);
372 1.1 christos
373 1.1 christos if (S_IS_EXPOSE(state) == 0) {
374 1.1 christos /*
375 1.1 christos * We special case this so that all the hidden
376 1.1 christos * sub-threads get indexed, not just the current one.
377 1.1 christos */
378 1.1 christos i = reindex_core(tp->t_head);
379 1.1 christos }
380 1.1 christos else {
381 1.1 christos i = 0;
382 1.1 christos for (mp = first_message(tp->t_head); mp; mp = next_message(mp))
383 1.1 christos mp->m_index = ++i;
384 1.1 christos }
385 1.1 christos
386 1.1 christos assert(i <= message_array.t_msgCount);
387 1.1 christos
388 1.1 christos tp->t_msgCount = i;
389 1.1 christos i = 0;
390 1.1 christos for (mp = first_message(tp->t_head); mp; mp = next_message(mp))
391 1.1 christos tp->t_msgtbl[i++] = mp;
392 1.1 christos }
393 1.1 christos
394 1.1 christos static void
395 1.1 christos redepth_core(struct message *mp, int depth, struct message *parent)
396 1.1 christos {
397 1.1 christos assert(mp->m_blink == NULL);
398 1.1 christos assert((parent == NULL && depth == 0) ||
399 1.1 christos (parent != NULL && depth != 0 && depth == parent->m_depth + 1));
400 1.1 christos
401 1.1 christos for (/*EMPTY*/; mp; mp = mp->m_flink) {
402 1.1 christos assert(mp->m_plink == parent);
403 1.1 christos assert(mp->m_flink == NULL || mp == mp->m_flink->m_blink);
404 1.1 christos assert(mp->m_blink == NULL || mp == mp->m_blink->m_flink);
405 1.1 christos
406 1.1 christos mp->m_depth = depth;
407 1.1 christos if (mp->m_clink)
408 1.1 christos redepth_core(mp->m_clink, depth + 1, mp);
409 1.1 christos }
410 1.1 christos }
411 1.1 christos
412 1.1 christos static void
413 1.1 christos redepth(struct thread_s *thread)
414 1.1 christos {
415 1.1 christos int depth;
416 1.1 christos struct message *mp;
417 1.1 christos
418 1.1 christos assert(thread != NULL);
419 1.1 christos
420 1.1 christos if ((mp = thread->t_head) == NULL)
421 1.1 christos return;
422 1.1 christos
423 1.1 christos depth = mp->m_plink ? mp->m_plink->m_depth + 1 : 0;
424 1.1 christos
425 1.1 christos #ifndef NDEBUG /* a sanity check if asserts are active */
426 1.1 christos {
427 1.1 christos struct message *tp;
428 1.1 christos int i;
429 1.1 christos i = 0;
430 1.1 christos for (tp = mp->m_plink; tp; tp = tp->m_plink)
431 1.1 christos i++;
432 1.1 christos assert(i == depth);
433 1.1 christos }
434 1.1 christos #endif
435 1.1 christos
436 1.1 christos redepth_core(mp, depth, mp->m_plink);
437 1.1 christos }
438 1.1 christos
439 1.1 christos /************************************************************************
440 1.1 christos * To be called after reallocating the main message list. It is here
441 1.1 christos * as it needs access to current_thread.t_head.
442 1.1 christos */
443 1.1 christos PUBLIC void
444 1.1 christos thread_fix_old_links(struct message *nmessage, struct message *message, int omsgCount)
445 1.1 christos {
446 1.1 christos int i;
447 1.1 christos if (nmessage == message)
448 1.1 christos return;
449 1.1 christos
450 1.1 christos #ifndef NDEBUG
451 1.1 christos message_array.t_head = nmessage; /* for assert check in thread_fix_new_links */
452 1.1 christos #endif
453 1.1 christos
454 1.1 christos # define FIX_LINK(p) do { if (p) p = nmessage + (p - message); } while(/*CONSTCOND*/0)
455 1.1 christos FIX_LINK(current_thread.t_head);
456 1.1 christos for (i = 0; i < omsgCount; i++) {
457 1.1 christos FIX_LINK(nmessage[i].m_blink);
458 1.1 christos FIX_LINK(nmessage[i].m_flink);
459 1.1 christos FIX_LINK(nmessage[i].m_clink);
460 1.1 christos FIX_LINK(nmessage[i].m_plink);
461 1.1 christos }
462 1.1 christos for (i = 0; i < current_thread.t_msgCount; i++ )
463 1.1 christos FIX_LINK(current_thread.t_msgtbl[i]);
464 1.1 christos
465 1.1 christos # undef FIX_LINK
466 1.1 christos }
467 1.1 christos
468 1.1 christos static void
469 1.1 christos thread_init(struct thread_s *tp, struct message *mp, int msgCount)
470 1.1 christos {
471 1.1 christos int i;
472 1.1 christos
473 1.1 christos if (tp->t_msgtbl == NULL || msgCount > tp->t_msgCount) {
474 1.1 christos if (tp->t_msgtbl)
475 1.1 christos free(tp->t_msgtbl);
476 1.1 christos tp->t_msgtbl = ecalloc((size_t)msgCount, sizeof(tp->t_msgtbl[0]));
477 1.1 christos }
478 1.1 christos tp->t_head = mp;
479 1.1 christos tp->t_msgCount = msgCount;
480 1.1 christos for (i = 0; i < msgCount; i++)
481 1.1 christos tp->t_msgtbl[i] = &mp[i];
482 1.1 christos }
483 1.1 christos
484 1.1 christos /*
485 1.1 christos * To be called after reading in the new message structures.
486 1.1 christos * It is here as it needs access to current_thread.t_head.
487 1.1 christos */
488 1.1 christos PUBLIC void
489 1.1 christos thread_fix_new_links(struct message *message, int omsgCount, int msgCount)
490 1.1 christos {
491 1.1 christos int i;
492 1.1 christos struct message *lastmp;
493 1.1 christos
494 1.1 christos /* This should only be called at the top level if omsgCount != 0! */
495 1.1 christos assert(omsgCount == 0 || message->m_plink == NULL);
496 1.1 christos assert(omsgCount == 0 || message_array.t_msgCount == omsgCount);
497 1.1 christos assert(message_array.t_head == message);
498 1.1 christos
499 1.1 christos message_array.t_head = message;
500 1.1 christos message_array.t_msgCount = msgCount;
501 1.1 christos assert(message_array.t_msgtbl == NULL); /* never used */
502 1.1 christos
503 1.1 christos lastmp = NULL;
504 1.1 christos if (omsgCount) {
505 1.1 christos /*
506 1.1 christos * Find the end of the toplevel thread.
507 1.1 christos */
508 1.1 christos for (i = 0; i < omsgCount; i++) {
509 1.1 christos if (message_array.t_head[i].m_depth == 0 &&
510 1.1 christos message_array.t_head[i].m_flink == NULL) {
511 1.1 christos lastmp = &message_array.t_head[i];
512 1.1 christos break;
513 1.1 christos }
514 1.1 christos }
515 1.1 christos #ifndef NDEBUG
516 1.1 christos /*
517 1.1 christos * lastmp better be unique!!!
518 1.1 christos */
519 1.1 christos for (i++; i < omsgCount; i++)
520 1.1 christos assert(message_array.t_head[i].m_depth != 0 ||
521 1.1 christos message_array.t_head[i].m_flink != NULL);
522 1.1 christos assert(lastmp != NULL);
523 1.1 christos #endif /* NDEBUG */
524 1.1 christos }
525 1.1 christos /*
526 1.1 christos * Link and index the new messages linearly at depth 0.
527 1.1 christos */
528 1.1 christos for (i = omsgCount; i < msgCount; i++) {
529 1.1 christos message[i].m_index = i + 1;
530 1.1 christos message[i].m_depth = 0;
531 1.1 christos message[i].m_blink = lastmp;
532 1.1 christos message[i].m_flink = NULL;
533 1.1 christos message[i].m_clink = NULL;
534 1.1 christos message[i].m_plink = NULL;
535 1.1 christos if (lastmp)
536 1.1 christos lastmp->m_flink = &message[i];
537 1.1 christos lastmp = &message[i];
538 1.1 christos }
539 1.1 christos
540 1.1 christos /*
541 1.1 christos * Make sure the current thread is setup correctly.
542 1.1 christos */
543 1.1 christos if (omsgCount == 0) {
544 1.1 christos thread_init(¤t_thread, message, msgCount);
545 1.1 christos }
546 1.1 christos else {
547 1.1 christos /*
548 1.1 christos * Make sure current_thread.t_msgtbl is always large
549 1.1 christos * enough.
550 1.1 christos */
551 1.1 christos current_thread.t_msgtbl =
552 1.1 christos erealloc(current_thread.t_msgtbl,
553 1.1 christos msgCount * sizeof(*current_thread.t_msgtbl));
554 1.1 christos
555 1.1 christos assert(current_thread.t_head != NULL);
556 1.1 christos if (current_thread.t_head->m_depth == 0)
557 1.1 christos reindex(¤t_thread);
558 1.1 christos }
559 1.1 christos }
560 1.1 christos
561 1.1 christos /************************************************************************/
562 1.1 christos /*
563 1.1 christos * All state changes should go through here!!!
564 1.1 christos */
565 1.1 christos static state_t
566 1.1 christos set_state(int and_bits, int xor_bits)
567 1.1 christos {
568 1.1 christos state_t old_state;
569 1.1 christos old_state = state;
570 1.1 christos state &= and_bits;
571 1.1 christos state ^= xor_bits;
572 1.1 christos reindex(¤t_thread);
573 1.1 christos redepth(¤t_thread);
574 1.1 christos return old_state;
575 1.1 christos }
576 1.1 christos
577 1.1 christos static void
578 1.1 christos restore_state(state_t new_state)
579 1.1 christos {
580 1.1 christos state = new_state;
581 1.1 christos reindex(¤t_thread);
582 1.1 christos redepth(¤t_thread);
583 1.1 christos }
584 1.1 christos
585 1.1 christos /************************************************************************/
586 1.1 christos /*
587 1.1 christos * Possibly show the message list.
588 1.1 christos */
589 1.1 christos static void
590 1.1 christos thread_announce(void *v)
591 1.1 christos {
592 1.1 christos int vec[2];
593 1.1 christos
594 1.1 christos if (v == NULL) /* check this here to avoid it before each call */
595 1.1 christos return;
596 1.1 christos
597 1.1 christos if (dot == NULL) {
598 1.1 christos (void)printf("No applicable messages\n");
599 1.1 christos return;
600 1.1 christos }
601 1.1 christos vec[0] = get_msgnum(dot);
602 1.1 christos vec[1] = 0;
603 1.1 christos if (get_msgCount() > 0 && value(ENAME_NOHEADER) == NULL)
604 1.1 christos (void)headers(vec);
605 1.1 christos sawcom = 0; /* so next will print the first message */
606 1.1 christos }
607 1.1 christos
608 1.1 christos /************************************************************************/
609 1.1 christos
610 1.1 christos /*
611 1.1 christos * Flatten out the portion of the thread starting with the given
612 1.1 christos * message.
613 1.1 christos */
614 1.1 christos static void
615 1.1 christos flattencmd_core(struct message *mp)
616 1.1 christos {
617 1.1 christos struct message **marray;
618 1.1 christos size_t mcount;
619 1.1 christos struct message *tp;
620 1.1 christos struct message *nextmp;
621 1.1 christos int i;
622 1.1 christos
623 1.1 christos if (mp == NULL)
624 1.1 christos return;
625 1.1 christos
626 1.1 christos mcount = 1;
627 1.1 christos for (tp = next_message(mp); tp && tp->m_depth > mp->m_depth; tp = next_message(tp))
628 1.1 christos mcount++;
629 1.1 christos
630 1.1 christos if (tp && tp->m_depth < mp->m_depth)
631 1.1 christos nextmp = NULL;
632 1.1 christos else
633 1.1 christos nextmp = tp;
634 1.1 christos
635 1.1 christos if (mcount == 1)
636 1.1 christos return;
637 1.1 christos
638 1.1 christos marray = csalloc(mcount, sizeof(*marray));
639 1.1 christos tp = mp;
640 1.1 christos for (i = 0; i < mcount; i++) {
641 1.1 christos marray[i] = tp;
642 1.1 christos tp = next_message(tp);
643 1.1 christos }
644 1.1 christos mp->m_clink = NULL;
645 1.1 christos for (i = 1; i < mcount; i++) {
646 1.1 christos marray[i]->m_depth = mp->m_depth;
647 1.1 christos marray[i]->m_plink = mp->m_plink;
648 1.1 christos marray[i]->m_clink = NULL;
649 1.1 christos marray[i]->m_blink = marray[i - 1];
650 1.1 christos marray[i - 1]->m_flink = marray[i];
651 1.1 christos }
652 1.1 christos marray[i - 1]->m_flink = nextmp;
653 1.1 christos if (nextmp)
654 1.1 christos nextmp->m_blink = marray[i - 1];
655 1.1 christos }
656 1.1 christos
657 1.1 christos /*
658 1.1 christos * Flatten out all thread parts given in the message list, or the
659 1.1 christos * current thread, if none given.
660 1.1 christos */
661 1.1 christos PUBLIC int
662 1.1 christos flattencmd(void *v)
663 1.1 christos {
664 1.1 christos int *msgvec;
665 1.1 christos int *ip;
666 1.1 christos
667 1.1 christos msgvec = v;
668 1.1 christos
669 1.1 christos if (*msgvec) { /* a message was supplied */
670 1.1 christos for (ip = msgvec; *ip; ip++) {
671 1.1 christos struct message *mp;
672 1.1 christos mp = get_message(*ip);
673 1.1 christos if (mp != NULL)
674 1.1 christos flattencmd_core(mp);
675 1.1 christos }
676 1.1 christos }
677 1.1 christos else { /* no message given - flatten current thread */
678 1.1 christos struct message *mp;
679 1.1 christos for (mp = first_message(current_thread.t_head);
680 1.1 christos mp; mp = next_message(mp))
681 1.1 christos flattencmd_core(mp);
682 1.1 christos }
683 1.1 christos redepth(¤t_thread);
684 1.1 christos thread_announce(v);
685 1.1 christos return 0;
686 1.1 christos }
687 1.1 christos
688 1.1 christos
689 1.1 christos /************************************************************************/
690 1.1 christos /*
691 1.1 christos * The basic sort structure. For each message the index and key
692 1.1 christos * fields are set. The key field is used for the basic sort and the
693 1.1 christos * index is used to ensure that the order from the current thread is
694 1.1 christos * maintained when the key compare is equal.
695 1.1 christos */
696 1.1 christos struct key_sort_s {
697 1.1 christos struct message *mp; /* the message the following refer to */
698 1.1 christos union {
699 1.1 christos char *str; /* string sort key (typically a field or address) */
700 1.1 christos long lines; /* a long sort key (typically a message line count) */
701 1.1 christos off_t size; /* a size sort key (typically the message size) */
702 1.1 christos time_t time; /* a time sort key (typically from date or headline) */
703 1.1 christos } key;
704 1.1 christos int index; /* index from of the current thread before sorting */
705 1.1 christos /* XXX - do we really want index? It is always set to mp->m_index */
706 1.1 christos };
707 1.1 christos
708 1.1 christos /*
709 1.1 christos * This is the compare function obtained from the key_tbl[]. It is
710 1.1 christos * used by thread_array() to identify the end of the thread and by
711 1.1 christos * qsort_cmpfn() to do the basic sort.
712 1.1 christos */
713 1.1 christos static struct {
714 1.1 christos int inv;
715 1.1 christos int (*fn)(const void *, const void *);
716 1.1 christos } cmp;
717 1.1 christos
718 1.1 christos /*
719 1.1 christos * The routine passed to qsort. Note that cmpfn must be set first!
720 1.1 christos */
721 1.1 christos static int
722 1.1 christos qsort_cmpfn(const void *left, const void *right)
723 1.1 christos {
724 1.1 christos int delta;
725 1.1 christos const struct key_sort_s *lp = left;
726 1.1 christos const struct key_sort_s *rp = right;
727 1.1 christos
728 1.1 christos delta = cmp.fn(left, right);
729 1.1 christos return delta ? cmp.inv ? - delta : delta : lp->index - rp->index;
730 1.1 christos }
731 1.1 christos
732 1.1 christos static void
733 1.1 christos link_array(struct key_sort_s *marray, size_t mcount)
734 1.1 christos {
735 1.1 christos int i;
736 1.1 christos struct message *lastmp;
737 1.1 christos lastmp = NULL;
738 1.1 christos for (i = 0; i < mcount; i++) {
739 1.1 christos marray[i].mp->m_index = i + 1;
740 1.1 christos marray[i].mp->m_blink = lastmp;
741 1.1 christos marray[i].mp->m_flink = NULL;
742 1.1 christos if (lastmp)
743 1.1 christos lastmp->m_flink = marray[i].mp;
744 1.1 christos lastmp = marray[i].mp;
745 1.1 christos }
746 1.1 christos if (current_thread.t_head->m_plink)
747 1.1 christos current_thread.t_head->m_plink->m_clink = marray[0].mp;
748 1.1 christos
749 1.1 christos current_thread.t_head = marray[0].mp;
750 1.1 christos }
751 1.1 christos
752 1.1 christos static void
753 1.1 christos cut_array(struct key_sort_s *marray, int beg, int end)
754 1.1 christos {
755 1.1 christos int i;
756 1.1 christos
757 1.1 christos if (beg + 1 < end) {
758 1.1 christos assert(marray[beg].mp->m_clink == NULL);
759 1.1 christos
760 1.1 christos marray[beg].mp->m_clink = marray[beg + 1].mp;
761 1.1 christos marray[beg + 1].mp->m_blink = NULL;
762 1.1 christos
763 1.1 christos marray[beg].mp->m_flink = marray[end].mp;
764 1.1 christos if (marray[end].mp)
765 1.1 christos marray[end].mp->m_blink = marray[beg].mp;
766 1.1 christos
767 1.1 christos marray[end - 1].mp->m_flink = NULL;
768 1.1 christos
769 1.1 christos for (i = beg + 1; i < end; i++)
770 1.1 christos marray[i].mp->m_plink = marray[beg].mp;
771 1.1 christos }
772 1.1 christos }
773 1.1 christos
774 1.1 christos static void
775 1.1 christos thread_array(struct key_sort_s *marray, size_t mcount, int cutit)
776 1.1 christos {
777 1.1 christos struct message *parent;
778 1.1 christos
779 1.1 christos parent = marray[0].mp->m_plink;
780 1.1 christos qsort(marray, mcount, sizeof(*marray), qsort_cmpfn);
781 1.1 christos link_array(marray, mcount);
782 1.1 christos
783 1.1 christos if (cutit) {
784 1.1 christos int i, j;
785 1.1 christos /*
786 1.1 christos * Flatten out the array.
787 1.1 christos */
788 1.1 christos for (i = 0; i < mcount; i++) {
789 1.1 christos marray[i].mp->m_plink = parent;
790 1.1 christos marray[i].mp->m_clink = NULL;
791 1.1 christos }
792 1.1 christos
793 1.1 christos /*
794 1.1 christos * Now chop it up. There is really only one level here.
795 1.1 christos */
796 1.1 christos i = 0;
797 1.1 christos for (j = 1; j < mcount; j++) {
798 1.1 christos if (cmp.fn(&marray[i], &marray[j]) != 0) {
799 1.1 christos cut_array(marray, i, j);
800 1.1 christos i = j;
801 1.1 christos }
802 1.1 christos }
803 1.1 christos cut_array(marray, i, j);
804 1.1 christos }
805 1.1 christos }
806 1.1 christos
807 1.1 christos /************************************************************************/
808 1.1 christos /*
809 1.1 christos * thread_on_reference() is the core reference threading routine. It
810 1.1 christos * is not a command itself by called by threadcmd().
811 1.1 christos */
812 1.1 christos
813 1.1 christos static void
814 1.1 christos adopt_child(struct message *parent, struct message *child)
815 1.1 christos {
816 1.1 christos /*
817 1.1 christos * Unhook the child from its current location.
818 1.1 christos */
819 1.1 christos if (child->m_blink != NULL) {
820 1.1 christos child->m_blink->m_flink = child->m_flink;
821 1.1 christos }
822 1.1 christos if (child->m_flink != NULL) {
823 1.1 christos child->m_flink->m_blink = child->m_blink;
824 1.1 christos }
825 1.1 christos
826 1.1 christos /*
827 1.1 christos * Link the child to the parent.
828 1.1 christos */
829 1.1 christos if (parent->m_clink == NULL) { /* parent has no child */
830 1.1 christos parent->m_clink = child;
831 1.1 christos child->m_blink = NULL;
832 1.1 christos }
833 1.1 christos else { /* add message to end of parent's child's flist */
834 1.1 christos struct message *t;
835 1.1 christos for (t = parent->m_clink; t && t->m_flink; t = t->m_flink)
836 1.1 christos continue;
837 1.1 christos t->m_flink = child;
838 1.1 christos child->m_blink = t;
839 1.1 christos }
840 1.1 christos child->m_flink = NULL;
841 1.1 christos child->m_plink = parent;
842 1.1 christos }
843 1.1 christos
844 1.1 christos /*
845 1.1 christos * Get the parent ID for a message (if there is one).
846 1.1 christos *
847 1.1 christos * See RFC 2822, sec 3.6.4.
848 1.1 christos *
849 1.1 christos * Many mailers seem to screw up the In-Reply-To: and/or
850 1.1 christos * References: fields, generally by omitting one or both.
851 1.1 christos *
852 1.1 christos * We give preference to the "References" field. If it does
853 1.1 christos * not exist, try the "In-Reply-To" field. If neither exist,
854 1.1 christos * then the message is either not a reply or someone isn't
855 1.1 christos * adding the necessary fields, so skip it.
856 1.1 christos */
857 1.1 christos static char *
858 1.1 christos get_parent_id(struct message *mp)
859 1.1 christos {
860 1.1 christos struct name *refs;
861 1.1 christos
862 1.1 christos if ((refs = extract(hfield("references", mp), 0)) != NULL) {
863 1.1 christos char *id;
864 1.1 christos while (refs->n_flink)
865 1.1 christos refs = refs->n_flink;
866 1.1 christos
867 1.1 christos id = skin(refs->n_name);
868 1.1 christos if (*id != '\0')
869 1.1 christos return id;
870 1.1 christos }
871 1.1 christos
872 1.1 christos return skin(hfield("in-reply-to", mp));
873 1.1 christos }
874 1.1 christos
875 1.1 christos struct marray_s {
876 1.1 christos struct message *mp;
877 1.1 christos char *message_id;
878 1.1 christos char *parent_id;
879 1.1 christos };
880 1.1 christos
881 1.1 christos static struct message *
882 1.1 christos thread_top(struct message *mp)
883 1.1 christos {
884 1.1 christos while (mp && mp->m_plink) {
885 1.1 christos if (mp->m_plink->m_clink == current_thread.t_head)
886 1.1 christos break;
887 1.1 christos mp = mp->m_plink;
888 1.1 christos }
889 1.1 christos return mp;
890 1.1 christos }
891 1.1 christos
892 1.1 christos
893 1.1 christos /*
894 1.1 christos * Thread on the "In-Reply-To" and "Reference" fields. This is the
895 1.1 christos * normal way to thread.
896 1.1 christos */
897 1.1 christos static void
898 1.1 christos thread_on_reference(struct message *mp)
899 1.1 christos {
900 1.1 christos struct message *parent;
901 1.1 christos state_t oldstate;
902 1.1 christos size_t mcount;
903 1.1 christos struct marray_s *marray;
904 1.1 christos int i;
905 1.1 christos
906 1.1 christos assert(mp == current_thread.t_head);
907 1.1 christos
908 1.1 christos oldstate = set_state(~(S_RESTRICT|S_EXPOSE), S_EXPOSE); /* restrict off, expose on */
909 1.1 christos
910 1.1 christos mcount = get_msgCount();
911 1.1 christos
912 1.1 christos if (mcount < 2) /* it's hard to thread so few messages! */
913 1.1 christos goto done;
914 1.1 christos
915 1.1 christos marray = csalloc(mcount + 1, sizeof(*marray));
916 1.1 christos
917 1.1 christos /*
918 1.1 christos * Load up the array (skin where necessary).
919 1.1 christos *
920 1.1 christos * With a 40K message file, most of the time is spent here,
921 1.1 christos * not in the search loop below.
922 1.1 christos */
923 1.1 christos for (i = 0; i < mcount; i++) {
924 1.1 christos marray[i].mp = mp;
925 1.1 christos marray[i].message_id = skin(hfield("message-id", mp));
926 1.1 christos marray[i].parent_id = get_parent_id(mp);
927 1.1 christos mp = next_message(mp);
928 1.1 christos }
929 1.1 christos
930 1.1 christos /*
931 1.1 christos * Save the old parent.
932 1.1 christos */
933 1.1 christos parent = marray[0].mp->m_plink;
934 1.1 christos
935 1.1 christos /*
936 1.1 christos * flatten the array.
937 1.1 christos */
938 1.1 christos marray[0].mp->m_clink = NULL;
939 1.1 christos for (i = 1; i < mcount; i++) {
940 1.1 christos marray[i].mp->m_depth = marray[0].mp->m_depth;
941 1.1 christos marray[i].mp->m_plink = marray[0].mp->m_plink;
942 1.1 christos marray[i].mp->m_clink = NULL;
943 1.1 christos marray[i].mp->m_blink = marray[i - 1].mp;
944 1.1 christos marray[i - 1].mp->m_flink = marray[i].mp;
945 1.1 christos }
946 1.1 christos marray[i - 1].mp->m_flink = NULL;
947 1.1 christos
948 1.1 christos /*
949 1.1 christos * Walk the array hooking up the replies with their parents.
950 1.1 christos */
951 1.1 christos for (i = 0; i < mcount; i++) {
952 1.1 christos struct message *child;
953 1.1 christos char *parent_id;
954 1.1 christos int j;
955 1.1 christos
956 1.1 christos if ((parent_id = marray[i].parent_id) == NULL)
957 1.1 christos continue;
958 1.1 christos
959 1.1 christos child = marray[i].mp;
960 1.1 christos
961 1.1 christos /*
962 1.1 christos * Look for the parent message and link this one in
963 1.1 christos * appropriately.
964 1.1 christos *
965 1.1 christos * XXX - This will not scale nicely, though it does
966 1.1 christos * not appear to be the dominant loop even with 40K
967 1.1 christos * messages. If this becomes a problem, implement a
968 1.1 christos * binary search.
969 1.1 christos */
970 1.1 christos for (j = 0; j < mcount; j++) {
971 1.1 christos /* message_id will be NULL on mbox files */
972 1.1 christos if (marray[i].message_id == NULL)
973 1.1 christos continue;
974 1.1 christos
975 1.1 christos if (equal(marray[j].message_id, parent_id)) {
976 1.1 christos /*
977 1.1 christos * The child is at the top level. If
978 1.1 christos * it is being adopted and it was top
979 1.1 christos * left (current_thread.t_head), then
980 1.1 christos * its right sibling is the new top
981 1.1 christos * left (current_thread.t_head).
982 1.1 christos */
983 1.1 christos if (current_thread.t_head == child) {
984 1.1 christos current_thread.t_head = child->m_flink;
985 1.1 christos assert(current_thread.t_head != NULL);
986 1.1 christos }
987 1.1 christos adopt_child(marray[j].mp, child);
988 1.1 christos break;
989 1.1 christos }
990 1.1 christos }
991 1.1 christos }
992 1.1 christos
993 1.1 christos if (parent)
994 1.1 christos parent->m_clink = current_thread.t_head;
995 1.1 christos /*
996 1.1 christos * If the old state is not exposed, reset the dot to the head
997 1.1 christos * of the thread it lived in, so it will be in a valid spot
998 1.1 christos * when things are re-hidden.
999 1.1 christos */
1000 1.1 christos if (!S_IS_EXPOSE(oldstate))
1001 1.1 christos dot = thread_top(dot);
1002 1.1 christos done:
1003 1.1 christos restore_state(oldstate);
1004 1.1 christos }
1005 1.1 christos
1006 1.1 christos /************************************************************************/
1007 1.1 christos /*
1008 1.1 christos * Tagging commands.
1009 1.1 christos */
1010 1.1 christos static int
1011 1.1 christos tag1(int *msgvec, int and_bits, int xor_bits)
1012 1.1 christos {
1013 1.1 christos int *ip;
1014 1.1 christos
1015 1.1 christos for (ip = msgvec; *ip != 0; ip++)
1016 1.1 christos (void)set_m_flag(*ip, and_bits, xor_bits);
1017 1.1 christos
1018 1.1 christos reindex(¤t_thread);
1019 1.1 christos /* thread_announce(v); */
1020 1.1 christos return 0;
1021 1.1 christos }
1022 1.1 christos
1023 1.1 christos /*
1024 1.1 christos * Tag the current message dot or a message list.
1025 1.1 christos */
1026 1.1 christos PUBLIC int
1027 1.1 christos tagcmd(void *v)
1028 1.1 christos {
1029 1.1 christos return tag1(v, ~MTAGGED, MTAGGED);
1030 1.1 christos }
1031 1.1 christos
1032 1.1 christos /*
1033 1.1 christos * Untag the current message dot or a message list.
1034 1.1 christos */
1035 1.1 christos PUBLIC int
1036 1.1 christos untagcmd(void *v)
1037 1.1 christos {
1038 1.1 christos return tag1(v, ~MTAGGED, 0);
1039 1.1 christos }
1040 1.1 christos
1041 1.1 christos /*
1042 1.1 christos * Invert all tags in the message list.
1043 1.1 christos */
1044 1.1 christos PUBLIC int
1045 1.1 christos invtagscmd(void *v)
1046 1.1 christos {
1047 1.1 christos return tag1(v, ~0, MTAGGED);
1048 1.1 christos }
1049 1.1 christos
1050 1.1 christos /*
1051 1.1 christos * Tag all messages below the current dot or below a specified
1052 1.1 christos * message.
1053 1.1 christos */
1054 1.1 christos PUBLIC int
1055 1.1 christos tagbelowcmd(void *v)
1056 1.1 christos {
1057 1.1 christos int *msgvec;
1058 1.1 christos struct message *mp;
1059 1.1 christos state_t oldstate;
1060 1.1 christos int depth;
1061 1.1 christos
1062 1.1 christos msgvec = v;
1063 1.1 christos
1064 1.1 christos oldstate = set_state(~(S_RESTRICT|S_EXPOSE), S_EXPOSE); /* restrict off, expose on */
1065 1.1 christos mp = get_message(*msgvec);
1066 1.1 christos if (mp) {
1067 1.1 christos depth = mp->m_depth;
1068 1.1 christos for (mp = first_message(current_thread.t_head); mp; mp = next_message(mp))
1069 1.1 christos if (mp->m_depth > depth ) {
1070 1.1 christos mp->m_flag |= MTAGGED;
1071 1.1 christos touch(mp);
1072 1.1 christos }
1073 1.1 christos }
1074 1.1 christos restore_state(oldstate);
1075 1.1 christos /* thread_announce(v); */
1076 1.1 christos return 0;
1077 1.1 christos }
1078 1.1 christos
1079 1.1 christos /*
1080 1.1 christos * Do not display the tagged messages.
1081 1.1 christos */
1082 1.1 christos PUBLIC int
1083 1.1 christos hidetagscmd(void *v)
1084 1.1 christos {
1085 1.1 christos (void)set_state(~S_RESTRICT, S_RESTRICT);
1086 1.1 christos thread_announce(v);
1087 1.1 christos return 0;
1088 1.1 christos }
1089 1.1 christos
1090 1.1 christos /*
1091 1.1 christos * Display the tagged messages.
1092 1.1 christos */
1093 1.1 christos PUBLIC int
1094 1.1 christos showtagscmd(void *v)
1095 1.1 christos {
1096 1.1 christos (void)set_state(~S_RESTRICT, 0);
1097 1.1 christos thread_announce(v);
1098 1.1 christos return 0;
1099 1.1 christos }
1100 1.1 christos
1101 1.1 christos /************************************************************************/
1102 1.1 christos /*
1103 1.1 christos * Basic threading commands.
1104 1.1 christos */
1105 1.1 christos /*
1106 1.1 christos * Show the threads.
1107 1.1 christos */
1108 1.1 christos PUBLIC int
1109 1.1 christos exposecmd(void *v)
1110 1.1 christos {
1111 1.1 christos (void)set_state(~S_EXPOSE, S_EXPOSE); /* expose on */
1112 1.1 christos thread_announce(v);
1113 1.1 christos return 0;
1114 1.1 christos }
1115 1.1 christos
1116 1.1 christos /*
1117 1.1 christos * Hide the threads.
1118 1.1 christos */
1119 1.1 christos PUBLIC int
1120 1.1 christos hidecmd(void *v)
1121 1.1 christos {
1122 1.1 christos dot = thread_top(dot);
1123 1.1 christos (void)set_state(~S_EXPOSE, 0); /* expose off */
1124 1.1 christos thread_announce(v);
1125 1.1 christos return 0;
1126 1.1 christos }
1127 1.1 christos
1128 1.1 christos /*
1129 1.1 christos * Up one level in the thread tree. Go up multiple levels if given an
1130 1.1 christos * argument.
1131 1.1 christos */
1132 1.1 christos PUBLIC int
1133 1.1 christos upcmd(void *v)
1134 1.1 christos {
1135 1.1 christos char *str;
1136 1.1 christos int upcnt;
1137 1.1 christos int upone;
1138 1.1 christos
1139 1.1 christos str = v;
1140 1.1 christos str = skip_blank(str);
1141 1.1 christos if (*str == '\0')
1142 1.1 christos upcnt = 1;
1143 1.1 christos else
1144 1.1 christos upcnt = atoi(str);
1145 1.1 christos
1146 1.1 christos if (upcnt < 1) {
1147 1.1 christos (void)printf("Sorry, argument must be > 0.\n");
1148 1.1 christos return 0;
1149 1.1 christos }
1150 1.1 christos if (dot == NULL) {
1151 1.1 christos (void)printf("No applicable messages\n");
1152 1.1 christos return 0;
1153 1.1 christos }
1154 1.1 christos if (dot->m_plink == NULL) {
1155 1.1 christos (void)printf("top thread\n");
1156 1.1 christos return 0;
1157 1.1 christos }
1158 1.1 christos upone = 0;
1159 1.1 christos while (upcnt-- > 0) {
1160 1.1 christos struct message *parent;
1161 1.1 christos parent = current_thread.t_head->m_plink;
1162 1.1 christos if (parent == NULL) {
1163 1.1 christos (void)printf("top thread\n");
1164 1.1 christos break;
1165 1.1 christos }
1166 1.1 christos else {
1167 1.1 christos struct message *mp;
1168 1.1 christos assert(current_thread.t_head->m_depth > 0);
1169 1.1 christos for (mp = parent; mp && mp->m_blink; mp = mp->m_blink)
1170 1.1 christos continue;
1171 1.1 christos current_thread.t_head = mp;
1172 1.1 christos dot = parent;
1173 1.1 christos upone = 1;
1174 1.1 christos }
1175 1.1 christos }
1176 1.1 christos if (upone) {
1177 1.1 christos reindex(¤t_thread);
1178 1.1 christos thread_announce(v);
1179 1.1 christos }
1180 1.1 christos return 0;
1181 1.1 christos }
1182 1.1 christos
1183 1.1 christos /*
1184 1.1 christos * Go down one level in the thread tree from the current dot or a
1185 1.1 christos * given message number if given.
1186 1.1 christos */
1187 1.1 christos PUBLIC int
1188 1.1 christos downcmd(void *v)
1189 1.1 christos {
1190 1.1 christos struct message *child;
1191 1.1 christos struct message *mp;
1192 1.1 christos int *msgvec = v;
1193 1.1 christos
1194 1.1 christos if ((mp = get_message(*msgvec)) == NULL ||
1195 1.1 christos (child = mp->m_clink) == NULL)
1196 1.1 christos (void)printf("no sub-thread\n");
1197 1.1 christos else {
1198 1.1 christos current_thread.t_head = child;
1199 1.1 christos dot = child;
1200 1.1 christos reindex(¤t_thread);
1201 1.1 christos thread_announce(v);
1202 1.1 christos }
1203 1.1 christos return 0;
1204 1.1 christos }
1205 1.1 christos
1206 1.1 christos /*
1207 1.1 christos * Set the current thread level to the current dot or to the message
1208 1.1 christos * if given.
1209 1.1 christos */
1210 1.1 christos PUBLIC int
1211 1.1 christos tsetcmd(void *v)
1212 1.1 christos {
1213 1.1 christos struct message *mp;
1214 1.1 christos int *msgvec = v;
1215 1.1 christos
1216 1.1 christos if ((mp = get_message(*msgvec)) == NULL)
1217 1.1 christos (void)printf("invalid message\n");
1218 1.1 christos else {
1219 1.1 christos for (/*EMPTY*/; mp->m_blink; mp = mp->m_blink)
1220 1.1 christos continue;
1221 1.1 christos current_thread.t_head = mp;
1222 1.1 christos reindex(¤t_thread);
1223 1.1 christos thread_announce(v);
1224 1.1 christos }
1225 1.1 christos return 0;
1226 1.1 christos }
1227 1.1 christos
1228 1.1 christos /*
1229 1.1 christos * Reverse the current thread order. If threaded, it only operates on
1230 1.1 christos * the heads.
1231 1.1 christos */
1232 1.1 christos static void
1233 1.1 christos reversecmd_core(struct thread_s *tp)
1234 1.1 christos {
1235 1.1 christos struct message *thread_start;
1236 1.1 christos struct message *mp;
1237 1.1 christos struct message *lastmp;
1238 1.1 christos struct message *old_flink;
1239 1.1 christos
1240 1.1 christos thread_start = tp->t_head;
1241 1.1 christos
1242 1.1 christos assert(thread_start->m_blink == NULL);
1243 1.1 christos
1244 1.1 christos lastmp = NULL;
1245 1.1 christos for (mp = thread_start; mp; mp = old_flink) {
1246 1.1 christos old_flink = mp->m_flink;
1247 1.1 christos mp->m_flink = mp->m_blink;
1248 1.1 christos mp->m_blink = old_flink;
1249 1.1 christos lastmp = mp;
1250 1.1 christos }
1251 1.1 christos if (thread_start->m_plink)
1252 1.1 christos thread_start->m_plink->m_clink = lastmp;
1253 1.1 christos
1254 1.1 christos current_thread.t_head = lastmp;
1255 1.1 christos reindex(tp);
1256 1.1 christos }
1257 1.1 christos
1258 1.1 christos PUBLIC int
1259 1.1 christos reversecmd(void *v)
1260 1.1 christos {
1261 1.1 christos reversecmd_core(¤t_thread);
1262 1.1 christos thread_announce(v);
1263 1.1 christos return 0;
1264 1.1 christos }
1265 1.1 christos
1266 1.1 christos
1267 1.1 christos /*
1268 1.1 christos * Get threading and sorting modifiers.
1269 1.1 christos */
1270 1.1 christos #define MF_IGNCASE 1 /* ignore case when sorting */
1271 1.1 christos #define MF_REVERSE 2 /* reverse sort direction */
1272 1.1 christos #define MF_SKIN 4 /* "skin" the field to remove comments */
1273 1.1 christos static int
1274 1.1 christos get_modifiers(char **str)
1275 1.1 christos {
1276 1.1 christos int modflags;
1277 1.1 christos char *p;
1278 1.1 christos
1279 1.1 christos modflags = 0;
1280 1.1 christos for (p = *str; p && *p; p++) {
1281 1.1 christos switch (*p) {
1282 1.1 christos case '!':
1283 1.1 christos modflags |= MF_REVERSE;
1284 1.1 christos break;
1285 1.1 christos case '^':
1286 1.1 christos modflags |= MF_IGNCASE;
1287 1.1 christos break;
1288 1.1 christos case '-':
1289 1.1 christos modflags |= MF_SKIN;
1290 1.1 christos break;
1291 1.1 christos case ' ':
1292 1.1 christos case '\t':
1293 1.1 christos break;
1294 1.1 christos default:
1295 1.1 christos goto done;
1296 1.1 christos }
1297 1.1 christos }
1298 1.1 christos done:
1299 1.1 christos *str = p;
1300 1.1 christos return modflags;
1301 1.1 christos }
1302 1.1 christos
1303 1.1 christos /************************************************************************/
1304 1.1 christos /*
1305 1.1 christos * The key_sort_s compare routines.
1306 1.1 christos */
1307 1.1 christos
1308 1.1 christos static int
1309 1.1 christos keystrcmp(const void *left, const void *right)
1310 1.1 christos {
1311 1.1 christos const struct key_sort_s *lp = left;
1312 1.1 christos const struct key_sort_s *rp = right;
1313 1.1 christos
1314 1.1 christos lp = left;
1315 1.1 christos rp = right;
1316 1.1 christos
1317 1.1 christos if (rp->key.str == NULL && lp->key.str == NULL)
1318 1.1 christos return 0;
1319 1.1 christos else if (rp->key.str == NULL)
1320 1.1 christos return -1;
1321 1.1 christos else if (lp->key.str == NULL)
1322 1.1 christos return 1;
1323 1.1 christos else
1324 1.1 christos return strcmp(lp->key.str, rp->key.str);
1325 1.1 christos }
1326 1.1 christos
1327 1.1 christos static int
1328 1.1 christos keystrcasecmp(const void *left, const void *right)
1329 1.1 christos {
1330 1.1 christos const struct key_sort_s *lp = left;
1331 1.1 christos const struct key_sort_s *rp = right;
1332 1.1 christos
1333 1.1 christos if (rp->key.str == NULL && lp->key.str == NULL)
1334 1.1 christos return 0;
1335 1.1 christos else if (rp->key.str == NULL)
1336 1.1 christos return -1;
1337 1.1 christos else if (lp->key.str == NULL)
1338 1.1 christos return 1;
1339 1.1 christos else
1340 1.1 christos return strcasecmp(lp->key.str, rp->key.str);
1341 1.1 christos }
1342 1.1 christos
1343 1.1 christos static int
1344 1.1 christos keylongcmp(const void *left, const void *right)
1345 1.1 christos {
1346 1.1 christos const struct key_sort_s *lp = left;
1347 1.1 christos const struct key_sort_s *rp = right;
1348 1.1 christos
1349 1.1 christos if (lp->key.lines > rp->key.lines)
1350 1.1 christos return 1;
1351 1.1 christos
1352 1.1 christos if (lp->key.lines < rp->key.lines)
1353 1.1 christos return -1;
1354 1.1 christos
1355 1.1 christos return 0;
1356 1.1 christos }
1357 1.1 christos
1358 1.1 christos static int
1359 1.1 christos keyoffcmp(const void *left, const void *right)
1360 1.1 christos {
1361 1.1 christos const struct key_sort_s *lp = left;
1362 1.1 christos const struct key_sort_s *rp = right;
1363 1.1 christos
1364 1.1 christos if (lp->key.size > rp->key.size)
1365 1.1 christos return 1;
1366 1.1 christos
1367 1.1 christos if (lp->key.size < rp->key.size)
1368 1.1 christos return -1;
1369 1.1 christos
1370 1.1 christos return 0;
1371 1.1 christos }
1372 1.1 christos
1373 1.1 christos static int
1374 1.1 christos keytimecmp(const void *left, const void *right)
1375 1.1 christos {
1376 1.1 christos double delta;
1377 1.1 christos const struct key_sort_s *lp = left;
1378 1.1 christos const struct key_sort_s *rp = right;
1379 1.1 christos
1380 1.1 christos delta = difftime(lp->key.time, rp->key.time);
1381 1.1 christos if (delta > 0)
1382 1.1 christos return 1;
1383 1.1 christos
1384 1.1 christos if (delta < 0)
1385 1.1 christos return -1;
1386 1.1 christos
1387 1.1 christos return 0;
1388 1.1 christos }
1389 1.1 christos
1390 1.1 christos /************************************************************************
1391 1.1 christos * key_sort_s loading routines.
1392 1.1 christos */
1393 1.1 christos static void
1394 1.1 christos field_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1395 1.1 christos const char *key, int skin_it)
1396 1.1 christos {
1397 1.1 christos int i;
1398 1.1 christos for (i = 0; i < mcount; i++) {
1399 1.1 christos marray[i].mp = mp;
1400 1.1 christos marray[i].key.str =
1401 1.1 christos skin_it ? skin(hfield(key, mp)) : hfield(key, mp);
1402 1.1 christos marray[i].index = mp->m_index;
1403 1.1 christos mp = next_message(mp);
1404 1.1 christos }
1405 1.1 christos }
1406 1.1 christos
1407 1.1 christos static void
1408 1.1 christos subj_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1409 1.1 christos const char *key __unused, int flags __unused)
1410 1.1 christos {
1411 1.1 christos int i;
1412 1.1 christos #ifdef __lint__
1413 1.1 christos flags = flags;
1414 1.1 christos key = key;
1415 1.1 christos #endif
1416 1.1 christos for (i = 0; i < mcount; i++) {
1417 1.1 christos char *subj = hfield(key, mp);
1418 1.1 christos while( strncasecmp(subj, "Re:", 3) == 0 )
1419 1.1 christos subj = skip_blank(subj + 3);
1420 1.1 christos marray[i].mp = mp;
1421 1.1 christos marray[i].key.str = subj;
1422 1.1 christos marray[i].index = mp->m_index;
1423 1.1 christos mp = next_message(mp);
1424 1.1 christos }
1425 1.1 christos }
1426 1.1 christos
1427 1.1 christos
1428 1.1 christos static void
1429 1.1 christos lines_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1430 1.1 christos const char *key __unused, int flags)
1431 1.1 christos {
1432 1.1 christos int i;
1433 1.1 christos int use_blines;
1434 1.1 christos int use_hlines;
1435 1.1 christos #ifdef __lint__
1436 1.1 christos key = key;
1437 1.1 christos #endif
1438 1.1 christos #define HLINES 1
1439 1.1 christos #define BLINES 2
1440 1.1 christos #define TLINES 3
1441 1.1 christos use_hlines = flags == HLINES;
1442 1.1 christos use_blines = flags == BLINES;
1443 1.1 christos
1444 1.1 christos for (i = 0; i < mcount; i++) {
1445 1.1 christos marray[i].mp = mp;
1446 1.1 christos marray[i].key.lines = use_hlines ? mp->m_lines - mp->m_blines :
1447 1.1 christos use_blines ? mp->m_blines : mp->m_lines;
1448 1.1 christos marray[i].index = mp->m_index;
1449 1.1 christos mp = next_message(mp);
1450 1.1 christos }
1451 1.1 christos }
1452 1.1 christos
1453 1.1 christos static void
1454 1.1 christos size_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1455 1.1 christos const char *key __unused, int flags __unused)
1456 1.1 christos {
1457 1.1 christos int i;
1458 1.1 christos #ifdef __lint__
1459 1.1 christos flags = flags;
1460 1.1 christos key = key;
1461 1.1 christos #endif
1462 1.1 christos for (i = 0; i < mcount; i++) {
1463 1.1 christos marray[i].mp = mp;
1464 1.1 christos marray[i].key.size = mp->m_size;
1465 1.1 christos marray[i].index = mp->m_index;
1466 1.1 christos mp = next_message(mp);
1467 1.1 christos }
1468 1.1 christos }
1469 1.1 christos
1470 1.1 christos static void __unused
1471 1.1 christos date_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1472 1.1 christos const char *key __unused, int flags)
1473 1.1 christos {
1474 1.1 christos int i;
1475 1.1 christos int use_hl_date;
1476 1.1 christos int zero_hour_min_sec;
1477 1.1 christos #ifdef __lint__
1478 1.1 christos key = key;
1479 1.1 christos #endif
1480 1.1 christos #define RDAY 1
1481 1.1 christos #define SDAY 2
1482 1.1 christos #define RDATE 3
1483 1.1 christos #define SDATE 4
1484 1.1 christos use_hl_date = (flags == RDAY || flags == RDATE);
1485 1.1 christos zero_hour_min_sec = (flags == RDAY || flags == SDAY);
1486 1.1 christos
1487 1.1 christos for (i = 0; i < mcount; i++) {
1488 1.1 christos struct tm tm;
1489 1.1 christos (void)dateof(&tm, mp, use_hl_date);
1490 1.1 christos if (zero_hour_min_sec) {
1491 1.1 christos tm.tm_sec = 0;
1492 1.1 christos tm.tm_min = 0;
1493 1.1 christos tm.tm_hour = 0;
1494 1.1 christos }
1495 1.1 christos marray[i].mp = mp;
1496 1.1 christos marray[i].key.time = mktime(&tm);
1497 1.1 christos marray[i].index = mp->m_index;
1498 1.1 christos mp = next_message(mp);
1499 1.1 christos }
1500 1.1 christos }
1501 1.1 christos
1502 1.1 christos static void
1503 1.1 christos from_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1504 1.1 christos const char *key __unused, int flags __unused)
1505 1.1 christos {
1506 1.1 christos int i;
1507 1.1 christos #ifdef __lint__
1508 1.1 christos flags = flags;
1509 1.1 christos key = key;
1510 1.1 christos #endif
1511 1.1 christos for (i = 0; i < mcount; i++) {
1512 1.1 christos marray[i].mp = mp;
1513 1.1 christos marray[i].key.str = nameof(mp, 0);
1514 1.1 christos marray[i].index = mp->m_index;
1515 1.1 christos mp = next_message(mp);
1516 1.1 christos }
1517 1.1 christos }
1518 1.1 christos
1519 1.1 christos /************************************************************************
1520 1.1 christos * The master table that controls all sorting and threading.
1521 1.1 christos */
1522 1.1 christos static const struct key_tbl_s {
1523 1.1 christos const char *key;
1524 1.1 christos void (*loadfn)(struct key_sort_s *, size_t, struct message *, const char *, int);
1525 1.1 christos int flags;
1526 1.1 christos int (*cmpfn)(const void*, const void*);
1527 1.1 christos int (*casecmpfn)(const void*, const void*);
1528 1.1 christos } key_tbl[] = {
1529 1.1 christos {"blines", lines_load, BLINES, keylongcmp, keylongcmp},
1530 1.1 christos {"hlines", lines_load, HLINES, keylongcmp, keylongcmp},
1531 1.1 christos {"tlines", lines_load, TLINES, keylongcmp, keylongcmp},
1532 1.1 christos {"size", size_load, 0, keyoffcmp, keyoffcmp},
1533 1.1 christos {"sday", date_load, SDAY, keytimecmp, keytimecmp},
1534 1.1 christos {"rday", date_load, RDAY, keytimecmp, keytimecmp},
1535 1.1 christos {"sdate", date_load, SDATE, keytimecmp, keytimecmp},
1536 1.1 christos {"rdate", date_load, RDATE, keytimecmp, keytimecmp},
1537 1.1 christos {"from", from_load, 0, keystrcasecmp, keystrcasecmp},
1538 1.1 christos {"subject", subj_load, 0, keystrcmp, keystrcasecmp},
1539 1.1 christos {NULL, field_load, 0, keystrcmp, keystrcasecmp},
1540 1.1 christos };
1541 1.1 christos
1542 1.1 christos #ifdef USE_EDITLINE
1543 1.1 christos /*
1544 1.1 christos * This is for use in complete.c to get the list of threading key
1545 1.1 christos * names without exposing the key_tbl[]. The first name is returned
1546 1.1 christos * if called with a pointer to a NULL pointer. Subsequent calls with
1547 1.1 christos * the same cookie give successive names. A NULL return indicates the
1548 1.1 christos * end of the list.
1549 1.1 christos */
1550 1.1 christos PUBLIC const char *
1551 1.1 christos thread_next_key_name(const void **cookie)
1552 1.1 christos {
1553 1.1 christos const struct key_tbl_s *kp;
1554 1.1 christos
1555 1.1 christos kp = *cookie;
1556 1.1 christos if (kp == NULL)
1557 1.1 christos kp = key_tbl;
1558 1.1 christos
1559 1.1 christos *cookie = kp->key ? &kp[1] : NULL;
1560 1.1 christos
1561 1.1 christos return kp->key;
1562 1.1 christos }
1563 1.1 christos #endif /* USE_EDITLINE */
1564 1.1 christos
1565 1.1 christos static const struct key_tbl_s *
1566 1.1 christos get_key(const char *key)
1567 1.1 christos {
1568 1.1 christos const struct key_tbl_s *kp;
1569 1.1 christos for (kp = key_tbl; kp->key != NULL; kp++)
1570 1.1 christos if (strcmp(kp->key, key) == 0)
1571 1.1 christos return kp;
1572 1.1 christos return kp;
1573 1.1 christos }
1574 1.1 christos
1575 1.1 christos static int (*
1576 1.1 christos get_cmpfn(const struct key_tbl_s *kp, int ignorecase)
1577 1.1 christos )(const void*, const void*)
1578 1.1 christos {
1579 1.1 christos if (ignorecase)
1580 1.1 christos return kp->casecmpfn;
1581 1.1 christos else
1582 1.1 christos return kp->cmpfn;
1583 1.1 christos }
1584 1.1 christos
1585 1.1 christos static void
1586 1.1 christos thread_current_on(char *str, int modflags, int cutit)
1587 1.1 christos {
1588 1.1 christos const struct key_tbl_s *kp;
1589 1.1 christos struct key_sort_s *marray;
1590 1.1 christos size_t mcount;
1591 1.1 christos state_t oldstate;
1592 1.1 christos
1593 1.1 christos oldstate = set_state(~(S_RESTRICT|S_EXPOSE), cutit ? S_EXPOSE : 0);
1594 1.1 christos
1595 1.1 christos kp = get_key(str);
1596 1.1 christos mcount = get_msgCount();
1597 1.1 christos marray = csalloc(mcount + 1, sizeof(*marray));
1598 1.1 christos kp->loadfn(marray, mcount, current_thread.t_head, str,
1599 1.1 christos kp->flags ? kp->flags : modflags & MF_SKIN);
1600 1.1 christos cmp.fn = get_cmpfn(kp, modflags & MF_IGNCASE);
1601 1.1 christos cmp.inv = modflags & MF_REVERSE;
1602 1.1 christos thread_array(marray, mcount, cutit);
1603 1.1 christos
1604 1.1 christos if (!S_IS_EXPOSE(oldstate))
1605 1.1 christos dot = thread_top(dot);
1606 1.1 christos
1607 1.1 christos restore_state(oldstate);
1608 1.1 christos }
1609 1.1 christos
1610 1.1 christos /*
1611 1.1 christos * The thread command. Thread the current thread on its references or
1612 1.1 christos * on a specified field.
1613 1.1 christos */
1614 1.1 christos PUBLIC int
1615 1.1 christos threadcmd(void *v)
1616 1.1 christos {
1617 1.1 christos char *str;
1618 1.1 christos
1619 1.1 christos str = v;
1620 1.1 christos if (*str == '\0')
1621 1.1 christos thread_on_reference(current_thread.t_head);
1622 1.1 christos else {
1623 1.1 christos int modflags;
1624 1.1 christos modflags = get_modifiers(&str);
1625 1.1 christos thread_current_on(str, modflags, 1);
1626 1.1 christos }
1627 1.1 christos thread_announce(v);
1628 1.1 christos return 0;
1629 1.1 christos }
1630 1.1 christos
1631 1.1 christos /*
1632 1.1 christos * Remove all threading information, reverting to the startup state.
1633 1.1 christos */
1634 1.1 christos PUBLIC int
1635 1.1 christos unthreadcmd(void *v)
1636 1.1 christos {
1637 1.1 christos thread_fix_new_links(message_array.t_head, 0, message_array.t_msgCount);
1638 1.1 christos thread_announce(v);
1639 1.1 christos return 0;
1640 1.1 christos }
1641 1.1 christos
1642 1.1 christos /*
1643 1.1 christos * The sort command.
1644 1.1 christos */
1645 1.1 christos PUBLIC int
1646 1.1 christos sortcmd(void *v)
1647 1.1 christos {
1648 1.1 christos int modflags;
1649 1.1 christos char *str;
1650 1.1 christos
1651 1.1 christos str = v;
1652 1.1 christos modflags = get_modifiers(&str);
1653 1.1 christos if (*str != '\0')
1654 1.1 christos thread_current_on(str, modflags, 0);
1655 1.1 christos else {
1656 1.1 christos if (modflags & MF_REVERSE)
1657 1.1 christos reversecmd_core(¤t_thread);
1658 1.1 christos else {
1659 1.1 christos (void)printf("sort on what?\n");
1660 1.1 christos return 0;
1661 1.1 christos }
1662 1.1 christos }
1663 1.1 christos thread_announce(v);
1664 1.1 christos return 0;
1665 1.1 christos }
1666 1.1 christos
1667 1.1 christos
1668 1.1 christos /*
1669 1.1 christos * Delete duplicate messages (based on their "Message-Id" field).
1670 1.1 christos *
1671 1.1 christos * XXX - This doesn't completely belong here, but what the hell.
1672 1.1 christos */
1673 1.1 christos /*ARGSUSED*/
1674 1.1 christos PUBLIC int
1675 1.1 christos deldupscmd(void *v __unused)
1676 1.1 christos {
1677 1.1 christos struct message *mp;
1678 1.1 christos int depth;
1679 1.1 christos state_t oldstate;
1680 1.1 christos
1681 1.1 christos oldstate = set_state(~(S_RESTRICT|S_EXPOSE), S_EXPOSE);
1682 1.1 christos
1683 1.1 christos thread_current_on(__UNCONST("Message-Id"), 0, 1);
1684 1.1 christos reindex(¤t_thread);
1685 1.1 christos redepth(¤t_thread);
1686 1.1 christos depth = current_thread.t_head->m_depth;
1687 1.1 christos for (mp = first_message(current_thread.t_head); mp; mp = next_message(mp))
1688 1.1 christos if (mp->m_depth > depth ) {
1689 1.1 christos mp->m_flag &= ~(MPRESERVE|MSAVED|MBOX);
1690 1.1 christos mp->m_flag |= MDELETED|MTOUCH;
1691 1.1 christos touch(mp);
1692 1.1 christos }
1693 1.1 christos restore_state(oldstate);
1694 1.1 christos return 0;
1695 1.1 christos }
1696 1.1 christos
1697 1.1 christos #endif /* THREAD_SUPPORT */
1698