CHROMIUM: verity: remove stale code/comments from earlier bitmap design

dm-bht.c

  /*
  * Copyright (C) 2010 The Chromium OS Authors <chromium-os-dev@chromium.org>
  *
  * Device-Mapper block hash tree interface.
  * See Documentation/device-mapper/dm-bht.txt for details.
  *
  * This file is released under the GPL.
  */
 
 #include <asm/atomic.h>
@@ skipping 270 matching lines @@
         /* Each dm_bht_entry->nodes is one page.  The node code tracks
          * how many nodes fit into one entry where a node is a single
          * hash (message digest).
          */
         bht->node_count_shift = fls(PAGE_SIZE / bht->digest_size) - 1;
         /* Round down to the nearest power of two.  This makes indexing
          * into the tree much less painful.
          */
         bht->node_count = 1 << bht->node_count_shift;
 
-        /* TODO(wad) if node_count < DM_BHT_MAX_NODE_COUNT, then retry with
-         * node_count_shift-1.
-         */
-        if (bht->node_count > DM_BHT_MAX_NODE_COUNT) {
-                DMERR("node_count maximum node bitmap size");
-                status = -EINVAL;
-                goto bad_node_count;
-        }
-
         /* This is unlikely to happen, but with 64k pages, who knows. */
         if (bht->node_count > UINT_MAX / bht->digest_size) {
                 DMERR("node_count * hash_len exceeds UINT_MAX!");
                 status = -EINVAL;
                 goto bad_node_count;
         }
         /* Ensure that we can safely shift by this value. */
         if (depth * bht->node_count_shift >= sizeof(unsigned int) * 8) {
                 DMERR("specified depth and node_count_shift is too large");
                 status = -EINVAL;
@@ skipping 317 matching lines @@
                 return 1;
         }
 
         /* Index into the entry data */
         index = (block_index % bht->node_count) * bht->digest_size;
         if (memcmp(&entry->nodes[index], digest, bht->digest_size)) {
                 DMCRIT("digest mismatch for block %u", block_index);
                 dm_bht_log_mismatch(bht, &entry->nodes[index], digest);
                 return DM_BHT_ENTRY_ERROR_MISMATCH;
         }
-        /* TODO(wad) update bht->block_bitmap here or in the caller */
         return 0;
 }
 
 /* Walk all entries at level 0 to compute the root digest.
  * 0 on success.
  */
 static int dm_bht_compute_root(struct dm_bht *bht, u8 *digest)
 {
         struct dm_bht_entry *entry;
         unsigned int count;
@@ skipping 640 matching lines @@
                 DMERR("no root digest exists to export");
                 if (available > 0)
                         *hexdigest = 0;
                 return -1;
         }
         dm_bht_bin_to_hex(bht->root_digest, hexdigest, bht->digest_size);
         return 0;
 }
 EXPORT_SYMBOL(dm_bht_root_hexdigest);