lp:~reviczky/texlive/+git/harfbuzz

Owned by Adam Reviczky
Get this repository:
git clone https://git.qastaging.paddev.net/~reviczky/texlive/+git/harfbuzz

Import details

Import Status: Suspended

This repository is an import of the Git repository at https://github.com/harfbuzz/harfbuzz.git.

Last successful import was .

Import started on juju-eb11dc-stg-qa-launchpad-codeimport-0 and finished taking 5 seconds — see the log
Import started on juju-eb11dc-stg-qa-launchpad-codeimport-0 and finished taking 10 seconds — see the log
Import started on juju-eb11dc-stg-qa-launchpad-codeimport-0 and finished taking 5 minutes
Import started on juju-eb11dc-stg-qa-launchpad-codeimport-0 and finished taking 10 seconds — see the log

Branches

Name Last Modified Last Commit
main 2023-11-15 21:55:11 UTC
Merge pull request #4473 from googlefonts/help

Author: BehdadEsfahbod
Author Date: 2023-11-15 21:55:11 UTC

Merge pull request #4473 from googlefonts/help

[instancer] add the option to leave blanks in the min:def:max syntax.

speedup-sanitize-chainrule 2023-11-15 21:18:57 UTC
[ChainRule] Speed up sanitize

Author: BehdadEsfahbod
Author Date: 2023-11-15 21:00:52 UTC

[ChainRule] Speed up sanitize

Limit backtrack-len and lookahead-len to HB_MAX_CONTEXT_LENGTH.
Add a max_size for the struct, and bail early if max_size is
within sanitize range.

Speeds up Gulzar sanitization by over 20%.

For consistency, put the same limit on backtrack/lookahead of
ReverseChainContextSubstFormat1.

next_range2 2023-11-14 01:35:04 UTC
[set] Speed up next_range()

Author: BehdadEsfahbod
Author Date: 2023-11-11 02:10:51 UTC

[set] Speed up next_range()

sanitize-barrier 2023-11-04 00:04:40 UTC
[sanitize] Yet another hack to "fix" barrier issue

Author: BehdadEsfahbod
Author Date: 2023-11-03 23:51:50 UTC

[sanitize] Yet another hack to "fix" barrier issue

PaintLocation 2023-08-22 23:10:06 UTC
WIP [COLR] Add PaintLocation

Author: BehdadEsfahbod
Author Date: 2023-08-22 22:59:27 UTC

WIP [COLR] Add PaintLocation

Doesn't work...

msvc-bug 2023-08-07 17:27:29 UTC
Revert "Fix bot"

Author: BehdadEsfahbod
Author Date: 2023-08-07 17:27:29 UTC

Revert "Fix bot"

This reverts commit 483d4a8741890ac72fa22d167ed53d4e39e9bd1d.

colrv2 2023-08-06 02:10:07 UTC
[COLRv2] Implement PaintGlyphDelta

Author: BehdadEsfahbod
Author Date: 2023-08-06 02:10:07 UTC

[COLRv2] Implement PaintGlyphDelta

colr-paint-template 2023-08-04 22:53:00 UTC
Revert "[COLR] Make template arguments sharable"

Author: BehdadEsfahbod
Author Date: 2023-08-04 22:53:00 UTC

Revert "[COLR] Make template arguments sharable"

This reverts commit 7e1c71cfb9ea6d63932af7d8b6af298be7fa6bcd.

Discarding idea. Didn't save any.

monster-fonts 2023-07-27 21:50:39 UTC
[benchmark] Switch -font and -shape to monster-fonts submodule

Author: BehdadEsfahbod
Author Date: 2023-07-27 21:47:43 UTC

[benchmark] Switch -font and -shape to monster-fonts submodule

hb-ot-aat 2023-06-06 13:08:39 UTC
[shape] Add “ot” and “aat” shapers

Author: Khaled Hosny
Author Date: 2023-06-06 13:08:39 UTC

[shape] Add “ot” and “aat” shapers

They currently fail if relevant tables are missing, but don’t actually
enforce the relevant shaping model.

retaingid-glyf-speedup 2023-06-02 02:55:39 UTC
[subset/glyf] Use a hashmap instead of vector for SubsetGlyph

Author: BehdadEsfahbod
Author Date: 2023-06-02 02:52:36 UTC

[subset/glyf] Use a hashmap instead of vector for SubsetGlyph

Doens't seem to provide any speedup though.

map-is-used-bitmap 2023-06-01 19:28:54 UTC
[map] Keep one byte of the hash in a separate array

Author: BehdadEsfahbod
Author Date: 2023-06-01 19:28:54 UTC

[map] Keep one byte of the hash in a separate array

Still no speedup. Just for the record.

simd 2023-05-04 18:47:18 UTC
Merge branch 'main' into simd

Author: BehdadEsfahbod
Author Date: 2023-05-04 18:24:13 UTC

Merge branch 'main' into simd

simd-neon 2023-05-04 17:58:39 UTC
[layout] Use NEON SIMD instructions for apply_forward()

Author: BehdadEsfahbod
Author Date: 2023-05-04 17:58:39 UTC

[layout] Use NEON SIMD instructions for apply_forward()

To skip four glyphs at a time.

Unfortunately slows down benchmark-shape by up to 25% for Amiri, instead of
speeding anything up. This is due to the overhead of switching back and forth
between the ARM and NEON processors.

To be experimented with: Same architecture but with AVX on x86_64 to skip 8
glyphs at a time.

https://github.com/harfbuzz/harfbuzz/issues/566

simd-avx 2023-05-04 17:55:46 UTC
[layout] Use AVX2 SIMD instructions for apply_forward()

Author: BehdadEsfahbod
Author Date: 2022-06-15 22:08:28 UTC

[layout] Use AVX2 SIMD instructions for apply_forward()

To skip eight glyphs at a time.

Like the NEON instructions, this slows down shaping by up to 35%,
for Amiri.

https://github.com/harfbuzz/harfbuzz/issues/566

gi-cairo 2023-03-17 11:42:46 UTC
[cairo] Add some GI annotations

Author: BehdadEsfahbod
Author Date: 2023-03-09 21:27:25 UTC

[cairo] Add some GI annotations

coverage-cache2 2023-01-30 23:48:29 UTC
[coverage] Add a static cache

Author: BehdadEsfahbod
Author Date: 2023-01-30 19:19:17 UTC

[coverage] Add a static cache

Speeds up Roboto by around 5%; costs 2kb globally.

list-table-versions 2023-01-16 02:47:50 UTC
hb-shape: Print table version where relevant

Author: Matthias Clasen
Author Date: 2023-01-16 02:47:50 UTC

hb-shape: Print table version where relevant

When listing tables with --list-tables, show
the version for CPAL and COLR tables.

language-get-scripts 2023-01-02 23:11:21 UTC
Add hb_language_get_scripts

Author: Matthias Clasen
Author Date: 2023-01-02 22:48:06 UTC

Add hb_language_get_scripts

This is a copy of the Pango implementation, minus caching.

Tests included.

wip/face-collection 2022-12-29 03:24:45 UTC
Some tweaks

Author: Matthias Clasen
Author Date: 2022-12-29 03:24:45 UTC

Some tweaks

patch_mode 2022-10-17 20:14:02 UTC
[subset] only preprocess in benchmark when experimental api is enabled.

Author: Garret Rieger
Author Date: 2022-10-17 20:14:02 UTC

[subset] only preprocess in benchmark when experimental api is enabled.

pairpos-nextglyph 2022-09-21 18:22:41 UTC
[gpos] in PairPos, always advance next-glyph by one only

Author: BehdadEsfahbod
Author Date: 2022-09-21 18:22:41 UTC

[gpos] in PairPos, always advance next-glyph by one only

This goes against the spec.

https://github.com/harfbuzz/harfbuzz/issues/3824

extension_promotion 2022-07-25 21:55:03 UTC
[repacker] for ext promotion choose lookups from highest subtables per byte t...

Author: Garret Rieger
Author Date: 2022-07-25 21:55:03 UTC

[repacker] for ext promotion choose lookups from highest subtables per byte to lowest.

Attempts to roughly maximize the number of subtables that are non-ext.

inplace 2022-06-08 12:17:27 UTC
[inplace] Adjust

Author: BehdadEsfahbod
Author Date: 2022-06-08 12:17:27 UTC

[inplace] Adjust

extension-dispatch 2021-02-12 21:13:11 UTC
WIP

Author: BehdadEsfahbod
Author Date: 2021-02-12 21:13:11 UTC

WIP

run-tests-stream 2018-01-10 12:59:36 UTC
[WIP][test] Speed up test runner

Author: BehdadEsfahbod
Author Date: 2018-01-10 12:59:36 UTC

[WIP][test] Speed up test runner

Keep one hb-shape process open and stream text to it.

accelerate-lookups 2013-05-02 19:39:16 UTC
[OTLayout] Accelerate lookups by batching

Author: BehdadEsfahbod
Author Date: 2013-04-30 01:16:15 UTC

[OTLayout] Accelerate lookups by batching

If we need to apply many many lookups, we can fasten that up by applying
them in batches. For each batch we keep the union of the coverage of
the lookups participating. We can then skip glyph ranges that do NOT
participate in any lookup in the batch. The batch partition is
determined optimally by a mathematical probability model on the glyphs
and a dynamic-program to optimize the partition.

The net effect is 30% speedup on Amiri. the downside is more memory
consuption as each batch will keep an hb_set_t of its coverage.

I'm not yet convinced that the tradeoff is worth pursuing. I'm trying
to find out ways to optimized this more, with less memory overhead.

This work also ignores the number of subtables per lookup. That may
prove to be very important for the performance numbers from here on.

127 of 27 results
This repository contains Public information 
Everyone can see this information.

Subscribers