@@ -173,7 +173,7 @@ string BinaryNinja::GetPathRelativeToUserDirectory(const string& rel)
173173
174174
175175bool BinaryNinja::ExecuteWorkerProcess (const string& path, const vector<string>& args, const DataBuffer& input,
176- string& output, string& errors, bool stdoutIsText, bool stderrIsText)
176+ string& output, string& errors, bool stdoutIsText, bool stderrIsText)
177177{
178178 const char ** argArray = new const char *[args.size () + 1 ];
179179 for (size_t i = 0 ; i < args.size (); i++)
@@ -182,8 +182,8 @@ bool BinaryNinja::ExecuteWorkerProcess(const string& path, const vector<string>&
182182
183183 char * outputStr;
184184 char * errorStr;
185- bool result = BNExecuteWorkerProcess (path. c_str (), argArray, input. GetBufferObject (), &outputStr, &errorStr,
186- stdoutIsText, stderrIsText);
185+ bool result = BNExecuteWorkerProcess (
186+ path. c_str (), argArray, input. GetBufferObject (), &outputStr, &errorStr, stdoutIsText, stderrIsText);
187187
188188 output = outputStr;
189189 errors = errorStr;
@@ -301,9 +301,7 @@ void BinaryNinja::WorkerEnqueue(RefCountObject* owner, const function<void()>& a
301301 context.owner = owner;
302302 context.func = action;
303303
304- WorkerEnqueue ([=]() {
305- context.func ();
306- });
304+ WorkerEnqueue ([=]() { context.func (); });
307305}
308306
309307
@@ -325,9 +323,7 @@ void BinaryNinja::WorkerPriorityEnqueue(RefCountObject* owner, const function<vo
325323 context.owner = owner;
326324 context.func = action;
327325
328- WorkerPriorityEnqueue ([=]() {
329- context.func ();
330- });
326+ WorkerPriorityEnqueue ([=]() { context.func (); });
331327}
332328
333329
@@ -349,9 +345,7 @@ void BinaryNinja::WorkerInteractiveEnqueue(RefCountObject* owner, const function
349345 context.owner = owner;
350346 context.func = action;
351347
352- WorkerInteractiveEnqueue ([=]() {
353- context.func ();
354- });
348+ WorkerInteractiveEnqueue ([=]() { context.func (); });
355349}
356350
357351
@@ -389,23 +383,27 @@ map<string, uint64_t> BinaryNinja::GetMemoryUsageInfo()
389383}
390384
391385
392- std::function<bool (size_t , size_t )>
393- BinaryNinja::SplitProgress ( std::function<bool (size_t , size_t )> originalFn, size_t subpart, size_t subpartCount)
386+ std::function<bool (size_t , size_t )> BinaryNinja::SplitProgress (
387+ std::function<bool (size_t , size_t )> originalFn, size_t subpart, size_t subpartCount)
394388{
395389 return SplitProgress (originalFn, subpart, std::vector<double >(subpartCount, 1.0 / (double )subpartCount));
396390}
397391
398392
399- std::function<bool (size_t , size_t )>
400- BinaryNinja::SplitProgress ( std::function<bool (size_t , size_t )> originalFn, size_t subpart, std::vector<double> subpartWeights)
393+ std::function<bool (size_t , size_t )> BinaryNinja::SplitProgress (
394+ std::function<bool (size_t , size_t )> originalFn, size_t subpart, std::vector<double> subpartWeights)
401395{
402396 if (!originalFn)
403- return [](size_t , size_t ){ return true ; };
397+ return [](size_t , size_t ) {
398+ return true ;
399+ };
404400
405401 // Normalize weights
406402 double weightSum = std::accumulate (subpartWeights.begin (), subpartWeights.end (), 0.0 );
407403 if (weightSum < 0 .0001f )
408- return [](size_t , size_t ){ return true ; };
404+ return [](size_t , size_t ) {
405+ return true ;
406+ };
409407 // Keep a running count of weights for the start
410408 std::vector<double > subpartStarts;
411409 double start = 0.0 ;
0 commit comments