| /freebsd-13-stable/contrib/subversion/subversion/libsvn_wc/ |
| HD | wc-queries.sql | 34 FROM nodes 39 SELECT op_depth, nodes.repos_id, nodes.repos_path, presence, kind, revision, 47 FROM nodes 48 LEFT OUTER JOIN lock ON nodes.repos_id = lock.repos_id 49 AND nodes.repos_path = lock.repos_relpath AND nodes.op_depth=0 57 FROM nodes 61 SELECT nodes.repos_id, nodes.repos_path, presence, kind, revision, 68 FROM nodes 69 LEFT OUTER JOIN lock ON nodes.repos_id = lock.repos_id 70 AND nodes.repos_path = lock.repos_relpath [all …]
|
| HD | wc-checks.sql | 37 CREATE TEMPORARY TRIGGER validation_01 BEFORE INSERT ON nodes 46 CREATE TEMPORARY TRIGGER validation_02 BEFORE INSERT ON nodes 54 CREATE TEMPORARY TRIGGER validation_03 BEFORE INSERT ON nodes 58 (EXISTS (SELECT 1 FROM nodes 71 OR EXISTS (SELECT 1 FROM nodes 80 FROM nodes n WHERE local_relpath != '' 99 AND NOT EXISTS(SELECT 1 from nodes i 102 AND NOT EXISTS(SELECT 1 from nodes i 111 LEFT JOIN nodes n on n.wc_id = a.wc_id AND n.local_relpath = a.local_relpath 112 AND n.op_depth = (SELECT MAX(op_depth) from nodes i [all …]
|
| HD | 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-stable/contrib/ofed/librdmacm/examples/ |
| HD | cmtime.c | 102 static struct node *nodes; variable 171 if (!zero_time(&nodes[c].times[i][0]) && in show_perf() 172 !zero_time(&nodes[c].times[i][1])) { in show_perf() 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() 362 start_perf(&nodes[i], STEP_CREATE_ID); in alloc_nodes() 364 ret = rdma_create_id(channel, &nodes[i].id, &nodes[i], in alloc_nodes() 369 end_perf(&nodes[i], STEP_CREATE_ID); in alloc_nodes() 376 rdma_destroy_id(nodes[i].id); in alloc_nodes() [all …]
|
| HD | cmatose.c | 64 struct cmatest_node *nodes; member 274 node = &test.nodes[test.conn_index++]; in connect_handler() 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() 386 &test.nodes[i].cma_id, in alloc_nodes() 387 &test.nodes[i], hints.ai_port_space); in alloc_nodes() 395 rdma_destroy_id(test.nodes[i].cma_id); in alloc_nodes() 396 free(test.nodes); in alloc_nodes() [all …]
|
| HD | 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() 389 ret = rdma_create_id(test.channel, &test.nodes[i].cma_id, in alloc_nodes() 390 &test.nodes[i], port_space); in alloc_nodes() 397 rdma_destroy_id(test.nodes[i].cma_id); in alloc_nodes() 398 free(test.nodes); in alloc_nodes() 407 destroy_node(&test.nodes[i]); in destroy_nodes() [all …]
|
| HD | udaddy.c | 62 struct cmatest_node *nodes; member 296 node = &test.nodes[test.conn_index++]; in connect_handler() 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() 430 &test.nodes[i], hints.ai_port_space); in alloc_nodes() 438 rdma_destroy_id(test.nodes[i].cma_id); in alloc_nodes() 439 free(test.nodes); in alloc_nodes() [all …]
|
| /freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| HD | SpillPlacement.cpp | 151 bool update(const Node nodes[], BlockFrequency Threshold) { in update() 156 if (nodes[L.second].Value == -1) in update() 158 else if (nodes[L.second].Value == 1) in update() 181 const Node nodes[]) const { in getDissentingNeighbors() 186 if (Value != nodes[n].Value) in getDissentingNeighbors() 196 assert(!nodes && "Leaking node array"); in runOnMachineFunction() 197 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction() 215 delete[] nodes; in releaseMemory() 216 nodes = nullptr; in releaseMemory() 226 nodes[n].clear(Threshold); in activate() [all …]
|
| /freebsd-13-stable/sys/netpfil/ipfilter/netinet/ |
| HD | radix_ipf.c | 33 ipf_rdx_node_t nodes[2], int *); 101 buildnodes(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2]) in buildnodes() 118 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); in buildnodes() 119 nodes[0].maskbitcount = maskbits; in buildnodes() 120 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); in buildnodes() 121 nodes[0].addrkey = (u_32_t *)addr; in buildnodes() 122 nodes[0].maskkey = (u_32_t *)mask; in buildnodes() 123 nodes[0].addroff = nodes[0].addrkey + masklen; in buildnodes() 124 nodes[0].maskoff = nodes[0].maskkey + masklen; in buildnodes() 125 nodes[0].parent = &nodes[1]; in buildnodes() [all …]
|
| /freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/bdb/ |
| HD | 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-stable/crypto/openssl/crypto/x509v3/ |
| HD | 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() 85 if (level->nodes == NULL) in level_add_node() 86 level->nodes = policy_node_cmp_new(); in level_add_node() 87 if (level->nodes == NULL) { in level_add_node() 91 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in level_add_node() 122 (void) sk_X509_POLICY_NODE_pop(level->nodes); in level_add_node()
|
| HD | pcy_tree.c | 82 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print() 83 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print() 270 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes() 271 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes() 387 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_any() 388 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any() 412 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune() 415 nodes = curr->nodes; in tree_prune() 417 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) { in tree_prune() 418 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune() [all …]
|
| /freebsd-13-stable/sys/contrib/device-tree/Bindings/cpu/ |
| HD | cpu-topology.txt | 20 For instance in a system where CPUs support SMT, "cpu" nodes represent all 22 In systems where SMT is not supported "cpu" nodes represent all cores present 25 CPU topology bindings allow one to associate cpu nodes with hierarchical groups 27 tree nodes. 32 The cpu nodes, as per bindings defined in [4], represent the devices that 35 A topology description containing phandles to cpu nodes that are not compliant 44 nodes are listed. 60 The cpu-map node's child nodes can be: 62 - one or more cluster nodes or 63 - one or more socket nodes in a multi-socket system [all …]
|
| /freebsd-13-stable/bin/sh/ |
| HD | 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-stable/sys/contrib/device-tree/Bindings/usb/ |
| HD | 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-stable/sys/contrib/device-tree/Bindings/pinctrl/ |
| 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-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| HD | sanitizer_stackdepotbase.h | 51 nodes.MemoryUsage() + Node::allocated(), in GetStats() 60 nodes.TestOnlyUnmap(); in TestOnlyUnmap() 73 TwoLevelMap<Node, kNodesSize1, kNodesSize2> nodes; variable 83 const Node &node = nodes[s]; in find() 142 Node &new_node = nodes[s]; in Put() 156 if (!nodes.contains(id)) in Get() 158 const Node &node = nodes[id]; in Get() 173 nodes.Lock(); in LockBeforeFork() 179 nodes.Unlock(); in UnlockAfterFork() 199 const Node &node = nodes[s]; in PrintAll()
|
| /freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
| HD | 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-stable/contrib/kyua/admin/ |
| HD | 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-stable/contrib/mandoc/ |
| HD | tag.c | 39 struct roff_node **nodes; member 73 free(entry->nodes); in tag_free() 142 entry->nodes = NULL; in tag_put() 163 nold = entry->nodes[--entry->nnodes]; in tag_put() 178 entry->nodes = mandoc_reallocarray(entry->nodes, in tag_put() 179 entry->maxnodes, sizeof(*entry->nodes)); in tag_put() 181 entry->nodes[entry->nnodes++] = n; in tag_put()
|
| /freebsd-13-stable/sys/contrib/device-tree/Bindings/pwm/ |
| HD | 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-stable/sys/contrib/device-tree/Bindings/i2c/ |
| HD | 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
|
| HD | 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-stable/sys/contrib/device-tree/Bindings/media/ |
| HD | 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-stable/sys/contrib/device-tree/Bindings/ |
| HD | 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
|