2 * Blog view renderer module for WebCit
4 * Copyright (c) 1996-2011 by the citadel.org team
6 * This program is open source software. You can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation; either version 3 of the
9 * License, or (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #include "webserver.h"
27 * Generate a permalink for a post
28 * (Call with NULL arguments to make this function wcprintf() the permalink
29 * instead of writing it to the template)
31 void tmplput_blog_permalink(StrBuf *Target, WCTemplputParams *TP) {
34 strcpy(perma, "/readfwd?go=");
35 urlesc(&perma[strlen(perma)], sizeof(perma)-strlen(perma), (char *)ChrPtr(WC->CurRoom.name));
36 snprintf(&perma[strlen(perma)], sizeof(perma)-strlen(perma), "?p=%d", WC->bptlid);
38 wc_printf("%s", perma);
41 StrBufAppendPrintf(Target, "%s", perma);
47 * Render (maybe) a single blog post and (maybe) its comments
49 void blogpost_render(struct blogpost *bp) {
54 p = atoi(BSTR("p")); /* are we looking for a specific post? */
55 WC->bptlid = bp->top_level_id;
57 if ( ((p == 0) || (p == bp->top_level_id)) && (bp->num_msgs > 0) ) {
58 /* Show the top level post */
59 read_message(WC->WBuf, HKEY("view_blog_post"), bp->msgs[0], NULL, &Mime);
62 /* Show the number of comments */
63 wc_printf("<a href=\"readfwd?p=%d?go=", bp->top_level_id);
64 urlescputs(ChrPtr(WC->CurRoom.name));
65 wc_printf("#comments\">");
66 wc_printf(_("%d comments"), bp->num_msgs - 1);
67 wc_printf("</a> | <a href=\"");
68 tmplput_blog_permalink(NULL, NULL);
69 wc_printf("\">%s</a>", _("permalink"));
70 wc_printf("<br><br><br>\n");
72 else if (bp->num_msgs < 2) {
73 wc_printf(_("%d comments"), 0);
76 wc_printf("<a name=\"comments\"></a>\n");
77 wc_printf(_("%d comments"), bp->num_msgs - 1);
78 wc_printf(" | <a href=\"");
79 tmplput_blog_permalink(NULL, NULL);
80 wc_printf("\">%s</a>", _("permalink"));
82 for (i=1; i<bp->num_msgs; ++i) {
83 read_message(WC->WBuf, HKEY("view_blog_comment"), bp->msgs[i], NULL, &Mime);
88 /* offer the comment box */
89 if (p == bp->top_level_id) {
90 do_template("blog_comment_box");
97 * Destructor for "struct blogpost"
99 void blogpost_destroy(struct blogpost *bp) {
100 if (bp->alloc_msgs > 0) {
108 * Entry point for message read operations.
110 int blogview_GetParamsGetServerCall(SharedMessageStatus *Stat,
116 HashList *BLOG = NewHash(1, NULL);
117 *ViewSpecific = BLOG;
119 Stat->startmsg = (-1); /* not used here */
120 Stat->sortit = 1; /* not used here */
121 Stat->num_displayed = DEFAULT_MAXMSGS; /* not used here */
122 if (Stat->maxmsgs == 0) Stat->maxmsgs = DEFAULT_MAXMSGS;
124 /* perform a "read all" call to fetch the message list -- we'll cut it down later */
125 rlid[2].cmd(cmd, len);
132 * Given a msgnum, populate the id and refs fields of
133 * a "struct bltr" by fetching them from the Citadel server
135 struct bltr blogview_learn_thread_references(long msgnum)
140 struct bltr bltr = { 0, 0 } ;
143 serv_printf("MSG0 %ld|1", msgnum); /* top level citadel headers only */
144 StrBuf_ServGetln(Buf);
145 if (GetServerStatus(Buf, NULL) == 1) {
146 while (len = StrBuf_ServGetln(Buf),
148 ((len != 3) || strcmp(ChrPtr(Buf), "000") )))
150 if (!strncasecmp(ChrPtr(Buf), "msgn=", 5)) {
151 StrBufCutLeft(Buf, 5);
152 bltr.id = ThreadIdHash(Buf);
154 else if (!strncasecmp(ChrPtr(Buf), "wefw=", 5)) {
155 StrBufCutLeft(Buf, 5); /* trim the field name */
156 StrBufExtract_token(r, Buf, 0, '|');
157 bltr.refs = ThreadIdHash(r);
168 * This function is called for every message in the list.
170 int blogview_LoadMsgFromServer(SharedMessageStatus *Stat,
172 message_summary* Msg,
176 HashList *BLOG = (HashList *) *ViewSpecific;
178 struct blogpost *bp = NULL;
180 b = blogview_learn_thread_references(Msg->msgnum);
182 /* FIXME an optimization here -- one we ought to perform -- is to exit this
183 * function immediately if the viewer is only interested in a single post and
184 * that message ID is neither the id nor the refs. Actually, that might *be*
185 * the way to display only a single message (with or without comments).
189 bp = malloc(sizeof(struct blogpost));
190 if (!bp) return(200);
191 memset(bp, 0, sizeof (struct blogpost));
192 bp->top_level_id = b.id;
193 Put(BLOG, (const char *)&b.id, sizeof(b.id), bp, (DeleteHashDataFunc)blogpost_destroy);
196 GetHash(BLOG, (const char *)&b.refs , sizeof(b.refs), (void *)&bp);
200 * Now we have a 'struct blogpost' to which we can add a message. It's either the
201 * blog post itself or a comment attached to it; either way, the code is the same from
205 if (bp->alloc_msgs == 0) {
206 bp->alloc_msgs = 1000;
207 bp->msgs = malloc(bp->alloc_msgs * sizeof(long));
208 memset(bp->msgs, 0, (bp->alloc_msgs * sizeof(long)) );
210 if (bp->num_msgs >= bp->alloc_msgs) {
212 bp->msgs = realloc(bp->msgs, (bp->alloc_msgs * sizeof(long)));
213 memset(&bp->msgs[bp->num_msgs], 0,
214 ((bp->alloc_msgs - bp->num_msgs) * sizeof(long)) );
216 bp->msgs[bp->num_msgs++] = Msg->msgnum;
224 * Sort a list of 'struct blogpost' objects by newest-to-oldest msgnum.
225 * With big thanks to whoever wrote http://www.c.happycodings.com/Sorting_Searching/code14.html
227 static int blogview_sortfunc(const void *a, const void *b) {
228 struct blogpost * const *one = a;
229 struct blogpost * const *two = b;
231 if ( (*one)->msgs[0] > (*two)->msgs[0] ) return(-1);
232 if ( (*one)->msgs[0] < (*two)->msgs[0] ) return(+1);
238 * All blogpost entries are now in the hash list.
239 * Sort them, (FIXME cull by date range if needed,) and render what we want to see.
241 int blogview_render(SharedMessageStatus *Stat, void **ViewSpecific, long oper)
243 HashList *BLOG = (HashList *) *ViewSpecific;
249 struct blogpost **blogposts = NULL;
250 int num_blogposts = 0;
251 int num_blogposts_alloc = 0;
253 it = GetNewHashPos(BLOG, 0);
254 while (GetNextHashPos(BLOG, it, &len, &Key, &Data)) {
255 if (num_blogposts >= num_blogposts_alloc) {
256 if (num_blogposts_alloc == 0) {
257 num_blogposts_alloc = 100;
258 blogposts = malloc((num_blogposts_alloc * sizeof (struct blogpost *)));
261 num_blogposts_alloc *= 2;
262 blogposts = realloc(blogposts, (num_blogposts_alloc * sizeof (struct blogpost *)));
265 blogposts[num_blogposts++] = (struct blogpost *) Data;
269 if (num_blogposts > 0) {
270 qsort(blogposts, num_blogposts, sizeof(void *), blogview_sortfunc);
272 /* FIXME this is where we handle date ranges etc */
274 for (i=0; i<num_blogposts; ++i) {
275 blogpost_render(blogposts[i]);
284 int blogview_Cleanup(void **ViewSpecific)
286 HashList *BLOG = (HashList *) *ViewSpecific;
296 InitModule_BLOGVIEWRENDERERS
299 RegisterReadLoopHandlerset(
301 blogview_GetParamsGetServerCall,
304 blogview_LoadMsgFromServer,
308 RegisterNamespace("BLOG:PERMALINK", 0, 0, tmplput_blog_permalink, NULL, CTX_NONE);