Lines Matching refs:result
105 value result; in SerialRecursiveFib() local
107 result = n; in SerialRecursiveFib()
109 result = SerialRecursiveFib(n - 1) + SerialRecursiveFib(n - 2); in SerialRecursiveFib()
110 return result; in SerialRecursiveFib()
319 bool result = Queue.try_pop(M); // get last element in ParallelPipeFib() local
320 assert(result); in ParallelPipeFib()
439 value result; in Measure() local
444 result = func(number); in Measure()
447 return result; in Measure()
459 value result, sum; in main() local
464 result = Measure("Serial loop", SerialFib, NumbersCount); in main()
466 assert(result == sum); in main()
468 assert(result == sum); in main()
470 assert(result == sum); in main()
480 assert(result == sum); in main()
484 assert(result == sum); in main()
488 assert(result == sum); in main()
490 assert(result == sum); in main()
492 assert(result == sum); in main()
494 assert(result == sum); in main()
496 assert(result == sum); in main()
501 printf("Fibonacci number #%d modulo 2^64 is %lld\n\n", NumbersCount, result); in main()
504 printf("Fibonacci number #%d modulo 2^64 is %I64d\n\n", NumbersCount, result); in main()
523 Matrix2x2 result; in operator *() local
524 Matrix2x2Multiply(v, to.v, result.v); in operator *()
525 return result; in operator *()