Searched refs:depth (Results 1 - 25 of 440) sorted by relevance

1234567891011>>

/openbsd-current/regress/usr.bin/tsort/
H A Dbuild-tree6 # This does build tree of a given depth and breadth, to check on tsort's
9 $depth=shift;
16 my $depth = shift;
23 build_tree($root.$leaf, $depth-1) if $depth > 0;
28 build_tree('a', $depth) if $depth > 0;
/openbsd-current/sys/dev/pci/drm/
H A Ddrm_fourcc.c36 * @depth: bit depth per pixel
38 * Computes a drm fourcc pixel format code for the given @bpp/@depth values.
41 uint32_t drm_mode_legacy_fb_format(uint32_t bpp, uint32_t depth) argument
47 if (depth == 1)
52 if (depth == 2)
57 if (depth == 4)
62 if (depth == 8)
67 switch (depth) {
80 if (depth
119 drm_driver_legacy_fb_format(struct drm_device *dev, uint32_t bpp, uint32_t depth) argument
[all...]
/openbsd-current/gnu/llvm/llvm/tools/llvm-c-test/
H A Dcalc.c45 int depth = 0; local
58 if (depth < 2) {
63 stack[depth - 2] = LLVMBuildBinOp(builder, op_to_opcode(tok),
64 stack[depth - 1], stack[depth - 2], "");
65 depth--;
72 if (depth < 1) {
78 off = LLVMBuildGEP2(builder, ty, param, &stack[depth - 1], 1, "");
79 stack[depth - 1] = LLVMBuildLoad2(builder, ty, off, "");
92 if (depth >
[all...]
/openbsd-current/sys/arch/sparc64/stand/ofwboot/
H A Ddiskprobe.c126 int node, child, stack[10], depth; local
132 depth = 0;
136 node = stack[depth];
139 if (--depth < 0)
142 stack[depth] = OF_peer(stack[depth]);
157 if (child != 0 && child != -1 && depth < 9)
158 stack[++depth] = child;
160 stack[depth] = OF_peer(stack[depth]);
[all...]
/openbsd-current/gnu/gcc/gcc/
H A Dtree-loop-linear.c120 int dist = DDR_DIST_VECT (ddr, j)[loop->depth - first_loop->depth];
169 unsigned int depth,
195 loop_i->depth < loop_j->depth;
225 loop_i->depth - first_loop->depth,
226 loop_j->depth - first_loop->depth);
229 if (!lambda_transform_legal_p (trans, depth, dependence_relation
168 try_interchange_loops(lambda_trans_matrix trans, unsigned int depth, VEC (ddr_p, heap) *dependence_relations, VEC (data_reference_p, heap) *datarefs, struct loop *first_loop) argument
251 unsigned int depth = 0; local
303 lambda_matrix_id (LTM_MATRIX (trans), depth); local
[all...]
H A Det-forest.c49 int depth; /* The depth of the node is the sum of depth member in struct:et_occ
51 int min; /* The minimum value of the depth in the subtree
52 is obtained by adding sum of depth fields
55 depth. */
61 /* Changes depth of OCC to D. */
69 occ->min += d - occ->depth;
70 occ->depth = d;
73 /* Adds D to the depth o
204 record_path_before_1(struct et_occ *occ, int depth) argument
255 check_path_after_1(struct et_occ *occ, int depth) argument
[all...]
H A Dlambda-code.c55 iteration space can be represented by a vector of size <loop depth>. You can
174 int depth; local
179 depth = LTM_ROWSIZE (transform);
181 temp = lambda_body_vector_new (depth);
184 lambda_vector_matrix_mult (LBV_COEFFICIENTS (vect), depth, local
185 LTM_MATRIX (transform), depth, local
203 int depth, int invariants)
213 for (i = 0; i < depth; i++)
274 depth/number of coefficients is given by DEPTH, the number of invariants is
281 int depth, in
202 lle_equal(lambda_linear_expression lle1, lambda_linear_expression lle2, int depth, int invariants) argument
279 print_lambda_linear_expression(FILE * outfile, lambda_linear_expression expr, int depth, int invariants, char start) argument
298 print_lambda_loop(FILE * outfile, lambda_loop loop, int depth, int invariants, char start) argument
329 lambda_loopnest_new(int depth, int invariants) argument
361 lambda_lattice_new(int depth, int invariants) argument
384 int depth, invariants; local
479 compute_nest_using_fourier_motzkin(int size, int depth, int invariants, lambda_matrix A, lambda_matrix B, lambda_vector a) argument
635 int depth, invariants, size; local
751 invertedtrans, depth); local
778 int depth, invariants; local
792 lambda_matrix_copy (LTM_MATRIX (H), H1, depth, depth); local
845 depth, inverse, depth, local
848 LLE_COEFFICIENTS (target_expr), depth, local
902 depth, inverse, depth, local
905 LLE_COEFFICIENTS (target_expr), depth, local
1029 int depth, invariants; local
1060 LTM_MATRIX (trans1), depth, depth, depth); local
1065 lambda_matrix_hermite (LTM_MATRIX (trans1), depth, LTM_MATRIX (H), local
1081 lambda_matrix_vector_mult (LTM_MATRIX (trans), depth, depth, local
1084 origin_invariants, depth, depth, invariants); local
1114 gcc_tree_to_linear_expression(int depth, tree expr, VEC(tree,heap) *outerinductionvars, VEC(tree,heap) *invariants, int extra) argument
1174 size_t depth = 0; local
1210 gcc_loop_to_lambda_loop(struct loop *loop, int depth, VEC(tree,heap) ** invariants, tree * ourinductionvar, VEC(tree,heap) * outerinductionvars, VEC(tree,heap) ** lboundvars, VEC(tree,heap) ** uboundvars, VEC(int,heap) ** steps) argument
1467 int depth = depth_of_nest (loop_nest); local
1815 size_t depth = 0; local
1860 lambda_vector_zerop (LLE_COEFFICIENTS (offset), depth)); local
[all...]
/openbsd-current/gnu/llvm/compiler-rt/lib/dfsan/
H A Ddfsan_origin.h74 int depth = prev.isChainedOrigin() ? prev.depth() : -1; local
75 // depth is the length of the chain minus 1.
76 // origin_history_size of 0 means unlimited depth.
78 ++depth;
79 if (depth >= flags().origin_history_size || depth > kMaxDepth)
101 return Origin((depth << kDepthShift) | chained_id);
116 int depth() const { function in class:__dfsan::Origin
/openbsd-current/usr.bin/file/
H A Dmagic-dump.c26 magic_dump_line(struct magic_line *ml, u_int depth) argument
32 for (i = 0; i < depth; i++)
46 magic_dump_line(child, depth + 1);
/openbsd-current/sys/arch/sh/sh/
H A Ddb_trace.c161 int depth, prdepth, fpdepth; local
163 depth = 0;
177 prdepth = depth;
178 depth++;
182 fpdepth = depth;
183 depth++;
187 depth++;
198 depth += -n/4;
213 depth += (r3 / 4);
228 printf("depth
[all...]
/openbsd-current/gnu/gcc/gcc/config/i386/
H A Dgthr-win32.c190 mutex->depth = 0;
201 mutex->depth = 1;
207 ++(mutex->depth);
211 mutex->depth = 1;
230 mutex->depth = 1;
234 ++(mutex->depth);
244 --(mutex->depth);
245 if (mutex->depth == 0)
/openbsd-current/sys/dev/pci/drm/amd/display/dc/inc/hw/
H A Dvmid.h45 enum dcn_hubbub_page_table_depth depth; member in struct:dcn_vmid_page_table_config
/openbsd-current/gnu/usr.bin/perl/cpan/Test-Simple/lib/Test/Tester/
H A DCaptureRunner.pm39 next if defined $res->{depth};
40 my $depth = $res->{_depth} - $res->{_level} - $start - 3;
41 # print "my $depth = $res->{_depth} - $res->{_level} - $start - 1\n";
42 $res->{depth} = $depth;
/openbsd-current/gnu/llvm/compiler-rt/lib/msan/
H A Dmsan_origin.h51 // The "zzz" bits of chained origin id are used to store the length (or depth)
110 int depth = prev.isChainedOrigin() ? prev.depth() : 0; local
111 // depth is the length of the chain minus 1.
112 // origin_history_size of 0 means unlimited depth.
114 if (depth + 1 >= flags()->origin_history_size) {
117 ++depth;
118 CHECK(depth < (1 << kDepthBits));
137 return Origin((1 << kHeapShift) | (depth << kDepthShift) | chained_id);
157 int depth() cons function
[all...]
/openbsd-current/sys/dev/pci/drm/apple/
H A Diomfb.c89 return (ch->depth != 0);
96 * depth. This rule frees the caller from tracking the call context manually.
100 u8 depth = oob ? dcp->ch_oobcmd.depth : dcp->ch_cmd.depth; local
102 if (depth)
131 static u16 dcp_packet_start(struct dcp_channel *ch, u8 depth) argument
133 if (depth > 0)
134 return ch->end[depth - 1];
139 /* Pushes and pops the depth o
140 dcp_push_depth(u8 *depth) argument
148 dcp_pop_depth(u8 *depth) argument
174 u8 depth = dcp_push_depth(&ch->depth); local
265 u8 depth; local
[all...]
/openbsd-current/gnu/llvm/clang/bindings/python/examples/cindex/
H A Dcindex-dump.py38 def get_info(node, depth=0):
39 if opts.maxDepth is not None and depth >= opts.maxDepth:
42 children = [get_info(c, depth+1)
67 parser.add_option("", "--max-depth", dest="maxDepth",
68 help="Limit cursor expansion to depth N",
/openbsd-current/gnu/llvm/lld/Common/
H A DTimer.cpp56 void Timer::print(int depth, double totalDuration, bool recurse) const { argument
61 std::string s = std::string(depth * 2, ' ') + name + std::string(":");
69 child->print(depth + 1, totalDuration);
/openbsd-current/sys/dev/pci/drm/amd/display/amdgpu_dm/
H A Ddc_fpu.c70 int *pcpu, depth = 0; local
73 depth = *pcpu;
76 ASSERT(depth >= 1);
/openbsd-current/usr.bin/mg/
H A Dmatch.c71 int c, i, depth; local
91 /* init nesting depth */
92 depth = 0;
113 if (depth == 0) {
117 depth--;
121 depth++;
/openbsd-current/usr.sbin/eeprom/
H A Doptree.c36 op_print(struct opiocdesc *opio, int depth) argument
43 printf("%*s%s: ", depth * 4, " ", opio->op_name);
111 op_nodes(int fd, int node, int depth) argument
127 printf("\n%*s", depth * 4, " ");
158 op_print(&opio, depth + 1);
165 op_nodes(fd, opio.op_nodeid, depth + 1);
172 op_nodes(fd, opio.op_nodeid, depth);
/openbsd-current/gnu/llvm/lldb/source/Breakpoint/
H A DBreakpointResolverScripted.cpp30 lldb::SearchDepth depth, const StructuredDataImpl &args_data)
32 m_class_name(std::string(class_name)), m_depth(depth), m_args(args_data) {
74 // The Python function will actually provide the search depth, this is a
76 lldb::SearchDepth depth = lldb::eSearchDepthTarget; local
83 return new BreakpointResolverScripted(bkpt, class_name, depth,
123 lldb::SearchDepth depth = lldb::eSearchDepthModule; local
126 depth = interp->ScriptedBreakpointResolverSearchDepth(
129 return depth;
28 BreakpointResolverScripted( const BreakpointSP &bkpt, const llvm::StringRef class_name, lldb::SearchDepth depth, const StructuredDataImpl &args_data) argument
/openbsd-current/lib/libssl/
H A Dbs_ber.c48 unsigned int depth)
52 if (depth > kMaxDepth)
75 depth + 1))
122 char looking_for_eoc, unsigned int depth)
124 if (depth > kMaxDepth)
204 1 /* looking for eoc */, depth + 1))
227 0 /* not looking for eoc */, depth + 1))
47 cbs_find_indefinite(const CBS *orig_in, char *indefinite_found, unsigned int depth) argument
121 cbs_convert_indefinite(CBS *in, CBB *out, char squash_header, char looking_for_eoc, unsigned int depth) argument
/openbsd-current/lib/libcrypto/bytestring/
H A Dbs_ber.c48 unsigned int depth)
52 if (depth > kMaxDepth)
75 depth + 1))
122 char looking_for_eoc, unsigned int depth)
124 if (depth > kMaxDepth)
204 1 /* looking for eoc */, depth + 1))
227 0 /* not looking for eoc */, depth + 1))
47 cbs_find_indefinite(const CBS *orig_in, char *indefinite_found, unsigned int depth) argument
121 cbs_convert_indefinite(CBS *in, CBB *out, char squash_header, char looking_for_eoc, unsigned int depth) argument
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Dgenextract.c191 int depth = strlen (path);
225 newpath = (char *) xmalloc (depth + 2);
227 newpath[depth + 1] = 0;
231 newpath[depth] = (code == MATCH_OP_DUP ? '0' : 'a') + i;
241 newpath = (char *) xmalloc (depth + 2);
243 newpath[depth + 1] = 0;
247 newpath[depth] = '0' + i;
257 newpath = (char *) xmalloc (depth + 2);
259 newpath[depth + 1] = 0;
263 newpath[depth]
190 int depth = strlen (path); local
[all...]
/openbsd-current/lib/libcurses/base/
H A Dresizeterm.c177 int depth = 0; local
188 depth = 1 + child_depth(tst);
193 return depth;
202 int depth = 0; local
207 ++depth;
211 return depth;
226 T((T_CALLED("adjust_window(%p,%d,%d)%s depth %d/%d currently %ldx%ld at %ld,%ld"),
285 int depth = 0; local
293 TR(TRACE_UPDATE, ("decreasing size of windows to %dx%d, depth=%d",
294 ToLines, ToCols, depth));
320 int depth = 0; local
[all...]

Completed in 331 milliseconds

1234567891011>>