Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
W
wine-winehq
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
wine
wine-winehq
Commits
8cbc34e4
Commit
8cbc34e4
authored
Jul 29, 2011
by
Jacek Caban
Committed by
Alexandre Julliard
Jul 29, 2011
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
mshtml: Improved handling empty dispex_data_t in preprocess_dispex_data.
parent
ce57ebe3
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
8 additions
and
10 deletions
+8
-10
dispex.c
dlls/mshtml/dispex.c
+8
-10
No files found.
dlls/mshtml/dispex.c
View file @
8cbc34e4
...
@@ -248,21 +248,19 @@ static dispex_data_t *preprocess_dispex_data(DispatchEx *This)
...
@@ -248,21 +248,19 @@ static dispex_data_t *preprocess_dispex_data(DispatchEx *This)
if
(
!
data
->
func_cnt
)
{
if
(
!
data
->
func_cnt
)
{
heap_free
(
data
->
funcs
);
heap_free
(
data
->
funcs
);
data
->
name_table
=
NULL
;
data
->
funcs
=
NULL
;
data
->
funcs
=
NULL
;
}
else
if
(
data
->
func_cnt
!=
size
)
{
return
data
;
data
->
funcs
=
heap_realloc
(
data
->
funcs
,
data
->
func_cnt
*
sizeof
(
func_info_t
));
}
}
data
->
funcs
=
heap_realloc
(
data
->
funcs
,
data
->
func_cnt
*
sizeof
(
func_info_t
));
qsort
(
data
->
funcs
,
data
->
func_cnt
,
sizeof
(
func_info_t
),
dispid_cmp
);
qsort
(
data
->
funcs
,
data
->
func_cnt
,
sizeof
(
func_info_t
),
dispid_cmp
);
if
(
data
->
funcs
)
{
data
->
name_table
=
heap_alloc
(
data
->
func_cnt
*
sizeof
(
func_info_t
*
));
data
->
name_table
=
heap_alloc
(
data
->
func_cnt
*
sizeof
(
func_info_t
*
));
for
(
i
=
0
;
i
<
data
->
func_cnt
;
i
++
)
for
(
i
=
0
;
i
<
data
->
func_cnt
;
i
++
)
data
->
name_table
[
i
]
=
data
->
funcs
+
i
;
data
->
name_table
[
i
]
=
data
->
funcs
+
i
;
qsort
(
data
->
name_table
,
data
->
func_cnt
,
sizeof
(
func_info_t
*
),
func_name_cmp
);
qsort
(
data
->
name_table
,
data
->
func_cnt
,
sizeof
(
func_info_t
*
),
func_name_cmp
);
}
else
{
data
->
name_table
=
NULL
;
}
return
data
;
return
data
;
}
}
...
...
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