@@ -1176,7 +1176,8 @@ int unpack_trees(unsigned len, struct tree_desc *t, struct unpack_trees_options
1176
1176
static int reject_merge (const struct cache_entry * ce ,
1177
1177
struct unpack_trees_options * o )
1178
1178
{
1179
- return add_rejected_path (o , ERROR_WOULD_OVERWRITE , ce -> name );
1179
+ return o -> gently ? -1 :
1180
+ add_rejected_path (o , ERROR_WOULD_OVERWRITE , ce -> name );
1180
1181
}
1181
1182
1182
1183
static int same (const struct cache_entry * a , const struct cache_entry * b )
@@ -1631,15 +1632,15 @@ int threeway_merge(const struct cache_entry * const *stages,
1631
1632
/* #14, #14ALT, #2ALT */
1632
1633
if (remote && !df_conflict_head && head_match && !remote_match ) {
1633
1634
if (index && !same (index , remote ) && !same (index , head ))
1634
- return o -> gently ? -1 : reject_merge (index , o );
1635
+ return reject_merge (index , o );
1635
1636
return merged_entry (remote , index , o );
1636
1637
}
1637
1638
/*
1638
1639
* If we have an entry in the index cache, then we want to
1639
1640
* make sure that it matches head.
1640
1641
*/
1641
1642
if (index && !same (index , head ))
1642
- return o -> gently ? -1 : reject_merge (index , o );
1643
+ return reject_merge (index , o );
1643
1644
1644
1645
if (head ) {
1645
1646
/* #5ALT, #15 */
@@ -1768,9 +1769,8 @@ int twoway_merge(const struct cache_entry * const *src,
1768
1769
else
1769
1770
return merged_entry (newtree , current , o );
1770
1771
}
1771
- return o -> gently ? -1 : reject_merge (current , o );
1772
- }
1773
- else if ((!oldtree && !newtree ) || /* 4 and 5 */
1772
+ return reject_merge (current , o );
1773
+ } else if ((!oldtree && !newtree ) || /* 4 and 5 */
1774
1774
(!oldtree && newtree &&
1775
1775
same (current , newtree )) || /* 6 and 7 */
1776
1776
(oldtree && newtree &&
@@ -1779,26 +1779,15 @@ int twoway_merge(const struct cache_entry * const *src,
1779
1779
!same (oldtree , newtree ) && /* 18 and 19 */
1780
1780
same (current , newtree ))) {
1781
1781
return keep_entry (current , o );
1782
- }
1783
- else if (oldtree && !newtree && same (current , oldtree )) {
1782
+ } else if (oldtree && !newtree && same (current , oldtree )) {
1784
1783
/* 10 or 11 */
1785
1784
return deleted_entry (oldtree , current , o );
1786
- }
1787
- else if (oldtree && newtree &&
1785
+ } else if (oldtree && newtree &&
1788
1786
same (current , oldtree ) && !same (current , newtree )) {
1789
1787
/* 20 or 21 */
1790
1788
return merged_entry (newtree , current , o );
1791
- }
1792
- else {
1793
- /* all other failures */
1794
- if (oldtree )
1795
- return o -> gently ? -1 : reject_merge (oldtree , o );
1796
- if (current )
1797
- return o -> gently ? -1 : reject_merge (current , o );
1798
- if (newtree )
1799
- return o -> gently ? -1 : reject_merge (newtree , o );
1800
- return -1 ;
1801
- }
1789
+ } else
1790
+ return reject_merge (current , o );
1802
1791
}
1803
1792
else if (newtree ) {
1804
1793
if (oldtree && !o -> initial_checkout ) {
0 commit comments