| 1 |
/***************************************************************************
|
| 2 |
section_list.h - description
|
| 3 |
-------------------
|
| 4 |
Copyright : (C) 2004-2025 by Leaflet
|
| 5 |
Email : leaflet@leafok.com
|
| 6 |
***************************************************************************/
|
| 7 |
|
| 8 |
/***************************************************************************
|
| 9 |
* *
|
| 10 |
* This program is free software; you can redistribute it and/or modify *
|
| 11 |
* it under the terms of the GNU General Public License as published by *
|
| 12 |
* the Free Software Foundation; either version 3 of the License, or *
|
| 13 |
* (at your option) any later version. *
|
| 14 |
* *
|
| 15 |
***************************************************************************/
|
| 16 |
|
| 17 |
#include "common.h"
|
| 18 |
#include "bbs.h"
|
| 19 |
#include <time.h>
|
| 20 |
|
| 21 |
#define BBS_article_title_max_len 80
|
| 22 |
#define BBS_article_limit_per_section 50000
|
| 23 |
#define BBS_article_limit_per_page 20
|
| 24 |
|
| 25 |
#define ARTICLE_PER_BLOCK 1000
|
| 26 |
|
| 27 |
struct article_t
|
| 28 |
{
|
| 29 |
int32_t aid;
|
| 30 |
int32_t tid;
|
| 31 |
int32_t sid;
|
| 32 |
int32_t cid;
|
| 33 |
int32_t uid;
|
| 34 |
struct article_t *p_prior; // prior article
|
| 35 |
struct article_t *p_next; // next article
|
| 36 |
struct article_t *p_topic_prior; // same topic
|
| 37 |
struct article_t *p_topic_next; // same topic
|
| 38 |
int8_t visible;
|
| 39 |
int8_t excerption;
|
| 40 |
int8_t ontop;
|
| 41 |
int8_t lock;
|
| 42 |
int8_t transship;
|
| 43 |
char username[BBS_username_max_len + 1];
|
| 44 |
char nickname[BBS_nickname_max_len + 1];
|
| 45 |
char title[BBS_article_title_max_len + 1];
|
| 46 |
time_t sub_dt;
|
| 47 |
};
|
| 48 |
typedef struct article_t ARTICLE;
|
| 49 |
|
| 50 |
struct section_list_t
|
| 51 |
{
|
| 52 |
int32_t sid;
|
| 53 |
int32_t class_id;
|
| 54 |
int8_t enable;
|
| 55 |
char sname[BBS_section_name_max_len + 1];
|
| 56 |
char stitle[BBS_section_title_max_len + 1];
|
| 57 |
char master_name[BBS_username_max_len + 1];
|
| 58 |
int read_user_level;
|
| 59 |
int write_user_level;
|
| 60 |
int32_t article_count;
|
| 61 |
int32_t topic_count;
|
| 62 |
int32_t visible_article_count;
|
| 63 |
int32_t visible_topic_count;
|
| 64 |
ARTICLE *p_article_head;
|
| 65 |
ARTICLE *p_article_tail;
|
| 66 |
ARTICLE *p_page_first_article[BBS_article_limit_per_section / BBS_article_limit_per_page];
|
| 67 |
int32_t page_count;
|
| 68 |
int32_t last_page_visible_article_count;
|
| 69 |
};
|
| 70 |
typedef struct section_list_t SECTION_LIST;
|
| 71 |
|
| 72 |
// article_block_count * ARTICLE_PER_BLOCK should be
|
| 73 |
// no less than BBS_article_limit_per_section * BBS_max_section,
|
| 74 |
// in order to allocate enough memory for blocks
|
| 75 |
extern int article_block_init(const char *filename, int block_count);
|
| 76 |
extern void article_block_cleanup(void);
|
| 77 |
|
| 78 |
extern int set_article_block_shm_readonly(void);
|
| 79 |
extern int detach_article_block_shm(void);
|
| 80 |
|
| 81 |
extern int article_block_reset(void);
|
| 82 |
|
| 83 |
extern ARTICLE *article_block_find_by_aid(int32_t aid);
|
| 84 |
extern ARTICLE *article_block_find_by_index(int index);
|
| 85 |
|
| 86 |
extern int32_t article_block_last_aid(void);
|
| 87 |
extern int article_block_article_count(void);
|
| 88 |
|
| 89 |
extern int article_count_of_topic(int32_t aid);
|
| 90 |
|
| 91 |
extern int section_list_init(const char *filename);
|
| 92 |
extern void section_list_cleanup(void);
|
| 93 |
|
| 94 |
extern int set_section_list_shm_readonly(void);
|
| 95 |
extern int detach_section_list_shm(void);
|
| 96 |
|
| 97 |
extern SECTION_LIST *section_list_create(int32_t sid, const char *sname, const char *stitle, const char *master_name);
|
| 98 |
extern void section_list_reset_articles(SECTION_LIST *p_section);
|
| 99 |
extern SECTION_LIST *section_list_find_by_name(const char *sname);
|
| 100 |
extern SECTION_LIST *section_list_find_by_sid(int32_t sid);
|
| 101 |
extern int get_section_index(SECTION_LIST *p_section);
|
| 102 |
|
| 103 |
extern int section_list_append_article(SECTION_LIST *p_section, const ARTICLE *p_article_src);
|
| 104 |
extern int section_list_set_article_visible(SECTION_LIST *p_section, int32_t aid, int8_t visible);
|
| 105 |
|
| 106 |
// *p_page, *p_offset will be set as page / offset of the article with aid in *p_section (including both visible and invisible articles)
|
| 107 |
// *pp_next will be set as pointer to the next article of the article with aid
|
| 108 |
// *pp_next will be set as head article of the section if the article with aid locates at the tail of the section
|
| 109 |
extern ARTICLE *section_list_find_article_with_offset(SECTION_LIST *p_section, int32_t aid, int32_t *p_page, int32_t *p_offset, ARTICLE **pp_next);
|
| 110 |
|
| 111 |
extern int section_list_calculate_page(SECTION_LIST *p_section, int32_t start_aid);
|
| 112 |
extern int section_list_move_topic(SECTION_LIST *p_section_src, SECTION_LIST *p_section_dest, int32_t aid);
|
| 113 |
|
| 114 |
extern int section_list_try_rd_lock(SECTION_LIST *p_section, int wait_sec);
|
| 115 |
extern int section_list_try_rw_lock(SECTION_LIST *p_section, int wait_sec);
|
| 116 |
extern int section_list_rd_unlock(SECTION_LIST *p_section);
|
| 117 |
extern int section_list_rw_unlock(SECTION_LIST *p_section);
|
| 118 |
extern int section_list_rd_lock(SECTION_LIST *p_section);
|
| 119 |
extern int section_list_rw_lock(SECTION_LIST *p_section);
|
Parent Directory
| 
Revision Log