Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
azure-cloud-mining-script
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Recolic
azure-cloud-mining-script
Commits
5db8000c
There was an error fetching the commit references. Please try again later.
Commit
5db8000c
authored
6 years ago
by
psychocrypt
Browse files
Options
Downloads
Patches
Plain Diff
NVIDIA bittube2 improvement
5% more hash per second
parent
12575794
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
xmrstak/backend/nvidia/nvcc_code/cuda_core.cu
+9
-8
9 additions, 8 deletions
xmrstak/backend/nvidia/nvcc_code/cuda_core.cu
with
9 additions
and
8 deletions
xmrstak/backend/nvidia/nvcc_code/cuda_core.cu
+
9
−
8
View file @
5db8000c
...
@@ -268,26 +268,27 @@ __global__ void cryptonight_core_gpu_phase2( int threads, int bfactor, int parti
...
@@ -268,26 +268,27 @@ __global__ void cryptonight_core_gpu_phase2( int threads, int bfactor, int parti
k
[
2
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
],
sub
+
2
);
k
[
2
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
],
sub
+
2
);
k
[
3
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
],
sub
+
3
);
k
[
3
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
],
sub
+
3
);
uint32_t
r
;
#pragma unroll 4
#pragma unroll 4
for
(
int
i
=
0
;
i
<
4
;
++
i
)
for
(
int
i
=
0
;
i
<
4
;
++
i
)
{
{
// only calculate the key if all data are up to date
// only calculate the key if all data are up to date
if
(
i
==
sub
)
if
(
i
==
sub
)
{
{
r
=
a
^
d
[
x
]
=
a
^
t_fn0
(
k
[
0
]
&
0xff
)
^
t_fn0
(
k
[
0
]
&
0xff
)
^
t_fn1
(
(
k
[
1
]
>>
8
)
&
0xff
)
^
t_fn1
(
(
k
[
1
]
>>
8
)
&
0xff
)
^
t_fn2
(
(
k
[
2
]
>>
16
)
&
0xff
)
^
t_fn2
(
(
k
[
2
]
>>
16
)
&
0xff
)
^
t_fn3
(
(
k
[
3
]
>>
24
)
);
t_fn3
(
(
k
[
3
]
>>
24
)
);
}
}
/* avoid negative number for modulo
// the last shuffle is not needed
* load valid key (k) depending on the round
if
(
i
!=
3
)
*/
{
k
[(
4
-
sub
+
i
)
%
4
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
]
^
r
,
i
);
/* avoid negative number for modulo
* load valid key (k) depending on the round
*/
k
[(
4
-
sub
+
i
)
%
4
]
=
shuffle
<
4
>
(
sPtr
,
sub
,
k
[
0
]
^
d
[
x
],
i
);
}
}
}
d
[
x
]
=
r
;
}
}
else
else
{
{
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment