/dports/irc/irssi/irssi-1.2.3/src/irc/dcc/ |
H A D | dcc-queue.c | 34 static GPtrArray *queuelist; variable 41 for (i = 0; i < queuelist->len; i++) { in dcc_queue_old() 71 for (i = 0; i < queuelist->len; i++) { in dcc_queue_new() 72 if (g_ptr_array_index(queuelist, i) == NULL) in dcc_queue_new() 76 if (i == queuelist->len) in dcc_queue_new() 77 g_ptr_array_set_size(queuelist, (i + 1) * 2); in dcc_queue_new() 177 qlist = g_ptr_array_index(queuelist, queue); in dcc_queue_get_next() 198 for (i = 0; i < queuelist->len; i++) { in sig_dcc_destroyed() 212 queuelist = g_ptr_array_new(); in dcc_queue_init() 221 for (i = 0; i < queuelist->len; i++) in dcc_queue_deinit() [all …]
|
/dports/comms/tkscanfax/tkscanfax1/ |
H A D | fax-queue.tcl | 113 set fax(queuelist) $wn.1.2 145 bind $fax(queuelist) <Double-Button> fax_queue_view 158 bind $fax(queuelist) <Button> fax_queue_setcur 169 $fax(queuelist) configure -state normal 170 $fax(queuelist) delete 1.0 end 282 if { $nline < 1 } { $fax(queuelist) insert end "$header" } 331 $fax(queuelist) insert end $iline 340 $fax(queuelist) delete {end -1 char} 346 $fax(queuelist) configure -state disabled 353 if [winfo exist $fax(queuelist)] { [all …]
|
/dports/devel/hs-git-annex/git-annex-8.20210903/Assistant/ |
H A D | TransferQueue.hs | 45 getTransferQueue = (atomically . readTList . queuelist) <<~ transferQueue 150 l <- readTList (queuelist q) 154 void $ modlist (queuelist q) (t, info) 194 else readTList (queuelist q) >>= \case 198 setTList (queuelist q) rest 230 !(removed, ts) <- partition (c . fst) <$> readTList (queuelist q) 233 setTList (queuelist q) ts
|
/dports/science/jstrack/jstrack/extlib/tcllib1.19/struct/ |
H A D | prioqueue.tcl | 390 set queuelist $queues($name) 392 set foundat [lsearch -glob $queuelist $itemrep] 397 set queues($name) [lreplace $queuelist $foundat $foundat] 406 set queuelist $queues($name) 407 set foundat [lsearch -index 1 -exact $queuelist $item] 412 set queues($name) [lreplace $queuelist $foundat $foundat]
|
/dports/devel/tcllib/tcllib-1.20/modules/struct/ |
H A D | prioqueue.tcl | 390 set queuelist $queues($name) 392 set foundat [lsearch -glob $queuelist $itemrep] 397 set queues($name) [lreplace $queuelist $foundat $foundat] 406 set queuelist $queues($name) 407 set foundat [lsearch -index 1 -exact $queuelist $item] 412 set queues($name) [lreplace $queuelist $foundat $foundat]
|
/dports/devel/tcllibc/tcllib-1.20/modules/struct/ |
H A D | prioqueue.tcl | 390 set queuelist $queues($name) 392 set foundat [lsearch -glob $queuelist $itemrep] 397 set queues($name) [lreplace $queuelist $foundat $foundat] 406 set queuelist $queues($name) 407 set foundat [lsearch -index 1 -exact $queuelist $item] 412 set queues($name) [lreplace $queuelist $foundat $foundat]
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/block/ |
H A D | mq-deadline.c | 115 list_del_init(&rq->queuelist); in deadline_remove_request() 149 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) { in dd_merged_requests() 152 list_move(&req->queuelist, &next->queuelist); in dd_merged_requests() 223 list_for_each_entry(rq, &dd->fifo_list[WRITE], queuelist) { in deadline_fifo_request() 280 rq = list_first_entry(&dd->dispatch, struct request, queuelist); in __dd_dispatch_request() 281 list_del_init(&rq->queuelist); in __dd_dispatch_request() 503 list_add(&rq->queuelist, &dd->dispatch); in dd_insert_request() 517 list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]); in dd_insert_request() 531 rq = list_first_entry(list, struct request, queuelist); in dd_insert_requests() 532 list_del_init(&rq->queuelist); in dd_insert_requests()
|
H A D | blk-mq-sched.c | 81 struct request *rqa = container_of(a, struct request, queuelist); in sched_rq_cmp() 82 struct request *rqb = container_of(b, struct request, queuelist); in sched_rq_cmp() 90 list_first_entry(rq_list, struct request, queuelist)->mq_hctx; in blk_mq_dispatch_hctx_list() 95 list_for_each_entry(rq, rq_list, queuelist) { in blk_mq_dispatch_hctx_list() 97 list_cut_before(&hctx_list, rq_list, &rq->queuelist); in blk_mq_dispatch_hctx_list() 170 list_add_tail(&rq->queuelist, &rq_list); in __blk_mq_do_dispatch_sched() 273 list_add(&rq->queuelist, &rq_list); in blk_mq_do_dispatch_ctx() 459 list_add(&rq->queuelist, &list); in blk_mq_sched_insert_request()
|
H A D | blk-mq.c | 301 INIT_LIST_HEAD(&rq->queuelist); in blk_mq_rq_ctx_init() 759 BUG_ON(!list_empty(&rq->queuelist)); in blk_mq_requeue_request() 780 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 794 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 1254 list_add(&rq->queuelist, list); in blk_mq_handle_dev_resource() 1267 list_add(&rq->queuelist, zone_list); in blk_mq_handle_zone_resource() 1320 list_for_each_entry(rq, list, queuelist) { in blk_mq_release_budgets() 1358 list_del_init(&rq->queuelist); in blk_mq_dispatch_rq_list() 2116 queuelist); in blk_mq_try_issue_list_directly() 2118 list_del_init(&rq->queuelist); in blk_mq_try_issue_list_directly() [all …]
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/block/ |
H A D | mq-deadline.c | 115 list_del_init(&rq->queuelist); in deadline_remove_request() 149 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) { in dd_merged_requests() 152 list_move(&req->queuelist, &next->queuelist); in dd_merged_requests() 223 list_for_each_entry(rq, &dd->fifo_list[WRITE], queuelist) { in deadline_fifo_request() 280 rq = list_first_entry(&dd->dispatch, struct request, queuelist); in __dd_dispatch_request() 281 list_del_init(&rq->queuelist); in __dd_dispatch_request() 503 list_add(&rq->queuelist, &dd->dispatch); in dd_insert_request() 517 list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]); in dd_insert_request() 531 rq = list_first_entry(list, struct request, queuelist); in dd_insert_requests() 532 list_del_init(&rq->queuelist); in dd_insert_requests()
|
H A D | blk-mq-sched.c | 81 struct request *rqa = container_of(a, struct request, queuelist); in sched_rq_cmp() 82 struct request *rqb = container_of(b, struct request, queuelist); in sched_rq_cmp() 90 list_first_entry(rq_list, struct request, queuelist)->mq_hctx; in blk_mq_dispatch_hctx_list() 95 list_for_each_entry(rq, rq_list, queuelist) { in blk_mq_dispatch_hctx_list() 97 list_cut_before(&hctx_list, rq_list, &rq->queuelist); in blk_mq_dispatch_hctx_list() 170 list_add_tail(&rq->queuelist, &rq_list); in __blk_mq_do_dispatch_sched() 273 list_add(&rq->queuelist, &rq_list); in blk_mq_do_dispatch_ctx() 459 list_add(&rq->queuelist, &list); in blk_mq_sched_insert_request()
|
H A D | blk-mq.c | 301 INIT_LIST_HEAD(&rq->queuelist); in blk_mq_rq_ctx_init() 759 BUG_ON(!list_empty(&rq->queuelist)); in blk_mq_requeue_request() 780 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 794 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 1254 list_add(&rq->queuelist, list); in blk_mq_handle_dev_resource() 1267 list_add(&rq->queuelist, zone_list); in blk_mq_handle_zone_resource() 1320 list_for_each_entry(rq, list, queuelist) { in blk_mq_release_budgets() 1358 list_del_init(&rq->queuelist); in blk_mq_dispatch_rq_list() 2116 queuelist); in blk_mq_try_issue_list_directly() 2118 list_del_init(&rq->queuelist); in blk_mq_try_issue_list_directly() [all …]
|
/dports/multimedia/libv4l/linux-5.13-rc2/block/ |
H A D | mq-deadline.c | 115 list_del_init(&rq->queuelist); in deadline_remove_request() 149 if (!list_empty(&req->queuelist) && !list_empty(&next->queuelist)) { in dd_merged_requests() 152 list_move(&req->queuelist, &next->queuelist); in dd_merged_requests() 223 list_for_each_entry(rq, &dd->fifo_list[WRITE], queuelist) { in deadline_fifo_request() 280 rq = list_first_entry(&dd->dispatch, struct request, queuelist); in __dd_dispatch_request() 281 list_del_init(&rq->queuelist); in __dd_dispatch_request() 503 list_add(&rq->queuelist, &dd->dispatch); in dd_insert_request() 517 list_add_tail(&rq->queuelist, &dd->fifo_list[data_dir]); in dd_insert_request() 531 rq = list_first_entry(list, struct request, queuelist); in dd_insert_requests() 532 list_del_init(&rq->queuelist); in dd_insert_requests()
|
H A D | blk-mq-sched.c | 81 struct request *rqa = container_of(a, struct request, queuelist); in sched_rq_cmp() 82 struct request *rqb = container_of(b, struct request, queuelist); in sched_rq_cmp() 90 list_first_entry(rq_list, struct request, queuelist)->mq_hctx; in blk_mq_dispatch_hctx_list() 95 list_for_each_entry(rq, rq_list, queuelist) { in blk_mq_dispatch_hctx_list() 97 list_cut_before(&hctx_list, rq_list, &rq->queuelist); in blk_mq_dispatch_hctx_list() 170 list_add_tail(&rq->queuelist, &rq_list); in __blk_mq_do_dispatch_sched() 273 list_add(&rq->queuelist, &rq_list); in blk_mq_do_dispatch_ctx() 459 list_add(&rq->queuelist, &list); in blk_mq_sched_insert_request()
|
H A D | blk-mq.c | 301 INIT_LIST_HEAD(&rq->queuelist); in blk_mq_rq_ctx_init() 759 BUG_ON(!list_empty(&rq->queuelist)); in blk_mq_requeue_request() 780 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 794 list_del_init(&rq->queuelist); in blk_mq_requeue_work() 1254 list_add(&rq->queuelist, list); in blk_mq_handle_dev_resource() 1267 list_add(&rq->queuelist, zone_list); in blk_mq_handle_zone_resource() 1320 list_for_each_entry(rq, list, queuelist) { in blk_mq_release_budgets() 1358 list_del_init(&rq->queuelist); in blk_mq_dispatch_rq_list() 2116 queuelist); in blk_mq_try_issue_list_directly() 2118 list_del_init(&rq->queuelist); in blk_mq_try_issue_list_directly() [all …]
|
/dports/sysutils/enteruser/enteruser-1.0/ |
H A D | enteruser | 31 sub queuelist; 123 &queuelist(@userqueue); 168 sub queuelist { 184 &queuelist(@userlist);
|
/dports/www/rt50/rt-5.0.2/t/web/ |
H A D | queue_caching.t | 243 my $queuelist; 245 $queuelist->{$q->Id} = $q->Name; 247 return $queuelist; 265 ok(my $queuelist = $form->find_input('Queue','option'), "Found queue select"); 266 @queue_ids = $queuelist->possible_values; 267 @queue_names = $queuelist->value_names;
|
/dports/www/rt44/rt-4.4.5/t/web/ |
H A D | queue_caching.t | 244 my $queuelist; 246 $queuelist->{$q->Id} = $q->Name; 248 return $queuelist; 263 ok(my $queuelist = $form->find_input('Queue','option'), "Found queue select"); 264 @queue_ids = $queuelist->possible_values; 265 @queue_names = $queuelist->value_names;
|
/dports/graphics/xaos/XaoS-release-4.2.1/src/util/ |
H A D | xmenu.cpp | 19 static struct queuelist { struct 20 struct queuelist *next; argument 21 struct queuelist *previous; argument 41 list = (struct entry *)calloc(1, sizeof(struct queuelist)); in x_menu_insert() argument 160 struct queuelist *list; in menu_addqueue() 161 list = (struct queuelist *)calloc(1, sizeof(struct queuelist)); in menu_addqueue() 180 struct queuelist *list = firstqueue; in menu_delqueue()
|
/dports/multimedia/v4l_compat/linux-5.13-rc2/include/linux/ |
H A D | elevator.h | 166 #define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist) 167 #define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
|
/dports/multimedia/v4l-utils/linux-5.13-rc2/include/linux/ |
H A D | elevator.h | 166 #define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist) 167 #define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
|
/dports/multimedia/libv4l/linux-5.13-rc2/include/linux/ |
H A D | elevator.h | 166 #define rq_entry_fifo(ptr) list_entry((ptr), struct request, queuelist) 167 #define rq_fifo_clear(rq) list_del_init(&(rq)->queuelist)
|
/dports/security/samhain-server/samhain-4.4.3/src/ |
H A D | sh_log_evalrule.c | 121 static struct sh_qeval * queuelist = NULL; variable 386 nq->next = queuelist; in sh_eval_qadd() 387 queuelist = nq; in sh_eval_qadd() 396 struct sh_qeval * retval = queuelist; in sh_log_find_queue() 790 qtmp = queuelist; in sh_eval_cleanup() 794 queuelist = qtmp->next; in sh_eval_cleanup() 796 qtmp = queuelist; in sh_eval_cleanup() 812 queuelist = NULL; in sh_eval_cleanup()
|
/dports/security/samhain/samhain-4.4.3/src/ |
H A D | sh_log_evalrule.c | 121 static struct sh_qeval * queuelist = NULL; variable 386 nq->next = queuelist; in sh_eval_qadd() 387 queuelist = nq; in sh_eval_qadd() 396 struct sh_qeval * retval = queuelist; in sh_log_find_queue() 790 qtmp = queuelist; in sh_eval_cleanup() 794 queuelist = qtmp->next; in sh_eval_cleanup() 796 qtmp = queuelist; in sh_eval_cleanup() 812 queuelist = NULL; in sh_eval_cleanup()
|
/dports/security/samhain-client/samhain-4.4.3/src/ |
H A D | sh_log_evalrule.c | 121 static struct sh_qeval * queuelist = NULL; variable 386 nq->next = queuelist; in sh_eval_qadd() 387 queuelist = nq; in sh_eval_qadd() 396 struct sh_qeval * retval = queuelist; in sh_log_find_queue() 790 qtmp = queuelist; in sh_eval_cleanup() 794 queuelist = qtmp->next; in sh_eval_cleanup() 796 qtmp = queuelist; in sh_eval_cleanup() 812 queuelist = NULL; in sh_eval_cleanup()
|