| /dports/games/freeorion/freeorion-0.4.10.2/default/python/AI/ |
| H A D | ResearchAI.py | 723 insert_idx = min(insert_idx, research_queue_list.index("SHP_DEFLECTOR_SHIELD"))
758 insert_idx = 1 + research_queue_list.index(artif_minds)
760 insert_idx = 1
761 res = fo.issueEnqueueTechOrder(nest_tech, insert_idx)
845 insert_idx = num_techs_accelerated
905 …insert_idx = (1 + insert_idx) if "LRN_FORCE_FIELD" not in research_queue_list else max(1 + insert_…
910 insert_idx += 1
943 insert_idx = num_techs_accelerated
966 insert_idx = num_techs_accelerated
972 insert_idx += 1
[all …]
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib-http/ |
| H A D | http-server-resource.c | 31 unsigned int insert_idx; in http_server_location_add() local
38 http_server_location_cmp, &insert_idx)) in http_server_location_add()
39 return array_idx_elem(&server->locations, insert_idx); in http_server_location_add()
43 array_insert(&server->locations, insert_idx, &loc, 1); in http_server_location_add()
54 unsigned int insert_idx; in http_server_location_find() local
64 http_server_location_cmp, &insert_idx)) { in http_server_location_find()
66 *loc_r = array_idx_elem(&server->locations, insert_idx); in http_server_location_find()
70 if (insert_idx == 0) { in http_server_location_find()
74 loc = array_idx_elem(&server->locations, insert_idx-1); in http_server_location_find()
|
| H A D | http-client-queue.c | 851 unsigned int insert_idx; in http_client_queue_submit_now() local
856 http_client_queue_request_timeout_cmp, &insert_idx); in http_client_queue_submit_now()
857 array_insert(req_queue, insert_idx, &req, 1); in http_client_queue_submit_now()
928 unsigned int insert_idx; in http_client_queue_submit_request() local
956 unsigned int insert_idx; in http_client_queue_submit_request() local
961 http_client_queue_request_timeout_cmp, &insert_idx); in http_client_queue_submit_request()
962 array_insert(&queue->requests, insert_idx, &req, 1); in http_client_queue_submit_request()
965 if (insert_idx == 0) { in http_client_queue_submit_request()
987 http_client_queue_delayed_cmp, &insert_idx); in http_client_queue_submit_request()
988 array_insert(&queue->delayed_requests, insert_idx, in http_client_queue_submit_request()
[all …]
|
| /dports/games/retroarch/RetroArch-1.9.7/gfx/include/userland/containers/core/ |
| H A D | containers_list.c | 148 uint32_t insert_idx; in vc_containers_list_insert() local
156 match = vc_containers_list_find_index(list, new_entry, &insert_idx); in vc_containers_list_insert()
157 insert_ptr = (char *)list->entries + entry_size * insert_idx; in vc_containers_list_insert()
173 if (insert_idx < list->size) in vc_containers_list_insert()
174 memmove(insert_ptr + entry_size, insert_ptr, (list->size - insert_idx) * entry_size); in vc_containers_list_insert()
|
| /dports/games/emptyepsilon/EmptyEpsilon-EE-2021.06.23/src/ |
| H A D | pathPlanner.cpp | 89 insert_idx = 0; in plan()
96 if (insert_idx < route.size()) in plan()
98 if (insert_idx > 0) in plan()
99 p0 = route[insert_idx - 1]; in plan()
100 sf::Vector2f p1 = route[insert_idx]; in plan()
105 route.insert(route.begin() + insert_idx, new_point); in plan()
107 insert_idx++; in plan()
134 insert_idx = 0; in plan()
|
| /dports/lang/clover/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/libosmesa-gallium/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/libosmesa/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-gallium-xa/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-libs/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-gallium-va/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-gallium-vdpau/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-dri-gallium/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-devel/mesa-22.0-branchpoint-2059-ge8a63cf61ec/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/graphics/mesa-dri/mesa-21.3.6/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 82 int insert_idx; /* Instruction to move in front of */ member
89 insert_idx = -1; /* to be initialized later */ in UpwardsCursor()
92 bool has_insert_idx() const { return insert_idx != -1; } in has_insert_idx()
162 assert(insert_idx_clause < insert_idx); in verify_invariants()
172 for (int i = insert_idx_clause; i < insert_idx; ++i) { in verify_invariants()
273 cursor.insert_idx--; in downwards_move()
308 assert(insert_idx < source_idx); in verify_invariants()
311 for (int i = insert_idx; i < source_idx; ++i) { in verify_invariants()
348 cursor.insert_idx = cursor.source_idx; in upwards_update_insert_idx()
386 register_demand[cursor.insert_idx] = new_demand; in upwards_move()
[all …]
|
| /dports/net/ptunnel/PingTunnel/ |
| H A D | ptunnel.c | 1286 ring[*insert_idx].pkt = pkt; in queue_packet()
1294 *first_ack = *insert_idx; in queue_packet()
1296 (*insert_idx)++; in queue_packet()
1298 *insert_idx = 0; in queue_packet()
1374 (*insert_idx)++; in handle_data()
1376 else if (ring[*insert_idx]) in handle_data()
1381 *insert_idx = 0; in handle_data()
1383 while (ring[*insert_idx]) { in handle_data()
1386 (*insert_idx)++; in handle_data()
1388 *insert_idx = 0; in handle_data()
[all …]
|
| H A D | ptunnel.h | 401 …t16_t id_no, uint16_t icmp_id, uint16_t *seq, icmp_desc_t ring[], int *insert_idx, int *await_send…
403 …t_t *pkt, int total_len, forward_desc_t *ring[], int *await_send, int *insert_idx, uint16_t *next_…
404 …, icmp_desc_t ring[], int *packets_awaiting_ack, int one_ack_only, int insert_idx, int *first_ack,…
|
| /dports/graphics/mesa-dri-classic/mesa-20.2.3/src/amd/compiler/ |
| H A D | aco_scheduler.cpp | 67 int insert_idx, insert_idx_clause; member
127 insert_idx = current_idx + 1; in downwards_init()
202 insert_idx--; in downwards_move()
232 insert_idx = -1; in upwards_init()
255 insert_idx = before; in upwards_set_insert_idx()
261 assert(insert_idx >= 0); in upwards_move()
289 move_element(register_demand, source_idx, insert_idx); in upwards_move()
290 for (int i = insert_idx + 1; i <= source_idx; i++) in upwards_move()
292 register_demand[insert_idx] = new_demand; in upwards_move()
295 insert_idx++; in upwards_move()
[all …]
|
| /dports/audio/muse-sequencer/muse-4.0.0/src/muse/marker/ |
| H A D | markerview.cpp | 446 int insert_idx; in updateList() local
461 insert_idx = -1; in updateList()
473 if(found_item && insert_idx != -1 && prev_frame_found && next_frame_found) in updateList()
480 if(insert_idx == -1 && m_frame < mitem_frame) in updateList()
481 insert_idx = mitem_idx; in updateList()
526 if(found_item_idx <= insert_idx) in updateList()
528 if(insert_idx > 0) in updateList()
529 --insert_idx; in updateList()
536 if(insert_idx != -1) in updateList()
537 table->insertTopLevelItem(insert_idx, new_item); in updateList()
|
| /dports/security/py-angr/angr-9.0.5405/angr/analyses/decompiler/ |
| H A D | utils.py | 160 def insert_node(parent, insert_idx, node, node_idx, label=None, insert_location=None): argument
163 parent.nodes.insert(insert_idx, node)
169 parent.nodes.insert(insert_idx, node)
174 insert_node(parent.true_node, insert_idx - node_idx, node, 0)
178 insert_node(parent.false_node, insert_idx - node_idx, node, 0)
|
| /dports/mail/dovecot/dovecot-2.3.17/src/lib-storage/ |
| H A D | mailbox-attribute.c | 48 unsigned int insert_idx; in mailbox_attribute_register_internal() local
58 iattr, mailbox_attribute_internal_cmp, &insert_idx); in mailbox_attribute_register_internal()
62 array_insert(&mailbox_internal_attributes, insert_idx, &ireg, 1); in mailbox_attribute_register_internal()
103 unsigned int insert_idx; in mailbox_internal_attribute_get_int() local
111 &insert_idx)) { in mailbox_internal_attribute_get_int()
113 return array_idx(&mailbox_internal_attributes, insert_idx); in mailbox_internal_attribute_get_int()
115 if (insert_idx == 0) { in mailbox_internal_attribute_get_int()
119 iattr = array_idx(&mailbox_internal_attributes, insert_idx-1); in mailbox_internal_attribute_get_int()
|
| /dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/mysql-test/suite/innodb/include/ |
| H A D | innodb_bulk_inject_errors.inc | 34 LET $insert_idx = 1;
36 WHILE ($insert_idx <= $insert_cnt)
39 INC $insert_idx;
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/depot_tools/ |
| H A D | git_footers.py | 152 insert_idx = max(after_indices) + 1
154 insert_idx = min(before_indices)
156 insert_idx = len(footer_lines)
157 footer_lines.insert(insert_idx, new_footer)
|
| /dports/audio/sayonara/sayonara-player-5bbf1399332d5d59362ad03bf625f9132be72206/test/Util/ |
| H A D | MetaDataListTest.cpp | 51 int insert_idx = 8; in insert_test() local
56 v_md.insertTracks(inserted_md, insert_idx); in insert_test()
60 for(int i=0; i<insert_idx; i++) { in insert_test()
66 unique_ids2 << v_md[i + insert_idx].uniqueId(); in insert_test()
71 for(int i=insert_idx; i<v_md_orig.count(); i++) in insert_test()
|
| /dports/multimedia/audacious/audacious-4.1/src/libaudqt/ |
| H A D | eq-preset-qt.cc | 117 int insert_idx = rowCount(); in add_preset() local
122 insert_idx = row; in add_preset()
127 setItem(insert_idx, new PresetItem(preset)); in add_preset()
130 return index(insert_idx, 0); in add_preset()
|