| /external/curl/lib/ |
| sigpipe.h | 42 struct sigpipe_ignore *ig)
46 ig->no_signal = data->set.no_signal;
50 memset(&ig->old_pipe_act, 0, sizeof(struct sigaction));
51 sigaction(SIGPIPE, NULL, &ig->old_pipe_act);
52 action = ig->old_pipe_act;
64 static void sigpipe_restore(struct sigpipe_ignore *ig)
66 if(!ig->no_signal)
68 sigaction(SIGPIPE, &ig->old_pipe_act, NULL);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 155 int ig[] = {0, 1, 2, 3, 4, 5}; local
156 const int sg = static_cast<int>(sizeof(ig)/sizeof(ig[0]));
157 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
158 assert(base(r) == ig+sg);
159 assert(ig[0] == 0);
160 assert(ig[1] == 1);
161 assert(ig[2] == 2)
359 std::unique_ptr<int> ig[6]; local
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 156 int ig[] = {0, 1, 2, 3, 4, 5}; local
157 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
158 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
159 assert(base(r) == ig+sg);
160 assert(ig[0] == 0);
161 assert(ig[1] == 1);
162 assert(ig[2] == 2)
360 std::unique_ptr<int> ig[6]; local
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| rotate.pass.cpp | 156 int ig[] = {0, 1, 2, 3, 4, 5}; local
157 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
158 r = std::rotate(Iter(ig), Iter(ig), Iter(ig+sg));
159 assert(base(r) == ig+sg);
160 assert(ig[0] == 0);
161 assert(ig[1] == 1);
162 assert(ig[2] == 2)
360 std::unique_ptr<int> ig[6]; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 64 int ig[] = {0, 0, 1, 1}; local
65 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
66 r = std::unique(Iter(ig), Iter(ig+sg));
67 assert(base(r) == ig + 2);
68 assert(ig[0] == 0);
69 assert(ig[1] == 1);
139 Ptr ig[4]; local
140 ig[2].reset(&one)
[all...] |
| unique_pred.pass.cpp | 84 int ig[] = {0, 0, 1, 1}; local
85 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
87 r = std::unique(Iter(ig), Iter(ig+sg), count_equal());
88 assert(base(r) == ig + 2);
89 assert(ig[0] == 0);
90 assert(ig[1] == 1);
175 Ptr ig[4]; local
176 ig[2].reset(&one)
[all...] |
| unique_copy.pass.cpp | 68 const int ig[] = {0, 0, 1, 1}; local
69 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
71 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg));
|
| unique_copy_pred.pass.cpp | 89 const int ig[] = {0, 0, 1, 1}; local
90 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
93 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal());
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 64 int ig[] = {0, 0, 1, 1}; local
65 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
66 r = std::unique(Iter(ig), Iter(ig+sg));
67 assert(base(r) == ig + 2);
68 assert(ig[0] == 0);
69 assert(ig[1] == 1);
139 Ptr ig[4]; local
140 ig[2].reset(&one)
[all...] |
| unique_pred.pass.cpp | 84 int ig[] = {0, 0, 1, 1}; local
85 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
87 r = std::unique(Iter(ig), Iter(ig+sg), count_equal());
88 assert(base(r) == ig + 2);
89 assert(ig[0] == 0);
90 assert(ig[1] == 1);
175 Ptr ig[4]; local
176 ig[2].reset(&one)
[all...] |
| unique_copy.pass.cpp | 68 const int ig[] = {0, 0, 1, 1}; local
69 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
71 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg));
|
| unique_copy_pred.pass.cpp | 89 const int ig[] = {0, 0, 1, 1}; local
90 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
93 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal());
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 64 int ig[] = {0, 0, 1, 1}; local
65 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
66 r = std::unique(Iter(ig), Iter(ig+sg));
67 assert(base(r) == ig + 2);
68 assert(ig[0] == 0);
69 assert(ig[1] == 1);
139 Ptr ig[4]; local
140 ig[2].reset(&one)
[all...] |
| unique_pred.pass.cpp | 84 int ig[] = {0, 0, 1, 1}; local
85 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
87 r = std::unique(Iter(ig), Iter(ig+sg), count_equal());
88 assert(base(r) == ig + 2);
89 assert(ig[0] == 0);
90 assert(ig[1] == 1);
175 Ptr ig[4]; local
176 ig[2].reset(&one)
[all...] |
| unique_copy.pass.cpp | 68 const int ig[] = {0, 0, 1, 1}; local
69 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
71 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg));
|
| unique_copy_pred.pass.cpp | 89 const int ig[] = {0, 0, 1, 1}; local
90 const unsigned sg = sizeof(ig)/sizeof(ig[0]);
93 r = std::unique_copy(InIter(ig), InIter(ig+sg), OutIter(jg), count_equal());
|
| /external/python/cpython2/Tools/pynche/ |
| ListViewer.py | 165 ig, ig, ig, y1 = canvas.coords(colortag)
166 ig, ig, ig, y2 = canvas.coords(self.__bboxes[-1])
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| IItemAttribute.java | 110 final IItem ig = (IItem) g; local
112 return il.getName ().compareTo (ig.getName ());
178 final IItem ig = (IItem) g; local
183 final double nig = ig.getAggregate (m_numeratorAggregateID);
184 final double dig = ig.getAggregate (m_denominatorAggregateID);
|
| /frameworks/av/services/mediaanalytics/ |
| MetricsSummarizer.cpp | 266 const char **ig = ignorable; local
267 for (;*ig; ig++) {
268 if (strcmp(*ig, attrName) == 0) {
272 if (*ig) {
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/ |
| operator.c | 466 itemgetterobject *ig;
local
481 ig = PyObject_GC_New(itemgetterobject, &itemgetter_type);
482 if (ig == NULL)
486 ig->item = item;
487 ig->nitems = nitems;
489 PyObject_GC_Track(ig);
490 return (PyObject *)ig;
494 itemgetter_dealloc(itemgetterobject *ig)
496 PyObject_GC_UnTrack(ig);
497 Py_XDECREF(ig->item);
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| operator.c | 338 itemgetterobject *ig;
local
353 ig = PyObject_GC_New(itemgetterobject, &itemgetter_type);
354 if (ig == NULL)
358 ig->item = item;
359 ig->nitems = nitems;
361 PyObject_GC_Track(ig);
362 return (PyObject *)ig;
366 itemgetter_dealloc(itemgetterobject *ig)
368 PyObject_GC_UnTrack(ig);
369 Py_XDECREF(ig->item);
[all...] |
| /external/python/cpython2/Modules/ |
| operator.c | 466 itemgetterobject *ig; local
481 ig = PyObject_GC_New(itemgetterobject, &itemgetter_type);
482 if (ig == NULL)
486 ig->item = item;
487 ig->nitems = nitems;
489 PyObject_GC_Track(ig);
490 return (PyObject *)ig;
494 itemgetter_dealloc(itemgetterobject *ig)
496 PyObject_GC_UnTrack(ig);
497 Py_XDECREF(ig->item)
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 48 int ig[] = {1, 2, 3, 4}; local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 58 int ig[] = {1, 2, 3, 4}; local
59 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
|
