*
* 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,
/*
- * 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 single blog post and (optionally) its comments
*/
-void blogpost_render_and_destroy(struct blogpost *bp) {
+void blogpost_render(struct blogpost *bp, int with_comments)
+{
const StrBuf *Mime;
- int p = 0;
int i;
- p = atoi(BSTR("p")); /* are we looking for a specific post? */
WC->bptlid = bp->top_level_id;
- if ( ((p == 0) || (p == bp->top_level_id)) && (bp->num_msgs > 0) ) {
- /* Show the top level post */
+ /* Always show the top level post, unless we somehow ended up with an empty list */
+ if (bp->num_msgs > 0) {
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?go=", bp->top_level_id);
- urlescputs(ChrPtr(WC->CurRoom.name));
- wc_printf("#comments\">");
- wc_printf(_("%d comments"), bp->num_msgs - 1);
- 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) {
- wc_printf(_("%d comments"), 0);
- }
- 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 we were asked to suppress comments, show only the comment count */
+ if (!with_comments) {
+ /* Show the number of comments */
+ wc_printf("<a href=\"readfwd?p=%d?go=", bp->top_level_id);
+ urlescputs(ChrPtr(WC->CurRoom.name));
+ wc_printf("#comments\">");
+ wc_printf(_("%d comments"), bp->num_msgs - 1);
+ 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) {
+ wc_printf(_("%d comments"), 0);
+ }
- if (bp->alloc_msgs > 0) {
- free(bp->msgs);
+ 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);
+ }
}
/* offer the comment box */
- if (p == bp->top_level_id) {
+ if (with_comments) {
do_template("blog_comment_box");
}
+}
+
+
+/*
+ * Destructor for "struct blogpost"
+ */
+void blogpost_destroy(struct blogpost *bp) {
+ if (bp->alloc_msgs > 0) {
+ free(bp->msgs);
+ }
free(bp);
}
HashList *BLOG = (HashList *) *ViewSpecific;
struct bltr b;
struct blogpost *bp = NULL;
+ int p = 0;
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).
+ /* Stop processing if the viewer is only interested in a single post and
+ * that message ID is neither the id nor the refs.
*/
+ p = atoi(BSTR("p")); /* are we looking for a specific post? */
+ if ((p != 0) && (p != b.id) && (p != b.refs)) {
+ return 200;
+ }
+ /*
+ * Add our little bundle of blogworthy wonderfulness to the hash table
+ */
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);
+ 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.
-int blogview_sortfunc(const void *s1, const void *s2) {
- long *l1 = (long *)(s1);
- long *l2 = (long *)(s2);
+ * Sort a list of 'struct blogpost' pointers by newest-to-oldest msgnum.
+ * With big thanks to whoever wrote http://www.c.happycodings.com/Sorting_Searching/code14.html
+ */
+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);
}
- */
-
/*
- * We have to move the render code into this function because it needs to be sorted,
- * and possibly culled to a specific number of messages or date range...
+ * All blogpost entries are now in the hash list.
+ * Sort them, select the desired range, and render what we want to see.
*/
int blogview_render(SharedMessageStatus *Stat, void **ViewSpecific, long oper)
{
const char *Key;
void *Data;
long len;
- struct blogpost *bp;
+ int i;
+ struct blogpost **blogposts = NULL;
+ int num_blogposts = 0;
+ int num_blogposts_alloc = 0;
+ int with_comments = 0;
+
+ /* Comments are shown if we are only viewing a single blog post */
+ if (atoi(BSTR("p"))) with_comments = 1;
+ /* Iterate through the hash list and copy the data pointers into an array */
it = GetNewHashPos(BLOG, 0);
while (GetNextHashPos(BLOG, it, &len, &Key, &Data)) {
- bp = (struct blogpost *) Data;
- wc_printf("Top level ID is %d\n", bp->top_level_id);
- if (bp->num_msgs > 0) {
- wc_printf("; top level msgnum is %ld", bp->msgs[0]);
+ if (num_blogposts >= num_blogposts_alloc) {
+ if (num_blogposts_alloc == 0) {
+ num_blogposts_alloc = 100;
+ }
+ else {
+ num_blogposts_alloc *= 2;
+ }
+ blogposts = realloc(blogposts, (num_blogposts_alloc * sizeof (struct blogpost *)));
}
- wc_printf("<br>\n");
+ blogposts[num_blogposts++] = (struct blogpost *) Data;
}
-
DeleteHashPos(&it);
+
+ /* Now we have our array. It is ONLY an array of pointers. The objects to
+ * which they point are still owned by the hash list.
+ */
+ if (num_blogposts > 0) {
+
+ /* Sort newest-to-oldest */
+ qsort(blogposts, num_blogposts, sizeof(void *), blogview_sortfunc);
+
+ /* FIXME -- allow the user to select a starting point in the list */
+
+ /* FIXME -- allow the user (or a default setting) to select a maximum number of posts to display */
+
+ /* Now go through the list and render what we've got */
+ for (i=0; i<num_blogposts; ++i) {
+ blogpost_render(blogposts[i], with_comments);
+ }
+
+ /* Done. We are only freeing the array of pointers; the data itself
+ * will be freed along with the hash list.
+ */
+ free(blogposts);
+ }
+
return(0);
}
return 0;
}
+
void
InitModule_BLOGVIEWRENDERERS
(void)
projects / citadel.git / blobdiff