| /dports/science/py-pymol/pymol-open-source-2.4.0/layer0/ |
| H A D | Word.cpp | 44 int n_node; member
208 int n_node = 0; in WordMatcherNew() local
314 n_node++; in WordMatcherNew()
356 n_node++; in WordMatcherNew()
403 I->n_node = n_node; in WordMatcherNew()
489 int n_node = I->n_node; in WordMatcherMatchAlpha() local
497 n_node--; in WordMatcherMatchAlpha()
508 int n_node = I->n_node; in WordMatcherMatchMixed() local
516 n_node--; in WordMatcherMatchMixed()
544 int n_node = I->n_node; in WordMatcherMatchInteger() local
[all …]
|
| /dports/security/ossec-hids-local/ossec-hids-3.6.0/src/os_maild/ |
| H A D | mail_list.c | 19 static MailNode *n_node; variable
29 n_node = NULL; in OS_CreateMailList()
50 n_node = NULL; in OS_PopLastMail()
100 MailNode *tmp_node = n_node; in OS_AddMailtoList()
118 n_node = new_node; in OS_AddMailtoList()
141 n_node = (MailNode *)calloc(1, sizeof(MailNode)); in OS_AddMailtoList()
142 if (n_node == NULL) { in OS_AddMailtoList()
146 n_node->prev = NULL; in OS_AddMailtoList()
147 n_node->next = NULL; in OS_AddMailtoList()
148 n_node->mail = ml; in OS_AddMailtoList()
[all …]
|
| /dports/security/ossec-hids-server/ossec-hids-3.6.0/src/os_maild/ |
| H A D | mail_list.c | 19 static MailNode *n_node; variable
29 n_node = NULL; in OS_CreateMailList()
50 n_node = NULL; in OS_PopLastMail()
100 MailNode *tmp_node = n_node; in OS_AddMailtoList()
118 n_node = new_node; in OS_AddMailtoList()
141 n_node = (MailNode *)calloc(1, sizeof(MailNode)); in OS_AddMailtoList()
142 if (n_node == NULL) { in OS_AddMailtoList()
146 n_node->prev = NULL; in OS_AddMailtoList()
147 n_node->next = NULL; in OS_AddMailtoList()
148 n_node->mail = ml; in OS_AddMailtoList()
[all …]
|
| /dports/security/ossec-hids-agent/ossec-hids-3.6.0/src/os_maild/ |
| H A D | mail_list.c | 19 static MailNode *n_node; variable
29 n_node = NULL; in OS_CreateMailList()
50 n_node = NULL; in OS_PopLastMail()
100 MailNode *tmp_node = n_node; in OS_AddMailtoList()
118 n_node = new_node; in OS_AddMailtoList()
141 n_node = (MailNode *)calloc(1, sizeof(MailNode)); in OS_AddMailtoList()
142 if (n_node == NULL) { in OS_AddMailtoList()
146 n_node->prev = NULL; in OS_AddMailtoList()
147 n_node->next = NULL; in OS_AddMailtoList()
148 n_node->mail = ml; in OS_AddMailtoList()
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/tools/partitioner/ |
| H A D | hecmw_mesh_hash_sort.c | 108 e_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_edge_init()
109 e_buf_size = (n_node > n_elem) ? 10 * n_node : 10 * n_elem; in HECMW_mesh_hsort_edge_init()
111 e_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_edge_init()
112 e_buf_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_edge_init()
170 t_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_tsuf_init()
171 t_buf_size = (n_node > n_elem) ? 4 * n_node : 4 * n_elem; in HECMW_mesh_hsort_tsuf_init()
173 t_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_tsuf_init()
174 t_buf_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_tsuf_init()
238 q_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_qsuf_init()
241 q_hash_size = (n_node > n_elem) ? n_node : n_elem; in HECMW_mesh_hsort_qsuf_init()
[all …]
|
| H A D | hecmw_part_log.c | 23 static int *n_node = NULL; variable
50 HECMW_free(n_node); in clean_log()
56 n_node = NULL; in clean_log()
87 n_node = (int *)HECMW_calloc(n_domain, sizeof(int)); in HECMW_part_init_log()
88 if (n_node == NULL) { in HECMW_part_init_log()
299 n_node[domain] = _n_node; in HECMW_part_set_log_n_node()
348 if (_nn_internal > n_node[domain]) { in HECMW_part_set_log_nn_internal()
459 fprintf(fp, "%6d %12d %12d %12d %12d %12d\n", i, n_node[i], nn_internal[i], in HECMW_part_print_log()
|
| /dports/audio/praat/praat-6.2.03/external/glpk/ |
| H A D | glpnet04.c | 176 int n_node; member
210 #define n_node (csa->n_node) macro
313 n_node = parm[3]; in glp_gridgen()
339 if (n * n >= n_node) in glp_gridgen()
349 n_node = n1 * n2 + 1; in glp_gridgen()
350 n_arc = n_node * avg_degree; in glp_gridgen()
481 arc_ptr->to = n_node; in gen_additional_arcs()
485 arc_ptr->from = n_node; in gen_additional_arcs()
496 for (i = 1; i < n_node; i += n1) in gen_basic_grid()
593 xprintf("c nodes %d\n", n_node); in output()
[all …]
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/lib/ |
| H A D | klist.c | 97 list_add(&n->n_node, &k->k_list); in add_head()
104 list_add_tail(&n->n_node, &k->k_list); in add_tail()
110 INIT_LIST_HEAD(&n->n_node); in klist_node_init()
152 list_add(&n->n_node, &pos->n_node); in klist_add_behind()
168 list_add_tail(&n->n_node, &pos->n_node); in klist_add_before()
189 list_del(&n->n_node); in klist_release()
322 return container_of(n, struct klist_node, n_node); in to_klist_node()
343 prev = to_klist_node(last->n_node.prev); in klist_prev()
356 prev = to_klist_node(prev->n_node.prev); in klist_prev()
385 next = to_klist_node(last->n_node.next); in klist_next()
[all …]
|
| /dports/multimedia/libv4l/linux-5.13-rc2/lib/ |
| H A D | klist.c | 97 list_add(&n->n_node, &k->k_list); in add_head()
104 list_add_tail(&n->n_node, &k->k_list); in add_tail()
110 INIT_LIST_HEAD(&n->n_node); in klist_node_init()
152 list_add(&n->n_node, &pos->n_node); in klist_add_behind()
168 list_add_tail(&n->n_node, &pos->n_node); in klist_add_before()
189 list_del(&n->n_node); in klist_release()
322 return container_of(n, struct klist_node, n_node); in to_klist_node()
343 prev = to_klist_node(last->n_node.prev); in klist_prev()
356 prev = to_klist_node(prev->n_node.prev); in klist_prev()
385 next = to_klist_node(last->n_node.next); in klist_next()
[all …]
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/lib/ |
| H A D | klist.c | 97 list_add(&n->n_node, &k->k_list); in add_head()
104 list_add_tail(&n->n_node, &k->k_list); in add_tail()
110 INIT_LIST_HEAD(&n->n_node); in klist_node_init()
152 list_add(&n->n_node, &pos->n_node); in klist_add_behind()
168 list_add_tail(&n->n_node, &pos->n_node); in klist_add_before()
189 list_del(&n->n_node); in klist_release()
322 return container_of(n, struct klist_node, n_node); in to_klist_node()
343 prev = to_klist_node(last->n_node.prev); in klist_prev()
356 prev = to_klist_node(prev->n_node.prev); in klist_prev()
385 next = to_klist_node(last->n_node.next); in klist_next()
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/common/ |
| H A D | hecmw_result_f.f90 | 91 nnode = hecMESH%n_node
306 integer(kind=kint) :: n_node, n_elem, ierr local
317 call refine_result(hecMESH, n_node, result, ierr)
324 integer(kind=kint), intent(in) :: n_node local
331 if(n_node == hecMESH%n_node) return
332 if(n_node > hecMESH%n_node) then
346 if(n_node >= n_node_ref) cycle
373 integer(kind=kint) :: n_node, n_elem, ierr local
376 call get_global_component(result, n_node, ierr)
378 call get_node_component(result, n_node, ierr)
[all …]
|
| H A D | hecmw_result_copy_c2f.c | 213 int n_node, int n_elem) { in HECMW_result_copy_c2f_init() argument
215 nnode = n_node; in HECMW_result_copy_c2f_init()
301 int *n_node, int *n_elem, int *err, int len) { in hecmw_result_read_by_name_if() argument
315 *n_node = nnode; in hecmw_result_read_by_name_if()
322 int *n_node, int *n_elem, int *err, in hecmw_result_read_by_name_if_() argument
324 hecmw_result_read_by_name_if(name_ID, i_step, n_node, n_elem, err, in hecmw_result_read_by_name_if_()
329 int *n_node, int *n_elem, int *err, in hecmw_result_read_by_name_if__() argument
331 hecmw_result_read_by_name_if(name_ID, i_step, n_node, n_elem, err, in hecmw_result_read_by_name_if__()
336 int *n_node, int *n_elem, int *err, int len) { in HECMW_RESULT_READ_BY_NAME_IF() argument
337 hecmw_result_read_by_name_if(name_ID, i_step, n_node, n_elem, err, in HECMW_RESULT_READ_BY_NAME_IF()
|
| H A D | hecmw_result.c | 63 hecMESH->n_node, hecMESH->n_elem, hecMESH->global_node_ID, in HECMW_result_init()
113 if (HECMW_result_write_txt_ST_by_fname(filename, result, n_node, n_elem, in HECMW_result_write_ST_by_name()
117 if (HECMW_result_write_bin_ST_by_fname(filename, result, n_node, n_elem, in HECMW_result_write_ST_by_name()
247 void hecmw_result_init_if(int *n_node, int *n_elem, int *nodeID, int *elemID, in hecmw_result_init_if() argument
258 if (HECMW_result_init_body(*n_node, *n_elem, nodeID, elemID, *i_step, in hecmw_result_init_if()
264 void hecmw_result_init_if_(int *n_node, int *n_elem, int *nodeID, int *elemID, in hecmw_result_init_if_() argument
267 hecmw_result_init_if(n_node, n_elem, nodeID, elemID, i_step, header, comment, in hecmw_result_init_if_()
271 void hecmw_result_init_if__(int *n_node, int *n_elem, int *nodeID, int *elemID, in hecmw_result_init_if__() argument
274 hecmw_result_init_if(n_node, n_elem, nodeID, elemID, i_step, header, comment, in hecmw_result_init_if__()
278 void HECMW_RESULT_INIT_IF(int *n_node, int *n_elem, int *nodeID, int *elemID, in HECMW_RESULT_INIT_IF() argument
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/operations/adaptation/ |
| H A D | hecmw_adapt_new_node.f90 | 32 hecMESH%n_adapt_node_cur= hecMESH%n_node
33 hecMESH%n_adapt_node_old= hecMESH%n_node
100 hecMESH%n_node = hecMESH%n_adapt_node_cur
153 allocate (hecMESH%adapt_NEWtoOLD_node(hecMESH%n_node), &
154 & hecMESH%adapt_OLDtoNEW_node(hecMESH%n_node))
161 do in= 1, hecMESH%n_node
172 do in= 1, hecMESH%n_node
|
| H A D | hecmw_adapt_allocate.f90 | 95 allocate (WORKaR(3*hecMESH%n_node))
96 do i= 1, hecMESH%n_node
105 do i= 1, hecMESH%n_node
114 allocate (WORKaI(2*hecMESH%n_node))
115 do i= 1, hecMESH%n_node
123 do i= 1, hecMESH%n_node
131 allocate (WORKaI(hecMESH%n_node))
132 do i= 1, hecMESH%n_node
139 do i= 1, hecMESH%n_node
286 do i= 1, hecMESH%n_node
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/fistr1/src/analysis/static/ |
| H A D | readtemp.f90 | 58 do i=1, hecMESH%n_node
72 do i=1, hecMESH%n_node
79 do i=1, hecMESH%n_node
128 do i=1, hecMESH%n_node
136 do i=1, hecMESH%n_node
146 do i=1, hecMESH%n_node
163 do i=1, hecMESH%n_node
172 do i=1, hecMESH%n_node
198 do i=1, hecMESH%n_node
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/myisam/ |
| H A D | rt_split.cc | 39 int n_node; member
138 if (cur->n_node) { in pick_next()
161 if (cur->n_node) { in mark_all_entries()
164 cur->n_node = n_group; in mark_all_entries()
189 cur->n_node = 0; in split_rtree_node()
193 a->n_node = 1; in split_rtree_node()
194 b->n_node = 2; in split_rtree_node()
222 next->n_node = next_node; in split_rtree_node()
288 if (cur->n_node == 1) { in rtree_split_page()
|
| /dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | rt_split.c | 34 int n_node; member
152 if (cur->n_node) in pick_next()
179 if (cur->n_node) in mark_all_entries()
183 cur->n_node = n_group; in mark_all_entries()
212 cur->n_node = 0; in split_rtree_node()
216 a->n_node = 1; in split_rtree_node()
217 b->n_node = 2; in split_rtree_node()
251 next->n_node = next_node; in split_rtree_node()
322 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | rt_split.c | 34 int n_node; member
152 if (cur->n_node) in pick_next()
179 if (cur->n_node) in mark_all_entries()
183 cur->n_node = n_group; in mark_all_entries()
212 cur->n_node = 0; in split_rtree_node()
216 a->n_node = 1; in split_rtree_node()
217 b->n_node = 2; in split_rtree_node()
251 next->n_node = next_node; in split_rtree_node()
322 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/myisam/ |
| H A D | rt_split.c | 34 int n_node; member
152 if (cur->n_node) in pick_next()
179 if (cur->n_node) in mark_all_entries()
183 cur->n_node = n_group; in mark_all_entries()
212 cur->n_node = 0; in split_rtree_node()
216 a->n_node = 1; in split_rtree_node()
217 b->n_node = 2; in split_rtree_node()
251 next->n_node = next_node; in split_rtree_node()
322 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/myisam/ |
| H A D | rt_split.c | 31 int n_node; member
149 if (cur->n_node) in pick_next()
176 if (cur->n_node) in mark_all_entries()
180 cur->n_node = n_group; in mark_all_entries()
209 cur->n_node = 0; in split_rtree_node()
213 a->n_node = 1; in split_rtree_node()
214 b->n_node = 2; in split_rtree_node()
248 next->n_node = next_node; in split_rtree_node()
319 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/percona57-server/percona-server-5.7.36-39/storage/myisam/ |
| H A D | rt_split.c | 31 int n_node; member
149 if (cur->n_node) in pick_next()
176 if (cur->n_node) in mark_all_entries()
180 cur->n_node = n_group; in mark_all_entries()
209 cur->n_node = 0; in split_rtree_node()
213 a->n_node = 1; in split_rtree_node()
214 b->n_node = 2; in split_rtree_node()
248 next->n_node = next_node; in split_rtree_node()
319 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/myisam/ |
| H A D | rt_split.c | 31 int n_node; member
149 if (cur->n_node) in pick_next()
176 if (cur->n_node) in mark_all_entries()
180 cur->n_node = n_group; in mark_all_entries()
209 cur->n_node = 0; in split_rtree_node()
213 a->n_node = 1; in split_rtree_node()
214 b->n_node = 2; in split_rtree_node()
248 next->n_node = next_node; in split_rtree_node()
319 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/myisam/ |
| H A D | rt_split.c | 31 int n_node; member
149 if (cur->n_node) in pick_next()
176 if (cur->n_node) in mark_all_entries()
180 cur->n_node = n_group; in mark_all_entries()
209 cur->n_node = 0; in split_rtree_node()
213 a->n_node = 1; in split_rtree_node()
214 b->n_node = 2; in split_rtree_node()
248 next->n_node = next_node; in split_rtree_node()
319 if (cur->n_node == 1) in rtree_split_page()
|
| /dports/databases/percona57-client/percona-server-5.7.36-39/storage/myisam/ |
| H A D | rt_split.c | 31 int n_node; member
149 if (cur->n_node) in pick_next()
176 if (cur->n_node) in mark_all_entries()
180 cur->n_node = n_group; in mark_all_entries()
209 cur->n_node = 0; in split_rtree_node()
213 a->n_node = 1; in split_rtree_node()
214 b->n_node = 2; in split_rtree_node()
248 next->n_node = next_node; in split_rtree_node()
319 if (cur->n_node == 1) in rtree_split_page()
|