Mercurial > ~mikael > mcabber > hg
annotate mcabber/src/hbuf.c @ 370:dd9e2eb52916
Add /buffer search_{backward,forward}
| author | Mikael Berthe <mikael@lilotux.net> |
|---|---|
| date | Sun, 24 Jul 2005 22:56:42 +0100 |
| parents | da50f08ea058 |
| children | 468c9cac2798 |
| rev | line source |
|---|---|
| 71 | 1 /* |
| 2 * hbuf.c -- History buffer implementation | |
| 3 * | |
| 4 * Copyright (C) 2005 Mikael Berthe <bmikael@lists.lilotux.net> | |
| 5 * | |
| 6 * This program is free software; you can redistribute it and/or modify | |
| 7 * it under the terms of the GNU General Public License as published by | |
| 8 * the Free Software Foundation; either version 2 of the License, or (at | |
| 9 * your option) any later version. | |
| 10 * | |
| 11 * This program is distributed in the hope that it will be useful, but | |
| 12 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 14 * General Public License for more details. | |
| 15 * | |
| 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 | |
| 19 * USA | |
| 20 */ | |
| 21 | |
|
370
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
22 #define _GNU_SOURCE /* We need glibc for strptime */ |
| 71 | 23 #include <string.h> |
| 24 | |
| 25 #include "hbuf.h" | |
| 26 | |
| 27 | |
| 28 /* This is a private structure type */ | |
| 29 | |
| 30 typedef struct { | |
| 31 char *ptr; | |
| 182 | 32 char *ptr_end; // beginning of the block |
| 33 char *ptr_end_alloc; // end of the current persistent block | |
| 71 | 34 guchar flags; |
| 35 | |
| 36 // XXX This should certainly be a pointer, and be allocated only when needed | |
| 37 // (for ex. when HBB_FLAG_PERSISTENT is set). | |
| 38 struct { // hbuf_line_info | |
| 184 | 39 time_t timestamp; |
| 40 guchar flags; | |
| 41 } prefix; | |
| 71 | 42 } hbuf_block; |
| 43 | |
| 44 | |
| 184 | 45 // hbuf_add_line(p_hbuf, text, prefix_flags, width) |
| 71 | 46 // Add a line to the given buffer. If width is not null, then lines are |
| 47 // wrapped at this length. | |
| 48 // | |
| 49 // Note 1: Splitting according to width won't work if there are tabs; they | |
| 50 // should be expanded before. | |
| 51 // Note 2: width does not include the ending \0. | |
| 184 | 52 void hbuf_add_line(GList **p_hbuf, const char *text, time_t timestamp, |
| 53 guint prefix_flags, guint width) | |
| 71 | 54 { |
| 55 GList *hbuf = *p_hbuf; | |
| 56 char *line, *cr, *end; | |
| 83 | 57 hbuf_block *hbuf_block_elt; |
| 71 | 58 |
| 59 if (!text) return; | |
| 60 | |
| 83 | 61 hbuf_block_elt = g_new0(hbuf_block, 1); |
| 184 | 62 hbuf_block_elt->prefix.timestamp = timestamp; |
| 63 hbuf_block_elt->prefix.flags = prefix_flags; | |
| 71 | 64 if (!hbuf) { |
| 153 | 65 do { |
| 66 hbuf_block_elt->ptr = g_new(char, HBB_BLOCKSIZE); | |
| 67 } while (!hbuf_block_elt->ptr); | |
| 71 | 68 hbuf_block_elt->flags = HBB_FLAG_ALLOC | HBB_FLAG_PERSISTENT; |
| 182 | 69 hbuf_block_elt->ptr_end_alloc = hbuf_block_elt->ptr + HBB_BLOCKSIZE; |
| 71 | 70 *p_hbuf = g_list_append(*p_hbuf, hbuf_block_elt); |
| 71 } else { | |
| 72 hbuf_block *hbuf_b_prev = g_list_last(hbuf)->data; | |
| 73 hbuf_block_elt->ptr = hbuf_b_prev->ptr_end; | |
| 74 hbuf_block_elt->flags = HBB_FLAG_PERSISTENT; | |
| 182 | 75 hbuf_block_elt->ptr_end_alloc = hbuf_b_prev->ptr_end_alloc; |
| 71 | 76 *p_hbuf = g_list_append(*p_hbuf, hbuf_block_elt); |
| 77 } | |
| 78 | |
| 79 if (strlen(text) >= HBB_BLOCKSIZE) { | |
| 80 // Too long | |
| 81 text = "[ERR:LINE_TOO_LONG]"; | |
| 197 | 82 hbuf_block_elt->prefix.flags |= HBB_PREFIX_INFO; |
| 71 | 83 } |
| 182 | 84 if (hbuf_block_elt->ptr + strlen(text) >= hbuf_block_elt->ptr_end_alloc) { |
| 71 | 85 // Too long for the current allocated bloc, we need another one |
| 153 | 86 do { |
| 87 hbuf_block_elt->ptr = g_new0(char, HBB_BLOCKSIZE); | |
| 88 } while (!hbuf_block_elt->ptr); | |
| 71 | 89 hbuf_block_elt->flags = HBB_FLAG_ALLOC | HBB_FLAG_PERSISTENT; |
| 182 | 90 hbuf_block_elt->ptr_end_alloc = hbuf_block_elt->ptr + HBB_BLOCKSIZE; |
| 71 | 91 } |
| 92 | |
| 93 line = hbuf_block_elt->ptr; | |
| 94 // Ok, now we can copy the text.. | |
| 95 strcpy(line, text); | |
| 96 hbuf_block_elt->ptr_end = line + strlen(line) + 1; | |
| 97 end = hbuf_block_elt->ptr_end; | |
| 98 | |
| 99 // Let's add non-persistent blocs if necessary | |
| 100 // - If there are '\n' in the string | |
| 101 // - If length > width (and width != 0) | |
| 102 cr = strchr(line, '\n'); | |
| 103 while (cr || (width && strlen(line) > width)) { | |
| 104 hbuf_block *hbuf_b_prev = hbuf_block_elt; | |
| 105 | |
| 106 if (!width || (cr && (cr - line <= (int)width))) { | |
| 107 // Carriage return | |
| 108 *cr = 0; | |
| 109 hbuf_block_elt->ptr_end = cr; | |
| 110 // Create another persistent block | |
| 111 hbuf_block_elt = g_new0(hbuf_block, 1); | |
| 112 hbuf_block_elt->ptr = hbuf_b_prev->ptr_end + 1; // == cr+1 | |
| 113 hbuf_block_elt->ptr_end = end; | |
| 114 hbuf_block_elt->flags = HBB_FLAG_PERSISTENT; | |
| 182 | 115 hbuf_block_elt->ptr_end_alloc = hbuf_b_prev->ptr_end_alloc; |
| 71 | 116 *p_hbuf = g_list_append(*p_hbuf, hbuf_block_elt); |
| 117 line = hbuf_block_elt->ptr; | |
| 118 } else { | |
| 119 // We need to break where we can find a space char | |
| 120 char *br; // break pointer | |
| 121 for (br = line + width; br > line && *br != 32 && *br != 9; br--) | |
| 122 ; | |
| 123 if (br <= line) | |
| 124 br = line + width; | |
| 125 else | |
| 126 br++; | |
| 127 hbuf_block_elt->ptr_end = br; | |
| 128 // Create another block, non-persistent | |
| 129 hbuf_block_elt = g_new0(hbuf_block, 1); | |
| 130 hbuf_block_elt->ptr = hbuf_b_prev->ptr_end; // == br | |
| 131 hbuf_block_elt->ptr_end = end; | |
| 132 hbuf_block_elt->flags = 0; | |
| 182 | 133 hbuf_block_elt->ptr_end_alloc = hbuf_b_prev->ptr_end_alloc; |
| 71 | 134 *p_hbuf = g_list_append(*p_hbuf, hbuf_block_elt); |
| 135 line = hbuf_block_elt->ptr; | |
| 136 } | |
| 137 cr = strchr(line, '\n'); | |
| 138 } | |
| 139 } | |
| 140 | |
| 141 // hbuf_free() | |
| 142 // Destroys all hbuf list. | |
| 143 void hbuf_free(GList **p_hbuf) | |
| 144 { | |
| 145 hbuf_block *hbuf_b_elt; | |
| 146 GList *hbuf_elt; | |
| 147 GList *first_elt = g_list_first(*p_hbuf); | |
| 148 | |
| 149 for (hbuf_elt = first_elt; hbuf_elt; hbuf_elt = g_list_next(hbuf_elt)) { | |
| 150 hbuf_b_elt = (hbuf_block*)(hbuf_elt->data); | |
| 151 if (hbuf_b_elt->flags & HBB_FLAG_ALLOC) { | |
| 152 g_free(hbuf_b_elt->ptr); | |
| 153 } | |
| 154 } | |
| 155 | |
| 156 g_list_free(*p_hbuf); | |
| 157 *p_hbuf = NULL; | |
| 158 } | |
| 159 | |
| 160 // hbuf_rebuild() | |
| 161 // Rebuild all hbuf list, with the new width. | |
| 162 // If width == 0, lines are not wrapped. | |
| 163 void hbuf_rebuild(GList **p_hbuf, unsigned int width) | |
| 164 { | |
| 165 GList *first_elt, *curr_elt, *next_elt; | |
| 166 hbuf_block *hbuf_b_curr, *hbuf_b_next; | |
| 167 | |
| 150 | 168 // *p_hbuf needs to be the head of the list |
| 169 first_elt = *p_hbuf = g_list_first(*p_hbuf); | |
| 71 | 170 |
| 171 // #1 Remove non-persistent blocks (ptr_end should be updated!) | |
| 172 curr_elt = first_elt; | |
| 173 while (curr_elt) { | |
| 174 next_elt = g_list_next(curr_elt); | |
| 175 // Last element? | |
| 176 if (!next_elt) | |
| 177 break; | |
| 178 hbuf_b_curr = (hbuf_block*)(curr_elt->data); | |
| 179 hbuf_b_next = (hbuf_block*)(next_elt->data); | |
| 180 // Is next line not-persistent? | |
| 181 if (!(hbuf_b_next->flags & HBB_FLAG_PERSISTENT)) { | |
| 182 hbuf_b_curr->ptr_end = hbuf_b_next->ptr_end; | |
| 183 g_list_delete_link(curr_elt, next_elt); | |
| 184 } else | |
| 185 curr_elt = next_elt; | |
| 186 } | |
| 187 // #2 Go back to head and create non-persistent blocks when needed | |
| 188 if (width) { | |
| 189 char *line, *end; | |
| 190 curr_elt = first_elt; | |
| 191 | |
| 192 while (curr_elt) { | |
| 193 hbuf_b_curr = (hbuf_block*)(curr_elt->data); | |
| 194 line = hbuf_b_curr->ptr; | |
| 195 if (strlen(line) > width) { | |
| 196 hbuf_block *hbuf_b_prev = hbuf_b_curr; | |
| 197 | |
| 198 // We need to break where we can find a space char | |
| 199 char *br; // break pointer | |
| 200 for (br = line + width; br > line && *br != 32 && *br != 9; br--) | |
| 201 ; | |
| 202 if (br <= line) | |
| 203 br = line + width; | |
| 204 else | |
| 205 br++; | |
| 206 end = hbuf_b_curr->ptr_end; | |
| 207 hbuf_b_curr->ptr_end = br; | |
| 208 // Create another block, non-persistent | |
| 209 hbuf_b_curr = g_new0(hbuf_block, 1); | |
| 210 hbuf_b_curr->ptr = hbuf_b_prev->ptr_end; // == br | |
| 211 hbuf_b_curr->ptr_end = end; | |
| 212 hbuf_b_curr->flags = 0; | |
| 182 | 213 hbuf_b_curr->ptr_end_alloc = hbuf_b_prev->ptr_end_alloc; |
| 150 | 214 // This is OK because insert_before(NULL) == append(): |
| 215 *p_hbuf = g_list_insert_before(*p_hbuf, curr_elt->next, hbuf_b_curr); | |
| 71 | 216 } |
| 217 curr_elt = g_list_next(curr_elt); | |
| 218 } | |
| 219 } | |
| 220 } | |
| 221 | |
| 189 | 222 // hbuf_previous_persistent() |
| 223 // Returns the previous persistent block (line). If the given line is | |
| 224 // persistent, then it is returned. | |
| 225 // This function is used for example when resizing a buffer. If the top of the | |
| 226 // screen is on a non-persistent block, then a screen resize could destroy this | |
| 227 // line... | |
| 228 GList *hbuf_previous_persistent(GList *l_line) | |
| 229 { | |
| 230 hbuf_block *hbuf_b_elt; | |
| 231 | |
| 232 while (l_line) { | |
| 233 hbuf_b_elt = (hbuf_block*)l_line->data; | |
| 234 if (hbuf_b_elt->flags & HBB_FLAG_PERSISTENT) | |
| 235 return l_line; | |
| 236 l_line = g_list_previous(l_line); | |
| 237 } | |
| 238 | |
| 239 return NULL; | |
| 240 } | |
| 241 | |
|
368
da50f08ea058
Update hbuf_get_lines() comment
Mikael Berthe <mikael@lilotux.net>
parents:
197
diff
changeset
|
242 // hbuf_get_lines(hbuf, n) |
|
370
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
243 // Returns an array of n hbb_line pointers |
| 71 | 244 // (The first line will be the line currently pointed by hbuf) |
|
368
da50f08ea058
Update hbuf_get_lines() comment
Mikael Berthe <mikael@lilotux.net>
parents:
197
diff
changeset
|
245 // Note: The caller should free the array and the text pointers after use. |
| 184 | 246 hbb_line **hbuf_get_lines(GList *hbuf, unsigned int n) |
| 71 | 247 { |
| 248 unsigned int i; | |
| 249 | |
| 184 | 250 hbb_line **array = g_new0(hbb_line*, n); |
| 251 hbb_line **array_elt = array; | |
| 71 | 252 |
| 253 for (i=0 ; i < n ; i++) { | |
| 254 if (hbuf) { | |
| 255 hbuf_block *blk = (hbuf_block*)(hbuf->data); | |
| 256 int maxlen; | |
| 257 maxlen = blk->ptr_end - blk->ptr; | |
| 184 | 258 *array_elt = (hbb_line*)g_new(hbb_line, 1); |
| 259 (*array_elt)->timestamp = blk->prefix.timestamp; | |
| 260 (*array_elt)->flags = blk->prefix.flags; | |
| 261 (*array_elt)->text = g_strndup(blk->ptr, maxlen); | |
| 262 | |
| 71 | 263 hbuf = g_list_next(hbuf); |
| 264 } else | |
| 184 | 265 break; |
| 266 | |
| 267 array_elt++; | |
| 71 | 268 } |
| 269 | |
| 270 return array; | |
| 271 } | |
| 272 | |
|
370
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
273 // hbuf_search(hbuf, direction, string) |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
274 // Look backward/forward for a line containing string in the history buffer |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
275 // Search starts at hbuf, and goes forward if direction == 1, backward if -1 |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
276 GList *hbuf_search(GList *hbuf, int direction, const char *string) |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
277 { |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
278 hbuf_block *blk; |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
279 |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
280 for (;;) { |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
281 if (direction > 0) |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
282 hbuf = g_list_next(hbuf); |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
283 else |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
284 hbuf = g_list_previous(hbuf); |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
285 |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
286 if (!hbuf) break; |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
287 |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
288 blk = (hbuf_block*)(hbuf->data); |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
289 // XXX blk->ptr is (maybe) not really correct, because the match should |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
290 // not be after ptr_end. We should check that... |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
291 if (strcasestr(blk->ptr, string)) |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
292 break; |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
293 } |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
294 |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
295 return hbuf; |
|
dd9e2eb52916
Add /buffer search_{backward,forward}
Mikael Berthe <mikael@lilotux.net>
parents:
368
diff
changeset
|
296 } |