25 #define GET_BIT2(p, i, A0, A1) IF_BIT_0(p) \  argument
26   { UPDATE_0(p); i = (i + i); A0; } else \
27   { UPDATE_1(p); i = (i + i) + 1; A1; }
28 #define GET_BIT(p, i) GET_BIT2(p, i, ; , ;)  argument
30 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); }  argument
31 #define TREE_DECODE(probs, limit, i) \  argument
32   { i = 1; do { TREE_GET_BIT(probs, i); } while (i < limit); i -= limit; }
37 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i)  argument
39 #define TREE_6_DECODE(probs, i) \  argument
40   { i = 1; \
41   TREE_GET_BIT(probs, i); \
42   TREE_GET_BIT(probs, i); \
43   TREE_GET_BIT(probs, i); \
44   TREE_GET_BIT(probs, i); \
45   TREE_GET_BIT(probs, i); \
46   TREE_GET_BIT(probs, i); \
47   i -= 0x40; }
55 #define GET_BIT2_CHECK(p, i, A0, A1) IF_BIT_0_CHECK(p) \  argument
56   { UPDATE_0_CHECK; i = (i + i); A0; } else \
57   { UPDATE_1_CHECK; i = (i + i) + 1; A1; }
58 #define GET_BIT_CHECK(p, i) GET_BIT2_CHECK(p, i, ; , ;)  argument
59 #define TREE_DECODE_CHECK(probs, limit, i) \  argument
60   { i = 1; do { GET_BIT_CHECK(probs + i, i) } while (i < limit); i -= limit; }
322               unsigned i = 1;  in LzmaDec_DecodeReal()  local
328                 GET_BIT2(prob + i, i, ; , distance |= mask);  in LzmaDec_DecodeReal()
365               unsigned i = 1;  in LzmaDec_DecodeReal()  local
366               GET_BIT2(prob + i, i, ; , distance |= 1);  in LzmaDec_DecodeReal()
367               GET_BIT2(prob + i, i, ; , distance |= 2);  in LzmaDec_DecodeReal()
368               GET_BIT2(prob + i, i, ; , distance |= 4);  in LzmaDec_DecodeReal()
369               GET_BIT2(prob + i, i, ; , distance |= 8);  in LzmaDec_DecodeReal()
688             unsigned i = 1;  in LzmaDec_TryDummy()  local
691               GET_BIT_CHECK(prob + i, i);  in LzmaDec_TryDummy()
736   UInt32 i;  in LzmaDec_InitStateReal()  local
738   for (i = 0; i < numProbs; i++)  in LzmaDec_InitStateReal()
739     probs[i] = kBitModelTotal >> 1;  in LzmaDec_InitStateReal()