Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
xxadev
vscode
提交
376c52b9
V
vscode
项目概览
xxadev
/
vscode
与 Fork 源项目一致
从无法访问的项目Fork
通知
2
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
V
vscode
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
前往新版Gitcode,体验更适合开发者的 AI 搜索 >>
提交
376c52b9
编写于
6月 08, 2017
作者:
I
isidor
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
fixes #28198
上级
586d578d
变更
2
显示空白变更内容
内联
并排
Showing
2 changed file
with
11 addition
and
11 deletion
+11
-11
src/vs/workbench/parts/debug/common/debugModel.ts
src/vs/workbench/parts/debug/common/debugModel.ts
+3
-3
src/vs/workbench/parts/debug/electron-browser/debugViewer.ts
src/vs/workbench/parts/debug/electron-browser/debugViewer.ts
+8
-8
未找到文件。
src/vs/workbench/parts/debug/common/debugModel.ts
浏览文件 @
376c52b9
...
...
@@ -435,17 +435,17 @@ export class Thread implements IThread {
* Only fetches the first stack frame for performance reasons. Calling this method consecutive times
* gets the remainder of the call stack.
*/
public
fetchCallStack
():
TPromise
<
void
>
{
public
fetchCallStack
(
smartFetch
=
true
):
TPromise
<
void
>
{
if
(
!
this
.
stopped
)
{
return
TPromise
.
as
(
null
);
}
if
(
!
this
.
fetchPromise
)
{
if
(
!
this
.
fetchPromise
&&
smartFetch
)
{
this
.
fetchPromise
=
this
.
getCallStackImpl
(
0
,
1
).
then
(
callStack
=>
{
this
.
callStack
=
callStack
||
[];
});
}
else
{
this
.
fetchPromise
=
this
.
fetchPromise
.
then
(()
=>
this
.
getCallStackImpl
(
this
.
callStack
.
length
,
20
).
then
(
callStackSecondPart
=>
{
this
.
fetchPromise
=
(
this
.
fetchPromise
||
TPromise
.
as
(
null
))
.
then
(()
=>
this
.
getCallStackImpl
(
this
.
callStack
.
length
,
20
).
then
(
callStackSecondPart
=>
{
this
.
callStack
=
this
.
callStack
.
concat
(
callStackSecondPart
);
}));
}
...
...
src/vs/workbench/parts/debug/electron-browser/debugViewer.ts
浏览文件 @
376c52b9
...
...
@@ -354,7 +354,7 @@ export class CallStackDataSource implements IDataSource {
public
getChildren
(
tree
:
ITree
,
element
:
any
):
TPromise
<
any
>
{
if
(
element
instanceof
Thread
)
{
return
TPromise
.
as
(
this
.
getThreadChildren
(
element
)
);
return
this
.
getThreadChildren
(
element
);
}
if
(
element
instanceof
Model
)
{
return
TPromise
.
as
(
element
.
getProcesses
());
...
...
@@ -364,25 +364,25 @@ export class CallStackDataSource implements IDataSource {
return
TPromise
.
as
(
process
.
getAllThreads
());
}
private
getThreadChildren
(
thread
:
Thread
):
any
[]
{
private
getThreadChildren
(
thread
:
Thread
):
TPromise
<
any
>
{
const
callStack
:
any
[]
=
thread
.
getCallStack
();
if
(
!
callStack
)
{
return
[]
;
if
(
!
callStack
||
!
callStack
.
length
)
{
return
thread
.
fetchCallStack
(
false
).
then
(()
=>
thread
.
getCallStack
())
;
}
if
(
callStack
.
length
===
1
)
{
// To reduce flashing of the call stack view simply append the stale call stack
// once we have the correct data the tree will refresh and we will no longer display it.
return
callStack
.
concat
(
thread
.
getStaleCallStack
().
slice
(
1
));
return
TPromise
.
as
(
callStack
.
concat
(
thread
.
getStaleCallStack
().
slice
(
1
)
));
}
if
(
thread
.
stoppedDetails
&&
thread
.
stoppedDetails
.
framesErrorMessage
)
{
return
callStack
.
concat
([
thread
.
stoppedDetails
.
framesErrorMessage
]
);
return
TPromise
.
as
(
callStack
.
concat
([
thread
.
stoppedDetails
.
framesErrorMessage
])
);
}
if
(
thread
.
stoppedDetails
&&
thread
.
stoppedDetails
.
totalFrames
>
callStack
.
length
&&
callStack
.
length
>
1
)
{
return
callStack
.
concat
([
new
ThreadAndProcessIds
(
thread
.
process
.
getId
(),
thread
.
threadId
)]
);
return
TPromise
.
as
(
callStack
.
concat
([
new
ThreadAndProcessIds
(
thread
.
process
.
getId
(),
thread
.
threadId
)])
);
}
return
callStack
;
return
TPromise
.
as
(
callStack
)
;
}
public
getParent
(
tree
:
ITree
,
element
:
any
):
TPromise
<
any
>
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录