Home
last modified time | relevance | path

Searched refs:NODE_SIZE (Results 1 – 25 of 84) sorted by relevance

1234

/dports/security/silktools/silk-3.19.1/src/rwsort/
H A Drwdedupe.c183 return memcmp(a, b, NODE_SIZE); in rwrecCompare()
308 uint8_t recs[MAX_MERGE_FILES][NODE_SIZE]; in mergeFiles()
309 uint8_t lowest_rec[NODE_SIZE]; in mergeFiles()
385 if (NODE_SIZE == rv) { in mergeFiles()
406 rv, NODE_SIZE, in mergeFiles()
451 memcpy(lowest_rec, recs[lowest], NODE_SIZE); in mergeFiles()
457 if (NODE_SIZE != rv) { in mergeFiles()
491 != NODE_SIZE) in mergeFiles()
607 buffer_max_recs = buffer_size / NODE_SIZE; in sortRandom()
680 cur_node += NODE_SIZE; in sortRandom()
[all …]
H A Drwcombine.c237 return memcmp(a, b, NODE_SIZE); in rwrecCompare()
543 uint8_t recs[MAX_MERGE_FILES][NODE_SIZE]; in mergeFiles()
544 uint8_t lowest_rec[NODE_SIZE]; in mergeFiles()
620 if (NODE_SIZE == rv) { in mergeFiles()
641 rv, NODE_SIZE, in mergeFiles()
693 == NODE_SIZE) in mergeFiles()
740 if (NODE_SIZE != rv) { in mergeFiles()
848 buffer_max_recs = buffer_size / NODE_SIZE; in sortRandom()
946 cur_node += NODE_SIZE; in sortRandom()
1041 next_node = record_buffer + NODE_SIZE; in sortRandom()
[all …]
H A Drwcombine.h84 #define NODE_SIZE sizeof(rwRec) macro
94 #define MINIMUM_BUFFER_SIZE (NODE_SIZE * MIN_IN_CORE_RECORDS)
H A Drwdedupe.h84 #define NODE_SIZE sizeof(rwRec) macro
94 #define MINIMUM_BUFFER_SIZE (NODE_SIZE * MIN_IN_CORE_RECORDS)
/dports/editors/nedit/nedit-5.7/source/
H A DregularExp.c396 #define NODE_SIZE (NEXT_PTR_SIZE + OP_CODE_SIZE) macro
399 #define OPERAND(p) ((p) + NODE_SIZE)
404 (( *((p) + NODE_SIZE+1)) & 0377))
406 (( *((p) + NODE_SIZE+3)) & 0377))
659 if (GET_OP_CODE (scan + NODE_SIZE) == EXACTLY) { in CompileRE()
720 emit_look_behind_bounds = ret_val + NODE_SIZE; in chunk()
791 branch_tail (this_branch, NODE_SIZE, ender); in chunk()
1229 offset_tail (ret_val, NODE_SIZE, next); /* 3 */ in piece()
1985 Reg_Size += NODE_SIZE; in emit_node()
2056 Reg_Size += NODE_SIZE; /* Make room for the node */ in emit_special()
[all …]
/dports/audio/praat/praat-6.2.03/melder/
H A DregularExp.cpp391 #define NODE_SIZE (NEXT_PTR_SIZE + OP_CODE_SIZE) macro
394 #define OPERAND(p) ((p) + NODE_SIZE)
399 (( *((p) + NODE_SIZE+1)) & 0377))
401 (( *((p) + NODE_SIZE+3)) & 0377))
640 if (GET_OP_CODE (scan + NODE_SIZE) == EXACTLY) { in CompileRE()
700 emit_look_behind_bounds = ret_val + NODE_SIZE; in chunk()
781 branch_tail (this_branch, NODE_SIZE, ender); in chunk()
1163 tail (ret_val, ret_val + (4 * NODE_SIZE)); /* 6 */ in piece()
1229 offset_tail (ret_val, NODE_SIZE, next); /* 3 */ in piece()
1938 Reg_Size += NODE_SIZE; in emit_node()
[all …]
/dports/lang/yap/yap-6.2.2/library/rltree/
H A Drange_list.h59 #define NODE_SIZE sizeof(RL_Node) macro
75 #define ALL_OUT(n) memset(n,0,NODE_SIZE) // turn out a node
76 #define ALL_IN(n) memset(n,32767,NODE_SIZE) // turn in a leaf
90 #define REALLOC_MEM(tree) (tree->mem_alloc < (tree->size+1)*NODE_SIZE)
91 #define MEM_SIZE(tree) (tree->size+2)*NODE_SIZE
/dports/devel/libzookeeper/apache-zookeeper-3.7.0/zookeeper-server/src/test/java/org/apache/zookeeper/server/persistence/
H A DFileTxnLogTest.java160 private static final int NODE_SIZE = 1024; field in FileTxnLogTest
173 …CreateRequest record = new CreateRequest(null, new byte[NODE_SIZE], ZooDefs.Ids.OPEN_ACL_UNSAFE, 0… in testGetCurrentLogSize()
181 assertTrue(log.getCurrentLogSize() > (zxid - 1) * NODE_SIZE); in testGetCurrentLogSize()
188 assertTrue(log.getCurrentLogSize() > (zxid - 1) * NODE_SIZE); in testGetCurrentLogSize()
215 byte[] bytes = new byte[NODE_SIZE]; in testLogSizeLimit()
220 long txnCount = LOG_SIZE_LIMIT / NODE_SIZE / 2 * 5; in testLogSizeLimit()
246 long threshold = LOG_SIZE_LIMIT + NODE_SIZE; in testLogSizeLimit()
/dports/sysutils/kubectl/kubernetes-1.22.2/cluster/kubemark/iks/
H A Dconfig-default.sh31 NODE_SIZE=${NODE_SIZE:-u2c.2x4}
/dports/lang/gleam/gleam-0.18.2/cargo-crates/im-15.0.0/src/nodes/
H A Drrb.rs17 pub(crate) const NODE_SIZE: usize = CHUNK_SIZE;
52 if let Some(child_size) = NODE_SIZE.checked_pow(level as u32) { in table_from_size()
77 debug_assert!(size_table.len() < NODE_SIZE); in push()
399 if let Some(expected_size) = NODE_SIZE.checked_pow(level as u32 + 1) { in is_completely_dense()
445 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
571 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
631 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
688 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
903 if left_len + right_len <= NODE_SIZE { in merge_leaves()
906 let count = right_len.min(NODE_SIZE - left_len); in merge_leaves()
[all …]
/dports/devel/cargo-generate/cargo-generate-0.9.0/cargo-crates/im-rc-15.0.0/src/nodes/
H A Drrb.rs17 pub(crate) const NODE_SIZE: usize = CHUNK_SIZE;
52 if let Some(child_size) = NODE_SIZE.checked_pow(level as u32) { in table_from_size()
77 debug_assert!(size_table.len() < NODE_SIZE); in push()
399 if let Some(expected_size) = NODE_SIZE.checked_pow(level as u32 + 1) { in is_completely_dense()
445 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
571 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
631 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
688 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
903 if left_len + right_len <= NODE_SIZE { in merge_leaves()
906 let count = right_len.min(NODE_SIZE - left_len); in merge_leaves()
[all …]
/dports/devel/cargo-c/cargo-c-0.9.6+cargo-0.58/cargo-crates/im-rc-15.0.0/src/nodes/
H A Drrb.rs17 pub(crate) const NODE_SIZE: usize = CHUNK_SIZE;
52 if let Some(child_size) = NODE_SIZE.checked_pow(level as u32) { in table_from_size()
77 debug_assert!(size_table.len() < NODE_SIZE); in push()
399 if let Some(expected_size) = NODE_SIZE.checked_pow(level as u32 + 1) { in is_completely_dense()
445 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
571 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
631 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
688 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
903 if left_len + right_len <= NODE_SIZE { in merge_leaves()
906 let count = right_len.min(NODE_SIZE - left_len); in merge_leaves()
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/im-rc/src/nodes/
H A Drrb.rs17 pub(crate) const NODE_SIZE: usize = CHUNK_SIZE;
52 if let Some(child_size) = NODE_SIZE.checked_pow(level as u32) { in table_from_size()
77 debug_assert!(size_table.len() < NODE_SIZE); in push()
399 if let Some(expected_size) = NODE_SIZE.checked_pow(level as u32 + 1) { in is_completely_dense()
445 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
571 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
631 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
688 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
903 if left_len + right_len <= NODE_SIZE { in merge_leaves()
906 let count = right_len.min(NODE_SIZE - left_len); in merge_leaves()
[all …]
/dports/textproc/angle-grinder/angle-grinder-0.18.0/cargo-crates/im-13.0.0/src/nodes/
H A Drrb.rs17 pub const NODE_SIZE: usize = CHUNK_SIZE; const
52 let child_size = NODE_SIZE.pow(level as u32); in table_from_size()
70 debug_assert!(size_table.len() < NODE_SIZE); in push()
384 self.size() == NODE_SIZE.pow(level as u32 + 1) in is_completely_dense()
424 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
433 let mut target_idx = index / NODE_SIZE.pow(level as u32); in index_in()
544 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
600 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
657 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
846 if left_len + right_len <= NODE_SIZE { in merge_leaves()
[all …]
/dports/sysutils/vector/vector-0.10.0/cargo-crates/im-12.3.4/src/nodes/
H A Drrb.rs17 pub const NODE_SIZE: usize = CHUNK_SIZE; const
52 let child_size = NODE_SIZE.pow(level as u32); in table_from_size()
70 debug_assert!(size_table.len() < NODE_SIZE); in push()
384 self.size() == NODE_SIZE.pow(level as u32 + 1) in is_completely_dense()
424 Size::Size(_) => index * NODE_SIZE.pow(level as u32), in size_up_to()
433 let mut target_idx = index / NODE_SIZE.pow(level as u32); in index_in()
544 if values.len() + chunk.len() <= NODE_SIZE { in push_chunk()
600 if side == Left && chunk.len() < NODE_SIZE { in push_chunk()
657 if side == Left && chunk_size < NODE_SIZE { in push_chunk()
846 if left_len + right_len <= NODE_SIZE { in merge_leaves()
[all …]
/dports/math/gnubc/bc-1.07.1/bc/
H A Dstorage.c408 for (ix=1; ix < NODE_SIZE; ix++) in get_array_num()
413 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()
430 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()
433 for (ix=0; ix < NODE_SIZE; ix++) in get_array_num()
892 for (ix = 0; ix < NODE_SIZE; ix++) in free_a_tree()
895 for (ix = 0; ix < NODE_SIZE; ix++) in free_a_tree()
955 for (i=0; i<NODE_SIZE; i++) in copy_tree()
962 for (i=0; i<NODE_SIZE; i++) in copy_tree()
H A Dbcdefs.h134 bc_num n_num [NODE_SIZE];
135 struct bc_array_node *n_down [NODE_SIZE];
H A Dconst.h60 #define NODE_SIZE 64 /* Must be a power of 2. */ macro
/dports/devel/libgee/libgee-0.20.3/gee/
H A Dunrolledlinkedlist.vala262 while (j < NODE_SIZE && i < stop - start) {
563 if (node._size == NODE_SIZE) {
574 next._size = NODE_SIZE - SPLIT_POS;
593 assert (node._size <= NODE_SIZE);
595 assume (node._size <= NODE_SIZE);
660 assert (node._size + node._next._size <= NODE_SIZE);
663 assume (node._size + node._next._size <= NODE_SIZE);
669 assert (node._size <= NODE_SIZE);
671 assume (node._size <= NODE_SIZE);
724 private const int SPLIT_POS = (NODE_SIZE - 1)/2 + 1;
[all …]
/dports/devel/mercurial/mercurial-6.0/mercurial/dirstateutils/
H A Dv2.py21 NODE_SIZE = 44 variable
57 assert NODE_SIZE == NODE.size
92 node_start = start + NODE_SIZE * i
93 node_bytes = slice_with_len(data, node_start, NODE_SIZE)
/dports/multimedia/libdv/libdv-24218c36bed3b0a3bd5a57d5790ac12ade44e88d/encodedv/
H A Ddvavi.c135 #define NODE_SIZE PAL_SIZE macro
138 unsigned char buffer[NODE_SIZE];
426 (audio_bufs.last->usage + len > NODE_SIZE)) { in read_avi()
440 if (len > NODE_SIZE) { in read_avi()
453 if (len > NODE_SIZE) { in read_avi()
/dports/math/jts/jts-jts-1.18.1/modules/core/src/test/java/test/jts/perf/index/
H A DHPRtreePerfTest.java25 private static final int NODE_SIZE = 32; field in HPRtreePerfTest
50 index = new HPRtree(NODE_SIZE); in startRun()
/dports/multimedia/v4l_compat/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_iext_tree.c89 NODE_SIZE = 256, enumerator
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),
91 RECS_PER_LEAF = (NODE_SIZE - (2 * sizeof(struct xfs_iext_leaf *))) /
401 struct xfs_iext_node *node = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_grow()
457 struct xfs_iext_node *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_node()
545 struct xfs_iext_leaf *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_leaf()
604 new_size = NODE_SIZE; in xfs_iext_realloc_root()
/dports/multimedia/libv4l/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_iext_tree.c89 NODE_SIZE = 256, enumerator
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),
91 RECS_PER_LEAF = (NODE_SIZE - (2 * sizeof(struct xfs_iext_leaf *))) /
401 struct xfs_iext_node *node = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_grow()
457 struct xfs_iext_node *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_node()
545 struct xfs_iext_leaf *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_leaf()
604 new_size = NODE_SIZE; in xfs_iext_realloc_root()
/dports/multimedia/v4l-utils/linux-5.13-rc2/fs/xfs/libxfs/
H A Dxfs_iext_tree.c89 NODE_SIZE = 256, enumerator
90 KEYS_PER_NODE = NODE_SIZE / (sizeof(uint64_t) + sizeof(void *)),
91 RECS_PER_LEAF = (NODE_SIZE - (2 * sizeof(struct xfs_iext_leaf *))) /
401 struct xfs_iext_node *node = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_grow()
457 struct xfs_iext_node *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_node()
545 struct xfs_iext_leaf *new = kmem_zalloc(NODE_SIZE, KM_NOFS); in xfs_iext_split_leaf()
604 new_size = NODE_SIZE; in xfs_iext_realloc_root()

1234