Displaying 3 results from an estimated 3 matches for "end_typ".
Did you mean:
end_type
2007 Apr 16
0
4 commits - libswfdec/swfdec_shape.c libswfdec/swfdec_stroke.c test/dump.c
...ec_shape_accumulate_fills (shape, (SubPath *) path_array->data, path_array->len);
swfdec_shape_accumulate_lines (shape, (SubPath *) path_array->data, path_array->len);
for (i = 0; i < path_array->len; i++) {
@@ -927,13 +936,14 @@ swfdec_morph_shape_get_recs (SwfdecSwfDe
end_type = swfdec_shape_peek_type (end_bits);
if (end_type == SWFDEC_SHAPE_TYPE_CHANGE && start_type != SWFDEC_SHAPE_TYPE_CHANGE) {
SubPath *path;
- g_array_set_size (start_path_array, start_path_array->len + 1);
- path = &g_array_index (start_path_array, SubPath, start...
2011 Jun 10
6
[PATCH v2 0/6] btrfs: generic readeahead interface
This series introduces a generic readahead interface for btrfs trees.
The intention is to use it to speed up scrub in a first run, but balance
is another hot candidate. In general, every tree walk could be accompanied
by a readahead. Deletion of large files comes to mind, where the fetching
of the csums takes most of the time.
Also the initial build-ups of free-space-caches and
2011 Jun 29
14
[PATCH v4 0/6] btrfs: generic readeahead interface
This series introduces a generic readahead interface for btrfs trees.
The intention is to use it to speed up scrub in a first run, but balance
is another hot candidate. In general, every tree walk could be accompanied
by a readahead. Deletion of large files comes to mind, where the fetching
of the csums takes most of the time.
Also the initial build-ups of free-space-caches and