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

1234567891011>>

/freebsd-11-stable/sys/sys/
H A D_stack.h35 int depth; member in struct:stack
H A Dstack.h51 #define CTRSTACK(m, st, depth, cheap) do { \
53 stack_ktr((m), __FILE__, __LINE__, st, depth, cheap); \
56 #define CTRSTACK(m, st, depth, cheap)
/freebsd-11-stable/contrib/subversion/subversion/svn/
H A Drevert-cmd.c65 if (opt_state->depth == svn_depth_unknown)
66 opt_state->depth = svn_depth_empty;
72 err = svn_client_revert4(targets, opt_state->depth,
80 && (! SVN_DEPTH_IS_RECURSIVE(opt_state->depth)))
83 (err, _("Try 'svn revert --depth infinity' instead?"));
H A Dcommit-cmd.c50 reduced-depth commits of copied directories. */
55 svn_depth_t depth;
71 commit depth is less-than-infinite, and we've not already warned
75 && (b->depth < svn_depth_infinity)
82 _("svn: The depth of this commit is '%s', "
85 svn_depth_to_word(b->depth));
140 if (opt_state->depth == svn_depth_unknown)
141 opt_state->depth = svn_depth_infinity;
160 effectively always done with infinite depth. This is a potential
162 part by restricting the commit's depth
53 svn_depth_t depth; member in struct:copy_warning_notify_baton
[all...]
H A Dchangelist-cmd.c48 svn_depth_t depth = opt_state->depth;
78 if (depth == svn_depth_unknown)
79 depth = svn_depth_empty;
87 depth, opt_state->changelists,
97 svn_client_remove_from_changelists(targets, depth,
47 svn_depth_t depth = opt_state->depth; local
/freebsd-11-stable/sys/kern/
H A Dsubr_stack.c72 if (st->depth < STACK_MAX) {
73 st->pcs[st->depth++] = pc;
100 KASSERT(st->depth <= STACK_MAX, ("bogus stack"));
101 for (i = 0; i < st->depth; i++) {
116 KASSERT(st->depth <= STACK_MAX, ("bogus stack"));
117 for (i = 0; i < st->depth; i++) {
136 KASSERT(st->depth <= STACK_MAX, ("bogus stack"));
137 for (i = 0; i < st->depth; i++) {
152 KASSERT(st->depth <= STACK_MAX, ("bogus stack"));
153 for (i = 0; i < st->depth;
204 stack_ktr(u_int mask, const char *file, int line, const struct stack *st, u_int depth, int cheap) argument
[all...]
/freebsd-11-stable/contrib/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...]
/freebsd-11-stable/contrib/dtc/libfdt/
H A Dfdt.c162 int fdt_next_node(const void *fdt, int offset, int *depth) argument
181 if (depth)
182 (*depth)++;
186 if (depth && ((--(*depth)) < 0))
192 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
204 int depth = 0; local
206 offset = fdt_next_node(fdt, offset, &depth);
207 if (offset < 0 || depth != 1)
215 int depth local
[all...]
/freebsd-11-stable/sys/contrib/libfdt/
H A Dfdt.c165 int fdt_next_node(const void *fdt, int offset, int *depth) argument
184 if (depth)
185 (*depth)++;
189 if (depth && ((--(*depth)) < 0))
195 || ((nextoffset == -FDT_ERR_TRUNCATED) && !depth))
207 int depth = 0; local
209 offset = fdt_next_node(fdt, offset, &depth);
210 if (offset < 0 || depth != 1)
218 int depth local
[all...]
/freebsd-11-stable/contrib/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)
/freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/ustack/
H A DMakefile11 tst.depth.ksh \
/freebsd-11-stable/contrib/groff/src/utils/addftinfo/
H A Dguess.h38 int depth; member in struct:char_metric
/freebsd-11-stable/tools/tools/net80211/wlanstats/
H A DMakefile13 CFLAGS.clang+= -fbracket-depth=512
/freebsd-11-stable/contrib/xz/src/liblzma/lzma/
H A Dlzma_encoder_presets.c43 options->depth = depths[level];
48 options->depth = 0;
56 options->depth = 0;
59 options->depth = 512;
/freebsd-11-stable/contrib/llvm-project/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...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_client/
H A Dcheckout.c55 svn_depth_t depth,
59 if (depth == svn_depth_unknown)
60 depth = svn_depth_infinity;
65 pathrev->rev, depth, pool));
77 svn_depth_t depth,
149 SVN_ERR(initialize_area(local_abspath, pathrev, depth, ctx,
162 SVN_ERR(initialize_area(local_abspath, pathrev, depth, ctx,
192 local_abspath, &resolved_rev, depth,
208 svn_depth_t depth,
222 peg_revision, revision, depth,
51 initialize_area(const char *local_abspath, const svn_client__pathrev_t *pathrev, svn_depth_t depth, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
69 svn_client__checkout_internal(svn_revnum_t *result_rev, svn_boolean_t *timestamp_sleep, const char *url, const char *local_abspath, const svn_opt_revision_t *peg_revision, const svn_opt_revision_t *revision, svn_depth_t depth, svn_boolean_t ignore_externals, svn_boolean_t allow_unver_obstructions, svn_ra_session_t *ra_session, svn_client_ctx_t *ctx, apr_pool_t *scratch_pool) argument
201 svn_client_checkout3(svn_revnum_t *result_rev, const char *URL, const char *path, const svn_opt_revision_t *peg_revision, const svn_opt_revision_t *revision, svn_depth_t depth, svn_boolean_t ignore_externals, svn_boolean_t allow_unver_obstructions, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
[all...]
H A Dlayout.c47 svn_depth_t depth; member in struct:layout_item_t
70 svn_depth_t depth,
95 it->depth = depth;
123 expected_depth = depth;
124 else if (it->ancestor->depth == svn_depth_infinity)
139 (depth != expected_depth),
140 it->depth,
149 svn_depth_t depth,
175 it->depth
67 layout_set_path(void *report_baton, const char *path, svn_revnum_t revision, svn_depth_t depth, svn_boolean_t start_empty, const char *lock_token, apr_pool_t *pool) argument
145 layout_link_path(void *report_baton, const char *path, const char *url, svn_revnum_t revision, svn_depth_t depth, svn_boolean_t start_empty, const char *lock_token, apr_pool_t *pool) argument
[all...]
H A Dchangelist.c49 svn_depth_t depth,
79 depth, changelists,
92 svn_depth_t depth,
118 depth, changelists,
132 svn_depth_t depth,
142 SVN_ERR(svn_wc_get_changelists(ctx->wc_ctx, local_abspath, depth, changelists,
45 svn_client_add_to_changelist(const apr_array_header_t *paths, const char *changelist, svn_depth_t depth, const apr_array_header_t *changelists, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
89 svn_client_remove_from_changelists(const apr_array_header_t *paths, svn_depth_t depth, const apr_array_header_t *changelists, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
128 svn_client_get_changelists(const char *path, const apr_array_header_t *changelists, svn_depth_t depth, svn_changelist_receiver_t callback_func, void *callback_baton, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
/freebsd-11-stable/contrib/libdivsufsort/lib/
H A Dsssort.c143 saidx_t depth) {
146 for(U1 = T + depth + *p1,
147 U2 = T + depth + *p2,
168 saidx_t *first, saidx_t *last, saidx_t depth) {
174 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) {
292 saidx_t *first, saidx_t *last, saidx_t depth) {
296 for(; (++a < b) && ((PA[*a] + depth) >= (PA[*a + 1] + 1));) { *a = ~*a; }
297 for(; (a < --b) && ((PA[*b] + depth) < (PA[*b + 1] + 1));) { }
312 saidx_t depth) {
326 if(1 < (last - first)) { ss_insertionsort(T, PA, first, last, depth); }
141 ss_compare(const sauchar_t *T, const saidx_t *p1, const saidx_t *p2, saidx_t depth) argument
167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument
291 ss_partition(const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument
310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument
502 ss_inplacemerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t depth) argument
545 ss_mergeforward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument
595 ss_mergebackward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument
654 ss_swapmerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth) argument
747 sssort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth, saidx_t n, saint_t lastsuffix) argument
[all...]
/freebsd-11-stable/contrib/subversion/subversion/svnbench/
H A Dnull-info-cmd.c59 DEPTH is the depth starting at DIR, even though RECEIVER is never
71 svn_depth_t depth,
97 if (depth >= svn_depth_immediates
98 || (depth == svn_depth_files && the_ent->kind == svn_node_file))
101 if (depth == svn_depth_infinity && the_ent->kind == svn_node_dir)
103 counter, depth, ctx, subpool));
116 svn_depth_t depth,
131 if (depth == svn_depth_unknown)
132 depth = svn_depth_empty;
171 if (depth > svn_depth_empt
65 push_dir_info(svn_ra_session_t *ra_session, const svn_client__pathrev_t *pathrev, const char *dir, int *counter, svn_depth_t depth, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
111 client_info(const char *abspath_or_url, const svn_opt_revision_t *peg_revision, const svn_opt_revision_t *revision, svn_depth_t depth, svn_boolean_t fetch_excluded, svn_boolean_t fetch_actual_only, const apr_array_header_t *changelists, int *counter, svn_client_ctx_t *ctx, apr_pool_t *pool) argument
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_ra/
H A Ddebug_reporter.c47 svn_depth_t depth,
54 path, revision, svn_depth_to_word(depth),
57 revision, depth,
79 svn_depth_t depth,
87 path, url, revision, svn_depth_to_word(depth),
90 revision, depth, start_empty,
42 set_path(void *report_baton, const char *path, svn_revnum_t revision, svn_depth_t depth, svn_boolean_t start_empty, const char *lock_token, apr_pool_t *pool) argument
73 link_path(void *report_baton, const char *path, const char *url, svn_revnum_t revision, svn_depth_t depth, svn_boolean_t start_empty, const char *lock_token, apr_pool_t *pool) argument
/freebsd-11-stable/sbin/hastd/
H A Dtoken.l43 int depth;
83 \{ { DP; depth++; return OB; }
84 \} { DP; depth--; return CB; }
/freebsd-11-stable/contrib/subversion/subversion/include/private/
H A Dsvn_log.h116 svn_log__checkout(const char *path, svn_revnum_t rev, svn_depth_t depth,
125 svn_log__update(const char *path, svn_revnum_t rev, svn_depth_t depth,
136 svn_depth_t depth, apr_pool_t *pool);
144 svn_log__status(const char *path, svn_revnum_t rev, svn_depth_t depth,
155 svn_depth_t depth, svn_boolean_t ignore_ancestry,
264 apr_array_header_t *patterns, svn_depth_t depth,

Completed in 315 milliseconds

1234567891011>>