| /dports/emulators/qemu42/qemu-4.2.1/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu/qemu-6.2.0/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu60/qemu-6.0.0/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu-utils/qemu-4.2.1/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu5/qemu-5.2.0/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu-guest-agent/qemu-5.0.1/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu-cheri/qemu-0a323821042c36e21ea80e58b9545dfc3b0cb8ef/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu-devel/qemu-de8ed1055c2ce18c95f597eb10df360dcb534f99/hw/ipmi/ |
| H A D | ipmi_bt.c | 83 if (ib->use_irq && ib->irqs_enabled && ib->raise_irq) { in ipmi_bt_raise_irq()
84 ib->raise_irq(ib); in ipmi_bt_raise_irq()
91 ib->lower_irq(ib); in ipmi_bt_lower_irq()
115 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
116 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
141 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
142 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
145 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
197 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
263 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/emulators/qemu-powernv/qemu-powernv-3.0.50/hw/ipmi/ |
| H A D | isa_ipmi_bt.c | 125 if (ib->inmsg[0] != (ib->inlen - 1)) { in ipmi_bt_handle_event()
135 ib->outmsg[1] = ib->inmsg[1] | 0x04; in ipmi_bt_handle_event()
136 ib->outmsg[2] = ib->inmsg[2]; in ipmi_bt_handle_event()
137 ib->outmsg[3] = ib->inmsg[3]; in ipmi_bt_handle_event()
163 ib->waiting_seq = ib->inmsg[2]; in ipmi_bt_handle_event()
164 ib->inmsg[2] = ib->inmsg[1]; in ipmi_bt_handle_event()
167 bk->handle_command(ib->bmc, ib->inmsg + 2, ib->inlen - 2, in ipmi_bt_handle_event()
220 if (ib->outpos < ib->outlen) { in ipmi_bt_ioport_read()
221 ret = ib->outmsg[ib->outpos]; in ipmi_bt_ioport_read()
283 ib->inmsg[ib->inlen] = val; in ipmi_bt_ioport_write()
[all …]
|
| /dports/science/berkeleygw/BGW-2.0.0/MeanField/SAPO/ |
| H A D | ortho.f90 | 110 wfnspdummy(1:ib-1)=wfnsp(1:ib-1)
220 isrtort(ib,is,ik)=ib
224 isrtort(ib,is,ik)=nbinp+1-ib
238 isrtort(ib,is,ik)=ib
241 isrtort(ib,is,ik)=ib+nbpw
244 isrtort(ib,is,ik)=ib-nbaux
248 isrtort(ib,is,ik)=nbinp+1-ib
258 ensrt(ib-nbinp)=en(ib,ik,is)
264 isrtort(ib,is,ik)=ib
344 en(ib,ik,is)=ensrt(ib)
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate_copy.pass.cpp | 43 int ib[sa] = {0}; in test() local
50 assert(ib[0] == 0); in test()
54 assert(ib[0] == 0); in test()
58 assert(ib[0] == 0); in test()
59 assert(ib[1] == 1); in test()
63 assert(ib[0] == 1); in test()
64 assert(ib[1] == 0); in test()
68 assert(ib[0] == 0); in test()
69 assert(ib[1] == 1); in test()
73 assert(ib[0] == 0); in test()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate_copy.pass.cpp | 43 int ib[sa] = {0}; in test() local
50 assert(ib[0] == 0); in test()
54 assert(ib[0] == 0); in test()
58 assert(ib[0] == 0); in test()
59 assert(ib[1] == 1); in test()
63 assert(ib[0] == 1); in test()
64 assert(ib[1] == 0); in test()
68 assert(ib[0] == 0); in test()
69 assert(ib[1] == 1); in test()
73 assert(ib[0] == 0); in test()
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate_copy.pass.cpp | 43 int ib[sa] = {0}; in test() local
50 assert(ib[0] == 0); in test()
54 assert(ib[0] == 0); in test()
58 assert(ib[0] == 0); in test()
59 assert(ib[1] == 1); in test()
63 assert(ib[0] == 1); in test()
64 assert(ib[1] == 0); in test()
68 assert(ib[0] == 0); in test()
69 assert(ib[1] == 1); in test()
73 assert(ib[0] == 0); in test()
[all …]
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| H A D | rotate_copy.pass.cpp | 43 int ib[sa] = {0}; in test() local
50 assert(ib[0] == 0); in test()
54 assert(ib[0] == 0); in test()
58 assert(ib[0] == 0); in test()
59 assert(ib[1] == 1); in test()
63 assert(ib[0] == 1); in test()
64 assert(ib[1] == 0); in test()
68 assert(ib[0] == 0); in test()
69 assert(ib[1] == 1); in test()
73 assert(ib[0] == 0); in test()
[all …]
|
| /dports/x11-wm/afterstep-stable/afterstep-devel-2.2.12/libASGTK/ |
| H A D | asgtkimagebrowser.c | 126 return mystrndup (ib->current_dir, sep - ib->current_dir); in asgtk_image_browser_make_fullfilename()
205 if (ib->path_entry) { in asgtk_image_browser_path_entry()
218 if (ib) { in asgtk_image_browser_path_changed()
290 if (ib) { in asgtk_image_browser_file_sel_handler()
303 ASGtkImageBrowser *ib; in asgtk_image_browser_new() local
345 if (ib->path_entry) in asgtk_image_browser_new()
438 asgtk_image_view_add_detail (ib->preview, ib->scale_check_box, 0); in asgtk_image_browser_new()
442 ib); in asgtk_image_browser_new()
483 ib->current_dir ? ib->current_dir : "null"); in asgtk_image_browser_refresh()
544 if (ib->current_dir == NULL || strcmp (ib->current_dir, "/") != 0) { in asgtk_image_browser_refresh()
[all …]
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/buildtools/third_party/libc++/trunk/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/libc++/libcxx-10.0.1.src/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| H A D | is_permutation.pass.cpp | 26 int ib[] = {1, 1, 0}; in test_constexpr() local
30 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) in test_constexpr()
31 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr()
32 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr()
42 const int ib[] = {0}; in main() local
69 const int ib[] = {1}; in main() local
84 const int ib[] = {0, 0}; in main() local
102 const int ib[] = {0, 1}; in main() local
116 const int ib[] = {1, 0}; in main() local
130 const int ib[] = {1, 1}; in main() local
[all …]
|