Searched refs:edge (Results 1 - 25 of 45) sorted by relevance

12

/freebsd-current/contrib/unbound/edns-subnet/
H A Daddrtree.c46 * Create a new edge
47 * @param node: Child node this edge will connect to.
48 * @param addr: full key to this edge.
59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); local
60 if (!edge)
62 edge->node = node;
63 edge->len = addrlen;
64 edge->parent_index = parent_index;
65 edge
366 struct addredge *edge; local
482 struct addredge *edge = NULL; local
[all...]
H A Daddrtree.h103 struct addredge *edge[2]; member in struct:addrnode
104 /** edge between this node and parent */
117 /** child node this edge is connected to */
121 /** Index of this edge in parent_node */
/freebsd-current/contrib/ldns/
H A Dradix.c212 prefix->array[0].edge = add;
268 prefix->array[byte].edge = add;
269 } else if (prefix->array[byte-prefix->offset].edge == NULL) {
291 prefix->array[byte].edge = add;
368 node = node->array[byte].edge;
417 if (!node->array[byte].edge) {
436 node->array[byte].edge);
439 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge);
441 *result = ldns_radix_prev(node->array[byte].edge);
450 node->array[byte].edge);
[all...]
/freebsd-current/sys/modules/dtb/rockchip/
H A DMakefile9 rockchip/rk3399-khadas-edge-captain.dts \
10 rockchip/rk3399-khadas-edge.dts \
11 rockchip/rk3399-khadas-edge-v.dts \
/freebsd-current/tests/sys/netgraph/
H A Dng_macfilter_test.sh218 local edge="out$(seq 0 1 $HOOKS | sort -R | head -1)"
219 test $edge = 'out0' \
221 || echo $edge
311 test $i = 2 && edge='out2' || edge='out1'
314 ngctl msg MF: 'direct' "{ hookname=\"$edge\" ether=$ether }"
335 edge='out3'
338 ngctl msg MF: 'direct' "{ hookname=\"$edge\" ether=$ether }"
360 edge="default"
363 ngctl msg MF: 'direct' "{ hookname=\"$edge\" ethe
[all...]
/freebsd-current/sys/x86/iommu/
H A Diommu_intrmap.h36 int iommu_map_ioapic_intr(u_int ioapic_id, u_int cpu, u_int vector, bool edge,
H A Dintel_intrmap.c153 iommu_map_ioapic_intr(u_int ioapic_id, u_int cpu, u_int vector, bool edge, argument
194 (edge ? DMAR_IRTE1_TM_EDGE : DMAR_IRTE1_TM_LEVEL) |
205 (edge ? IOART_TRGREDG : IOART_TRGRLVL) |
/freebsd-current/contrib/llvm-project/lld/MachO/
H A DExportTrie.cpp13 // edge can represent multiple characters. For example, given two exported
152 for (const Edge &edge : edges) {
153 nodeSize += edge.substring.size() + 1 // String length.
154 + getULEB128Size(edge.child->offset); // Offset len.
183 // Append each child edge substring and node offset.
184 for (const Edge &edge : edges) {
185 memcpy(buf, edge.substring.data(), edge.substring.size());
186 buf += edge.substring.size();
188 buf += encodeULEB128(edge
[all...]
/freebsd-current/contrib/bmake/unit-tests/
H A Ddirective-ifmake.exp11 make: don't know how to make !edge (continuing)
H A Dcmdline-redirect-stdin.mk6 # This edge case is an implementation detail that has no practical
H A Dcond-eof.mk13 # These syntax errors are an edge case that does not occur during normal
H A Dvarparse-errors.mk52 # Demonstrate an edge case in which the 'static' for 'errorReported' in
54 # Given that this is an edge case and the error message is wrong and thus
H A Ddeptgt.mk46 # targets. This in turn would be such an extreme and unreliable edge case
/freebsd-current/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
183 // The edge does not exist. Create one with the appropriate interference
185 if (edge == G.invalidEdgeId()) {
206 if (G.getEdgeNode1Id(edge) == node2) {
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
237 G.updateEdgeCosts(edge, std::move(costs));
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local
278 assert(edge != G.invalidEdgeId() &&
279 "PBQP error ! The edge should exist !");
283 if (G.getEdgeNode1Id(edge)
[all...]
/freebsd-current/usr.sbin/bsdconfig/dot/
H A Ddot96 edge) printf '\t\t%s' "$node" ;;
324 # Perform edge-concentration when displaying a lot of information
332 # printf '\tconcentrate = true;\t// enable edge concentrators\n'
389 print_node edge "penwidth = 5.0" "style = bold" "color = $edge_color"
402 [ "$SHOW_CMDLINE" -o ! "$SHOW_INCLUDES" ] && print_node edge "headport = w"
403 print_node edge "style = bold" "color = $edge_color"
443 print_node edge "style = dashed" "color = $edge_color"
444 #print_node edge "label = \"\\T\"" "fontsize = 9"
505 print_node edge "headport = w" "weight = 100.0"
506 print_node edge "styl
[all...]
/freebsd-current/contrib/libpcap/
H A Dgencode.h251 * This corresponds to an edge in the CFG.
252 * It's a directed graph, so an edge has a predecessor and a successor.
254 struct edge { struct
256 int code; /* opcode for branch corresponding to this edge */
260 struct edge *next; /* link list of incoming edges for a node */
278 struct edge et; /* edge corresponding to the jt branch */
279 struct edge ef; /* edge corresponding to the jf branch */
284 struct edge *in_edge
[all...]
/freebsd-current/sys/dev/gpio/
H A Dgpiopps.c174 uint32_t edge, pincaps; local
188 /* Check which edge we're configured to capture (default is rising). */
189 if (ofw_bus_has_prop(dev, "assert-falling-edge"))
190 edge = GPIO_INTR_EDGE_FALLING;
192 edge = GPIO_INTR_EDGE_RISING;
211 if ((pincaps & edge) == 0) {
212 device_printf(dev, "Pin cannot be configured for the requested signal edge\n");
222 sc->gpin, edge)) == NULL) {
/freebsd-current/contrib/ldns/ldns/
H A Dradix.h57 /** Radix node select edge array */
59 /** Additional string after the selection byte for this edge. */
61 /** Length of additional string for this edge. */
64 ldns_radix_node_t* edge; member in struct:ldns_radix_array_t
77 /** Index in the the parent node select edge array. */
85 /** Select edge array. */
/freebsd-current/sys/sys/
H A Dtimepps.h119 int edge; member in struct:pps_kcbind_args
252 const int edge, const int tsformat)
257 arg.edge = edge;
251 time_pps_kcbind(pps_handle_t handle, const int kernel_consumer, const int edge, const int tsformat) argument
/freebsd-current/contrib/byacc/
H A Dlalr.c280 Value_t *edge; local
292 edge = NEW2(ngotos + 1, Value_t);
318 edge[nedges++] = map_goto(stateno, symbol);
326 rp[j] = edge[j];
346 FREE(edge);
363 Value_t *edge; local
368 edge = NEW2(ngotos + 1, Value_t);
410 edge[nedges++] = map_goto(stateno, *rp);
421 shortp[j] = edge[j];
436 FREE(edge);
[all...]
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DProfiledCallGraph.h41 // callee only the edge with the largest weight is added to the edge set.
49 using edge = ProfiledCallGraphEdge;
50 using edges = std::set<edge, ProfiledCallGraphEdgeComparer>;
107 // Fetch edge weight from the profile.
163 // Accumulate weight to the existing edge.
220 using EdgeType = NodeType::edge;
/freebsd-current/tools/tools/ath/athprom/
H A Dathprom.c384 printEdge(FILE *fd, int edge) argument
389 if (pRdEdgePwrInfo[edge].rdEdge == 0)
392 fprintf(fd, "%04d", pRdEdgePwrInfo[edge].rdEdge);
396 printEdgePower(FILE *fd, int edge) argument
401 if (pRdEdgePwrInfo[edge].rdEdge == 0)
405 pRdEdgePwrInfo[edge].twice_rdEdgePower / 2,
406 (pRdEdgePwrInfo[edge].twice_rdEdgePower % 2) * 5);
410 printEdgeFlag(FILE *fd, int edge) argument
415 if (pRdEdgePwrInfo[edge].rdEdge == 0)
418 fprintf(fd, " %1d", pRdEdgePwrInfo[edge]
[all...]
/freebsd-current/contrib/llvm-project/lld/ELF/Arch/
H A DMipsArchTree.cpp175 for (const auto &edge : archTree) {
176 if (res == edge.child) {
177 res = edge.parent;
/freebsd-current/sys/powerpc/powermac/
H A Dcpcht.c123 int edge; member in struct:cpcht_irq
584 * and should be programmed as edge triggered low-to-high.
622 cpcht_irqmap[irq].ht_base > 0 && !cpcht_irqmap[irq].edge) {
638 cpcht_irqmap[irq].edge = 1;
640 cpcht_irqmap[irq].edge = 0;
719 cpcht_irqmap[irq].ht_base > 0 && !cpcht_irqmap[irq].edge) {
/freebsd-current/contrib/llvm-project/lldb/source/Symbol/
H A DFunction.cpp352 [](const std::unique_ptr<CallEdge> &edge) { return edge->IsTailCall(); });
359 llvm::partition_point(edges, [&](const std::unique_ptr<CallEdge> &edge) {
360 return std::make_pair(edge->IsTailCall(),
361 edge->GetReturnPCAddress(*this, target)) <

Completed in 296 milliseconds

12