libipt, block: when filling a new cache entry, also proceed with the cache to update block

Signed-off-by: Yida Zhang <[email protected]>

Author: zyd2001

libipt/src/pt_block_decoder.c

@@ -45,6 +45,10 @@
 static int pt_blk_proceed_trailing_event(struct pt_block_decoder *,
 					 struct pt_block *);
 
+static int pt_blk_proceed_no_event_cached(struct pt_block_decoder *decoder,
+					  struct pt_block *block,
+					  struct pt_block_cache *bcache,
+					  const struct pt_mapped_section *msec);
 static int pt_blk_set_trig_anchor(struct pt_block_decoder *decoder)
 {
 	if (!decoder)
@@ -2249,6 +2253,7 @@ pt_blk_proceed_no_event_fill_cache(struct pt_block_decoder *decoder,
 	uint64_t nip, dip, ioff, noff;
 	int64_t disp;
 	int status;
+	int fill_block;
 
 	if (!decoder || !steps)
 		return -pte_internal;
@@ -2431,6 +2436,8 @@ pt_blk_proceed_no_event_fill_cache(struct pt_block_decoder *decoder,
 	if (status < 0)
 		return status;
 
+	
+	fill_block = pt_bce_is_valid(bce);
 	/* If we don't have a valid cache entry, yet, fill the cache some more.
 	 *
 	 * On our way back, we add a cache entry for this instruction based on
@@ -2515,7 +2522,18 @@ pt_blk_proceed_no_event_fill_cache(struct pt_block_decoder *decoder,
 	 * Cache updates are atomic so even if the two versions were not
 	 * identical, we wouldn't care because they are both correct.
 	 */
-	return pt_bcache_add(bcache, ioff, bce);
+	status = pt_bcache_add(bcache, ioff, bce);
+	if (status < 0)
+		return status;
+
+	/* After we fill a new cache entry, we also need to update the block 
+	 * with that entry.
+	 */
+	if (fill_block)
+		return pt_blk_proceed_no_event_cached(decoder, block,
+							    bcache, msec);
+
+	return status;
 }
 
 /* Proceed at a potentially truncated instruction.