merge: forcefully mark files that we get from the second parent as dirty After a hg merge, we want to include in the commit all the files that we got from the second parent, so that we have the correct file-level history. To make them visible to hg commit, we try to mark them as dirty. Unfortunately, right now we can't really mark them as dirty[1] - the best we can do is to mark them as needing a full comparison of their contents, but they will still be considered clean if they happen to be identical to the version in the first parent. This changeset extends the dirstate format in a compatible way, so that we can mark a file as dirty: Right now we use a negative file size to indicate we don't have valid stat data for this entry. In practice, this size is always -1. This patch uses -2 to indicate that the entry is dirty. Older versions of hg won't choke on this dirstate, but they may happily mark the file as clean after a full comparison, destroying all of our hard work. The patch adds a dirstate.normallookup method with the semantics of the current normaldirty, and changes normaldirty to forcefully mark the entry as dirty. This should fix issue522. [1] - well, we could put them in state 'm', but that state has a different meaning.

     1

# strutil.py - string utilities for Mercurial

     2

#

     3

# Copyright 2006 Vadim Gelfer <vadim.gelfer@gmail.com>

     4

#

     5

# This software may be used and distributed according to the terms

     6

# of the GNU General Public License, incorporated herein by reference.

     7

     8

def findall(haystack, needle, start=0, end=None):

     9

    if end is None:

    10

        end = len(haystack)

    11

    if end < 0:

    12

        end += len(haystack)

    13

    if start < 0:

    14

        start += len(haystack)

    15

    while start < end:

    16

        c = haystack.find(needle, start, end)

    17

        if c == -1:

    18

            break

    19

        yield c

    20

        start = c + 1

    21

    22

def rfindall(haystack, needle, start=0, end=None):

    23

    if end is None:

    24

        end = len(haystack)

    25

    if end < 0:

    26

        end += len(haystack)

    27

    if start < 0:

    28

        start += len(haystack)

    29

    while end >= 0:

    30

        c = haystack.rfind(needle, start, end)

    31

        if c == -1:

    32

            break

    33

        yield c

    34

        end = c - 1