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
|
/*
* Copyright (c) 2020, yzrh <yzrh@noema.org>
*
* SPDX-License-Identifier: Apache-2.0
*/
#include <stdlib.h>
#include <string.h>
#include "cnki.h"
#include "iconv.h"
#include "pdf.h"
/*
* It will write first, list, and count to *stat
* so that when called recursively, it knows
* what to do
*/
static int
_outline(pdf_object_t **pdf, object_outline_tree_t **outline_tree, int id, int **stat)
{
*stat = malloc(3 * sizeof(int));
if (*stat == NULL)
return 1;
int size;
char *str;
int *ret;
char buf[64];
char dictionary[1024];
object_outline_tree_t *ptr = *outline_tree;
(*stat)[0] = ptr->id;
(*stat)[2] = 0;
while (ptr != NULL) {
memset(dictionary, 0, 1024);
strcat(dictionary, "<<\n");
size = 512;
str = NULL;
if (strconv(&str, "UTF-16BE",
ptr->item->title, "GB18030",
&size) == 0) {
strcat(dictionary, "/Title <feff");
for (int i = 0; i < size; i++) {
snprintf(buf, 64, "%02x", (unsigned char) str[i]);
strcat(dictionary, buf);
}
strcat(dictionary, ">\n");
}
free(str);
snprintf(buf, 64, "/Parent %d 0 R\n", id);
strcat(dictionary, buf);
if (ptr->up != NULL && ptr->up->id != id) {
snprintf(buf, 64, "/Prev %d 0 R\n", ptr->up->id);
strcat(dictionary, buf);
}
if (ptr->left != NULL) {
snprintf(buf, 64, "/Next %d 0 R\n", ptr->left->id);
strcat(dictionary, buf);
}
if (ptr->right != NULL) {
_outline(pdf, &ptr->right, ptr->id, &ret);
snprintf(buf, 64, "/First %d 0 R\n", ret[0]);
strcat(dictionary, buf);
snprintf(buf, 64, "/Last %d 0 R\n", ret[1]);
strcat(dictionary, buf);
snprintf(buf, 64, "/Count -%d\n", ret[2]);
strcat(dictionary, buf);
free(ret);
}
/* Page starts from 0 */
snprintf(buf, 64, "/Dest [%d /XYZ null null null]\n>>\n",
atoi(ptr->item->page) - 1);
strcat(dictionary, buf);
pdf_obj_append(pdf, ptr->id, NULL, dictionary, NULL);
if (ptr->left == NULL)
(*stat)[1] = ptr->id;
(*stat)[2]++;
ptr = ptr->left;
}
return 0;
}
int
pdf_cnki_outline(pdf_object_t **pdf, object_outline_t **outline, int **ids)
{
if (*pdf == NULL || *outline == NULL || *ids == NULL)
return 1;
object_outline_tree_t *outline_tree = NULL;
cnki_outline_tree(&outline_tree, outline, *ids);
char buf[128];
int *ret;
_outline(pdf, &outline_tree->left, outline_tree->id, &ret);
free(outline_tree);
snprintf(buf, 128,
"<<\n/Type Outlines\n/First %d 0 R\n/Last %d 0 R\n/Count %d\n>>\n",
ret[0], ret[1], ret[2]);
free(ret);
pdf_obj_append(pdf, (*ids)[0], NULL, buf, NULL);
return 0;
}
|
