Home
last modified time | relevance | path

Searched full:it (Results 1 – 25 of 9522) sorted by relevance

12345678910>>...381

/openbsd-src/gnu/usr.bin/binutils/gdb/doc/
H A Drefcard.tex13 %This program is free software; you can redistribute it and/or modify
14 %it under the terms of the GNU General Public License as published by
18 %This program is distributed in the hope that it will be useful, but
46 % All other values will be computed at process time so it should be
214 \font\it=cmti7
247 gdb {\it program} \opt{{\it core}}&debug {\it program} \opt{using
248 coredump {\it core}}\cr
249 b \opt{\it file\tt:}{\it function}&set breakpoint at {\it function} \opt{in \it file}\cr
250 run \opt{{\it arglist}}&start your program \opt{with {\it arglist}}\cr
252 p {\it expr}&display the value of an expression\cr
[all …]
/openbsd-src/usr.bin/ctfconv/
H A Dparse.c21 * DWARF to IT (internal type) representation parser.
141 struct itype *it; in dwarf_parse() local
180 RB_FOREACH(it, itype_tree, &itypet[CTF_K_INTEGER]) { in dwarf_parse()
181 if (it_name(it) == NULL || it->it_size != (8 * sizeof(long))) in dwarf_parse()
184 if (strcmp(it_name(it), "unsigned") == 0) { in dwarf_parse()
185 long_tidx = it->it_idx; in dwarf_parse()
195 struct itype *it; in it_new() local
200 pool_init(&it_pool, "it", 512, sizeof(struct itype)); in it_new()
209 it = pmalloc(&it_pool, sizeof(*it)); in it_new()
210 SIMPLEQ_INIT(&it->it_refs); in it_new()
[all …]
H A Dctfconv.c92 struct itype *it; in main() local
122 /* Either dump the sections, or write it out. */ in main()
159 TAILQ_FOREACH(it, &iobjq, it_symb) in main()
160 dump_obj(it, &oidx); in main()
163 TAILQ_FOREACH(it, &ifuncq, it_symb) in main()
164 dump_func(it, &fidx); in main()
167 TAILQ_FOREACH(it, &itypeq, it_next) { in main()
168 if (it->it_flags & (ITF_FUNC|ITF_OBJ)) in main()
171 dump_type(it); in main()
312 struct itype *it; in find_symb() local
[all …]
/openbsd-src/regress/usr.bin/dc/
H A Dt3.out2 take one down, pass it around,
5 take one down, pass it around,
8 take one down, pass it around,
11 take one down, pass it around,
14 take one down, pass it around,
17 take one down, pass it around,
20 take one down, pass it around,
23 take one down, pass it around,
26 take one down, pass it around,
29 take one down, pass it around,
[all …]
/openbsd-src/lib/libcrypto/asn1/
H A Dtasn_new.c69 static int asn1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
70 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
72 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
75 ASN1_item_new(const ASN1_ITEM *it) in ASN1_item_new() argument
78 if (ASN1_item_ex_new(&ret, it) > 0) in ASN1_item_new()
87 ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_new() argument
89 return asn1_item_ex_new(pval, it); in ASN1_item_ex_new()
94 asn1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) in asn1_item_ex_new() argument
98 const ASN1_AUX *aux = it->funcs; in asn1_item_ex_new()
108 switch (it->itype) { in asn1_item_ex_new()
[all …]
H A Dtasn_fre.c67 static void asn1_item_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
72 ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) in ASN1_item_free() argument
74 asn1_item_free(&val, it); in ASN1_item_free()
79 ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) in ASN1_item_ex_free() argument
81 asn1_item_free(pval, it); in ASN1_item_ex_free()
86 asn1_item_free(ASN1_VALUE **pval, const ASN1_ITEM *it) in asn1_item_free() argument
90 const ASN1_AUX *aux = it->funcs; in asn1_item_free()
97 if (it->itype != ASN1_ITYPE_PRIMITIVE && *pval == NULL) in asn1_item_free()
103 switch (it->itype) { in asn1_item_free()
105 if (it in asn1_item_free()
190 ASN1_primitive_free(ASN1_VALUE ** pval,const ASN1_ITEM * it) ASN1_primitive_free() argument
[all...]
/openbsd-src/sys/dev/pci/drm/apple/
H A Dparser.c229 static int iterator_begin(struct dcp_parse_ctx *handle, struct iterator *it, in iterator_begin() argument
235 *it = (struct iterator) { in iterator_begin()
240 tag = parse_tag_of_type(it->handle, type); in iterator_begin()
244 it->len = tag->size; in iterator_begin()
248 #define dcp_parse_foreach_in_array(handle, it) \ argument
249 for (iterator_begin(handle, &it, false); it.idx < it.len; ++it.idx)
250 #define dcp_parse_foreach_in_dict(handle, it) \ argument
251 for (iterator_begin(handle, &it, true); it.idx < it.len; ++it.idx)
275 struct iterator it; in parse_dimension() local
278 dcp_parse_foreach_in_dict(handle, it) { in parse_dimension()
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/pat_trie_/
H A Derase_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
156 for (typename internal_node::iterator it = in clear_imp() local
158 it != static_cast<internal_node_pointer>(p_nd)->end(); in clear_imp()
159 ++it) in clear_imp()
161 node_pointer p_child =* it; in clear_imp()
176 erase(const_iterator it) in erase() argument
180 if (it == end()) in erase()
[all …]
H A Ddebug_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
77 for (const_iterator it = begin(); it != end(); ++it) in assert_iterators() local
80 map_debug_base::check_key_exists(PB_DS_V2F(*it)); in assert_iterators()
81 _GLIBCXX_DEBUG_ASSERT(lower_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
82 _GLIBCXX_DEBUG_ASSERT(--upper_bound(PB_DS_V2F(*it)) == it); in assert_iterators()
93 for (const_reverse_iterator it = rbegin(); it != rend(); ++it) in assert_reverse_iterators() local
97 const_cast<PB_DS_CLASS_C_DEC* >(this)->find_imp(PB_DS_V2F(*it)); in assert_reverse_iterators()
[all …]
/openbsd-src/regress/lib/libc/sys/
H A Dt_getitimer.c63 struct itimerval it; in ATF_TC_BODY() local
70 (void)memset(&it, 0, sizeof(struct itimerval)); in ATF_TC_BODY()
72 ATF_REQUIRE(getitimer(ITIMER_REAL, &it) == 0); in ATF_TC_BODY()
74 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
77 ATF_REQUIRE(getitimer(ITIMER_VIRTUAL, &it) == 0); in ATF_TC_BODY()
79 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
82 ATF_REQUIRE(getitimer(ITIMER_PROF, &it) == 0); in ATF_TC_BODY()
84 if (it.it_value.tv_sec != 0 || it.it_value.tv_usec != 0) in ATF_TC_BODY()
90 atf_tc_fail("getitimer(2) modfied the timer before it was armed"); in ATF_TC_BODY()
101 struct itimerval it; in ATF_TC_BODY() local
[all …]
/openbsd-src/gnu/llvm/clang/docs/analyzer/developer-docs/
H A DInitializerLists.rst7 It touches problems of modelling C++ standard library constructs in general,
29 The standard does hint that it should be possible to implement
35 Or, at least, it should be possible to explain to the analyzer that the list
36 somehow "takes hold" of the values put into it. Initializer lists can also be
47 So this sounds good, however apparently it does nothing to address our false
49 guessing that the metadata symbol attached to it, together with its contents,
50 should also escape. In fact, it's impossible to trigger a pointer escape from
56 triggering escapes when binding list elements to the list. However, it'd be as
67 turns out to be reachable. This requires no work on checker side, but it sounds
73 to escape. This puts a stress on the checkers, but with a smart data map it
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DAddressRanges.cpp20 auto It = llvm::upper_bound(Ranges, Range); in insert() local
21 auto It2 = It; in insert()
24 if (It != It2) { in insert()
26 It = Ranges.erase(It, It2); in insert()
28 if (It != Ranges.begin() && Range.start() <= std::prev(It)->end()) { in insert()
29 --It; in insert()
30 *It = {It->start(), std::max(It->end(), Range.end())}; in insert()
31 return It; in insert()
34 return Ranges.insert(It, Range); in insert()
39 auto It = std::partition_point( in find() local
[all …]
/openbsd-src/lib/libssl/
H A Dbytestring.h31 * like TLS and ASN.1 from it.
45 * CBS_init sets |cbs| to point to |data|. It does not take ownership of
51 * CBS_skip advances |cbs| by |len| bytes. It returns one on success and zero
74 * free. It returns one on success and zero on allocation failure. On
83 * with free. It returns one on success and zero on failure. On success,
91 * if it is at most |dst_len| bytes. If |copied| is not NULL, it will be set
92 * to the amount copied. It returns one on success and zero otherwise.
105 * starting at |data|. If they're equal, it returns one, otherwise zero. If the
106 * lengths match, it use
[all...]
/openbsd-src/lib/libcrypto/bytestring/
H A Dbytestring.h31 * like TLS and ASN.1 from it.
45 * CBS_init sets |cbs| to point to |data|. It does not take ownership of
51 * CBS_skip advances |cbs| by |len| bytes. It returns one on success and zero
74 * free. It returns one on success and zero on allocation failure. On
83 * with free. It returns one on success and zero on failure. On success,
91 * if it is at most |dst_len| bytes. If |copied| is not NULL, it will be set
92 * to the amount copied. It returns one on success and zero otherwise.
105 * starting at |data|. If they're equal, it returns one, otherwise zero. If the
106 * lengths match, it use
[all...]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/splay_tree_/
H A Derase_fn_imps.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
52 point_iterator it = find(r_key); in erase() local
53 if (it == base_type::end()) in erase()
55 erase(it); in erase()
62 erase(iterator it) in erase() argument
65 if (it == base_type::end()) in erase()
66 return it; in erase()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/modules/Formatter/
H A DTAP.t40 my $it = $CLASS->new(
44 return ($it, \$std, \$err);
66 ok($layers->{utf8}, "'S' is set in PERL_UNICODE, or in -C, honor it, utf8 should be on");
96 my ($it, $out, $err) = grabber();
99 ok(!$it->print_optimal_pass($fail, 1), "Not gonna print a non-pass");
102 ok(!$it->print_optimal_pass($fail, 1), "Not gonna print a non-pass");
106 ok(!$it->print_optimal_pass($pass, 1), "Not gonna print amnesty");
109 ok(!$it->print_optimal_pass($pass, 1), "Not gonna print todo (even empty todo)");
112 ok(!$it->print_optimal_pass($pass, 1), "Not gonna pritn a name with a hash");
115 ok(!$it->print_optimal_pass($pass, 1), "Not gonna pritn a name with a newline");
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/testsuite/27_io/
H A Dostream_inserter_other.cc7 // software; you can redistribute it and/or modify it under the
12 // This library is distributed in the hope that it will be useful,
156 test_buffer_1(const std::string& s) : str(s), it(str.begin()) { } in test_buffer_1()
159 virtual int underflow() { return (it != str.end() ? *it : EOF); } in underflow()
160 virtual int uflow() { return (it != str.end() ? *it++ : EOF); } in uflow()
164 std::string::const_iterator it; member in test_buffer_1
171 test_buffer_2(const std::string& s) : str(s), it(str.begin()) { } in test_buffer_2()
174 virtual int underflow() { return (it != str.end() ? *it : EOF); } in underflow()
175 virtual int uflow() { return (it != str.end() ? *it++ : EOF); } in uflow()
176 virtual std::streamsize showmanyc() { return std::distance(it, str.end()); } in showmanyc()
[all …]
/openbsd-src/gnu/usr.bin/perl/pod/
H A Dperlgpl.pod13 Perl is free software; you can redistribute it and/or modify
14 it under the terms of either:
23 It's here so that modules, programs, etc., that want to declare
24 this as their distribution license can link to it.
31 # it, we haven't gone thru and prettied it up with =item's or
32 # anything. It's good enough the way it is.
43 of this license document, but changing it is not allowed.
52 software and to any other program whose authors commit to using it.
53 You can use it for your programs, too.
58 software, that you receive source code or can get it if you want it,
[all …]
/openbsd-src/gnu/llvm/llvm/docs/tutorial/MyFirstLanguageFrontend/
H A DLangImpl10.rst16 It is interesting to see how far we've come, and how little code it has
22 Our little language supports a couple of interesting features: it
23 supports user defined binary and unary operators, it uses JIT
24 compilation for immediate evaluation, and it supports a few control flow
27 Part of the idea of this tutorial was to show you how easy and fun it
30 the basics, I strongly encourage you to take the code and hack on it.
36 Fortunately, our current setup makes it very easy to add global
38 variable is in the global variable symbol table before rejecting it.
53 works: it is so nifty/unconventional, it `has its own
56 arbitrary external functions, and we use it for things like "printd"
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/
H A Dmap_debug_base.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
182 key_set_iterator it = find(r_key); in erase_existing()
183 if (it == m_key_set.end()) in erase_existing()
188 m_key_set.erase(it); in erase_existing()
262 for (iterator_type it = m_key_set.begin(); it != m_key_set.end(); ++it) in find() local
263 if (m_eq(*it, r_key)) in find()
264 return it; in find()
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/
H A Dorder_statistics_imp.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
52 node_iterator it = node_begin(); in find_by_order() local
56 while (it != end_it) in find_by_order()
58 node_iterator l_it = it.get_l_child(); in find_by_order()
65 return (*it); in find_by_order()
67 it = l_it; in find_by_order()
72 it = it.get_r_child(); in find_by_order()
[all …]
/openbsd-src/games/fortune/datfiles/
H A Dfortunes16 1.79 x 10^12 furlongs per fortnight -- it's not just a good idea, it's
23 Take one down, short it to ground
28 Take one down, short it to ground
34 which time it will be worth absolutely nothing.
55 It isn't just a good idea, it's the law!
96 You patch a bug, and dump it again:
101 You patch a bug, and dump it again:
111 traveled if it had not hit the tree and play the ball from there,
116 placed in the fairway at a point equal to the distance it carried or
134 and wants it back the minute it begins to rain.
[all …]
/openbsd-src/gnu/gcc/gcc/doc/
H A Dcppinternals.info35 The GNU C preprocessor is implemented as a library, "cpplib", so it can
37 integrated with the C, C++ and Objective-C front ends. It is also
42 The library has been written to be re-entrant, so that it can be used
43 to preprocess many files simultaneously if necessary. It has also been
49 some of the tricky issues. It is intended that, along with the
80 it.
83 the bare minimum necessary, and then to keep it there. This makes clear
98 The lexer is contained in the file `lex.c'. It is a hand-coded lexer,
99 and not implemented as a state machine. It can understand C, C++ and
103 them as they are encountered in a single pass of the input file. It
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/
H A Dov_tree_map_.hpp6 // software; you can redistribute it and/or modify it under the terms
11 // This library is distributed in the hope that it will be useful, but
24 // file, or you compile this file and link it with other files to
39 // purpose. It is provided "as is" without express or implied
220 template<typename It>
222 copy_from_range(It, It);
244 point_iterator it = lower_bound(r_key); in operator []()
245 if (it != end() && !Cmp_Fn::operator()(r_key, PB_DS_V2F(*it))) in operator []()
249 return it->second; in operator []()
253 return (insert_new_val(it, std::make_pair(r_key, mapped_type()))->second); in operator []()
[all …]
/openbsd-src/gnu/llvm/libcxx/docs/DesignDocs/
H A DFileTimeType.rst40 the time points and duration it provides. It will look like this:
73 initial implementation of ``file_time_type`` did; it's also what
74 ``std::system_clock`` does. As a result, it can represent time points about
86 of file time stamps shouldn't exceed +/- 300 years, so should we care to support it?
89 providing glorified C++ wrappers for it. If the underlying API supports
94 implementation to report ``value_too_large`` errors when it encounters a time
95 point that it can't represent. This can cause the call to ``last_write_time``
129 // It seems reasonable to assume this call should succeed.
143 I limit my consideration of the point to this: Why was it not good enough for
144 the underlying system interfaces? If it wasn't good enough for them, then it
[all …]

12345678910>>...381