Assuming this is a conventional martingale (if you win, then stop; if you lose, then double your stake on the next round) with fair odds on a fair coin, then:
* the net amount you profit after stopping is your original stake $m$
* the probability you play the $n$th round is $\dfrac1{2^{n-1}}$ for positive integer $n$
* the probability you first win on the $n$th round and then stop is $\dfrac1{2^n}$ (a geometric distribution)
* the expected number of rounds is $\displaystyle\sum_1^\infty \dfrac n{2^{n}}=2$ (the reciprocal of the probability of winning a particular round, given that you play it)
* the amount you stake on the $n$th round, if you play it, is ${2^{n-1}}m$
* the expected amount you will have staked in total before winning is infinite: $\displaystyle \sum_1^\infty \dfrac{2^{n-1}m}{2^{n-1}} $
This final point is one of the reasons that it may be difficult to implement this strategy in practice. Typically a gambler has finite resources.