1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
|
/**********************************************************************
Copyright(c) 2020 Arm Corporation All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the
distribution.
* Neither the name of Arm Corporation nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
**********************************************************************/
#include <stddef.h>
#include <md5_mb.h>
#include <assert.h>
#ifndef max
#define max(a,b) (((a) > (b)) ? (a) : (b))
#endif
#ifndef min
#define min(a,b) (((a) < (b)) ? (a) : (b))
#endif
#define MD5_MB_CE_MAX_LANES 4
void md5_mb_asimd_x4(MD5_JOB *, MD5_JOB *, MD5_JOB *, MD5_JOB *, int);
void md5_mb_asimd_x1(MD5_JOB *, int);
#define LANE_IS_NOT_FINISHED(state,i) \
(((state->lens[i]&(~0xf))!=0) && state->ldata[i].job_in_lane!=NULL)
#define LANE_IS_FINISHED(state,i) \
(((state->lens[i]&(~0xf))==0) && state->ldata[i].job_in_lane!=NULL)
#define LANE_IS_FREE(state,i) \
(((state->lens[i]&(~0xf))==0) && state->ldata[i].job_in_lane==NULL)
#define LANE_IS_INVALID(state,i) \
(((state->lens[i]&(~0xf))!=0) && state->ldata[i].job_in_lane==NULL)
void md5_mb_mgr_init_asimd(MD5_MB_JOB_MGR * state)
{
unsigned int i;
state->unused_lanes[0] = 0xf;
state->num_lanes_inuse = 0;
for (i = 0; i < MD5_MB_CE_MAX_LANES; i++) {
state->unused_lanes[0] <<= 4;
state->unused_lanes[0] |= MD5_MB_CE_MAX_LANES - 1 - i;
state->lens[i] = i;
state->ldata[i].job_in_lane = 0;
}
//lanes > MD5_MB_CE_MAX_LANES is invalid lane
for (; i < MD5_MAX_LANES; i++) {
state->lens[i] = 0xf;
state->ldata[i].job_in_lane = 0;
}
}
static int md5_mb_mgr_do_jobs(MD5_MB_JOB_MGR * state)
{
int lane_idx, len, i;
if (state->num_lanes_inuse == 0) {
return -1;
}
if (state->num_lanes_inuse == 4) {
len = min(min(state->lens[0], state->lens[1]),
min(state->lens[2], state->lens[3]));
lane_idx = len & 0xf;
len &= ~0xf;
md5_mb_asimd_x4(state->ldata[0].job_in_lane,
state->ldata[1].job_in_lane,
state->ldata[2].job_in_lane,
state->ldata[3].job_in_lane, len >> 4);
//only return the min length job
for (i = 0; i < MD5_MAX_LANES; i++) {
if (LANE_IS_NOT_FINISHED(state, i)) {
state->lens[i] -= len;
state->ldata[i].job_in_lane->len -= len;
state->ldata[i].job_in_lane->buffer += len << 2;
}
}
return lane_idx;
} else {
for (i = 0; i < MD5_MAX_LANES; i++) {
if (LANE_IS_NOT_FINISHED(state, i)) {
len = state->lens[i] & (~0xf);
md5_mb_asimd_x1(state->ldata[i].job_in_lane, len >> 4);
state->lens[i] -= len;
state->ldata[i].job_in_lane->len -= len;
state->ldata[i].job_in_lane->buffer += len << 2;
return i;
}
}
}
return -1;
}
static MD5_JOB *md5_mb_mgr_free_lane(MD5_MB_JOB_MGR * state)
{
int i;
MD5_JOB *ret = NULL;
for (i = 0; i < MD5_MB_CE_MAX_LANES; i++) {
if (LANE_IS_FINISHED(state, i)) {
state->unused_lanes[0] <<= 4;
state->unused_lanes[0] |= i;
state->num_lanes_inuse--;
ret = state->ldata[i].job_in_lane;
ret->status = STS_COMPLETED;
state->ldata[i].job_in_lane = NULL;
break;
}
}
return ret;
}
static void md5_mb_mgr_insert_job(MD5_MB_JOB_MGR * state, MD5_JOB * job)
{
int lane_idx;
//add job into lanes
lane_idx = state->unused_lanes[0] & 0xf;
//fatal error
assert(lane_idx < MD5_MB_CE_MAX_LANES);
state->lens[lane_idx] = (job->len << 4) | lane_idx;
state->ldata[lane_idx].job_in_lane = job;
state->unused_lanes[0] >>= 4;
state->num_lanes_inuse++;
}
MD5_JOB *md5_mb_mgr_submit_asimd(MD5_MB_JOB_MGR * state, MD5_JOB * job)
{
#ifndef NDEBUG
int lane_idx;
#endif
MD5_JOB *ret;
//add job into lanes
md5_mb_mgr_insert_job(state, job);
ret = md5_mb_mgr_free_lane(state);
if (ret != NULL) {
return ret;
}
//submit will wait all lane has data
if (state->num_lanes_inuse < MD5_MB_CE_MAX_LANES)
return NULL;
#ifndef NDEBUG
lane_idx = md5_mb_mgr_do_jobs(state);
assert(lane_idx != -1);
#else
md5_mb_mgr_do_jobs(state);
#endif
ret = md5_mb_mgr_free_lane(state);
return ret;
}
MD5_JOB *md5_mb_mgr_flush_asimd(MD5_MB_JOB_MGR * state)
{
MD5_JOB *ret;
ret = md5_mb_mgr_free_lane(state);
if (ret) {
return ret;
}
md5_mb_mgr_do_jobs(state);
return md5_mb_mgr_free_lane(state);
}
|