|
6 | 6 | // SetBufferOffset does not check against the size, |
7 | 7 | // so we can provide and use a larger buffer. |
8 | 8 | std::vector<char> databuffer{}; |
9 | | - databuffer.reserve( 4*1024*1024*1024ll ); |
10 | | - TBufferFile b(TBuffer::kWrite, 2*1024*1024*1024ll-100, databuffer.data(), false /* don't adopt */); |
| 9 | + databuffer.reserve(4 * 1024 * 1024 * 1024ll); |
| 10 | + TBufferFile b(TBuffer::kWrite, 2 * 1024 * 1024 * 1024ll - 100, databuffer.data(), false /* don't adopt */); |
11 | 11 | { |
12 | 12 | // Regular object at offset 0 |
13 | 13 | UInt_t R__c = b.WriteVersion(TExMap::Class(), kTRUE); |
|
23 | 23 | { |
24 | 24 | // Object larger than 1GB |
25 | 25 | UInt_t R__c = b.WriteVersion(TExMap::Class(), kTRUE); |
26 | | - b.SetBufferOffset(4000+1*1024*1024*1024ll); |
| 26 | + b.SetBufferOffset(4000 + 1 * 1024 * 1024 * 1024ll); |
27 | 27 | b.SetByteCount(R__c, kTRUE); |
28 | 28 | } |
29 | 29 | { |
30 | 30 | // Regular object located past 1GB |
31 | 31 | UInt_t R__c = b.WriteVersion(TExMap::Class(), kTRUE); |
32 | | - b.SetBufferOffset(8000+1*1024*1024*1024ll); |
| 32 | + b.SetBufferOffset(8000 + 1 * 1024 * 1024 * 1024ll); |
33 | 33 | b.SetByteCount(R__c, kTRUE); |
34 | 34 | } |
35 | 35 | { |
|
40 | 40 | // However the lifting might be temporary, so this might need to be |
41 | 41 | // moved to a test that stored objects in a TFile. |
42 | 42 | UInt_t R__c = b.WriteVersion(TExMap::Class(), kTRUE); |
43 | | - b.SetBufferOffset(12000+2*1024*1024*1024ll); |
| 43 | + b.SetBufferOffset(12000 + 2 * 1024 * 1024 * 1024ll); |
44 | 44 | b.SetByteCount(R__c, kTRUE); |
45 | 45 | } |
46 | 46 |
|
47 | | - |
48 | 47 | // To make a copy instead of using the const references: |
49 | | - auto bytecounts{ b.GetByteCounts() }; |
| 48 | + auto bytecounts{b.GetByteCounts()}; |
50 | 49 | if (bytecounts.size() != expectedByteCounts) { |
51 | 50 | ++errors; |
52 | 51 | std::cerr << "The number of bytecount is not as expected (1), it is " << bytecounts.size() << '\n'; |
53 | 52 | std::cerr << "The full list is:\n"; |
54 | | - for(auto bc : bytecounts) |
| 53 | + for (auto bc : bytecounts) |
55 | 54 | std::cerr << "values: " << bc.first << " , " << bc.second << '\n'; |
56 | 55 | } |
57 | 56 |
|
|
85 | 84 | { |
86 | 85 | // Object larger than 1GB |
87 | 86 | auto version = b.ReadVersion(&R__s, &R__c, TExMap::Class()); |
88 | | - b.SetBufferOffset(4000+1*1024*1024*1024ll); |
| 87 | + b.SetBufferOffset(4000 + 1 * 1024 * 1024 * 1024ll); |
89 | 88 | auto res = b.CheckByteCount(R__s, R__c, TExMap::Class()); |
90 | 89 | if (res != 0) { |
91 | 90 | ++errors; |
|
95 | 94 | { |
96 | 95 | // Regular object located past 1GB |
97 | 96 | auto version = b.ReadVersion(&R__s, &R__c, TExMap::Class()); |
98 | | - b.SetBufferOffset(8000+1*1024*1024*1024ll); |
| 97 | + b.SetBufferOffset(8000 + 1 * 1024 * 1024 * 1024ll); |
99 | 98 | auto res = b.CheckByteCount(R__s, R__c, TExMap::Class()); |
100 | 99 | if (res != 0) { |
101 | 100 | ++errors; |
|
106 | 105 | // Object larger than 1GB start after 1GB |
107 | 106 | // NOTE: this does not yet fit. |
108 | 107 | auto version = b.ReadVersion(&R__s, &R__c, TExMap::Class()); |
109 | | - b.SetBufferOffset(12000+2*1024*1024*1024ll); |
| 108 | + b.SetBufferOffset(12000 + 2 * 1024 * 1024 * 1024ll); |
110 | 109 | auto res = b.CheckByteCount(R__s, R__c, TExMap::Class()); |
111 | 110 | if (res != 0) { |
112 | 111 | ++errors; |
|
0 commit comments