| 20 |
#include "log.h" |
#include "log.h" |
| 21 |
#include <stdlib.h> |
#include <stdlib.h> |
| 22 |
#include <string.h> |
#include <string.h> |
| 23 |
|
#include <sys/param.h> |
| 24 |
|
|
| 25 |
ARTICLE_FAVOR BBS_article_favor; |
ARTICLE_FAVOR BBS_article_favor; |
| 26 |
|
|
| 228 |
{ |
{ |
| 229 |
int32_t aid_new[MAX_FAVOR_AID_BASE_CNT]; |
int32_t aid_new[MAX_FAVOR_AID_BASE_CNT]; |
| 230 |
int i, j, k; |
int i, j, k; |
| 231 |
|
int len; |
| 232 |
|
|
| 233 |
if (p_favor == NULL) |
if (p_favor == NULL) |
| 234 |
{ |
{ |
| 258 |
} |
} |
| 259 |
} |
} |
| 260 |
|
|
| 261 |
while (i < p_favor->aid_base_cnt && k < MAX_FAVOR_AID_BASE_CNT) |
len = MIN(p_favor->aid_base_cnt - i, MAX_FAVOR_AID_BASE_CNT - k); |
| 262 |
|
if (len > 0) |
| 263 |
{ |
{ |
| 264 |
aid_new[k++] = p_favor->aid_base[i++]; |
memcpy(aid_new + k, p_favor->aid_base + i, |
| 265 |
|
sizeof(int32_t) * (size_t)len); |
| 266 |
|
i += len; |
| 267 |
|
k += len; |
| 268 |
} |
} |
| 269 |
if (i < p_favor->aid_base_cnt) |
if (i < p_favor->aid_base_cnt) |
| 270 |
{ |
{ |
| 271 |
log_error("Too many base aids, %d will be discarded\n", p_favor->aid_base_cnt - i); |
log_error("Too many base aids, %d will be discarded\n", p_favor->aid_base_cnt - i); |
| 272 |
} |
} |
| 273 |
|
|
| 274 |
while (j < p_favor->aid_inc_cnt && k < MAX_FAVOR_AID_BASE_CNT) |
len = MIN(p_favor->aid_inc_cnt - j, MAX_FAVOR_AID_BASE_CNT - k); |
| 275 |
|
if (len > 0) |
| 276 |
{ |
{ |
| 277 |
aid_new[k++] = p_favor->aid_inc[j++]; |
memcpy(aid_new + k, p_favor->aid_inc + j, |
| 278 |
|
sizeof(int32_t) * (size_t)len); |
| 279 |
|
j += len; |
| 280 |
|
k += len; |
| 281 |
} |
} |
| 282 |
if (j < p_favor->aid_inc_cnt) |
if (j < p_favor->aid_inc_cnt) |
| 283 |
{ |
{ |
| 398 |
|
|
| 399 |
if (aid == p_favor->aid_inc[left] && p_favor->aid_inc_cnt > 0) // Unset |
if (aid == p_favor->aid_inc[left] && p_favor->aid_inc_cnt > 0) // Unset |
| 400 |
{ |
{ |
| 401 |
for (i = left; i < p_favor->aid_inc_cnt - 1; i++) |
if (p_favor->aid_inc_cnt > left + 1) |
| 402 |
{ |
{ |
| 403 |
p_favor->aid_inc[i] = p_favor->aid_inc[i + 1]; |
memmove(p_favor->aid_inc + left, |
| 404 |
|
p_favor->aid_inc + left + 1, |
| 405 |
|
sizeof(int32_t) * (size_t)(p_favor->aid_inc_cnt - left - 1)); |
| 406 |
} |
} |
| 407 |
|
|
| 408 |
(p_favor->aid_inc_cnt)--; |
(p_favor->aid_inc_cnt)--; |
| 436 |
right = left + 1; |
right = left + 1; |
| 437 |
} |
} |
| 438 |
|
|
| 439 |
for (i = p_favor->aid_inc_cnt - 1; i >= right; i--) |
if (p_favor->aid_inc_cnt > right) |
| 440 |
{ |
{ |
| 441 |
p_favor->aid_inc[i + 1] = p_favor->aid_inc[i]; |
memmove(p_favor->aid_inc + right + 1, |
| 442 |
|
p_favor->aid_inc + right, |
| 443 |
|
sizeof(int32_t) * (size_t)(p_favor->aid_inc_cnt - right)); |
| 444 |
} |
} |
| 445 |
|
|
| 446 |
p_favor->aid_inc[right] = aid; |
p_favor->aid_inc[right] = aid; |