@@ -959,7 +959,7 @@ static void pass_blame_to_parent(struct blame_scoreboard *sb,
959
959
*
960
960
* Compute how trivial the lines in the blame_entry are.
961
961
*/
962
- static unsigned ent_score (struct blame_scoreboard * sb , struct blame_entry * e )
962
+ static unsigned blame_entry_score (struct blame_scoreboard * sb , struct blame_entry * e )
963
963
{
964
964
unsigned score ;
965
965
const char * cp , * ep ;
@@ -995,7 +995,7 @@ static void copy_split_if_better(struct blame_scoreboard *sb,
995
995
if (!this [1 ].suspect )
996
996
return ;
997
997
if (best_so_far [1 ].suspect ) {
998
- if (ent_score (sb , & this [1 ]) < ent_score (sb , & best_so_far [1 ]))
998
+ if (blame_entry_score (sb , & this [1 ]) < blame_entry_score (sb , & best_so_far [1 ]))
999
999
return ;
1000
1000
}
1001
1001
@@ -1107,7 +1107,7 @@ static struct blame_entry **filter_small(struct blame_scoreboard *sb,
1107
1107
struct blame_entry * p = * source ;
1108
1108
struct blame_entry * oldsmall = * small ;
1109
1109
while (p ) {
1110
- if (ent_score (sb , p ) <= score_min ) {
1110
+ if (blame_entry_score (sb , p ) <= score_min ) {
1111
1111
* small = p ;
1112
1112
small = & p -> next ;
1113
1113
p = * small ;
@@ -1156,7 +1156,7 @@ static void find_move_in_parent(struct blame_scoreboard *sb,
1156
1156
next = e -> next ;
1157
1157
find_copy_in_blob (sb , e , parent , split , & file_p );
1158
1158
if (split [1 ].suspect &&
1159
- blame_move_score < ent_score (sb , & split [1 ])) {
1159
+ blame_move_score < blame_entry_score (sb , & split [1 ])) {
1160
1160
split_blame (blamed , & unblamedtail , split , e );
1161
1161
} else {
1162
1162
e -> next = leftover ;
@@ -1286,7 +1286,7 @@ static void find_copy_in_parent(struct blame_scoreboard *sb,
1286
1286
for (j = 0 ; j < num_ents ; j ++ ) {
1287
1287
struct blame_entry * split = blame_list [j ].split ;
1288
1288
if (split [1 ].suspect &&
1289
- blame_copy_score < ent_score (sb , & split [1 ])) {
1289
+ blame_copy_score < blame_entry_score (sb , & split [1 ])) {
1290
1290
split_blame (blamed , & unblamedtail , split ,
1291
1291
blame_list [j ].ent );
1292
1292
} else {
@@ -2104,8 +2104,8 @@ static void find_alignment(struct blame_scoreboard *sb, int *option)
2104
2104
num = e -> lno + e -> num_lines ;
2105
2105
if (longest_dst_lines < num )
2106
2106
longest_dst_lines = num ;
2107
- if (largest_score < ent_score (sb , e ))
2108
- largest_score = ent_score (sb , e );
2107
+ if (largest_score < blame_entry_score (sb , e ))
2108
+ largest_score = blame_entry_score (sb , e );
2109
2109
}
2110
2110
max_orig_digits = decimal_width (longest_src_lines );
2111
2111
max_digits = decimal_width (longest_dst_lines );
0 commit comments