/external/harfbuzz_ng/src/ |
D | hb-ot-map.cc | 60 hb_ot_map_t::lookup_map_t *lookup = lookups[table_index].push (); in add_lookups() 115 for (unsigned int i = 0; i < lookups[table_index].len; i++) in collect_lookups() 116 hb_set_add (lookups_out, lookups[table_index][i].index); in collect_lookups() 276 if (last_num_lookups < m.lookups[table_index].len) in compile() 278 m.lookups[table_index].qsort (last_num_lookups, m.lookups[table_index].len); in compile() 281 for (unsigned int i = j + 1; i < m.lookups[table_index].len; i++) in compile() 282 if (m.lookups[table_index][i].index != m.lookups[table_index][j].index) in compile() 283 m.lookups[table_index][++j] = m.lookups[table_index][i]; in compile() 286 m.lookups[table_index][j].mask |= m.lookups[table_index][i].mask; in compile() 287 m.lookups[table_index][j].auto_zwj &= m.lookups[table_index][i].auto_zwj; in compile() [all …]
|
D | hb-ot-map-private.hh | 115 …tage < stages[table_index].len ? stages[table_index][stage].last_lookup : lookups[table_index].len; in get_stage_lookups() 116 *plookups = &lookups[table_index][start]; in get_stage_lookups() 120 HB_INTERNAL void collect_lookups (unsigned int table_index, hb_set_t *lookups) const; 131 lookups[table_index].finish (); in finish() 151 hb_prealloced_array_t<lookup_map_t, 32> lookups[2]; /* GSUB/GPOS */ member
|
D | hb-ot-shape-private.hh | 49 inline void collect_lookups (hb_tag_t table_tag, hb_set_t *lookups) const in collect_lookups() 57 map.collect_lookups (table_index, lookups); in collect_lookups()
|
D | hb-ot-shape.cc | 789 hb_set_t lookups; in hb_ot_shape_glyphs_closure() local 790 lookups.init (); in hb_ot_shape_glyphs_closure() 791 hb_ot_shape_plan_collect_lookups (shape_plan, HB_OT_TAG_GSUB, &lookups); in hb_ot_shape_glyphs_closure() 798 for (hb_codepoint_t lookup_index = -1; hb_set_next (&lookups, &lookup_index);) in hb_ot_shape_glyphs_closure()
|
D | hb-ot-layout.cc | 916 unsigned int lookup_index = lookups[table_index][i].index; in apply() 917 c.set_lookup_mask (lookups[table_index][i].mask); in apply() 918 c.set_auto_zwj (lookups[table_index][i].auto_zwj); in apply()
|
D | hb-ot-shape-complex-indic.cc | 487 &lookups, &count); in init() 495 …if (hb_ot_layout_lookup_would_substitute_fast (face, lookups[i].index, glyphs, glyphs_count, zero_… in would_substitute() 501 const hb_ot_map_t::lookup_map_t *lookups; member
|
/external/selinux/libselinux/utils/ |
D | avcstat.c | 30 unsigned long long lookups; member 185 &tmp.lookups, in main() 194 tot.lookups += tmp.lookups; in main() 208 tot.lookups, tot.hits, tot.misses, in main() 211 rel.lookups = tot.lookups - last.lookups; in main() 218 rel.lookups, rel.hits, rel.misses, in main()
|
/external/clang/include/clang/AST/ |
D | DeclLookups.h | 71 inline DeclContext::lookups_range DeclContext::lookups() const { in lookups() function 85 return lookups().begin(); in lookups_begin() 89 return lookups().end(); in lookups_end()
|
/external/deqp/doc/testspecs/GLES2/ |
D | performance.texture.format.txt | 36 Test cases measure performance of 2D and cubemap texture lookups without 38 more texture lookups, each targeting different texture unit. There are 41 Texture lookups use same coordinates and lookup results are multiplied
|
D | performance.compiler.txt | 33 - A number of texture lookups blended together in fragment shader
|
/external/strace/ |
D | quota.c | 208 u_int32_t lookups; member 220 u_int32_t lookups; member 441 tprintf("{lookups=%u, ", dq.lookups); in decode_cmd_data() 463 tprintf("{lookups=%u, ", dq.lookups); in decode_cmd_data()
|
/external/deqp/doc/testspecs/GLES3/ |
D | functional.fbo.invalidate.txt | 30 + Texture lookups from partially invalidated texture attachment
|
D | functional.texture.shadow.txt | 45 texture lookups.
|
/external/libvorbis/lib/ |
D | Makefile.am | 38 EXTRA_DIST = lookups.pl
|
/external/marisa-trie/ |
D | README | 16 … static and space efficient. Also, *marisa-trie* enables not only simple lookups but also prefix s…
|
/external/zlib/src/doc/ |
D | algorithm.txt | 108 will be two lookups. If you had a compression method with really long 109 symbols, you could have as many levels of lookups as is efficient. For 185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared 186 to one lookup for the single table, or 1.66 lookups per symbol for the
|
/external/jetty/src/config/etc/ |
D | jdbcRealm.properties | 16 # lookups in internal hash table. Set to 0 to disable caching.
|
/external/iptables/extensions/ |
D | libxt_CT.man | 24 Assign this packet to zone \fIid\fP and only have lookups done in that zone.
|
/external/mdnsresponder/mDNSPosix/ |
D | nss_ReadMe.txt | 12 hostname lookups using the Darwin mDNSResponder / mdnsd. This code has 28 This will cause dns lookups to be passed via mdnsd before trying the dns.
|
/external/fonttools/Lib/fontTools/ttLib/tables/ |
D | otTables.py | 548 lookups = ttf[overflowRecord.tableType].table.LookupList.Lookup 549 lookup = lookups[lookupIndex] 555 lookup = lookups[lookupIndex]
|
/external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/Post/ |
D | DepthOfField.frag | 49 // a full 5x5 (25-1 lookups) we'll skip every other one
|
/external/dnsmasq/contrib/openvpn/ |
D | README | 29 > DHCP requests to another server, and DNS lookups that work at all
|
/external/mesa3d/src/gallium/state_trackers/xa/ |
D | README | 72 lookups and test minor for compatibility before using such a function.
|
/external/llvm/docs/ |
D | SourceLevelDebugging.rst | 734 accelerator tables that are optimized for very quick lookups will benefit this 746 * Contain all of the names needed for typical lookups out of the box 754 The name lookups need to be fast and optimized for the kinds of lookups that 758 case of debuggers we optimized for lookups that fail most of the time. 1060 later and do very efficient name lookups with little or no parsing.
|
/external/dnsmasq/ |
D | FAQ | 109 in "man resolv.conf" for details on this topic. Testing lookups 444 do DNS lookups so that it can log the source of log messages, 445 these lookups will (depending on exact configuration) go through
|