[t:2811], remove unneeded leafentry accessor

git-svn-id: file:///svn/toku/tokudb@23609 c7de825b-a66e-492c-adef-691d508d4ae1

newbrt/leafentry.h

@@ -123,7 +123,6 @@ int print_leafentry (FILE *outf, LEAFENTRY v); // Print a leafentry out in human
 int le_latest_is_del(LEAFENTRY le); // Return true if it is a provisional delete.
 uint32_t le_num_xids(LEAFENTRY le); //Return how many xids exist (0 does not count)
 int le_has_xids(LEAFENTRY le, XIDS xids); // Return true transaction represented by xids is still provisional in this leafentry (le's xid stack is a superset or equal to xids)
-void*     le_latest_key (LEAFENTRY le); // Return the latest key (return NULL for provisional deletes)
 u_int32_t le_latest_keylen (LEAFENTRY le); // Return the latest keylen.
 void*     le_latest_val (LEAFENTRY le); // Return the latest val (return NULL for provisional deletes)
 u_int32_t le_latest_vallen (LEAFENTRY le); // Return the latest vallen.  Returns 0 for provisional deletes.
@@ -151,7 +150,6 @@ void le_clean_xids(LEAFENTRY le, size_t *new_leafentry_memorysize, size_t *new_l
 //        le_outermost_uncommitted_xid will return 0 after this.
 //        Changes results of following pointer functions, but memcmp of old/new answers would say they're the same.
 //          Note: You would have to memdup the old answers before calling le_full_promotion, if you want to run the comparison
-//           le_latest_key()
 //           le_latest_val()
 //           le_key()
 //        le_outermost_uncommitted_xid will return 0 after this

newbrt/tests/test-leafentry-nested.c

@@ -864,7 +864,6 @@ static void test_le_optimize(void) {
 //            - Check memsize function is correct
 //             - Assert == disksize (almost useless, but go ahead)
 //            - Check standard accessors
-//             - le_latest_key 
 //             - le_latest_keylen
 //             - le_latest_val_and_len
 //             - le_latest_val 

newbrt/ule.c

@@ -1056,21 +1056,6 @@ le_has_xids(LEAFENTRY le, XIDS xids) {
     return rval;
 }
 
-//DEBUG ONLY can be slow
-void*
-le_latest_key (LEAFENTRY le) {
-    ULE_S ule;
-    le_unpack(&ule, le);
-    UXR uxr = ule_get_innermost_uxr(&ule);
-    void *slow_rval;
-    if (uxr_is_insert(uxr))
-        slow_rval = ule.keyp;
-    else
-        slow_rval = NULL;
-    ule_cleanup(&ule);
-    return slow_rval;
-}
-
 u_int32_t
 le_latest_keylen (LEAFENTRY le) {
     u_int32_t rval;