@@ -111,8 +111,8 @@ benchmarks_instance! {
111
111
}
112
112
113
113
execute {
114
- let m in 1 .. MAX_MEMBERS ;
115
114
let b in 1 .. MAX_BYTES ;
115
+ let m in 1 .. MAX_MEMBERS ;
116
116
117
117
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
118
118
@@ -141,8 +141,8 @@ benchmarks_instance! {
141
141
142
142
// This tests when execution would happen immediately after proposal
143
143
propose_execute {
144
- let m in 1 .. MAX_MEMBERS ;
145
144
let b in 1 .. MAX_BYTES ;
145
+ let m in 1 .. MAX_MEMBERS ;
146
146
147
147
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
148
148
@@ -172,9 +172,9 @@ benchmarks_instance! {
172
172
173
173
// This tests when proposal is created and queued as "proposed"
174
174
propose_proposed {
175
+ let b in 1 .. MAX_BYTES ;
175
176
let m in 2 .. MAX_MEMBERS ;
176
177
let p in 1 .. T :: MaxProposals :: get( ) ;
177
- let b in 1 .. MAX_BYTES ;
178
178
179
179
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
180
180
@@ -287,10 +287,10 @@ benchmarks_instance! {
287
287
}
288
288
289
289
close_early_disapproved {
290
+ let b in 1 .. MAX_BYTES ;
290
291
// We choose 4 as a minimum so we always trigger a vote in the voting loop (`for j in ...`)
291
292
let m in 4 .. MAX_MEMBERS ;
292
293
let p in 1 .. T :: MaxProposals :: get( ) ;
293
- let b in 1 .. MAX_BYTES ;
294
294
295
295
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
296
296
@@ -364,10 +364,10 @@ benchmarks_instance! {
364
364
}
365
365
366
366
close_early_approved {
367
+ let b in 1 .. MAX_BYTES ;
367
368
// We choose 4 as a minimum so we always trigger a vote in the voting loop (`for j in ...`)
368
369
let m in 4 .. MAX_MEMBERS ;
369
370
let p in 1 .. T :: MaxProposals :: get( ) ;
370
- let b in 1 .. MAX_BYTES ;
371
371
372
372
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
373
373
@@ -445,10 +445,10 @@ benchmarks_instance! {
445
445
}
446
446
447
447
close_disapproved {
448
+ let b in 1 .. MAX_BYTES ;
448
449
// We choose 4 as a minimum so we always trigger a vote in the voting loop (`for j in ...`)
449
450
let m in 4 .. MAX_MEMBERS ;
450
451
let p in 1 .. T :: MaxProposals :: get( ) ;
451
- let b in 1 .. MAX_BYTES ;
452
452
453
453
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
454
454
@@ -517,10 +517,10 @@ benchmarks_instance! {
517
517
}
518
518
519
519
close_approved {
520
+ let b in 1 .. MAX_BYTES ;
520
521
// We choose 4 as a minimum so we always trigger a vote in the voting loop (`for j in ...`)
521
522
let m in 4 .. MAX_MEMBERS ;
522
523
let p in 1 .. T :: MaxProposals :: get( ) ;
523
- let b in 1 .. MAX_BYTES ;
524
524
525
525
let bytes_in_storage = b + size_of:: <u32 >( ) as u32 ;
526
526
0 commit comments