| /freebsd-13.1/contrib/subversion/subversion/libsvn_wc/ |
| H A D | wc-queries.sql | 34 FROM nodes 47 FROM nodes 57 FROM nodes 68 FROM nodes 76 FROM nodes 83 FROM nodes 94 FROM nodes 103 FROM nodes 108 FROM nodes 115 FROM nodes [all …]
|
| H A D | wc-checks.sql | 139 FROM nodes 158 FROM nodes 167 FROM nodes 187 FROM nodes 197 FROM nodes n 211 FROM nodes n 212 JOIN nodes p 227 FROM nodes n 235 FROM nodes n 256 FROM nodes s [all …]
|
| H A D | wc-metadata.sql | 488 SELECT * FROM nodes AS n 489 WHERE op_depth = (SELECT MAX(op_depth) FROM nodes AS n2 497 SELECT * FROM nodes 501 AFTER INSERT ON nodes 509 AFTER DELETE ON nodes 517 AFTER UPDATE OF checksum ON nodes 639 UPDATE nodes SET presence = 'server-excluded' WHERE presence = 'absent'; 643 UPDATE nodes SET file_external=1 WHERE file_external IS NOT NULL; 690 SELECT l.wc_id, l.local_relpath FROM nodes as l 691 LEFT OUTER JOIN nodes as r
|
| /freebsd-13.1/contrib/ofed/librdmacm/examples/ |
| H A D | cmtime.c | 173 us = diff_us(&nodes[c].times[i][1], &nodes[c].times[i][0]); in show_perf() 355 nodes = calloc(sizeof *nodes, connections); in alloc_nodes() 356 if (!nodes) in alloc_nodes() 364 ret = rdma_create_id(channel, &nodes[i].id, &nodes[i], in alloc_nodes() 377 free(nodes); in alloc_nodes() 389 if (nodes[i].id) in cleanup_nodes() 529 if (nodes[i].error) in run_client() 548 if (nodes[i].error) in run_client() 566 if (nodes[i].error) in run_client() 582 if (nodes[i].error) in run_client() [all …]
|
| H A D | cmatose.c | 64 struct cmatest_node *nodes; member 375 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes() 376 if (!test.nodes) { in alloc_nodes() 380 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes() 383 test.nodes[i].id = i; in alloc_nodes() 396 free(test.nodes); in alloc_nodes() 405 destroy_node(&test.nodes[i]); in destroy_nodes() 406 free(test.nodes); in destroy_nodes() 415 if (!test.nodes[i].connected) in poll_cqs() 559 if (!test.nodes[i].connected) in run_server() [all …]
|
| H A D | mckey.c | 65 struct cmatest_node *nodes; member 380 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes() 381 if (!test.nodes) { in alloc_nodes() 385 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes() 388 test.nodes[i].id = i; in alloc_nodes() 390 &test.nodes[i], port_space); in alloc_nodes() 398 free(test.nodes); in alloc_nodes() 407 destroy_node(&test.nodes[i]); in destroy_nodes() 408 free(test.nodes); in destroy_nodes() 417 if (!test.nodes[i].connected) in poll_cqs() [all …]
|
| H A D | udaddy.c | 62 struct cmatest_node *nodes; member 418 test.nodes = malloc(sizeof *test.nodes * connections); in alloc_nodes() 419 if (!test.nodes) { in alloc_nodes() 423 memset(test.nodes, 0, sizeof *test.nodes * connections); in alloc_nodes() 426 test.nodes[i].id = i; in alloc_nodes() 429 &test.nodes[i].cma_id, in alloc_nodes() 439 free(test.nodes); in alloc_nodes() 448 destroy_node(&test.nodes[i]); in destroy_nodes() 449 free(test.nodes); in destroy_nodes() 471 if (!test.nodes[i].connected) in poll_cqs() [all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.cpp | 217 delete[] nodes; in releaseMemory() 218 nodes = nullptr; in releaseMemory() 228 nodes[n].clear(Threshold); in activate() 240 nodes[n].BiasP = 0; in activate() 306 nodes[ib].addLink(ob, Freq); in addLinks() 307 nodes[ob].addLink(ib, Freq); in addLinks() 317 if (nodes[n].mustSpill()) in scanActiveBundles() 319 if (nodes[n].preferReg()) in scanActiveBundles() 326 if (!nodes[n].update(nodes, Threshold)) in update() 328 nodes[n].getDissentingNeighbors(TodoList, nodes); in update() [all …]
|
| /freebsd-13.1/sys/netpfil/ipfilter/netinet/ |
| H A D | radix_ipf.c | 121 nodes[0].addroff = nodes[0].addrkey + masklen; in buildnodes() 122 nodes[0].maskoff = nodes[0].maskkey + masklen; in buildnodes() 123 nodes[0].parent = &nodes[1]; in buildnodes() 127 nodes[1].left = &nodes[0]; in buildnodes() 392 if ((key[nodes[1].offset] & nodes[1].bitmask) == 0) { in ipf_rx_insert() 395 nodes[1].right = &nodes[0]; in ipf_rx_insert() 1176 rnh->nodes[0].index, GNAME(rnh->nodes[0].parent), in printroots() 1180 rnh->nodes[1].index, GNAME(rnh->nodes[1].parent), in printroots() 1184 rnh->nodes[2].index, GNAME(rnh->nodes[2].parent), in printroots() 1352 stp->nodes[0].parent = &stp->nodes[0]; in delete_addr() [all …]
|
| /freebsd-13.1/contrib/subversion/subversion/libsvn_fs_base/bdb/ |
| H A D | nodes-table.c | 55 DB *nodes; in svn_fs_bdb__open_nodes_table() local 58 BDB_ERR(db_create(&nodes, env, 0)); in svn_fs_bdb__open_nodes_table() 59 BDB_ERR((nodes->open)(SVN_BDB_OPEN_PARAMS(nodes, NULL), in svn_fs_bdb__open_nodes_table() 69 BDB_ERR(nodes->put(nodes, 0, in svn_fs_bdb__open_nodes_table() 74 *nodes_p = nodes; in svn_fs_bdb__open_nodes_table() 103 bfd->nodes->get(bfd->nodes, trail->db_txn, in svn_fs_bdb__new_node_id() 116 db_err = bfd->nodes->put(bfd->nodes, trail->db_txn, in svn_fs_bdb__new_node_id() 183 bfd->nodes->del(bfd->nodes, in svn_fs_bdb__delete_nodes_entry() 209 db_err = bfd->nodes->get(bfd->nodes, trail->db_txn, in svn_fs_bdb__get_node_revision() 254 bfd->nodes->put(bfd->nodes, db_txn, in svn_fs_bdb__put_node_revision()
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/cpu/ |
| H A D | cpu-topology.txt | 27 tree nodes. 44 nodes are listed. 62 - one or more cluster nodes or 114 A socket node's child nodes must be one or more cluster nodes. 123 nodes can be contained in parent cluster nodes. 131 - one or more core nodes 139 nodes are leaf nodes, otherwise they become containers of 140 thread nodes. 146 Properties for core nodes that are leaf nodes: 155 child nodes can be: [all …]
|
| /freebsd-13.1/crypto/openssl/crypto/x509v3/ |
| H A D | pcy_node.c | 28 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in tree_find_sk() argument 38 idx = sk_X509_POLICY_NODE_find(nodes, &l); in tree_find_sk() 39 return sk_X509_POLICY_NODE_value(nodes, idx); in tree_find_sk() 49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in level_find_node() 50 node = sk_X509_POLICY_NODE_value(level->nodes, i); in level_find_node() 80 if (level->nodes == NULL) in level_add_node() 81 level->nodes = policy_node_cmp_new(); in level_add_node() 82 if (level->nodes == NULL) { in level_add_node() 86 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in level_add_node()
|
| H A D | pcy_tree.c | 369 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any() 393 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune() 396 nodes = curr->nodes; in tree_prune() 399 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune() 404 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune() 411 nodes = curr->nodes; in tree_prune() 413 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune() 417 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune() 646 STACK_OF(X509_POLICY_NODE) *nodes, *auth_nodes = NULL; in X509_policy_check() 694 nodes = X509_policy_tree_get0_user_policies(tree); in X509_policy_check() [all …]
|
| /freebsd-13.1/bin/sh/ |
| H A D | Makefile | 20 GENSRCS= builtins.c nodes.c syntax.c 21 GENHDRS= builtins.h nodes.h syntax.h token.h 52 .ORDER: nodes.c nodes.h 53 nodes.h: .NOMETA 54 nodes.c nodes.h: mknodes nodetypes nodes.c.pat 55 ${BTOOLSPATH:U.}/mknodes ${.CURDIR}/nodetypes ${.CURDIR}/nodes.c.pat
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/usb/ |
| H A D | usb-device.txt | 7 Four types of device-tree nodes are defined: "host-controller nodes" 8 representing USB host controllers, "device nodes" representing USB devices, 9 "interface nodes" representing USB interfaces and "combined nodes" 20 Required properties for device nodes: 30 Required properties for device nodes with interface nodes: 35 Required properties for interface nodes: 49 Required properties for combined nodes: 59 Required properties for hub nodes with device nodes: 64 Required properties for host-controller nodes with device nodes:
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/pinctrl/ |
| H A D | meson,pinctrl.txt | 21 === GPIO sub-nodes === 26 Required properties for sub-nodes are: 35 === Other sub-nodes === 37 Child nodes without the "gpio-controller" represent some desired 38 configuration for a pin or a group. Those nodes can be pinmux nodes or 39 configuration nodes. 41 Required properties for pinmux nodes are: 48 Required properties for configuration nodes: 51 Configuration nodes support the following generic properties, as
|
| /freebsd-13.1/contrib/kyua/admin/ |
| H A D | check-api-docs.awk | 48 /utils\/config\/nodes\.hpp.*Member set_lua\(lutok::state &, const int\)/ {next} 49 /utils\/config\/nodes\.hpp.*Member push_lua\(lutok::state &\)/ {next} 50 /utils\/config\/nodes\.hpp.*Member set_string\(const std::string &\)/ {next} 51 /utils\/config\/nodes\.hpp.*Member to_string\(void\)/ {next} 52 /utils\/config\/nodes\.hpp.*Member is_set\(void\)/ {next}
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | Metadata.def | 27 // Handler for leaf nodes in the class hierarchy. 32 // Handler for non-leaf nodes in the class hierarchy. 37 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to 50 // Handler for leaf nodes under MDNode. 55 // Handler for leaf nodes under MDNode. 60 // Handler for non-leaf nodes under MDNode. 65 // Handler for specialized leaf nodes under MDNode. 70 // Handler for specialized non-leaf nodes under MDNode.
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/pwm/ |
| H A D | pwm-tipwmss.txt | 10 - address-cells: Specify the number of u32 entries needed in child nodes. 12 - size-cells: specify number of u32 entries needed to specify child nodes size 20 Also child nodes should also populated under PWMSS DT node. 33 /* child nodes go here */ 46 /* child nodes go here */ 57 /* child nodes go here */
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/i2c/ |
| H A D | i2c-mux.txt | 4 numbered uniquely in a device dependent manner. The nodes for an i2c bus 15 For i2c multiplexers/switches that have child nodes that are a mixture 16 of both i2c child busses and other child nodes, the 'i2c-mux' subnode 25 Required properties for i2c child bus nodes: 30 Optional properties for i2c child bus nodes: 32 - Child nodes conforming to i2c bus binding
|
| H A D | i2c-fsi.txt | 9 nodes. 10 - #size-cells = <0>; : Number of size cells in child nodes. 11 - child nodes : Nodes to describe busses off the I2C 18 - child nodes : Nodes to describe devices on the I2C
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/media/ |
| H A D | exynos4-fimc-is.txt | 30 The following are the FIMC-IS peripheral device nodes and can be specified 31 either standalone or as the fimc-is node child nodes. 33 i2c-isp (ISP I2C bus controller) nodes 44 For the above nodes it is required to specify a pinctrl state named "default", 47 Device tree nodes of the image sensors' controlled directly by the FIMC-IS 48 firmware must be child nodes of their corresponding ISP I2C bus controller node.
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/ |
| H A D | graph.txt | 10 There already is a simple directed graph between devices tree nodes using 11 phandle properties pointing to other nodes to describe connections that 30 Ports are described by child 'port' nodes contained in the device node. 37 and 'reg' properties is used to number the nodes. 66 All 'port' nodes can be grouped under an optional 'ports' node, which 68 nodes independently from any other child device nodes a device might 117 property present in the port and/or endpoint nodes then the following
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/net/ |
| H A D | marvell-pxa168.txt | 11 - #address-cells: must be 1 when using sub-nodes. 12 - #size-cells: must be 0 when using sub-nodes. 18 Sub-nodes: 21 Sub-nodes required properties:
|
| /freebsd-13.1/sys/netgraph/ |
| H A D | NOTES | 42 - Have a user level program to print out and manipulate nodes, etc. 49 command to list all existing nodes (in case you don't know the 53 - Need a way to get a list of ALL nodes. 57 - Enhance "netstat" to display all netgraph nodes -- or at least 58 all netgraph socket nodes. 68 - Need to implement passing meta information through socket nodes 77 - All nodes assume that all data mbufs have the M_PKTHDR flag set! 97 Every node has a queue, plus there is a list of nodes that have queued work.
|