piece-table: better naming len -> used

1 files changed, 13 insertions, 13 deletions

diff --git a/src/piece-table.c b/src/piece-table.c
index 6c9e850..7ca95f1 100644
--- a/src/piece-table.c
+++ b/src/piece-table.c
@@ -23,7 +23,7 @@
 
 typedef struct
   {
-    size_t len;
+    size_t used;
     size_t size;
     char *contents;
   }
@@ -41,7 +41,7 @@ piece;
 
 typedef struct _piece_buffer
   {
-    size_t len;
+    size_t used;
     size_t size;
     struct _piece_buffer *next;
     piece *start;
@@ -66,7 +66,7 @@ piece_table;
 void
 text_buffer_init (text_buffer *tb)
 {
-  tb->len = 0;
+  tb->used = 0;
   tb->size = 0;
   tb->contents = NULL;
 }
@@ -80,17 +80,17 @@ text_buffer_append (text_buffer *tb, char c)
       tb->contents = malloc (sizeof(*tb->contents) * base_size);
       tb->size = base_size;
     }
-  else if (tb->size == tb->len)
+  else if (tb->size == tb->used)
     {
-      tb->contents = realloc (tb->contents, sizeof(*tb->contents) * tb->len*2);
+      tb->contents = realloc (tb->contents, sizeof(*tb->contents) * tb->used*2);
     }
-  tb->contents[tb->len++] = c;
+  tb->contents[tb->used++] = c;
 }
 
 char
 text_buffer_index (text_buffer *tb, size_t pos)
 {
-  assert (pos < tb->len);
+  assert (pos < tb->used);
   return tb->contents[pos];
 }
 
@@ -105,7 +105,7 @@ void
 text_buffer_fill (text_buffer *tb, char *fill, size_t size)
 {
   size_t i;
-  tb->len = size;
+  tb->used = size;
   tb->size = size;
   free (tb->contents);
   tb->contents = malloc (sizeof (*tb->contents) * size);
@@ -142,11 +142,11 @@ piece_buffer_bump (piece_buffer *pb)
       pb = pb->next;
     }
 
-  if (pb->len == pb->size)
+  if (pb->used == pb->size)
     {
       pb->next = piece_buffer_create (1024);
     }
-  return &pb->start[pb->len++];
+  return &pb->start[pb->used++];
 }
 
 void
@@ -290,10 +290,10 @@ piece_table_insert (piece_table *pt, size_t pos, char *in, size_t len)
   /* Optimization!
    * Add in the end of the buffer, and the end of the piece: enlarge
    */
-  if ( pt->add.len != 0 &&
+  if ( pt->add.used != 0 &&
        start->buffer == &pt->add &&
        pt->cached_offset + start->length == pos &&
-       pt->add.len == start->start + start->length ) {
+       pt->add.used == start->start + start->length ) {
       pt->length += len;
       start->length += len;
       return;
@@ -303,7 +303,7 @@ piece_table_insert (piece_table *pt, size_t pos, char *in, size_t len)
   /* Make a new piece and insert it */
   new = piece_buffer_bump(pt->pieces);
   new->buffer = &pt->add;
-  new->start = pt->add.len - len;
+  new->start = pt->add.used - len;
   new->length = len;
 
   start->next = new;