Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
L
loopy
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
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
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Kaushik Kulkarni
loopy
Commits
5370d979
Commit
5370d979
authored
9 years ago
by
Andreas Klöckner
Browse files
Options
Downloads
Patches
Plain Diff
Scheduler: On Ctrl-C, print longest found kernel
parent
23142519
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
loopy/schedule.py
+45
-35
45 additions, 35 deletions
loopy/schedule.py
with
45 additions
and
35 deletions
loopy/schedule.py
+
45
−
35
View file @
5370d979
...
...
@@ -1207,43 +1207,9 @@ def generate_loop_schedules(kernel, debug_args={}):
debug
=
debug
,
allow_boost
=
None
),
generate_loop_schedules_internal
(
sched_state
,
debug
=
debug
)]
for
gen
in
generators
:
for
gen_sched
in
gen
:
# gen_sched = insert_barriers(kernel, gen_sched,
# reverse=False, kind="global")
# for sched_item in gen_sched:
# if isinstance(sched_item, Barrier) and sched_item.kind == "global":
# raise LoopyError("kernel requires a global barrier %s"
# % sched_item.comment)
debug
.
stop
()
logger
.
info
(
"
%s: barrier insertion: start
"
%
kernel
.
name
)
gen_sched
=
insert_barriers
(
kernel
,
gen_sched
,
reverse
=
False
,
kind
=
"
local
"
)
logger
.
info
(
"
%s: barrier insertion: done
"
%
kernel
.
name
)
yield
kernel
.
copy
(
schedule
=
gen_sched
,
state
=
kernel_state
.
SCHEDULED
)
debug
.
start
()
schedule_count
+=
1
# if no-boost mode yielded a viable schedule, stop now
if
schedule_count
:
break
debug
.
done_scheduling
()
if
not
schedule_count
:
def
print_longest_dead_end
():
if
debug
.
interactive
:
print
(
75
*
"
-
"
)
print
(
"
ERROR: Sorry--loo.py did not find a schedule for your kernel.
"
)
print
(
75
*
"
-
"
)
print
(
"
Loo.py will now show you the scheduler state at the point
"
)
print
(
"
where the longest (dead-end) schedule was generated, in the
"
)
print
(
"
the hope that some of this makes sense and helps you find
"
)
...
...
@@ -1262,6 +1228,50 @@ def generate_loop_schedules(kernel, debug_args={}):
debug
=
debug
):
pass
try
:
for
gen
in
generators
:
for
gen_sched
in
gen
:
# gen_sched = insert_barriers(kernel, gen_sched,
# reverse=False, kind="global")
# for sched_item in gen_sched:
# if isinstance(sched_item, Barrier) and sched_item.kind == "global":
# raise LoopyError("kernel requires a global barrier %s"
# % sched_item.comment)
debug
.
stop
()
logger
.
info
(
"
%s: barrier insertion: start
"
%
kernel
.
name
)
gen_sched
=
insert_barriers
(
kernel
,
gen_sched
,
reverse
=
False
,
kind
=
"
local
"
)
logger
.
info
(
"
%s: barrier insertion: done
"
%
kernel
.
name
)
yield
kernel
.
copy
(
schedule
=
gen_sched
,
state
=
kernel_state
.
SCHEDULED
)
debug
.
start
()
schedule_count
+=
1
# if no-boost mode yielded a viable schedule, stop now
if
schedule_count
:
break
except
KeyboardInterrupt
:
print
(
75
*
"
-
"
)
print
(
"
Interrupted during scheduling
"
)
print
(
75
*
"
-
"
)
print_longest_dead_end
()
raise
debug
.
done_scheduling
()
if
not
schedule_count
:
print
(
75
*
"
-
"
)
print
(
"
ERROR: Sorry--loo.py did not find a schedule for your kernel.
"
)
print
(
75
*
"
-
"
)
print_longest_dead_end
()
raise
RuntimeError
(
"
no valid schedules found
"
)
logger
.
info
(
"
%s: schedule done
"
%
kernel
.
name
)
...
...
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