Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
S
ssg
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
18
Issues
18
List
Boards
Labels
Milestones
Merge Requests
2
Merge Requests
2
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
sds
ssg
Commits
ed44b391
Commit
ed44b391
authored
Aug 22, 2016
by
Jonathan Jenkins
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
dispatch ULTs margo lookup
parent
2af29aa9
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
92 additions
and
13 deletions
+92
-13
src/ssg.c
src/ssg.c
+92
-13
No files found.
src/ssg.c
View file @
ed44b391
...
...
@@ -266,11 +266,30 @@ hg_return_t ssg_lookup(ssg_t s, hg_context_t *hgctx)
}
#ifdef HAVE_MARGO
struct
lookup_ult_args
{
ssg_t
ssg
;
margo_instance_id
mid
;
int
rank
;
hg_return_t
out
;
};
static
void
lookup_ult
(
void
*
arg
)
{
struct
lookup_ult_args
*
l
=
arg
;
l
->
out
=
margo_addr_lookup
(
l
->
mid
,
l
->
ssg
->
addr_strs
[
l
->
rank
],
&
l
->
ssg
->
addrs
[
l
->
rank
]);
}
// TODO: refactor - code is mostly a copy of ssg_lookup
hg_return_t
ssg_lookup_margo
(
ssg_t
s
,
margo_instance_id
mid
)
{
hg_context_t
*
hgctx
;
hg_return_t
hret
;
ABT_thread
*
ults
;
struct
lookup_ult_args
*
args
;
hg_return_t
hret
=
HG_SUCCESS
;
// "effective" rank for the lookup loop
int
eff_rank
=
0
;
...
...
@@ -295,25 +314,85 @@ hg_return_t ssg_lookup_margo(ssg_t s, margo_instance_id mid)
else
eff_rank
=
s
->
rank
;
// rank is set, perform lookup
// initialize ULTs
ults
=
malloc
(
s
->
num_addrs
*
sizeof
(
*
ults
));
if
(
ults
==
NULL
)
return
HG_NOMEM_ERROR
;
args
=
malloc
(
s
->
num_addrs
*
sizeof
(
*
args
));
if
(
args
==
NULL
)
{
free
(
ults
);
return
HG_NOMEM_ERROR
;
}
for
(
int
i
=
0
;
i
<
s
->
num_addrs
;
i
++
)
ults
[
i
]
=
ABT_THREAD_NULL
;
for
(
int
i
=
eff_rank
+
1
;
i
<
s
->
num_addrs
;
i
++
)
{
hret
=
margo_addr_lookup
(
mid
,
s
->
addr_strs
[
i
],
&
s
->
addrs
[
i
]);
if
(
hret
!=
HG_SUCCESS
)
return
hret
;
else
if
(
s
->
addrs
[
i
]
==
HG_ADDR_NULL
)
return
HG_PROTOCOL_ERROR
;
args
[
i
].
ssg
=
s
;
args
[
i
].
mid
=
mid
;
args
[
i
].
rank
=
i
;
int
aret
=
ABT_thread_create
(
*
margo_get_handler_pool
(
mid
),
&
lookup_ult
,
&
args
[
i
],
ABT_THREAD_ATTR_NULL
,
&
ults
[
i
]);
if
(
aret
!=
ABT_SUCCESS
)
{
hret
=
HG_OTHER_ERROR
;
goto
fin
;
}
}
for
(
int
i
=
0
;
i
<
eff_rank
;
i
++
)
{
hret
=
margo_addr_lookup
(
mid
,
s
->
addr_strs
[
i
],
&
s
->
addrs
[
i
]);
if
(
hret
!=
HG_SUCCESS
)
return
hret
;
else
if
(
s
->
addrs
[
i
]
==
HG_ADDR_NULL
)
return
HG_PROTOCOL_ERROR
;
args
[
i
].
ssg
=
s
;
args
[
i
].
mid
=
mid
;
args
[
i
].
rank
=
i
;
int
aret
=
ABT_thread_create
(
*
margo_get_handler_pool
(
mid
),
&
lookup_ult
,
&
args
[
i
],
ABT_THREAD_ATTR_NULL
,
&
ults
[
i
]);
if
(
aret
!=
ABT_SUCCESS
)
{
hret
=
HG_OTHER_ERROR
;
goto
fin
;
}
}
if
(
s
->
rank
==
SSG_EXTERNAL_RANK
)
{
hret
=
margo_addr_lookup
(
mid
,
s
->
addr_strs
[
eff_rank
],
&
s
->
addrs
[
eff_rank
]);
if
(
hret
!=
HG_SUCCESS
)
return
hret
;
else
if
(
s
->
addrs
[
eff_rank
]
==
HG_ADDR_NULL
)
return
HG_PROTOCOL_ERROR
;
args
[
eff_rank
].
ssg
=
s
;
args
[
eff_rank
].
mid
=
mid
;
args
[
eff_rank
].
rank
=
eff_rank
;
int
aret
=
ABT_thread_create
(
*
margo_get_handler_pool
(
mid
),
&
lookup_ult
,
&
args
[
eff_rank
],
ABT_THREAD_ATTR_NULL
,
&
ults
[
eff_rank
]);
if
(
aret
!=
ABT_SUCCESS
)
{
hret
=
HG_OTHER_ERROR
;
goto
fin
;
}
}
return
HG_SUCCESS
;
// wait on all
for
(
int
i
=
0
;
i
<
s
->
num_addrs
;
i
++
)
{
if
(
ults
[
i
]
!=
ABT_THREAD_NULL
)
{
int
aret
=
ABT_thread_join
(
ults
[
i
]);
ABT_thread_free
(
&
ults
[
i
]);
ults
[
i
]
=
ABT_THREAD_NULL
;
// in case of cascading failure from join
if
(
aret
!=
ABT_SUCCESS
)
{
hret
=
HG_OTHER_ERROR
;
break
;
}
else
if
(
args
[
i
].
out
!=
HG_SUCCESS
)
{
hret
=
args
[
i
].
out
;
break
;
}
}
}
fin:
// cleanup
if
(
ults
!=
NULL
)
{
for
(
int
i
=
0
;
i
<
s
->
num_addrs
;
i
++
)
{
if
(
ults
[
i
]
!=
ABT_THREAD_NULL
)
{
ABT_thread_cancel
(
ults
[
i
]);
ABT_thread_free
(
ults
[
i
]);
}
}
free
(
ults
);
}
if
(
args
!=
NULL
)
free
(
args
);
return
hret
;
}
#endif
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment