Home
last modified time | relevance | path

Searched +full:block +full:- +full:end (Results 1 – 25 of 1187) sorted by relevance

12345678910>>...48

/third_party/skia/modules/skparagraph/src/
DOneLineShaper.cpp9 static inline SkUnichar nextUtf8Unit(const char** ptr, const char* end) { in nextUtf8Unit() argument
10 SkUnichar val = SkUTF::NextUTF8(ptr, end); in nextUtf8Unit()
19 fCurrentRun->commit(); in commitRunBuffer()
23 SkDebugf("Run [%zu:%zu)\n", fCurrentRun->fTextRange.start, fCurrentRun->fTextRange.end); in commitRunBuffer()
24 for (size_t i = 0; i < fCurrentRun->size(); ++i) { in commitRunBuffer()
25 …SkDebugf("[%zu] %hu %u %f\n", i, fCurrentRun->fGlyphs[i], fCurrentRun->fClusterIndexes[i], fCurren… in commitRunBuffer()
29 sortOutGlyphs([&](GlyphRange block){ in commitRunBuffer() argument
30 if (block.width() == 0) { in commitRunBuffer()
33 addUnresolvedWithRun(block); in commitRunBuffer()
38 // No unresolved blocks added - we resolved the block with one run entirely in commitRunBuffer()
[all …]
/third_party/ffmpeg/libavcodec/x86/
Dmpegvideoenc_template.c20 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
95 "pcmpgtw "b", "a" \n\t" /* block[i] <= 0 ? 0xFF : 0x00 */\
97 "psubw "a", "b" \n\t" /* ABS(block[i]) */
100 …"psubw "a", "b" \n\t" // out=((ABS(block[i])*qmat[0] - bias[0]*qmat[0])>>16)*sign(bloc…
104 int16_t *block, int n, in RENAME()
114 //s->fdct (block); in RENAME()
115 RENAME_FDCT(ff_fdct)(block); // cannot be anything else ... in RENAME()
117 if(s->dct_error_sum) in RENAME()
118 s->denoise_dct(s, block); in RENAME()
120 if (s->mb_intra) { in RENAME()
[all …]
/third_party/flutter/skia/resources/lua/
Dslides_utils.lua6 end
11 end
18 end
19 end
21 end
25 end
28 local leftover = s:match("^-*(.*)")
29 return string.len(s) - string.len(leftover)
30 end
36 end
[all …]
/third_party/skia/src/core/
DSkBlockAllocator.h4 * Use of this source code is governed by a BSD-style license that can be
24 * SkBlockAllocator provides low-level support for a block allocated arena with a dynamic tail that
25 * tracks space reservations within each block. Its APIs provide the ability to reserve space,
29 * wrapped by a higher-level allocator that uses the low-level APIs to implement a simpler,
30 * purpose-focused API w/o having to worry as much about byte-level concerns.
41 * 2. In-place new'd
44 * totalSize- sizeof(SkBlockAllocator));
51 // TODO(michaelludwig) - While API is different, this shares similarities to SkArenaAlloc and
55 // Largest size that can be requested from allocate(), chosen because it's the largest pow-2
60 kFixed, // Next block size = N
[all …]
DSkDeque.cpp4 * Use of this source code is governed by a BSD-style license that can be
11 struct SkDeque::Block { struct in SkDeque
12 Block* fNext; argument
13 Block* fPrev; argument
15 char* fEnd; // end of used section in this chunk
16 char* fStop; // end of the allocated chunk
46 if (storageSize >= sizeof(Block) + elemSize) { in SkDeque()
47 fFrontBlock = (Block*)storage; in SkDeque()
48 fFrontBlock->init(storageSize); in SkDeque()
57 Block* head = fFrontBlock; in ~SkDeque()
[all …]
/third_party/mesa3d/src/gallium/auxiliary/gallivm/
Dlp_bld_flow.c20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
43 * Insert a new block, right where builder is pointing to.
47 * each other and fall-throughs maximized.
61 /* get current basic block */ in lp_build_insert_new_block()
62 current_block = LLVMGetInsertBlock(gallivm->builder); in lp_build_insert_new_block()
64 /* check if there's another block after this one */ in lp_build_insert_new_block()
67 /* insert the new block before the next block */ in lp_build_insert_new_block()
68 new_block = LLVMInsertBasicBlockInContext(gallivm->context, next_block, name); in lp_build_insert_new_block()
71 /* append new block after current block */ in lp_build_insert_new_block()
73 new_block = LLVMAppendBasicBlockInContext(gallivm->context, function, name); in lp_build_insert_new_block()
[all …]
/third_party/zlib/examples/
Dgznorm.c1 /* gznorm.c -- normalize a gzip stream
76 // level of deflate blocks. This enables clearing the last-block bit, shifting
78 // which can end at an arbitrary bit boundary, and identifying stored blocks in
80 // is terminated with a 10-bit empty fixed block. If any members on the input
81 // end with a 10-bit empty fixed block, then that block is excised from the
84 // input. The pad bits after stored block headers and after the final deflate
85 // block are all forced to zeros.
98 enum { // BETWEEN -> HEAD -> BLOCK -> TAIL -> BETWEEN -> ... in gzip_normalize()
99 BETWEEN, // between gzip members (must end in this state) in gzip_normalize()
101 BLOCK, // reading deflate blocks in gzip_normalize() enumerator
[all …]
/third_party/mesa3d/src/freedreno/ir3/
Dir3_remove_unreachable.c27 * for blocks after an if where both sides end in a break/continue. These blocks
33 delete_block(struct ir3 *ir, struct ir3_block *block) in delete_block() argument
35 struct ir3_instruction *end = NULL; in delete_block() local
36 foreach_instr (instr, &block->instr_list) { in delete_block()
37 if (instr->opc == OPC_END) { in delete_block()
38 end = instr; in delete_block()
43 /* The end block can be legitimately unreachable if the shader only exits via in delete_block()
44 * discarding. ir3_legalize will then insert a branch to the end. Keep the in delete_block()
45 * block around but delete all the other instructions and make the end not in delete_block()
49 if (end) { in delete_block()
[all …]
/third_party/flutter/skia/src/core/
DSkDeque.cpp4 * Use of this source code is governed by a BSD-style license that can be
11 struct SkDeque::Block { struct in SkDeque
12 Block* fNext; argument
13 Block* fPrev; argument
15 char* fEnd; // end of used section in this chunk
16 char* fStop; // end of the allocated chunk
46 if (storageSize >= sizeof(Block) + elemSize) { in SkDeque()
47 fFrontBlock = (Block*)storage; in SkDeque()
48 fFrontBlock->init(storageSize); in SkDeque()
57 Block* head = fFrontBlock; in ~SkDeque()
[all …]
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
Dreflib.py3 # Copyright 2016-2022 The Khronos Group Inc.
5 # SPDX-License-Identifier: Apache-2.0
29 end = kwargs.pop('end','\n')
31 file.write(end)
62 - setDiag and setWarn are True if the corresponding handle is to be set.
63 - filename is None for no logging, '-' for stdout, or a pathname."""
69 if filename == '-':
72 fp = open(filename, 'w', encoding='utf-8')
81 end = kwargs.pop('end','\n')
84 file.write(end)
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DMachineBasicBlock.h1 //===- llvm/CodeGen/MachineBasicBlock.h -------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // Collect the sequence of machine instructions for a basic block.
11 //===----------------------------------------------------------------------===//
106 /// Alignment of the basic block. One if the basic block does not need to be
110 /// Indicate that this basic block is entered via an exception handler.
113 /// Indicate that this basic block is potentially the target of an indirect
117 /// Indicate that this basic block needs its symbol be emitted regardless of
118 /// whether the flow just falls-through to it.
[all …]
/third_party/jsframework/runtime/main/model/
DdomHelper.ts10 * http://www.apache.org/licenses/LICENSE-2.0
36 * @param {Vm} vm - Vm object.
37 * @param {string} type - Element type.
47 * @param {Vm} vm - Vm object.
48 * @param {string} type - Element type.
57 * Create and return a frag block for an element.
58 * @param {Vm} vm - Vm object.
59 * @param {Element} element - Element object.
60 * @return {FragBlockInterface} New block.
64 const end = createBlockEnd(vm); constant
[all …]
/third_party/PyYAML/examples/yaml-highlight/
Dyaml_hl.cfg2 ---
11 stream-start:
12 stream-end:
13 directive: { start: "\e[35m", end: "\e[0;1;30;40m" }
14 document-start: { start: "\e[35m", end: "\e[0;1;30;40m" }
15 document-end: { start: "\e[35m", end: "\e[0;1;30;40m" }
16 block-sequence-start:
17 block-mapping-start:
18 block-end:
19 flow-sequence-start: { start: "\e[33m", end: "\e[0;1;30;40m" }
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/
DWebAssemblyCFGStackify.cpp1 //===-- WebAssemblyCFGStackify.cpp - CFG Stackification -------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 /// This pass inserts BLOCK, LOOP, and TRY markers to mark the start of scopes,
17 /// WebAssembly, provided that all loops are single-entry.
22 //===----------------------------------------------------------------------===//
36 #define DEBUG_TYPE "wasm-cfg-stackify"
53 // For each block whose label represents the end of a scope, record the block
68 // For each BLOCK|LOOP|TRY, the corresponding END_(BLOCK|LOOP|TRY).
70 // For each END_(BLOCK|LOOP|TRY), the corresponding BLOCK|LOOP|TRY.
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
DBranchFolding.cpp1 //===- BranchFolding.cpp - Fold machine code branch instructions ----------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // directly to the target block. This pass often results in dead MBB's, which
17 //===----------------------------------------------------------------------===//
70 #define DEBUG_TYPE "branch-folder"
74 STATISTIC(NumTailMerge , "Number of block tails merged");
78 static cl::opt<cl::boolOrDefault> FlagEnableTailMerge("enable-tail-merge",
83 TailMergeThreshold("tail-merge-threshold",
90 TailMergeSize("tail-merge-size",
[all …]
/third_party/mesa3d/src/compiler/nir/
Dnir_control_flow.c34 * graph up-to-date. The invariants respected are:
37 * 2. Each if-statement and loop must have one basic block before it and one
40 * 4. If a basic block has a jump instruction, there must be only one and it
41 * must be at the end of the block.
49 block_add_pred(nir_block *block, nir_block *pred) in block_add_pred() argument
51 _mesa_set_add(block->predecessors, pred); in block_add_pred()
55 block_remove_pred(nir_block *block, nir_block *pred) in block_remove_pred() argument
57 struct set_entry *entry = _mesa_set_search(block->predecessors, pred); in block_remove_pred()
61 _mesa_set_remove(block->predecessors, entry); in block_remove_pred()
67 pred->successors[0] = succ1; in link_blocks()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ExecutionEngine/JITLink/
DJITLink.h1 //===------------ JITLink.h - JIT linker functionality ----------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
9 // Contains generic JIT-linker types.
11 //===----------------------------------------------------------------------===//
75 void setOffset(OffsetT Offset) { this->Offset = Offset; } in setOffset()
77 void setKind(Kind K) { this->K = K; } in setKind()
81 return K - FirstRelocation; in getRelocation()
85 void setTarget(Symbol &Target) { this->Target = &Target; } in setTarget()
87 void setAddend(AddendT Addend) { this->Addend = Addend; } in setAddend()
[all …]
/third_party/mesa3d/src/panfrost/bifrost/valhall/
Dva_merge_flow.c36 * 4. Reconverge must be on the last instruction of the block.
37 * 5. End must be on the last instruction of the block.
39 * For simplicity, this pass only merges within a single basic block. This
42 * Because reconverge/end must be on the last instruction, there may be only
43 * one of these in a block. First check for a NOP at the end, and if it has
44 * reconverge/end flow control, merge with the penultimate instruction. Now we
60 * remove discards only if they are at the end of the last block and cannot be
62 * instruction has incompatible flow control (wait and end). In practice, this
64 * NOP, but BLEND is a no-op for helper threads anyway.
72 * If the last instruction has reconverge or end, try to merge with the
[all …]
/third_party/mesa3d/src/intel/compiler/
Dbrw_fs_live_variables.cpp40 * choose to expose per-component live intervals for VGRFs of size > 1,
44 * However, we internally track use/def information at the per-GRF level for
46 * (possibly non-adjacent) instructions. In this case, examining a single
63 end[var] = MAX2(end[var], ip); in setup_one_read()
65 /* The use[] bitset marks when the block makes use of a variable (VGRF in setup_one_read()
67 * block. in setup_one_read()
69 if (!BITSET_TEST(bd->def, var)) in setup_one_read()
70 BITSET_SET(bd->use, var); in setup_one_read()
81 end[var] = MAX2(end[var], ip); in setup_one_write()
83 /* The def[] bitset marks when an initialization in a block completely in setup_one_write()
[all …]
/third_party/vk-gl-cts/external/vulkan-docs/src/config/
Dmathtest.adoc1 // Copyright 2015-2022 The Khronos Group Inc.
3 // SPDX-License-Identifier: Apache-2.0
13 === latexmath block 1
17 f = { c \over { 2^b - 1 } }
20 === latexmath block 2
24 f = \max\left( {c \over {2^{b-1} - 1}}, -1.0 \right)
39 === latexmath block 3
43 s = {1 \over 2} + { \left( x_p - x_f \right) \over \text{size} }
48 t = {1 \over 2} + { \left( y_p - y_f \right) \over \text{size} }
51 === latexmath block 4
[all …]
Dmathtest.txt1 // Copyright 2015-2021 The Khronos Group Inc.
3 // SPDX-License-Identifier: Apache-2.0
13 === latexmath block 1
17 f = { c \over { 2^b - 1 } }
20 === latexmath block 2
24 f = \max\left( {c \over {2^{b-1} - 1}}, -1.0 \right)
39 === latexmath block 3
43 s = {1 \over 2} + { \left( x_p - x_f \right) \over \text{size} }
48 t = {1 \over 2} + { \left( y_p - y_f \right) \over \text{size} }
51 === latexmath block 4
[all …]
/third_party/PyYAML/lib/yaml/
Dparser.py5 # stream ::= STREAM-START implicit_document? explicit_document* STREAM-END
6 # implicit_document ::= block_node DOCUMENT-END*
7 # explicit_document ::= DIRECTIVE* DOCUMENT-START block_node? DOCUMENT-END*
24 # block_sequence ::= BLOCK-SEQUENCE-START (BLOCK-ENTRY block_node?)* BLOCK-END
25 # indentless_sequence ::= (BLOCK-ENTRY block_node?)+
26 # block_mapping ::= BLOCK-MAPPING_START
29 # BLOCK-END
30 # flow_sequence ::= FLOW-SEQUENCE-START
31 # (flow_sequence_entry FLOW-ENTRY)*
33 # FLOW-SEQUENCE-END
[all …]
/third_party/skia/third_party/externals/spirv-cross/
Dspirv_cfg.cpp2 * Copyright 2016-2021 Arm Limited
3 * SPDX-License-Identifier: Apache-2.0 OR MIT
9 * http://www.apache.org/licenses/LICENSE-2.0
20 * 1. The Apache License, Version 2.0, found at <http://www.apache.org/licenses/LICENSE-2.0>, or
55 // Traverse the post-order in reverse and build up the immediate dominator tree. in build_immediate_dominators()
59 for (auto i = post_order.size(); i; i--) in build_immediate_dominators()
61 uint32_t block = post_order[i - 1]; in build_immediate_dominators() local
62 auto &pred = preceding_edges[block]; in build_immediate_dominators()
63 if (pred.empty()) // This is for the entry block, but we've already set up the dominators. in build_immediate_dominators()
68 if (immediate_dominators[block]) in build_immediate_dominators()
[all …]
/third_party/mesa3d/src/amd/compiler/
Daco_spill.cpp52 * Implements the spilling algorithm on SSA-form from
53 * "Register Spilling and Live-Range Splitting for SSA-Form Programs"
74 std::stack<Block*, std::vector<Block*>> loop_header;
92 register_demand(std::move(register_demand_)), renames(program->blocks.size()), in spill_ctx()
93 spills_entry(program->blocks.size()), spills_exit(program->blocks.size()), in spill_ctx()
94 processed(program->blocks.size(), false), wave_size(program->wave_size), in spill_ctx()
119 affinities[found_first].insert(affinities[found_first].end(), in add_affinity()
121 affinities[found_second].end()); in add_affinity()
152 if (idx_a == -1) in get_dominator()
154 if (idx_b == -1) in get_dominator()
[all …]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Ddominator_tree.h7 // http://www.apache.org/licenses/LICENSE-2.0
37 dfs_num_pre_(-1),
38 dfs_num_post_(-1) {}
51 iterator end() { return children_.end(); } in end() function
53 const_iterator end() const { return cend(); } in end() function
55 const_iterator cend() const { return children_.end(); } in cend()
67 post_iterator post_end() { return post_iterator::end(nullptr); } in post_end()
74 return const_post_iterator::end(nullptr); in post_cend()
77 inline uint32_t id() const { return bb_->id(); } in id()
111 // Traverse the dominator tree in a depth first pre-order.
[all …]

12345678910>>...48