1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
|
/* Copyright 2020 Jaakko Keränen <jaakko.keranen@iki.fi>
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
#include "feeds.h"
#include "bookmarks.h"
#include "gmrequest.h"
#include "visited.h"
#include "app.h"
#include <the_Foundation/file.h>
#include <the_Foundation/mutex.h>
#include <the_Foundation/hash.h>
#include <the_Foundation/queue.h>
#include <the_Foundation/path.h>
#include <the_Foundation/regexp.h>
#include <the_Foundation/stringset.h>
#include <the_Foundation/thread.h>
#include <SDL_timer.h>
#include <ctype.h>
iDeclareType(Feeds)
iDeclareType(FeedJob)
iDefineTypeConstruction(FeedEntry)
void init_FeedEntry(iFeedEntry *d) {
iZap(d->timestamp);
init_String(&d->url);
init_String(&d->title);
d->bookmarkId = 0;
}
void deinit_FeedEntry(iFeedEntry *d) {
deinit_String(&d->title);
deinit_String(&d->url);
}
/*----------------------------------------------------------------------------------------------*/
struct Impl_FeedJob {
iString url;
uint32_t bookmarkId;
iTime startTime;
iGmRequest *request;
iPtrArray results;
};
static void init_FeedJob(iFeedJob *d, const iBookmark *bookmark) {
initCopy_String(&d->url, &bookmark->url);
d->bookmarkId = id_Bookmark(bookmark);
d->request = NULL;
init_PtrArray(&d->results);
iZap(d->startTime);
}
static void deinit_FeedJob(iFeedJob *d) {
iRelease(d->request);
iForEach(PtrArray, i, &d->results) {
delete_FeedEntry(i.ptr);
}
deinit_PtrArray(&d->results);
deinit_String(&d->url);
}
iDefineTypeConstructionArgs(FeedJob, (const iBookmark *bm), bm)
/*----------------------------------------------------------------------------------------------*/
static const char *feedsFilename_Feeds_ = "feeds.txt";
struct Impl_Feeds {
iMutex * mtx;
iString saveDir;
iTime lastRefreshedAt;
int refreshTimer;
iThread * worker;
iBool stopWorker;
iPtrArray jobs; /* pending */
iSortedArray entries; /* pointers to all discovered feed entries, sorted by entry ID (URL) */
};
static iFeeds feeds_;
#define maxConcurrentRequests_Feeds 4
static void submit_FeedJob_(iFeedJob *d) {
d->request = new_GmRequest(certs_App());
setUrl_GmRequest(d->request, &d->url);
initCurrent_Time(&d->startTime);
submit_GmRequest(d->request);
}
static iFeedJob *startNextJob_Feeds_(iFeeds *d) {
if (isEmpty_PtrArray(&d->jobs)) {
return NULL;
}
iFeedJob *job;
take_PtrArray(&d->jobs, 0, (void **) &job);
submit_FeedJob_(job);
return job;
}
static void trimTitle_(iString *title) {
const char *start = constBegin_String(title);
iConstForEach(String, i, title) {
start = i.pos;
if (!isSpace_Char(i.value) && !(i.value < 128 && ispunct(i.value))) {
break;
}
}
remove_Block(&title->chars, 0, start - constBegin_String(title));
}
static void parseResult_FeedJob_(iFeedJob *d) {
/* TODO: Should tell the user if the request failed. */
if (isSuccess_GmStatusCode(status_GmRequest(d->request))) {
iBeginCollect();
iRegExp *linkPattern =
new_RegExp("^=>\\s*([^\\s]+)\\s+"
"([0-9][0-9][0-9][0-9]-[0-1][0-9]-[0-3][0-9])"
"([^0-9].*)",
0);
iString src;
initBlock_String(&src, body_GmRequest(d->request));
iRangecc srcLine = iNullRange;
while (nextSplit_Rangecc(range_String(&src), "\n", &srcLine)) {
iRangecc line = srcLine;
trimEnd_Rangecc(&line);
iRegExpMatch m;
init_RegExpMatch(&m);
if (matchRange_RegExp(linkPattern, line, &m)) {
const iRangecc url = capturedRange_RegExpMatch(&m, 1);
const iRangecc date = capturedRange_RegExpMatch(&m, 2);
const iRangecc title = capturedRange_RegExpMatch(&m, 3);
iFeedEntry * entry = new_FeedEntry();
entry->bookmarkId = d->bookmarkId;
setRange_String(&entry->url, url);
set_String(&entry->url, absoluteUrl_String(url_GmRequest(d->request), &entry->url));
setRange_String(&entry->title, title);
trimTitle_(&entry->title);
int year, month, day;
sscanf(date.start, "%04d-%02d-%02d", &year, &month, &day);
init_Time(
&entry->timestamp,
&(iDate){
.year = year, .month = month, .day = day, .hour = 12 /* noon UTC */ });
pushBack_PtrArray(&d->results, entry);
}
}
deinit_String(&src);
iRelease(linkPattern);
iEndCollect();
}
}
static iBool updateEntries_Feeds_(iFeeds *d, iPtrArray *incoming) {
iBool gotNew = iFalse;
lock_Mutex(d->mtx);
iForEach(PtrArray, i, incoming) {
iFeedEntry *entry = i.ptr;
size_t pos;
if (locate_SortedArray(&d->entries, &entry, &pos)) {
iFeedEntry *existing = *(iFeedEntry **) at_SortedArray(&d->entries, pos);
/* Already known, but update it, maybe the time and label have changed. */
iBool changed = iFalse;
if (!equalCase_String(&existing->title, &entry->title) ||
cmp_Time(&existing->timestamp, &entry->timestamp)) {
changed = iTrue;
}
set_String(&existing->title, &entry->title);
existing->timestamp = entry->timestamp;
delete_FeedEntry(entry);
if (changed) {
/* TODO: better to use a new flag for read feed entries? */
removeUrl_Visited(visited_App(), &existing->url);
gotNew = iTrue;
}
}
else {
insert_SortedArray(&d->entries, &entry);
gotNew = iTrue;
}
remove_PtrArrayIterator(&i);
}
unlock_Mutex(d->mtx);
return gotNew;
}
static iThreadResult fetch_Feeds_(iThread *thread) {
iFeeds *d = &feeds_;
iUnused(thread);
iFeedJob *work[maxConcurrentRequests_Feeds]; /* We'll do a couple of concurrent requests. */
iZap(work);
iBool gotNew = iFalse;
postCommand_App("feeds.update.started");
while (!d->stopWorker) {
/* Start new jobs. */
iForIndices(i, work) {
if (!work[i]) {
work[i] = startNextJob_Feeds_(d);
}
}
sleep_Thread(0.5); /* TODO: wait on a Condition so we can exit quickly */
if (d->stopWorker) break;
size_t ongoing = 0;
iForIndices(i, work) {
if (work[i]) {
if (isFinished_GmRequest(work[i]->request)) {
/* TODO: Handle redirects. Need to resubmit the job with new URL. */
parseResult_FeedJob_(work[i]);
gotNew |= updateEntries_Feeds_(d, &work[i]->results);
delete_FeedJob(work[i]);
work[i] = NULL;
}
else {
ongoing++;
}
/* TODO: abort job if it takes too long (> 15 seconds?) */
}
}
/* Stop if everything has finished. */
if (ongoing == 0 && isEmpty_PtrArray(&d->jobs)) {
break;
}
}
postCommandf_App("feeds.update.finished arg:%d", gotNew ? 1 : 0);
initCurrent_Time(&d->lastRefreshedAt);
return 0;
}
static iBool isSubscribed_(void *context, const iBookmark *bm) {
iUnused(context);
return indexOfCStr_String(&bm->tags, "subscribed") != iInvalidPos; /* TODO: RegExp with \b */
}
static iBool startWorker_Feeds_(iFeeds *d) {
if (d->worker) {
return iFalse; /* Oops? */
}
/* Queue up all the subscriptions for the worker. */
iConstForEach(PtrArray, i, list_Bookmarks(bookmarks_App(), NULL, isSubscribed_, NULL)) {
iFeedJob* job = new_FeedJob(i.ptr);
pushBack_PtrArray(&d->jobs, job);
}
if (!isEmpty_Array(&d->jobs)) {
d->worker = new_Thread(fetch_Feeds_);
d->stopWorker = iFalse;
start_Thread(d->worker);
return iTrue;
}
return iFalse;
}
static uint32_t refresh_Feeds_(uint32_t interval, void *data) {
/* Called in the SDL timer thread, so let's start a worker thread for running the update. */
startWorker_Feeds_(&feeds_);
return 1000 * 60 * 60;
}
static void stopWorker_Feeds_(iFeeds *d) {
if (d->worker) {
d->stopWorker = iTrue;
join_Thread(d->worker);
iReleasePtr(&d->worker);
}
/* Clear remaining jobs. */
iForEach(PtrArray, i, &d->jobs) {
delete_FeedJob(i.ptr);
}
clear_PtrArray(&d->jobs);
}
static int cmp_FeedEntryPtr_(const void *a, const void *b) {
const iFeedEntry * const *elem[2] = { a, b };
return cmpString_String(&(*elem[0])->url, &(*elem[1])->url);
}
static void save_Feeds_(iFeeds *d) {
iFile *f = new_File(collect_String(concatCStr_Path(&d->saveDir, feedsFilename_Feeds_)));
if (open_File(f, write_FileMode | text_FileMode)) {
lock_Mutex(d->mtx);
iString *str = new_String();
format_String(str, "%llu\n# Feeds\n", integralSeconds_Time(&d->lastRefreshedAt));
write_File(f, utf8_String(str));
/* Index of feeds for IDs. */ {
iConstForEach(PtrArray, i, list_Bookmarks(bookmarks_App(), NULL, isSubscribed_, NULL)) {
const iBookmark *bm = i.ptr;
format_String(str, "%08x %s\n", id_Bookmark(bm), cstr_String(&bm->url));
write_File(f, utf8_String(str));
}
}
writeData_File(f, "# Entries\n", 10);
iConstForEach(Array, i, &d->entries.values) {
const iFeedEntry *entry = *(const iFeedEntry **) i.value;
format_String(str, "%x\n%llu\n%s\n%s\n",
entry->bookmarkId,
integralSeconds_Time(&entry->timestamp),
cstr_String(&entry->url),
cstr_String(&entry->title));
write_File(f, utf8_String(str));
}
delete_String(str);
close_File(f);
unlock_Mutex(d->mtx);
}
iRelease(f);
}
iDeclareType(FeedHashNode)
struct Impl_FeedHashNode {
iHashNode node;
uint32_t bookmarkId;
};
static void load_Feeds_(iFeeds *d) {
/* TODO: If there are lots of entries, it would make sense to load async. */
iFile *f = new_File(collect_String(concatCStr_Path(&d->saveDir, feedsFilename_Feeds_)));
if (open_File(f, read_FileMode | text_FileMode)) {
iBlock * src = readAll_File(f);
iRangecc line = iNullRange;
int section = 0;
iHash * feeds = new_Hash(); /* mapping from IDs to feed URLs */
while (nextSplit_Rangecc(range_Block(src), "\n", &line)) {
if (equal_Rangecc(line, "# Feeds")) {
section = 1;
continue;
}
else if (equal_Rangecc(line, "# Entries")) {
section = 2;
continue;
}
switch (section) {
case 0: {
unsigned long long ts = 0;
sscanf(line.start, "%llu", &ts);
d->lastRefreshedAt.ts.tv_sec = ts;
break;
}
case 1: {
if (size_Range(&line) > 8) {
uint32_t id = 0;
sscanf(line.start, "%08x", &id);
iString *feedUrl =
collect_String(newRange_String((iRangecc){ line.start + 9, line.end }));
const uint32_t bookmarkId = findUrl_Bookmarks(bookmarks_App(), feedUrl);
if (bookmarkId) {
iFeedHashNode *node = iMalloc(FeedHashNode);
node->node.key = id;
node->bookmarkId = bookmarkId;
insert_Hash(feeds, &node->node);
}
}
break;
}
case 2: {
const uint32_t feedId = strtoul(line.start, NULL, 16);
if (!nextSplit_Rangecc(range_Block(src), "\n", &line)) break;
const unsigned long long ts = strtoull(line.start, NULL, 10);
if (!nextSplit_Rangecc(range_Block(src), "\n", &line)) break;
const iRangecc urlRange = line;
if (!nextSplit_Rangecc(range_Block(src), "\n", &line)) break;
const iRangecc titleRange = line;
iString *url = newRange_String(urlRange);
iString *title = newRange_String(titleRange);
/* Look it up in the hash. */
const iFeedHashNode *node = (iFeedHashNode *) value_Hash(feeds, feedId);
if (node) {
iFeedEntry *entry = new_FeedEntry();
entry->bookmarkId = node->bookmarkId;
entry->timestamp.ts.tv_sec = ts;
set_String(&entry->url, url);
set_String(&entry->title, title);
insert_SortedArray(&d->entries, &entry);
}
delete_String(title);
delete_String(url);
break;
}
}
}
/* Cleanup. */
delete_Block(src);
iForEach(Hash, i, feeds) {
free(i.value);
}
delete_Hash(feeds);
}
iRelease(f);
}
/*----------------------------------------------------------------------------------------------*/
void init_Feeds(const char *saveDir) {
iFeeds *d = &feeds_;
d->mtx = new_Mutex();
initCStr_String(&d->saveDir, saveDir);
iZap(d->lastRefreshedAt);
d->worker = NULL;
init_PtrArray(&d->jobs);
init_SortedArray(&d->entries, sizeof(iFeedEntry *), cmp_FeedEntryPtr_);
load_Feeds_(d);
d->refreshTimer = SDL_AddTimer(5000, refresh_Feeds_, NULL);
}
void deinit_Feeds(void) {
iFeeds *d = &feeds_;
SDL_RemoveTimer(d->refreshTimer);
stopWorker_Feeds_(d);
iAssert(isEmpty_PtrArray(&d->jobs));
deinit_PtrArray(&d->jobs);
save_Feeds_(d);
deinit_String(&d->saveDir);
delete_Mutex(d->mtx);
iForEach(Array, i, &d->entries.values) {
iFeedEntry **entry = i.value;
delete_FeedEntry(*entry);
}
deinit_SortedArray(&d->entries);
}
static int cmpTimeDescending_FeedEntryPtr_(const void *a, const void *b) {
const iFeedEntry * const *e1 = a, * const *e2 = b;
return -cmp_Time(&(*e1)->timestamp, &(*e2)->timestamp);
}
const iPtrArray *listEntries_Feeds(void) {
iFeeds *d = &feeds_;
lock_Mutex(d->mtx);
/* The worker will never delete feed entries so we can use the same ones. Just make a copy
of the array in case the worker modifies it. */
iPtrArray *list = collect_PtrArray(copy_Array(&d->entries.values));
unlock_Mutex(d->mtx);
sort_Array(list, cmpTimeDescending_FeedEntryPtr_);
return list;
}
|