#include "webserver.h"
#include "groupdav.h"
-/*
- * Data which gets passed around between the various functions in this module
- *
- */
+/*
+ * Array type for a blog post. The first message is the post; the rest are comments
+ */
struct blogpost {
- long msgnum;
- StrBuf *id;
- StrBuf *refs;
-};
-
-struct blogview {
- struct blogpost *msgs; /* Array of msgnums for messages we are displaying */
+ 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 */
};
+/*
+ * 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...
+ */
+void blogpost_render_and_destroy(struct blogpost *bp) {
+ const StrBuf *Mime;
+ int p = 0;
+ int i;
+
+ p = atoi(BSTR("p")); /* are we looking for a specific post? */
+
+ if ( ((p == 0) || (p == bp->top_level_id)) && (bp->num_msgs > 0) ) {
+ /* Show the top level post */
+ read_message(WC->WBuf, HKEY("view_blog_post"), bp->msgs[0], NULL, &Mime);
+
+ if (p == 0) {
+ /* Show the number of comments */
+ wc_printf("<a href=\"readfwd?p=%d?gotofirst=", bp->top_level_id);
+ urlescputs(ChrPtr(WC->CurRoom.name));
+ wc_printf("#comments\">");
+ wc_printf(_("%d comments"), bp->num_msgs - 1);
+ wc_printf("</a>");
+ }
+ else if (bp->num_msgs < 2) {
+ wc_printf(_("%d comments"), 0);
+ }
+ else {
+ wc_printf("<a name=\"comments\"></a>\n");
+ wc_printf(_("%d comments"), bp->num_msgs - 1);
+ wc_printf("<br>\n");
+ wc_printf("<blockquote>");
+ for (i=1; i<bp->num_msgs; ++i) {
+ read_message(WC->WBuf, HKEY("view_blog_comment"), bp->msgs[i], NULL, &Mime);
+ }
+ wc_printf("</blockquote>");
+ }
+ }
+
+
+ if (bp->alloc_msgs > 0) {
+ free(bp->msgs);
+ }
+ free(bp);
+}
+
+
+/*
+ * Data which gets returned from a call to blogview_learn_thread_references()
+ */
+struct bltr {
+ int id;
+ int refs;
+};
+
+
/*
* Entry point for message read operations.
*/
char *cmd,
long len)
{
- struct blogview *BLOG = malloc(sizeof(struct blogview));
- memset(BLOG, 0, sizeof(struct blogview));
+ HashList *BLOG = NewHash(1, NULL);
*ViewSpecific = BLOG;
Stat->startmsg = (-1); /* not used here */
}
+/*
+ * Given a 'struct blogpost' containing a msgnum, populate the id
+ * and refs fields by fetching them from the Citadel server
+ */
+struct bltr blogview_learn_thread_references(long msgnum)
+{
+ StrBuf *Buf;
+ StrBuf *r;
+ struct bltr bltr = { 0, 0 } ;
+ Buf = NewStrBuf();
+ r = NewStrBuf();
+ serv_printf("MSG0 %ld|1", msgnum); /* top level citadel headers only */
+ StrBuf_ServGetln(Buf);
+ if (GetServerStatus(Buf, NULL) == 1) {
+ while (StrBuf_ServGetln(Buf), strcmp(ChrPtr(Buf), "000")) {
+ if (!strncasecmp(ChrPtr(Buf), "msgn=", 5)) {
+ StrBufCutLeft(Buf, 5);
+ bltr.id = HashLittle(ChrPtr(Buf), StrLength(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));
+ }
+ }
+ }
+ FreeStrBuf(&Buf);
+ FreeStrBuf(&r);
+ return(bltr);
+}
+
+
/*
* This function is called for every message in the list.
*/
int is_new,
int i)
{
- struct blogview *BLOG = (struct blogview *) *ViewSpecific;
+ HashList *BLOG = (HashList *) *ViewSpecific;
+ struct bltr b;
+ struct blogpost *bp = NULL;
- if (BLOG->alloc_msgs == 0) {
- BLOG->alloc_msgs = 1000;
- BLOG->msgs = malloc(BLOG->alloc_msgs * sizeof(struct blogpost));
- memset(BLOG->msgs, 0, (BLOG->alloc_msgs * sizeof(struct blogpost)) );
- }
+ b = blogview_learn_thread_references(Msg->msgnum);
+
+ /* 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).
+ */
- /* Check our buffer size */
- if (BLOG->num_msgs >= BLOG->alloc_msgs) {
- BLOG->alloc_msgs *= 2;
- BLOG->msgs = realloc(BLOG->msgs, (BLOG->alloc_msgs * sizeof(long)));
- memset(&BLOG->msgs[BLOG->num_msgs], 0, ((BLOG->alloc_msgs - BLOG->num_msgs) * sizeof(long)) );
+ 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);
+ }
+ else {
+ GetHash(BLOG, (const char *)&b.refs , sizeof(b.refs), (void *)&bp);
}
- BLOG->msgs[BLOG->num_msgs++].msgnum = Msg->msgnum;
- BLOG->msgs[BLOG->num_msgs].id = NULL;
- BLOG->msgs[BLOG->num_msgs].refs = NULL;
+ /*
+ * Now we have a 'struct blogpost' to which we can add a message. It's either the
+ * blog post itself or a comment attached to it; either way, the code is the same from
+ * this point onward.
+ */
+ if (bp != NULL) {
+ if (bp->alloc_msgs == 0) {
+ bp->alloc_msgs = 1000;
+ bp->msgs = malloc(bp->alloc_msgs * sizeof(long));
+ memset(bp->msgs, 0, (bp->alloc_msgs * sizeof(long)) );
+ }
+ if (bp->num_msgs >= bp->alloc_msgs) {
+ bp->alloc_msgs *= 2;
+ bp->msgs = realloc(bp->msgs, (bp->alloc_msgs * sizeof(long)));
+ memset(&bp->msgs[bp->num_msgs], 0,
+ ((bp->alloc_msgs - bp->num_msgs) * sizeof(long)) );
+ }
+ bp->msgs[bp->num_msgs++] = Msg->msgnum;
+ }
return 200;
}
/*
- * People expect blogs to be sorted newest-to-oldest
+ * Sort a list of 'struct blogpost' objects by newest-to-oldest msgnum.
*/
int blogview_sortfunc(const void *s1, const void *s2) {
- struct blogpost *l1 = (struct blogpost *)(s1);
- struct blogpost *l2 = (struct blogpost *)(s2);
+ long *l1 = (long *)(s1);
+ long *l2 = (long *)(s2);
- if (l1->msgnum > l2->msgnum) return(-1);
- if (l1->msgnum < l2->msgnum) return(+1);
+ if (*l1 > *l2) return(-1);
+ if (*l1 < *l2) return(+1);
return(0);
}
-int blogview_render(SharedMessageStatus *Stat,
- void **ViewSpecific,
- long oper)
+int blogview_render(SharedMessageStatus *Stat, void **ViewSpecific, long oper)
{
- struct blogview *BLOG = (struct blogview *) *ViewSpecific;
- int i;
+ /*HashList *BLOG = (HashList *) *ViewSpecific;*/
- if (Stat->nummsgs > 0) {
- lprintf(9, "sorting %d messages\n", BLOG->num_msgs);
- qsort(BLOG->msgs, (size_t)(BLOG->num_msgs), sizeof(struct blogpost), blogview_sortfunc);
- }
-
- for (i=0; (i<BLOG->num_msgs); ++i) {
- if (BLOG->msgs[i].msgnum > 0L) {
-
- /* maybe put some of this into its own function later */
- StrBuf *Buf;
- Buf = NewStrBuf();
- serv_printf("MSG0 %ld|1", BLOG->msgs[i].msgnum);/* top level citadel headers only */
- StrBuf_ServGetln(Buf);
- if (GetServerStatus(Buf, NULL) == 1) {
- while (StrBuf_ServGetln(Buf), strcmp(ChrPtr(Buf), "000")) {
- if (!strncasecmp(ChrPtr(Buf), "msgn=", 5)) {
- BLOG->msgs[i].id = NewStrBufDup(Buf);
- StrBufCutLeft(BLOG->msgs[i].id, 5);
- }
- else if (!strncasecmp(ChrPtr(Buf), "wefw=", 5)) {
- BLOG->msgs[i].refs = NewStrBufDup(Buf);
- StrBufCutLeft(BLOG->msgs[i].refs, 5);
- }
- }
- }
- FreeStrBuf(&Buf);
- wc_printf("Message %d, #%ld, id '%s', refs '%s'<br>\n",
- i,
- BLOG->msgs[i].msgnum,
- ChrPtr(BLOG->msgs[i].id),
- ChrPtr(BLOG->msgs[i].refs)
- );
- }
- }
+ /*
+ * No code needed here -- we render during disposition.
+ * Maybe this is the location where we want to handle pretty permalinks.
+ */
return(0);
}
int blogview_Cleanup(void **ViewSpecific)
{
- struct blogview *BLOG = (struct blogview *) *ViewSpecific;
- int i;
+ HashList *BLOG = (HashList *) *ViewSpecific;
- if (BLOG->alloc_msgs != 0) {
- for (i=0; i<BLOG->num_msgs; ++i) {
- FreeStrBuf(&BLOG->msgs[i].id);
- FreeStrBuf(&BLOG->msgs[i].refs);
- }
- free(BLOG->msgs);
- }
- free(BLOG);
+ DeleteHash(&BLOG);
wDumpContent(1);
return 0;
projects / citadel.git / blobdiff