Lines Matching refs:transfers
260 # case the list of transfers produced will never read from the
272 self.transfers = []
311 # Find the ordering dependencies among transfers (this is O(n^2)
312 # in the number of transfers).
314 # Find a sequence of transfers that satisfies as many ordering
371 for xf in self.transfers:
624 for xf in self.transfers:
646 for xf in self.transfers:
696 for xf in self.transfers:
798 # Simulate the sequences of transfers we will output, and check that:
805 # Imagine processing the transfers in order.
806 for xf in self.transfers:
847 for xf in self.transfers:
856 S = [(u.NetStashChange(), u.order, u) for u in self.transfers
869 assert len(L) == len(self.transfers)
871 self.transfers = L
881 for xf in self.transfers:
918 for xf in self.transfers:
966 for xf in self.transfers:
975 for xf in self.transfers:
981 for xf in self.transfers:
1043 # and by rearranging self.transfers to be in the chosen sequence.
1052 self.transfers = new_transfers
1060 # - a set of transfers.
1062 for b in self.transfers:
1074 for a in self.transfers:
1102 """Parse the file_map to generate all the transfers."""
1120 # We care about diff transfers only.
1168 "zero", self.transfers)
1174 AddTransfer(tgt_fn, None, tgt_ranges, empty, "new", self.transfers)
1180 "diff", self.transfers, self.version >= 3)
1188 "diff", self.transfers, self.version >= 3)
1199 "diff", self.transfers, self.version >= 3)
1202 AddTransfer(tgt_fn, None, tgt_ranges, empty, "new", self.transfers)
