*
* This program is open source software. You can redistribute it and/or
* modify it under the terms of the GNU General Public License as
- * published by the Free Software Foundation; either version 3 of the
+ * published by the Free Software Foundation -- either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
#include "groupdav.h"
-/*
- * Array type for a blog post. The first message is the post; the rest are comments
+/*
+ * Generate a permalink for a post
+ * (Call with NULL arguments to make this function wcprintf() the permalink
+ * instead of writing it to the template)
*/
-struct blogpost {
- int top_level_id;
- long *msgs; /* Array of msgnums for messages we are displaying */
- int num_msgs; /* Number of msgnums stored in 'msgs' */
- int alloc_msgs; /* Currently allocated size of array */
-};
+void tmplput_blog_permalink(StrBuf *Target, WCTemplputParams *TP) {
+ char perma[SIZ];
+
+ strcpy(perma, "/readfwd?go=");
+ urlesc(&perma[strlen(perma)], sizeof(perma)-strlen(perma), (char *)ChrPtr(WC->CurRoom.name));
+ snprintf(&perma[strlen(perma)], sizeof(perma)-strlen(perma), "?p=%d", WC->bptlid);
+ if (!Target) {
+ wc_printf("%s", perma);
+ }
+ else {
+ StrBufAppendPrintf(Target, "%s", perma);
+ }
+}
/*
- * Destructor for 'struct blogpost' which does the rendering first.
- * By rendering from here, we eliminate the need for a separate iterator, although
- * we might run into trouble when we get around to displaying newest-to-oldest...
+ * Render (maybe) a single blog post and (maybe) its comments
*/
-void blogpost_render_and_destroy(struct blogpost *bp) {
+void blogpost_render(struct blogpost *bp) {
const StrBuf *Mime;
int p = 0;
int i;
urlescputs(ChrPtr(WC->CurRoom.name));
wc_printf("#comments\">");
wc_printf(_("%d comments"), bp->num_msgs - 1);
- wc_printf("</a>");
+ wc_printf("</a> | <a href=\"");
+ tmplput_blog_permalink(NULL, NULL);
+ wc_printf("\">%s</a>", _("permalink"));
wc_printf("<br><br><br>\n");
}
else if (bp->num_msgs < 2) {
else {
wc_printf("<a name=\"comments\"></a>\n");
wc_printf(_("%d comments"), bp->num_msgs - 1);
+ wc_printf(" | <a href=\"");
+ tmplput_blog_permalink(NULL, NULL);
+ wc_printf("\">%s</a>", _("permalink"));
wc_printf("<br>\n");
for (i=1; i<bp->num_msgs; ++i) {
read_message(WC->WBuf, HKEY("view_blog_comment"), bp->msgs[i], NULL, &Mime);
}
}
-
- if (bp->alloc_msgs > 0) {
- free(bp->msgs);
+ /* offer the comment box */
+ if (p == bp->top_level_id) {
+ do_template("blog_comment_box");
}
- free(bp);
+
}
/*
- * Data which gets returned from a call to blogview_learn_thread_references()
+ * Destructor for "struct blogpost"
*/
-struct bltr {
- int id;
- int refs;
- char euid[BLOG_EUIDBUF_SIZE]; /* please do not change this to a StrBuf */
-};
+void blogpost_destroy(struct blogpost *bp) {
+ if (bp->alloc_msgs > 0) {
+ free(bp->msgs);
+ }
+ free(bp);
+}
/*
/*
- * Given a 'struct blogpost' containing a msgnum, populate the id
- * and refs fields by fetching them from the Citadel server
+ * Given a msgnum, populate the id and refs fields of
+ * a "struct bltr" by fetching them from the Citadel server
*/
struct bltr blogview_learn_thread_references(long msgnum)
{
StrBuf *Buf;
StrBuf *r;
int len;
- struct bltr bltr = { 0, 0, "" } ;
+ struct bltr bltr = { 0, 0 } ;
Buf = NewStrBuf();
r = NewStrBuf();
serv_printf("MSG0 %ld|1", msgnum); /* top level citadel headers only */
{
if (!strncasecmp(ChrPtr(Buf), "msgn=", 5)) {
StrBufCutLeft(Buf, 5);
- bltr.id = HashLittle(ChrPtr(Buf), StrLength(Buf));
+ bltr.id = ThreadIdHash(Buf);
}
else if (!strncasecmp(ChrPtr(Buf), "wefw=", 5)) {
StrBufCutLeft(Buf, 5); /* trim the field name */
StrBufExtract_token(r, Buf, 0, '|');
- bltr.refs = HashLittle(ChrPtr(r), StrLength(r));
- }
- else if (!strncasecmp(ChrPtr(Buf), "exti=", 5)) {
- StrBufCutLeft(Buf, 5); /* trim the field name */
- safestrncpy(bltr.euid, ChrPtr(Buf), sizeof(bltr.euid));
+ bltr.refs = ThreadIdHash(r);
}
}
}
b = blogview_learn_thread_references(Msg->msgnum);
- if (!IsEmptyStr(b.euid)) {
- syslog(LOG_DEBUG, "\033[7m%s\033[0m", b.euid);
- }
-
/* FIXME an optimization here -- one we ought to perform -- is to exit this
* function immediately if the viewer is only interested in a single post and
- * that message ID is neither the id nor the refs. Actually, that might *be*
- * the way to display only a single message (with or without comments).
+ * that message ID is neither the id nor the refs.
*/
if (b.refs == 0) {
bp = malloc(sizeof(struct blogpost));
if (!bp) return(200);
memset(bp, 0, sizeof (struct blogpost));
- bp->top_level_id = b.id;
- Put(BLOG, (const char *)&b.id, sizeof(b.id), bp,
- (DeleteHashDataFunc)blogpost_render_and_destroy);
+ bp->top_level_id = b.id;
+ Put(BLOG, (const char *)&b.id, sizeof(b.id), bp, (DeleteHashDataFunc)blogpost_destroy);
}
else {
GetHash(BLOG, (const char *)&b.refs , sizeof(b.refs), (void *)&bp);
/*
* Sort a list of 'struct blogpost' objects by newest-to-oldest msgnum.
+ * With big thanks to whoever wrote http://www.c.happycodings.com/Sorting_Searching/code14.html
*/
-int blogview_sortfunc(const void *s1, const void *s2) {
- long *l1 = (long *)(s1);
- long *l2 = (long *)(s2);
+static int blogview_sortfunc(const void *a, const void *b) {
+ struct blogpost * const *one = a;
+ struct blogpost * const *two = b;
- if (*l1 > *l2) return(-1);
- if (*l1 < *l2) return(+1);
+ if ( (*one)->msgs[0] > (*two)->msgs[0] ) return(-1);
+ if ( (*one)->msgs[0] < (*two)->msgs[0] ) return(+1);
return(0);
}
+/*
+ * All blogpost entries are now in the hash list.
+ * Sort them, (FIXME cull by date range if needed,) and render what we want to see.
+ */
int blogview_render(SharedMessageStatus *Stat, void **ViewSpecific, long oper)
{
- /*HashList *BLOG = (HashList *) *ViewSpecific;*/
+ HashList *BLOG = (HashList *) *ViewSpecific;
+ HashPos *it;
+ const char *Key;
+ void *Data;
+ long len;
+ int i;
+ struct blogpost **blogposts = NULL;
+ int num_blogposts = 0;
+ int num_blogposts_alloc = 0;
+
+ it = GetNewHashPos(BLOG, 0);
+ while (GetNextHashPos(BLOG, it, &len, &Key, &Data)) {
+ if (num_blogposts >= num_blogposts_alloc) {
+ if (num_blogposts_alloc == 0) {
+ num_blogposts_alloc = 100;
+ blogposts = malloc((num_blogposts_alloc * sizeof (struct blogpost *)));
+ }
+ else {
+ num_blogposts_alloc *= 2;
+ blogposts = realloc(blogposts, (num_blogposts_alloc * sizeof (struct blogpost *)));
+ }
+ }
+ blogposts[num_blogposts++] = (struct blogpost *) Data;
+ }
+ DeleteHashPos(&it);
- /*
- * No code needed here -- we render during disposition.
- * Maybe this is the location where we want to handle pretty permalinks.
- */
+ if (num_blogposts > 0) {
+ qsort(blogposts, num_blogposts, sizeof(void *), blogview_sortfunc);
+
+ /* FIXME this is where we handle date ranges etc */
+ for (i=0; i<num_blogposts; ++i) {
+ blogpost_render(blogposts[i]);
+ }
+ free(blogposts);
+ }
return(0);
}
return 0;
}
-/*
- * Generate a permalink for a post
- */
-void tmplput_blog_permalink(StrBuf *Target, WCTemplputParams *TP) {
- char perma[SIZ];
-
- strcpy(perma, "/readfwd?go=");
- urlesc(&perma[strlen(perma)], sizeof(perma)-strlen(perma), ChrPtr(WC->CurRoom.name));
- snprintf(&perma[strlen(perma)], sizeof(perma)-strlen(perma), "?p=%d", WC->bptlid);
- StrBufAppendPrintf(Target, "%s", perma);
-}
-
void
InitModule_BLOGVIEWRENDERERS
projects / citadel.git / blobdiff