Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 131) sorted by relevance

123456

/unit/src/
H A Dnxt_process_title.c50 nxt_uint_t i; in nxt_process_arguments() local
71 for (i = 0; argv[i] != NULL; i++) { in nxt_process_arguments()
108 for (i = 0; env[i] != NULL; i++) { in nxt_process_arguments()
111 if (env[i] == end) { in nxt_process_arguments()
135 for (i = 0; argv[i] != NULL; i++) { in nxt_process_arguments()
146 argv[i] = p; in nxt_process_arguments()
165 for (i = 0; env[i] != NULL; i++) { in nxt_process_arguments()
176 env[i] = p; in nxt_process_arguments()
215 nxt_uint_t i; in nxt_process_title() local
219 for (i = 0; nxt_process_argv[i] != NULL; i++) { in nxt_process_title()
[all …]
H A Dnxt_port_queue.h36 nxt_nncq_atomic_t i; in nxt_port_queue_init() local
41 for (i = 0; i < NXT_PORT_QUEUE_SIZE; i++) { in nxt_port_queue_init()
42 nxt_nncq_enqueue(&q->free_items, i); in nxt_port_queue_init()
53 nxt_nncq_atomic_t i; in nxt_port_queue_send() local
56 i = nxt_nncq_dequeue(&q->free_items); in nxt_port_queue_send()
67 nxt_nncq_enqueue(&q->queue, i); in nxt_port_queue_send()
71 *notify = (i == 0); in nxt_port_queue_send()
81 nxt_nncq_atomic_t i; in nxt_port_queue_recv() local
84 i = nxt_nncq_dequeue(&q->queue); in nxt_port_queue_recv()
85 if (i == nxt_nncq_empty(&q->queue)) { in nxt_port_queue_recv()
[all …]
H A Dnxt_nvbcq.h49 return i % NXT_NVBCQ_SIZE; in nxt_nvbcq_index()
56 return i % NXT_NVBCQ_SIZE; in nxt_nvbcq_map()
70 nxt_nvbcq_atomic_t i; in nxt_nvbcq_init() local
74 for (i = 0; i < NXT_NVBCQ_SIZE; i++) { in nxt_nvbcq_init()
75 q->entries[i] = NXT_NVBCQ_SIZE; in nxt_nvbcq_init()
85 nxt_nvbcq_atomic_t t, h, i; in nxt_nvbcq_enqueue() local
91 i = nxt_nvbcq_map(q, t); in nxt_nvbcq_enqueue()
93 if (q->entries[i] == NXT_NVBCQ_SIZE in nxt_nvbcq_enqueue()
116 nxt_nvbcq_atomic_t h, t, i, e; in nxt_nvbcq_dequeue() local
122 i = nxt_nvbcq_map(q, h); in nxt_nvbcq_dequeue()
[all …]
H A Dnxt_upstream_round_robin.c66 for (i = 0; i < n; i++) { in nxt_upstream_round_robin_create()
94 for (i = 0; i < n; i++) { in nxt_upstream_round_robin_create()
104 urr->server[i].sockaddr = sa; in nxt_upstream_round_robin_create()
111 urr->server[i].weight = wt; in nxt_upstream_round_robin_create()
156 for (i = 0; i < n; i++) { in nxt_upstream_round_robin_joint_create()
157 urr->server[i] = urrcf->server[i]; in nxt_upstream_round_robin_joint_create()
180 for (i = 0; i < n; i++) { in nxt_upstream_round_robin_server_get()
182 s[i].current_weight += s[i].effective_weight; in nxt_upstream_round_robin_server_get()
185 if (s[i].effective_weight < s[i].weight) { in nxt_upstream_round_robin_server_get()
186 s[i].effective_weight++; in nxt_upstream_round_robin_server_get()
[all …]
H A Dnxt_app_queue.h36 nxt_app_nncq_atomic_t i; in nxt_app_queue_init() local
41 for (i = 0; i < NXT_APP_QUEUE_SIZE; i++) { in nxt_app_queue_init()
55 nxt_app_nncq_atomic_t i; in nxt_app_queue_send() local
57 i = nxt_app_nncq_dequeue(&q->free_items); in nxt_app_queue_send()
67 *cookie = i; in nxt_app_queue_send()
69 nxt_app_nncq_enqueue(&q->queue, i); in nxt_app_queue_send()
105 nxt_app_nncq_atomic_t i; in nxt_app_queue_recv() local
107 i = nxt_app_nncq_dequeue(&q->queue); in nxt_app_queue_recv()
108 if (i == nxt_app_nncq_empty(&q->queue)) { in nxt_app_queue_recv()
117 *cookie = i; in nxt_app_queue_recv()
[all …]
H A Dnxt_upstream.c21 uint32_t i, n, next; in nxt_upstreams_create() local
53 for (i = 0; i < n; i++) { in nxt_upstreams_create()
56 string = nxt_str_dup(mp, &upstreams->upstream[i].name, &name); in nxt_upstreams_create()
78 uint32_t i, n; in nxt_upstream_find() local
88 for (i = 0; i < n; i++) { in nxt_upstream_find()
89 if (nxt_strstr_eq(&upstream[i].name, name)) { in nxt_upstream_find()
90 action->u.upstream_number = i; in nxt_upstream_find()
105 uint32_t i, n; in nxt_upstreams_joint_create() local
127 for (i = 0; i < n; i++) { in nxt_upstreams_joint_create()
128 up[i] = u[i].proto->joint_create(tmcf, &u[i]); in nxt_upstreams_joint_create()
[all …]
H A Dnxt_random.c39 nxt_uint_t i; in nxt_random_start_schedule() local
41 r->i = 0; in nxt_random_start_schedule()
44 for (i = 0; i < 256; i++) { in nxt_random_start_schedule()
45 r->s[i] = i; in nxt_random_start_schedule()
124 val = r->s[r->i]; in nxt_random_add()
130 r->i++; in nxt_random_add()
134 r->i--; in nxt_random_add()
136 r->j = r->i; in nxt_random_add()
165 r->i++; in nxt_random_byte()
166 si = r->s[r->i]; in nxt_random_byte()
[all …]
H A Dnxt_nncq.h46 nxt_nncq_index(nxt_nncq_t const volatile *q, nxt_nncq_atomic_t i) in nxt_nncq_index() argument
48 return i % NXT_NNCQ_SIZE; in nxt_nncq_index()
53 nxt_nncq_map(nxt_nncq_t const volatile *q, nxt_nncq_atomic_t i) in nxt_nncq_map() argument
55 return i % NXT_NNCQ_SIZE; in nxt_nncq_map()
60 nxt_nncq_cycle(nxt_nncq_t const volatile *q, nxt_nncq_atomic_t i) in nxt_nncq_cycle() argument
62 return i / NXT_NNCQ_SIZE; in nxt_nncq_cycle()
67 nxt_nncq_next_cycle(nxt_nncq_t const volatile *q, nxt_nncq_cycle_t i) in nxt_nncq_next_cycle() argument
69 return i + 1; in nxt_nncq_next_cycle()
75 nxt_nncq_atomic_t i) in nxt_nncq_new_entry() argument
77 return cycle * NXT_NNCQ_SIZE + (i % NXT_NNCQ_SIZE); in nxt_nncq_new_entry()
H A Dnxt_app_nncq.h46 nxt_app_nncq_index(nxt_app_nncq_t const volatile *q, nxt_app_nncq_atomic_t i) in nxt_app_nncq_index() argument
48 return i % NXT_APP_NNCQ_SIZE; in nxt_app_nncq_index()
53 nxt_app_nncq_map(nxt_app_nncq_t const volatile *q, nxt_app_nncq_atomic_t i) in nxt_app_nncq_map() argument
55 return i % NXT_APP_NNCQ_SIZE; in nxt_app_nncq_map()
60 nxt_app_nncq_cycle(nxt_app_nncq_t const volatile *q, nxt_app_nncq_atomic_t i) in nxt_app_nncq_cycle() argument
62 return i / NXT_APP_NNCQ_SIZE; in nxt_app_nncq_cycle()
68 nxt_app_nncq_cycle_t i) in nxt_app_nncq_next_cycle() argument
70 return i + 1; in nxt_app_nncq_next_cycle()
77 nxt_app_nncq_atomic_t i) in nxt_app_nncq_new_entry() argument
79 return cycle * NXT_APP_NNCQ_SIZE + (i % NXT_APP_NNCQ_SIZE); in nxt_app_nncq_new_entry()
H A Dnxt_clone.c140 nxt_uint_t i; in nxt_clone_credential_map_set() local
159 for (i = 0; i < map->size; i++) { in nxt_clone_credential_map_set()
161 map->map[i].host, map->map[i].size); in nxt_clone_credential_map_set()
169 if (i+1 < map->size) { in nxt_clone_credential_map_set()
261 nxt_uint_t i; in nxt_clone_vldt_credential_uidmap() local
293 for (i = 0; i < map->size; i++) { in nxt_clone_vldt_credential_uidmap()
294 m = map->map[i]; in nxt_clone_vldt_credential_uidmap()
315 nxt_uint_t i, j; in nxt_clone_vldt_credential_gidmap() local
392 for (i = 0; i < creds->ngroups; i++) { in nxt_clone_vldt_credential_gidmap()
418 for (i = 0; i < map->size; i++) { in nxt_clone_vldt_credential_gidmap()
[all …]
/unit/src/test/
H A Dnxt_cq_test.c60 for (i = 0; i < n; i++) { in mean()
76 for (i = 0; i < n; i++) { in cov()
144 for (i = 0; i < nops / nprocs_cas; i++) { in cas_worker()
164 for (i = 0; i < nops / nprocs_faa; i++) { in faa_worker()
213 for (i = 0; i < nops / nprocs_enq; i++) { in enq_worker()
234 for (i = 0; i < nops / nprocs_deq; i++) { in deq_worker()
255 for (i = 0; i < nops / nprocs_wenq; i++) { in wenq_worker()
280 for (i = 0; i < nops / nprocs_wdeq; i++) { in wdeq_worker()
355 for (i = 1; i < argc; i++) { in main()
439 for(i = 0; i < NXT_CQ_SIZE; i++) { in main()
[all …]
H A Dnxt_rbtree_test.c55 for (i = 0; i < n; i++) { in nxt_rbtree_test()
58 keys[i] = key; in nxt_rbtree_test()
67 for (i = 0; i < n; i++) { in nxt_rbtree_test()
71 for (i = 0; i < n; i++) { in nxt_rbtree_test()
81 i = 0; in nxt_rbtree_test()
90 i, keys[i], item->key); in nxt_rbtree_test()
94 i++; in nxt_rbtree_test()
98 if (i != n) { in nxt_rbtree_test()
103 for (i = 0; i < n; i++) { in nxt_rbtree_test()
220 for (i = 0; i < NXT_RBT_NODES; i++) { in nxt_rbtree_mb_start()
[all …]
H A Dnxt_utf8_test.c48 nxt_uint_t i; in nxt_utf8_overlong() local
65 for (i = 0; i < len; i++) { in nxt_utf8_overlong()
88 nxt_uint_t i, k, l, m; in nxt_utf8_test() local
119 for (i = 0; i < sizeof(invalid); i += 5) { in nxt_utf8_test()
121 len = invalid[i]; in nxt_utf8_test()
122 utf8[0] = invalid[i + 1]; in nxt_utf8_test()
123 utf8[1] = invalid[i + 2]; in nxt_utf8_test()
124 utf8[2] = invalid[i + 3]; in nxt_utf8_test()
134 for (i = 0; i < len; i++) { in nxt_utf8_test()
147 for (i = NXT_UTF8_START_TEST; i < 256; i++) { in nxt_utf8_test()
[all …]
H A Dnxt_rbtree1_test.c83 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
95 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
99 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
100 if (nxt_rbtree1_test_find(&tree, &nodes[i]) != &nodes[i]) { in nxt_rbtree1_test()
107 i = 0; in nxt_rbtree1_test()
114 i, keys[i], node->key); in nxt_rbtree1_test()
118 i++; in nxt_rbtree1_test()
122 if (i != n) { in nxt_rbtree1_test()
127 for (i = 0; i < n; i++) { in nxt_rbtree1_test()
282 for (i = 0; i < NXT_RBT_NODES; i++) { in nxt_rbtree1_mb_start()
[all …]
H A Dnxt_strverscmp_test.c22 nxt_uint_t i; in nxt_strverscmp_test() local
55 for (i = 0; i < nxt_nitems(tests); i++) { in nxt_strverscmp_test()
57 ret = nxt_strverscmp((u_char *) tests[i].v1, (u_char *) tests[i].v2); in nxt_strverscmp_test()
59 switch (tests[i].res) { in nxt_strverscmp_test()
85 tests[i].v1, tests[i].res, tests[i].v2, ret); in nxt_strverscmp_test()
H A Dnxt_base64_test.c14 nxt_uint_t i; in nxt_base64_test() local
72 for (i = 0; i < nxt_nitems(tests); i++) { in nxt_base64_test()
73 ret = nxt_base64_decode(NULL, tests[i].enc.start, tests[i].enc.length); in nxt_base64_test()
75 if (ret == NXT_ERROR && tests[i].dec.start == NULL) { in nxt_base64_test()
79 if ((size_t) ret != tests[i].dec.length) { in nxt_base64_test()
83 &tests[i].enc, ret, tests[i].dec.length); in nxt_base64_test()
87 ret = nxt_base64_decode(buf, tests[i].enc.start, tests[i].enc.length); in nxt_base64_test()
89 if (!nxt_str_eq(&tests[i].dec, buf, (size_t) ret)) { in nxt_base64_test()
H A Dnxt_malloc_test.c27 nxt_uint_t i, tight; in nxt_malloc_run_test() local
33 for (i = 1; i < times; i++) { in nxt_malloc_run_test()
35 p[i] = nxt_malloc(size); in nxt_malloc_run_test()
36 if (p[i] == NULL) { in nxt_malloc_run_test()
40 n = (uintptr_t) p[i]; in nxt_malloc_run_test()
52 for (i = 1; i < times; i++) { in nxt_malloc_run_test()
54 nxt_malloc_usable_size(p[i], s); in nxt_malloc_run_test()
56 if (p[i - 1] + s == p[i] || p[i - 1] == p[i] + s) { in nxt_malloc_run_test()
60 nxt_free(p[i]); in nxt_malloc_run_test()
H A Dnxt_msec_diff_test.c30 nxt_uint_t i; in nxt_msec_diff_test() local
34 for (i = 0; i < nxt_nitems(pairs); i += 2) { in nxt_msec_diff_test()
36 if (!less(pairs[i], pairs[i + 1])) { in nxt_msec_diff_test()
39 pairs[i], pairs[i + 1]); in nxt_msec_diff_test()
H A Dnxt_lvlhsh_test.c123 nxt_uint_t i; in nxt_lvlhsh_test() local
157 for (i = 0; i < n; i++) { in nxt_lvlhsh_test()
162 "lvlhsh add test failed at %ui", i); in nxt_lvlhsh_test()
168 for (i = 0; i < n; i++) { in nxt_lvlhsh_test()
178 for (i = 0; i < n + 1; i++) { in nxt_lvlhsh_test()
184 if (i != n) { in nxt_lvlhsh_test()
190 for (i = 0; i < n; i++) { in nxt_lvlhsh_test()
204 if (i != n) { in nxt_lvlhsh_test()
217 for (i = 0; i < n; i++) { in nxt_lvlhsh_test()
227 for (i = 0; i < n; i++) { in nxt_lvlhsh_test()
[all …]
H A Dnxt_sprintf_test.c46 nxt_uint_t i; in nxt_sprintf_test() local
53 for (i = 0; i < nxt_nitems(double_test); i++) { in nxt_sprintf_test()
55 ret = nxt_sprintf_test_double(buf, end, double_test[i].format, in nxt_sprintf_test()
56 double_test[i].test, in nxt_sprintf_test()
57 double_test[i].number); in nxt_sprintf_test()
64 double_test[i].format, double_test[i].test, buf); in nxt_sprintf_test()
H A Dnxt_term_parse_test.c40 nxt_uint_t i; in nxt_term_parse_test() local
45 for (i = 0; i < nxt_nitems(terms); i++) { in nxt_term_parse_test()
47 s = &terms[i].string; in nxt_term_parse_test()
48 val = nxt_term_parse(s->start, s->length, terms[i].is_sec); in nxt_term_parse_test()
50 if (val != terms[i].value) { in nxt_term_parse_test()
53 s, terms[i].value, val); in nxt_term_parse_test()
/unit/auto/echo/
H A Decho.c23 int i = 1; in main() local
29 i++; in main()
32 while (i < argc) { in main()
33 printf("%s%s", argv[i], (i == argc - 1) ? "" : " "); in main()
34 i++; in main()
/unit/src/python/
H A Dnxt_python.c214 for (i = 0; /* void */; i++) { in nxt_python_start()
244 for (i = 1; i < targets->count; i++) { in nxt_python_start()
456 uint32_t i; in nxt_python_init_threads() local
494 for (i = 0; i < c->threads - 1; i++) { in nxt_python_init_threads()
511 uint32_t i; in nxt_python_ready_handler() local
521 for (i = 0; i < c->threads - 1; i++) { in nxt_python_ready_handler()
586 uint32_t i; in nxt_python_join_threads() local
596 for (i = 0; i < c->threads - 1; i++) { in nxt_python_join_threads()
616 for (i = 0; i < c->threads - 1; i++) { in nxt_python_join_threads()
670 nxt_int_t i; in nxt_python_atexit() local
[all …]
/unit/src/java/nginx/unit/websocket/pojo/
H A DPojoMethodMapping.java285 for (int i = 0; i < types.length; i++) { in getPathParams()
286 Class<?> type = types[i]; in getPathParams()
319 if (result[i] == null) { in getPathParams()
340 for (int i = 0; i < pathParams.length; i++) { in buildArgs()
343 result[i] = session; in buildArgs()
345 result[i] = config; in buildArgs()
347 result[i] = throwable; in buildArgs()
349 result[i] = closeReason; in buildArgs()
390 for (int i = 0; i < types.length; i++) { in MessageHandlerInfo()
397 Integer.valueOf(i), new PojoPathParam(types[i], in MessageHandlerInfo()
[all …]
/unit/test/python/threading/
H A Dwsgi.py20 i = 0
22 self.log_index(i)
23 i += 1
25 self.log_index(i)
26 i += 1

123456