Lines Matching defs:marray
665 struct message **marray;
686 marray = csalloc(mcount, sizeof(*marray));
689 marray[i] = tp;
694 marray[i]->m_depth = mp->m_depth;
695 marray[i]->m_plink = mp->m_plink;
696 marray[i]->m_clink = NULL;
697 marray[i]->m_blink = marray[i - 1];
698 marray[i - 1]->m_flink = marray[i];
700 marray[i - 1]->m_flink = nextmp;
702 nextmp->m_blink = marray[i - 1];
781 link_array(struct key_sort_s *marray, size_t mcount)
787 marray[i].mp->m_index = (int)i + 1;
788 marray[i].mp->m_blink = lastmp;
789 marray[i].mp->m_flink = NULL;
791 lastmp->m_flink = marray[i].mp;
792 lastmp = marray[i].mp;
795 current_thread.t_head->m_plink->m_clink = marray[0].mp;
797 current_thread.t_head = marray[0].mp;
801 cut_array(struct key_sort_s *marray, size_t beg, size_t end)
806 assert(marray[beg].mp->m_clink == NULL);
808 marray[beg].mp->m_clink = marray[beg + 1].mp;
809 marray[beg + 1].mp->m_blink = NULL;
811 marray[beg].mp->m_flink = marray[end].mp;
812 if (marray[end].mp)
813 marray[end].mp->m_blink = marray[beg].mp;
815 marray[end - 1].mp->m_flink = NULL;
818 marray[i].mp->m_plink = marray[beg].mp;
823 thread_array(struct key_sort_s *marray, size_t mcount, int cutit)
830 parent = marray[0].mp->m_plink;
831 qsort(marray, mcount, sizeof(*marray), qsort_cmpfn);
832 link_array(marray, mcount);
840 marray[i].mp->m_plink = parent;
841 marray[i].mp->m_clink = NULL;
849 if (cmp.fn(&marray[i], &marray[j]) != 0) {
850 cut_array(marray, i, j);
854 cut_array(marray, i, j);
937 } *marray;
951 marray = csalloc(mcount + 1, sizeof(*marray));
960 marray[i].mp = mp;
961 marray[i].message_id = skin(hfield("message-id", mp));
962 marray[i].parent_id = get_parent_id(mp);
969 parent = marray[0].mp->m_plink;
974 marray[0].mp->m_clink = NULL;
976 marray[i].mp->m_depth = marray[0].mp->m_depth;
977 marray[i].mp->m_plink = marray[0].mp->m_plink;
978 marray[i].mp->m_clink = NULL;
979 marray[i].mp->m_blink = marray[i - 1].mp;
980 marray[i - 1].mp->m_flink = marray[i].mp;
982 marray[i - 1].mp->m_flink = NULL;
992 if ((parent_id = marray[i].parent_id) == NULL)
995 child = marray[i].mp;
1008 if (marray[j].message_id == NULL)
1011 if (equal(marray[j].message_id, parent_id)) {
1023 adopt_child(marray[j].mp, child);
1435 field_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1440 marray[i].mp = mp;
1441 marray[i].key.str =
1443 marray[i].index = mp->m_index;
1449 subj_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1461 marray[i].mp = mp;
1462 marray[i].key.str = subj;
1463 marray[i].index = mp->m_index;
1470 lines_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1486 marray[i].mp = mp;
1487 marray[i].key.lines = use_hlines ? mp->m_lines - mp->m_blines :
1489 marray[i].index = mp->m_index;
1495 size_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1504 marray[i].mp = mp;
1505 marray[i].key.size = mp->m_size;
1506 marray[i].index = mp->m_index;
1512 marray, size_t mcount, struct message *mp,
1536 marray[i].mp = mp;
1537 marray[i].key.time = mktime(&tm);
1538 marray[i].index = mp->m_index;
1544 from_load(struct key_sort_s *marray, size_t mcount, struct message *mp,
1553 marray[i].mp = mp;
1554 marray[i].key.str = nameof(mp, 0);
1555 marray[i].index = mp->m_index;
1630 struct key_sort_s *marray;
1638 marray = csalloc(mcount + 1, sizeof(*marray));
1639 kp->loadfn(marray, mcount, current_thread.t_head, str,
1643 thread_array(marray, mcount, cutit);