Searched refs:it (Results 276 - 300 of 686) sorted by relevance

<<11121314151617181920>>

/freebsd-11-stable/contrib/ntp/sntp/ag-tpl/
H A DMdoc.pm82 Parse a line from the C<INPUT> filehandle. If a macro was detected it returns a
83 list (MACRO_NAME, @MACRO_ARGS), otherwise it calls the C<OUTPUT_CODE>, giving
84 caller a chance to modify line before printing it. If C<PREPROCESS_CODE> is
85 defined it calls it prior to passing argument to a macro, giving caller a
101 This is like perl's map only it calls BLOCK only on elements which are not
106 Turn spacing on or off. If called without argument it returns the current state.
143 preceeding that element is put behind it.
/freebsd-11-stable/contrib/libucl/src/
H A Ducl_emitter.c299 ucl_hash_iter_t it = NULL; local
319 while ((cur = ucl_hash_iterate (obj->value.ov, &it))) {
510 ucl_object_iter_t it; local
552 it = NULL;
554 while ((cur = ucl_object_iterate (obj, &it, true)) != NULL) {
571 it = NULL;
573 while ((cur = ucl_object_iterate (obj, &it, true)) != NULL) {
/freebsd-11-stable/contrib/bmake/mk/
H A Dmeta.autodep.mk6 # This file is provided in the hope that it will
24 # it would be nice to be able to query .SUFFIXES
48 # it is a bad idea to update anything
98 # if it isn't supposed to be touched by us the Makefile should have
163 # it would be nice to be able to get .SUFFIXES as ${.SUFFIXES}
247 # it is left as an exercise for the reader to work out what this does
288 # these make it easy to gather some stats
H A Dautodep.mk7 # This file is provided in the hope that it will
35 # it does nothing if SRCS is not defined or is empty
66 # actually it ignores <> so may not be a great idea
H A Dgendirdeps.mk154 # so we need to give it what it expects
155 # and tell it not to add machine qualifiers
166 # if we are using a split-fs sandbox, it gets a little messier.
248 # We have do a double test with dirdep_list as it _may_ contain
304 # if this is going to exist it would be there by now
/freebsd-11-stable/share/mk/
H A Dmeta.autodep.mk7 # This file is provided in the hope that it will
25 # it would be nice to be able to query .SUFFIXES
49 # it is a bad idea to update anything
99 # if it isn't supposed to be touched by us the Makefile should have
164 # it would be nice to be able to get .SUFFIXES as ${.SUFFIXES}
248 # it is left as an exercise for the reader to work out what this does
289 # these make it easy to gather some stats
H A Dbsd.dep.mk26 # dependencies, ${SRCS} are always part of it.
89 # since it will track dependencies itself. OBJS_DEPEND_GUESS is still used.
212 # If using filemon then _EXTRADEPEND is skipped since it is not needed.
223 # For meta+filemon the .meta file is checked for since it is the dependency
255 # need for manually running it. The dirdeps build should only do this in
270 # ignored if using meta+filemon since it handles all dependencies. The other
324 # Ignore -Wl,--start-group/-Wl,--end-group as it might be required in the
H A Dgendirdeps.mk152 # so we need to give it what it expects
153 # and tell it not to add machine qualifiers
164 # if we are using a split-fs sandbox, it gets a little messier.
246 # We have do a double test with dirdep_list as it _may_ contain
300 # if this is going to exist it would be there by now
/freebsd-11-stable/share/examples/drivers/
H A Dmake_device_driver.sh2 # This writes a skeleton driver and puts it into the kernel tree for you.
8 # More interestingly, it creates a modules/foo directory
9 # which it populates, to allow you to compile a FOO module
42 echo -n "Should it be overwritten? [Y]"
143 * hopefully it will make it's way into the handbook.
300 * the parent bus so that it looks as if the devices were detected by
318 * The ISA PNP system will have automatically added it to the system and
324 * driver is linked in. So even as a module it MAY still be there.
337 * Maybe it wa
[all...]
/freebsd-11-stable/contrib/bmake/unit-tests/
H A Descape.mk13 # line, or a line immediately preceding an include line, it shall
20 # the next line shall not be included if it is a <tab>.
37 # of the value, and treats the newline as though it was not escaped.
189 # The "#" in "# second line without space" makes it a comment instead
191 # The ":" in "third line':" makes it look like the start of a
/freebsd-11-stable/sys/dev/firewire/
H A Dfwohci.c665 sc->fc.it[i] = &sc->it[i].xferq;
667 sc->it[i].xferq.dmach = i;
669 sc->it[i].ndb = 0;
803 fwohci_db_free(&sc->it[i]);
1305 fwohci_db_free(&sc->it[dmach]);
1306 sc->it[dmach].xferq.flag &= ~FWXFERQ_RUNNING;
1349 if (&sc->it[dmach] == dbch) {
1509 struct fw_xferq *it; local
1511 dbch = &sc->it[dmac
2140 struct fw_xferq *it; local
2559 struct fw_xferq *it; local
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Frontend/
H A DFrontendAction.cpp160 for (FrontendPluginRegistry::iterator it = FrontendPluginRegistry::begin(),
162 it != ie; ++it) {
163 if (it->getName() == Arg)
183 // or after it (in AfterConsumers)
186 for (FrontendPluginRegistry::iterator it = FrontendPluginRegistry::begin(),
188 it != ie; ++it) {
189 std::unique_ptr<PluginASTAction> P = it->instantiate();
196 if (it
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsAsmPrinter.cpp86 it = MipsFI->StubsNeeded.begin();
87 it != MipsFI->StubsNeeded.end(); ++it) {
88 const char *Symbol = it->first;
89 const Mips16HardFloatInfo::FuncSignature *Signature = it->second;
203 // If we just ended a constant pool, mark it as such.
219 // If this is the first entry of the pool, mark it.
348 // If it's a floating point register, set the FPU Bitmask.
349 // If it's a general purpose register, set the CPU Bitmask.
484 // implementation, so it i
[all...]
/freebsd-11-stable/sys/contrib/ipfilter/netinet/
H A Dfil.c440 /* per-protocol analyzer if it exists. In validating the packet, a protocol*/
613 /* big enough for it to be in, checking if it is repeated and setting a */
663 * the presence of this extension header as it has no impact on the
664 * end result until after it has been defragmented.
843 * is), as it could be behind destination options (amongst others) so
1021 /* is 32bits as well, it is not possible(?) to determine the version from a */
1115 /* Since fr_pullup() expects the total length of bytes to be pulled up, it */
1164 /* 4 header. That is, it must not be a fragment that has its offset set to */
1165 /* start within the layer 4 header (hdrmin) or if it i
7582 ipftoken_t *it; local
7610 ipftoken_t *it, *next; local
7642 ipftoken_t *it; local
7699 ipftoken_t *it, *new; local
7916 ipfruleiter_t it; local
8062 ipfruleiter_t it; local
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/UnwindAssembly/x86/
H A Dx86AssemblyInspectionEngine.cpp129 for (MachineRegnumToNameAndLLDBRegnum::iterator it = m_reg_map.begin();
130 it != m_reg_map.end(); ++it) {
131 const RegisterInfo *ri = reg_ctx->GetRegisterInfoByName(it->second.name);
133 it->second.lldb_regnum = ri->kinds[eRegisterKindLLDB];
234 for (MachineRegnumToNameAndLLDBRegnum::iterator it = m_reg_map.begin();
235 it != m_reg_map.end(); ++it) {
237 if (::strcmp(reg_info[i].name, it->second.name) == 0) {
238 it
907 MachineRegnumToNameAndLLDBRegnum::iterator it = m_reg_map.find(machine_regno); local
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/
H A DCompactUnwindInfo.cpp322 // don't trust anything from this compact_unwind section if it looks
329 // level page info until it's needed
517 std::vector<UnwindIndex>::const_iterator it; local
518 it = std::lower_bound(m_indexes.begin(), m_indexes.end(), key);
519 if (it == m_indexes.end()) {
523 if (it->function_offset != key.function_offset) {
524 if (it != m_indexes.begin())
525 --it;
528 if (it->sentinal_entry) {
532 auto next_it = it
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DExprEngineC.cpp25 /// (offset) if it is unknown so that memory arithmetic always
53 for (ExplodedNodeSet::iterator it=CheckedSet.begin(), ei=CheckedSet.end();
54 it != ei; ++it) {
56 ProgramStateRef state = (*it)->getState();
57 const LocationContext *LCtx = (*it)->getLocationContext();
74 evalStore(Tmp2, B, LHS, *it, state->BindExpr(B, LCtx, ExprVal),
80 StmtNodeBuilder Bldr(*it, Tmp2, *currBldrCtx);
109 Bldr.generateNode(B, *it, state);
134 evalLoad(Tmp, B, LHS, *it, stat
[all...]
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Ddarwin-tramp.asm6 * This file is free software; you can redistribute it and/or modify it
19 * This file is distributed in the hope that it will be useful, but
H A Dtramp.asm6 * This file is free software; you can redistribute it and/or modify it
19 * This file is distributed in the hope that it will be useful, but
/freebsd-11-stable/contrib/gcc/config/sparc/
H A Dsol2-c1.asm6 ! This file is free software; you can redistribute it and/or modify it
19 ! This file is distributed in the hope that it will be useful, but
/freebsd-11-stable/sys/dev/mlx5/mlx5_core/
H A Dmlx5_fs_tree.c137 /* Make sure we only read it once while we go up the tree */
694 struct fs_base *it; local
701 fs_for_each_ns_or_ft_reverse(it, prio) {
702 if (it->type == FS_TYPE_NAMESPACE) {
705 fs_get_obj(ns, it);
718 fs_get_obj(ft, it);
1201 struct fs_base *it = container_of(start, struct fs_base, list); local
1206 fs_for_each_ns_or_ft_continue_reverse(it, prio) {
1210 if (it->type == FS_TYPE_FLOW_TABLE) {
1211 fs_get_obj(ft, it);
1302 struct fs_base *it = container_of(start, struct fs_base, list); local
2234 struct fs_base *it; local
2568 struct fs_base *it; local
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/UnwindAssembly/InstEmulation/
H A DUnwindAssemblyInstEmulation.cpp63 // CreateFunctionEntryUnwind should have created the first row. If it
91 // Initialize the CFA with a known value. In the 32 bit case it will be
115 // Make a copy of the current instruction Row and save it in m_curr_row
153 auto it = saved_unwind_states.upper_bound(current_offset); local
154 assert(it != saved_unwind_states.begin() &&
156 --it; // Move it to the row corresponding to the current offset
163 if (it->second.first->GetOffset() != m_curr_row->GetOffset()) {
165 *newrow = *it->second.first;
167 m_register_values = it
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h152 /// We may create a new instruction, so remember it because it
396 /// tie breaker, if it's set.
555 std::map<SUnit *, int>::const_iterator it = InstrToCycle.find(SU); local
556 if (it == InstrToCycle.end())
558 return (it->second - FirstCycle) / InitiationInterval;
564 std::map<SUnit *, int>::const_iterator it = InstrToCycle.find(SU); local
565 assert(it != InstrToCycle.end() && "Instruction hasn't been scheduled.");
566 return (it->second - FirstCycle) % InitiationInterval;
/freebsd-11-stable/contrib/opie/
H A Dconfigure8 # gives unlimited permission to copy, distribute and modify it.
86 # If the previous option needs an argument, assign it.
431 # 3 some systems may open it to /dev/tty
475 # AIX cpp loses on an empty file, so make sure it contains at least a newline.
678 # Extract the first word of "gcc", so it can be a program name with args.
708 # Extract the first word of "cc", so it can be a program name with args.
734 # We found a bogon in the path, so make sure we never use it.
739 # However, it has the same basename, so the bogon will be chosen
759 # Extract the first word of "cl", so it can be a program name with args.
1001 # Extract the first word of "ranlib", so it ca
[all...]
/freebsd-11-stable/crypto/openssl/crypto/pkcs12/
H A Dpkcs12.h177 PKCS12_SAFEBAG *PKCS12_item_pack_safebag(void *obj, const ASN1_ITEM *it,
217 void *PKCS12_item_decrypt_d2i(X509_ALGOR *algor, const ASN1_ITEM *it,
221 const ASN1_ITEM *it,

Completed in 538 milliseconds

<<11121314151617181920>>