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 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707
|
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
sparse_buffer.c
Copyright (C) 2006 Sebastien Granjoux
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "sparse_buffer.h"
#include "anjuta-marshal.h"
#include <string.h>
/*#define DEBUG*/
#include <libanjuta/anjuta-debug.h>
/*
* This object works with the DmaSparseView which is a text view window allowing
* to display very big amount of data. Only the part of the data currently
* displayed is kept in memory.
*
* This object doesn't replace the GtkTextBuffer in the corresponding
* DmaSparseView. The GtkTextBuffer of each DmaSparseView contains only the data
* displayed by the view. So several view displaying the same DmaSparseBuffer
* will probably have GtkTextBuffer containing different data.
*
* The DmaSparseBuffer object contains the data necessary for each view and
* try to maintain a cache of recently used data. The data should be split in
* blocks having a address and a size. The buffer does not care about the
* exact content of each block.
*
* The DmaSparseBuffer does not have any graphical knowledge, like which data
* correspond to one line in the GtkTextBuffer.
*---------------------------------------------------------------------------*/
enum
{
DMA_SPARSE_BUFFER_NODE_SIZE = 512,
DMA_SPARSE_BUFFER_MAX_PAGE = 60,
};
static GObjectClass *parent_class = NULL;
enum
{
CHANGED,
LAST_SIGNAL
};
static guint signals[LAST_SIGNAL] = {0};
/* Helper functions
*---------------------------------------------------------------------------*/
/* DmaBufferNode functions
*---------------------------------------------------------------------------*/
/* Transport functions
*---------------------------------------------------------------------------*/
DmaSparseBufferTransport*
dma_sparse_buffer_alloc_transport (DmaSparseBuffer *buffer, guint lines, guint chars)
{
DmaSparseBufferTransport *trans;
trans = g_slice_new0 (DmaSparseBufferTransport);
trans->buffer = buffer;
trans->lines = lines;
trans->chars = chars;
trans->next = buffer->pending;
buffer->pending = trans;
return trans;
}
void
dma_sparse_buffer_free_transport (DmaSparseBufferTransport *trans)
{
DmaSparseBufferTransport **prev;
g_return_if_fail (trans != NULL);
for (prev = &trans->buffer->pending; *prev != trans; prev = &(*prev)->next)
{
if (*prev == NULL)
{
g_warning ("transport structure is missing");
return;
}
}
/* Remove transport structure and free it */
*prev = trans->next;
g_slice_free (DmaSparseBufferTransport, trans);
}
/* Private functions
*---------------------------------------------------------------------------*/
static DmaSparseBufferNode*
dma_sparse_buffer_find (DmaSparseBuffer *buffer, guint address)
{
DmaSparseBufferNode *node = NULL;
DmaSparseBufferNode *next;
/* Look in last node */
if (buffer->cache.head != NULL)
{
gint gap = buffer->cache.head->lower - address + DMA_SPARSE_BUFFER_NODE_SIZE * 4;
if (gap < DMA_SPARSE_BUFFER_NODE_SIZE * 9)
{
/* node should be quite near */
node = buffer->cache.head;
}
else
{
node = buffer->head;
}
}
else
{
node = buffer->head;
}
for (;;)
{
if (node == NULL) break;
if (node->lower > address)
{
/* Search backward */
node = node->prev;
}
else if (node->upper < address)
{
/* Search forward */
next = node->next;
if ((next == NULL) || (next->lower > address))
{
/* Corresponding node doesn't exist */
break;
}
node = next;
}
else
{
/* Find current node */
break;
}
}
return node;
}
static void
on_dma_sparse_buffer_changed (const DmaSparseBuffer *buffer)
{
}
/* Public functions
*---------------------------------------------------------------------------*/
DmaSparseBufferNode*
dma_sparse_buffer_lookup (DmaSparseBuffer *buffer, guint address)
{
return dma_sparse_buffer_find (buffer, address);
}
DmaSparseBufferNode*
dma_sparse_buffer_first (DmaSparseBuffer *buffer)
{
return buffer->head;
}
void
dma_sparse_buffer_insert (DmaSparseBuffer *buffer, DmaSparseBufferNode *node)
{
/* New node should have been allocated by caller with g_new */
DmaSparseBufferNode *prev;
DEBUG_PRINT ("insert block %p %x %x", node, node->lower, node->upper);
/* Look for previous node */
prev = dma_sparse_buffer_find (buffer, node->lower);
while ((prev != NULL) && (node->lower <= prev->upper))
{
DmaSparseBufferNode *tmp;
DEBUG_PRINT ("remove previous block %x %x", prev->lower, prev->upper);
/* node overlap, remove it */
tmp = prev->prev;
dma_sparse_buffer_remove (buffer, prev);
prev = tmp;
}
/* Insert node just after prev */
if (prev == NULL)
{
/* Insert at the beginning */
node->prev = NULL;
node->next = buffer->head;
buffer->head = node;
}
else
{
node->prev = prev;
node->next = prev->next;
prev->next = node;
}
if (node->next != NULL)
{
node->next->prev = node;
}
/* Check if new node overlap next one */
while ((node->next != NULL) && (node->upper >= node->next->lower))
{
DEBUG_PRINT ("remove next block %p %x %x", node->next, node->next->lower, node->next->upper);
/* node overlap, remove it */
dma_sparse_buffer_remove (buffer, node->next);
}
/* Insert node at the beginning of cache list */
node->cache.prev = NULL;
node->cache.next = buffer->cache.head;
if (buffer->cache.head != NULL)
{
buffer->cache.head->prev = node;
}
buffer->stamp++;
}
void
dma_sparse_buffer_remove (DmaSparseBuffer *buffer, DmaSparseBufferNode *node)
{
/* Remove node from node list */
if (node->next != NULL)
{
node->next->prev = node->prev;
}
if (node->prev != NULL)
{
node->prev->next = node->next;
}
if (buffer->head == node)
{
buffer->head = node->next;
}
/* Remove node from cache list */
if (node->cache.next != NULL)
{
node->cache.next->prev = node->cache.prev;
}
if (node->cache.prev != NULL)
{
node->cache.prev->next = node->cache.next;
}
if (buffer->cache.head == node)
{
buffer->cache.head = node->cache.next;
}
if (buffer->cache.tail == node)
{
buffer->cache.tail = node->cache.prev;
}
g_free (node);
buffer->stamp++;
}
void
dma_sparse_buffer_remove_all (DmaSparseBuffer *buffer)
{
DmaSparseBufferNode *node;
DmaSparseBufferNode *next;
for (node = buffer->head; node != NULL; node = next)
{
next = node->next;
g_free (node);
}
buffer->cache.head = NULL;
buffer->cache.tail = NULL;
buffer->head = NULL;
buffer->stamp++;
}
guint
dma_sparse_buffer_get_lower (const DmaSparseBuffer *buffer)
{
return buffer->lower;
}
guint
dma_sparse_buffer_get_upper (const DmaSparseBuffer *buffer)
{
return buffer->upper;
}
void
dma_sparse_buffer_changed (const DmaSparseBuffer *buffer)
{
g_signal_emit (G_OBJECT (buffer), signals[CHANGED], 0);
}
void
dma_sparse_buffer_add_mark (DmaSparseBuffer *buffer, guint address, gint mark)
{
gint markers;
if (buffer->mark == NULL)
{
/* Create new hash table */
buffer->mark = g_hash_table_new (g_direct_hash, g_direct_equal);
}
/* Add mark */
markers = GPOINTER_TO_INT (g_hash_table_lookup (buffer->mark, GINT_TO_POINTER (address)));
markers |= 1 << mark;
g_hash_table_replace (buffer->mark, GINT_TO_POINTER (address), GINT_TO_POINTER (markers));
}
void
dma_sparse_buffer_remove_mark (DmaSparseBuffer *buffer, guint address, gint mark)
{
gint markers;
if (buffer->mark == NULL) return; /* No mark */
/* Remove one mark */
markers = GPOINTER_TO_INT (g_hash_table_lookup (buffer->mark, GINT_TO_POINTER (address)));
markers &= ~ (1 << mark);
if (markers == 0)
{
g_hash_table_remove (buffer->mark, GINT_TO_POINTER (address));
}
else
{
g_hash_table_replace (buffer->mark, GINT_TO_POINTER (address), GINT_TO_POINTER (markers));
}
}
struct RemoveMarkPacket
{
GHashTable *hash;
gint mark;
};
static void
on_remove_mark (gpointer key, gpointer value, gpointer user_data)
{
struct RemoveMarkPacket* pack = (struct RemoveMarkPacket *)user_data;
value = GINT_TO_POINTER (GPOINTER_TO_INT (value) & ~(1<< pack->mark));
g_hash_table_replace (pack->hash, key, value);
}
static gboolean
on_remove_empty_mark (gpointer key, gpointer value, gpointer user_data)
{
return (value == NULL);
}
void
dma_sparse_buffer_remove_all_mark (DmaSparseBuffer *buffer, gint mark)
{
/* marker hash table could be null, is no marks have been set */
if (buffer->mark != NULL)
{
struct RemoveMarkPacket pack;
pack.hash = buffer->mark;
pack.mark = mark;
g_hash_table_foreach (buffer->mark, on_remove_mark, &pack);
g_hash_table_foreach_remove (buffer->mark, on_remove_empty_mark, NULL);
}
}
gint
dma_sparse_buffer_get_marks (DmaSparseBuffer *buffer, guint address)
{
if (buffer->mark == NULL) return 0;
return GPOINTER_TO_INT (g_hash_table_lookup (buffer->mark, GINT_TO_POINTER (address)));
}
/* Iterator private functions
*---------------------------------------------------------------------------*/
static gboolean
dma_sparse_iter_forward_line (DmaSparseIter *iter)
{
return DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->forward_line (iter);
}
static gboolean
dma_sparse_iter_backward_line (DmaSparseIter *iter)
{
return DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->backward_line (iter);
}
static void
dma_sparse_iter_insert_line (DmaSparseIter *iter, GtkTextIter *dst)
{
DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->insert_line (iter, dst);
}
/* Iterator public functions
*---------------------------------------------------------------------------*/
void
dma_sparse_buffer_get_iterator_at_address (DmaSparseBuffer *buffer, DmaSparseIter *iter, guint address)
{
g_return_if_fail (iter != NULL);
g_return_if_fail (DMA_IS_SPARSE_BUFFER (buffer));
iter->buffer = buffer;
iter->node = dma_sparse_buffer_find (buffer, address);
iter->base = address;
iter->offset = 0;
iter->stamp = buffer->stamp;
iter->line = 0;
DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->refresh_iter (iter);
}
void
dma_sparse_buffer_get_iterator_near_address (DmaSparseBuffer *buffer, DmaSparseIter *iter, guint address)
{
g_return_if_fail (iter != NULL);
g_return_if_fail (DMA_IS_SPARSE_BUFFER (buffer));
iter->buffer = buffer;
iter->node = dma_sparse_buffer_find (buffer, address);
iter->base = address;
iter->offset = 1;
iter->line = 0;
iter->stamp = buffer->stamp;
DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->refresh_iter (iter);
}
void
dma_sparse_iter_copy (DmaSparseIter *dst, const DmaSparseIter *src)
{
memcpy(dst, src, sizeof (DmaSparseIter));
}
void
dma_sparse_iter_move_at (DmaSparseIter *iter, guint address)
{
dma_sparse_buffer_get_iterator_at_address (iter->buffer, iter, address);
}
void
dma_sparse_iter_move_near (DmaSparseIter *iter, guint address)
{
dma_sparse_buffer_get_iterator_near_address (iter->buffer, iter, address);
}
void
dma_sparse_iter_refresh (DmaSparseIter *iter)
{
if (iter->buffer->stamp != iter->stamp)
{
iter->node = dma_sparse_buffer_find (iter->buffer, iter->base);
iter->stamp = iter->buffer->stamp;
DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->refresh_iter (iter);
}
}
void
dma_sparse_iter_round (DmaSparseIter *iter, gboolean round_up)
{
if (iter->buffer->stamp != iter->stamp)
{
iter->node = dma_sparse_buffer_find (iter->buffer, iter->base);
iter->stamp = iter->buffer->stamp;
}
DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->round_iter (iter, round_up);
}
gulong
dma_sparse_iter_get_address (DmaSparseIter *iter)
{
return DMA_GET_SPARSE_BUFFER_CLASS (iter->buffer)->get_address (iter);
}
gboolean
dma_sparse_iter_forward_lines (DmaSparseIter *iter, gint count)
{
gint i;
dma_sparse_iter_refresh (iter);
if (count < 0)
{
for (i = 0; i > count; --i)
{
if (!dma_sparse_iter_backward_line (iter)) return FALSE;
}
}
else if (count > 0)
{
for (i = 0; i < count; i++)
{
if (!dma_sparse_iter_forward_line (iter)) return FALSE;
}
}
return TRUE;
}
void
dma_sparse_iter_insert_lines (DmaSparseIter *src, GtkTextIter *dst, guint count)
{
DmaSparseIter iter;
guint line = 0;
GtkTextBuffer *buffer;
buffer = gtk_text_iter_get_buffer (dst);
/* It is possible to get an iterator that doesn't point to any node
* if it has been move to a fixed address without rounding it to
* the nearest line */
dma_sparse_iter_copy (&iter, src);
dma_sparse_iter_refresh (&iter);
/* Fill with data */
for (; line < count; line++)
{
dma_sparse_iter_insert_line (&iter, dst);
if (!dma_sparse_iter_forward_line (&iter))
{
/* no more data */
break;
}
if (line != count - 1) gtk_text_buffer_insert (buffer, dst, "\n", 1);
}
}
/* GObject functions
*---------------------------------------------------------------------------*/
/* Used in dispose and finalize */
/* dispose is the first destruction step. It is used to unref object created
* with instance_init in order to break reference counting cycles. This
* function could be called several times. All function should still work
* after this call. It has to called its parents.*/
static void
dma_sparse_buffer_dispose (GObject *object)
{
/*DmaSparseBuffer *self = DMA_DATA_BUFFER (object);*/
G_OBJECT_CLASS (parent_class)->dispose (object);
}
/* finalize is the last destruction step. It must free all memory allocated
* with instance_init. It is called only one time just before releasing all
* memory */
static void
dma_sparse_buffer_finalize (GObject *object)
{
DmaSparseBuffer *buffer = DMA_SPARSE_BUFFER (object);
DmaSparseBufferTransport *trans;
dma_sparse_buffer_remove_all (buffer);
/* Free all remaining transport structure */
for (trans = buffer->pending; trans != NULL;)
{
DmaSparseBufferTransport *next = trans->next;
g_slice_free (DmaSparseBufferTransport, trans);
trans = next;
}
/* Free marker hash table */
if (buffer->mark != NULL)
{
g_hash_table_destroy (buffer->mark);
buffer->mark = NULL;
}
G_OBJECT_CLASS (parent_class)->finalize (object);
}
/* instance_init is the constructor. All functions should work after this
* call. */
static void
dma_sparse_buffer_instance_init (DmaSparseBuffer *buffer)
{
buffer->lower = 0;
buffer->upper = 0;
buffer->cache.head = NULL;
buffer->cache.tail = NULL;
buffer->head = NULL;
buffer->stamp = 0;
buffer->pending = NULL;
buffer->mark = NULL;
}
/* class_init intialize the class itself not the instance */
static void
dma_sparse_buffer_class_init (DmaSparseBufferClass * klass)
{
GObjectClass *object_class;
g_return_if_fail (klass != NULL);
parent_class = g_type_class_peek_parent (klass);
object_class = G_OBJECT_CLASS (klass);
object_class->dispose = dma_sparse_buffer_dispose;
object_class->finalize = dma_sparse_buffer_finalize;
klass->changed = on_dma_sparse_buffer_changed;
signals[CHANGED] = g_signal_new ("changed",
G_OBJECT_CLASS_TYPE (object_class),
G_SIGNAL_RUN_LAST,
G_STRUCT_OFFSET (DmaSparseBufferClass, changed),
NULL, NULL,
anjuta_marshal_VOID__VOID,
G_TYPE_NONE,
0);
}
GType
dma_sparse_buffer_get_type (void)
{
static GType type = 0;
if (!type)
{
static const GTypeInfo type_info =
{
sizeof (DmaSparseBufferClass),
(GBaseInitFunc) NULL,
(GBaseFinalizeFunc) NULL,
(GClassInitFunc) dma_sparse_buffer_class_init,
(GClassFinalizeFunc) NULL,
NULL, /* class_data */
sizeof (DmaSparseBuffer),
0, /* n_preallocs */
(GInstanceInitFunc) dma_sparse_buffer_instance_init,
NULL /* value_table */
};
type = g_type_register_static (G_TYPE_OBJECT,
"DmaSparseBuffer", &type_info, 0);
}
return type;
}
/* Creation and Destruction
*---------------------------------------------------------------------------*/
DmaSparseBuffer*
dma_sparse_buffer_new (guint lower, guint upper)
{
DmaSparseBuffer *buffer;
buffer = g_object_new (DMA_SPARSE_BUFFER_TYPE, NULL);
g_assert (buffer != NULL);
buffer->lower = lower;
buffer->upper = upper;
return buffer;
}
void
dma_sparse_buffer_free (DmaSparseBuffer *buffer)
{
g_object_unref (buffer);
}
|