Searched defs:ig (Results 1 - 25 of 35) sorted by relevance

12

/external/curl/lib/
H A Dsigpipe.h42 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) argument
66 if(!ig->no_signal)
68 sigaction(SIGPIPE, &ig->old_pipe_act, NULL);
41 sigpipe_ignore(struct Curl_easy *data, struct sigpipe_ignore *ig) argument
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp155 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[
359 std::unique_ptr<int> ig[6]; local
[all...]
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dsearch.pass.cpp48 int ig[] = {1, 2, 3, 4}; local
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8));
H A Dsearch_pred.pass.cpp89 int ig[] = {1, 2, 3, 4}; local
90 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), count_equal()) == Iter1(ib+8));
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp64 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[
[all...]
H A Dunique_copy.pass.cpp68 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));
H A Dunique_copy_pred.pass.cpp89 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());
H A Dunique_pred.pass.cpp84 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[
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
H A Dhash.pass.cpp79 int ig[] = {1, 2, 3, 4}; local
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
113 char ig[] = {1, 2, 3, 4}; local
114 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
H A Dhash.pred.pass.cpp94 int ig[] = {1, 2, 3, 4}; local
95 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
131 char ig[] = {1, 2, 3, 4}; local
132 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
H A Dpred.pass.cpp88 int ig[] = {1, 2, 3, 4}; local
89 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
122 char ig[] = {1, 2, 3, 4}; local
123 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
H A Dhash.pass.cpp78 int ig[] = {1, 2, 3, 4}; local
79 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
112 char ig[] = {1, 2, 3, 4}; local
113 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
H A Dhash.pred.pass.cpp91 int ig[] = {1, 2, 3, 4}; local
92 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
125 char ig[] = {1, 2, 3, 4}; local
126 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
H A Dpred.pass.cpp85 int ig[] = {1, 2, 3, 4}; local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
119 char ig[] = {1, 2, 3, 4}; local
120 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp73 int ig[] = {1, 2, 3, 4}; local
74 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
H A Ddefault.pred.pass.cpp85 int ig[] = {1, 2, 3, 4}; local
86 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
H A Dmake_default_searcher.pass.cpp58 int ig[] = {1, 2, 3, 4}; local
59 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8));
H A Dmake_default_searcher.pred.pass.cpp70 int ig[] = {1, 2, 3, 4}; local
71 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4), Iter1(ib+8), sb*4);
/external/skia/tests/
H A DImageGeneratorTest.cpp47 MyImageGenerator ig; local
59 ig.queryYUV8(&sizeInfo, nullptr);
60 ig.queryYUV8(&sizeInfo, &colorSpace);
66 ig.getYUV8Planes(sizeInfo, planes);
/external/python/cpython2/Modules/
H A Doperator.c466 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) argument
496 PyObject_GC_UnTrack(ig);
497 Py_XDECREF(ig
502 itemgetter_traverse(itemgetterobject *ig, visitproc visit, void *arg) argument
509 itemgetter_call(itemgetterobject *ig, PyObject *args, PyObject *kw) argument
[all...]
/external/libpng/
H A Dpngrtran.c759 int ir, ig, ib; local
771 for (ig = 0; ig < num_green; ig++)
773 /* int dg = abs(ig - g); */
774 int dg = ((ig > g) ? ig - g : g - ig);
777 int index_g = index_r | (ig << PNG_QUANTIZE_BLUE_BITS);
/external/pdfium/third_party/libpng16/
H A Dpngrtran.c759 int ir, ig, ib; local
771 for (ig = 0; ig < num_green; ig++)
773 /* int dg = abs(ig - g); */
774 int dg = ((ig > g) ? ig - g : g - ig);
777 int index_g = index_r | (ig << PNG_QUANTIZE_BLUE_BITS);
/external/skia/src/core/
H A DSkColorSpaceXform.cpp686 Sk4i ig = Sk4f_round(dg); local
693 | dstTables[1][ig[0]] << kGShift
697 | dstTables[1][ig[1]] << kGShift
701 | dstTables[1][ig[2]] << kGShift
705 | dstTables[1][ig[3]] << kGShift

Completed in 402 milliseconds

12