Searched refs:ih (Results 1 - 25 of 89) sorted by relevance

1234

/external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/
H A DGifFrame.java7 int ix, iy, iw, ih; field in class:GifFrame
/external/avb/test/
H A Dimage_handler_unittest.py117 ih = avbtool.ImageHandler(self.TEST_FILE_SPARSE_PATH)
120 self.assertEqual(ih.tell(), 0)
123 self.assertEqual(ih.read(14), bytearray('Barfoo43Barfoo'))
124 self.assertEqual(ih.tell(), 14)
125 self.assertEqual(ih.read(2), bytearray('43'))
126 self.assertEqual(ih.tell(), 16)
129 ih.seek(0x6000 + 1)
130 self.assertEqual(ih.read(4), bytearray('\x02\x03\x04\x01'))
133 ih.seek(0x3000 - 10)
134 self.assertEqual(ih
[all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
H A Dunique.pass.cpp83 int ih[] = {0, 1, 1}; local
84 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
85 r = std::unique(Iter(ih), Iter(ih+sh));
86 assert(base(r) == ih + 2);
87 assert(ih[0] == 0);
88 assert(ih[1] == 1);
160 Ptr ih[3]; local
161 ih[
[all...]
H A Dunique_pred.pass.cpp105 int ih[] = {0, 1, 1}; local
106 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
108 r = std::unique(Iter(ih), Iter(ih+sh), count_equal());
109 assert(base(r) == ih + 2);
110 assert(ih[0] == 0);
111 assert(ih[1] == 1);
198 Ptr ih[3]; local
199 ih[
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dcoda.h322 struct coda_in_hdr ih; member in struct:coda_open_in
336 struct coda_in_hdr ih; member in struct:coda_store_in
347 struct coda_in_hdr ih; member in struct:coda_release_in
358 struct coda_in_hdr ih; member in struct:coda_close_in
369 struct coda_in_hdr ih; member in struct:coda_ioctl_in
386 struct coda_in_hdr ih; member in struct:coda_getattr_in
398 struct coda_in_hdr ih; member in struct:coda_setattr_in
409 struct coda_in_hdr ih; member in struct:coda_access_in
425 struct coda_in_hdr ih; member in struct:coda_lookup_in
440 struct coda_in_hdr ih; member in struct:coda_create_in
457 struct coda_in_hdr ih; member in struct:coda_remove_in
468 struct coda_in_hdr ih; member in struct:coda_link_in
481 struct coda_in_hdr ih; member in struct:coda_rename_in
494 struct coda_in_hdr ih; member in struct:coda_mkdir_in
509 struct coda_in_hdr ih; member in struct:coda_rmdir_in
520 struct coda_in_hdr ih; member in struct:coda_symlink_in
533 struct coda_in_hdr ih; member in struct:coda_readlink_in
546 struct coda_in_hdr ih; member in struct:coda_fsync_in
556 struct coda_in_hdr ih; member in struct:coda_vget_in
609 struct coda_in_hdr ih; member in struct:coda_open_by_fd_in
625 struct coda_in_hdr ih; member in struct:coda_open_by_path_in
653 struct coda_in_hdr ih; /* NB: every struct below begins with an ih */ member in union:inputArgs
[all...]
/external/toybox/toys/pending/
H A Dping.c97 struct icmphdr *ih = (void *)toybuf; local
194 memset(ih, 0, sizeof(*ih));
195 ih->type = (ai->ai_family == AF_INET) ? 8 : 128;
196 ih->un.echo.id = getpid();
197 ih->un.echo.sequence = ++seq;
198 if (TT.s >= 4) *(unsigned *)(ih+1) = tnow;
200 ih->checksum = 0;
201 ih->checksum = pingchksum((void *)toybuf, TT.s+sizeof(*ih));
[all...]
/external/ltp/testcases/kernel/syscalls/utils/
H A Dinotify.h74 * h_list is protected by ih->mutex of the associated inotify_handle.
76 * ih, inode, and wd are never written to once the watch is created.
86 struct inotify_handle *ih; /* associated inotify handle */ member in struct:inotify_watch
176 static inline void inotify_destroy(struct inotify_handle *ih) argument
180 static inline __s32 inotify_find_watch(struct inotify_handle *ih, struct inode *inode, argument
186 static inline __s32 inotify_find_update_watch(struct inotify_handle *ih, argument
192 static inline __s32 inotify_add_watch(struct inotify_handle *ih, argument
199 static inline int inotify_rm_watch(struct inotify_handle *ih, argument
205 static inline int inotify_rm_wd(struct inotify_handle *ih, __u32 wd) argument
210 static inline void inotify_remove_watch_locked(struct inotify_handle *ih, argument
[all...]
/external/fdlibm/
H A Dk_rem_pio2.c116 * ih integer. If >0 it indicates q[] is >= 0.5, hence
170 int jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih; local
205 ih = 0;
209 ih = iq[jz-1]>>(23-q0);
211 else if(q0==0) ih = iq[jz-1]>>23;
212 else if(z>=0.5) ih=2;
214 if(ih>0) { /* q > 0.5 */
232 if(ih==2) {
286 y[0] = (ih==0)? fw: -fw;
292 y[0] = (ih
[all...]
/external/webrtc/talk/session/media/
H A Dyuvscaler_unittest.cc98 bool TestScale(int iw, int ih, int ow, int oh, int offset, bool usefile, argument
102 size_t isize = I420_SIZE(iw, ih);
116 if (!LoadPlanarYuvTestImage("faces", iw, ih, ibuf) ||
149 EXPECT_EQ(0, libyuv::ScaleOffset(ibuf, iw, ih, obuf, ow, oh,
193 const int iw = 640, ih = 360; local
195 ALIGN16(uint8_t ibuf[I420_SIZE(iw, ih)]);
199 ASSERT_TRUE(LoadPlanarYuvTestImage("faces", iw, ih, ibuf));
201 libyuv::ScaleOffset(ibuf, iw, ih, obuf, ow, oh, 0, false);
209 const int iw = 640, ih = 360; local
212 scoped_ptr<uint8_t[]> ibuffer(new uint8_t[I420_SIZE(iw, ih)
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/
H A Ddefault.pass.cpp75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/
H A Dmake_default_searcher.pass.cpp60 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
61 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
63 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
H A Dmake_default_searcher.pred.pass.cpp72 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
73 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
75 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/
H A Ddefault.pass.cpp75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
H A Ddefault.pred.pass.cpp87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/
H A Ddefault.pass.cpp75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pass.cpp81 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
82 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
84 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pred.pass.cpp96 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
97 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
99 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
133 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
134 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
136 do_search(Iter1(ih), Iter
[all...]
H A Dpred.pass.cpp90 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
91 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
93 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
124 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
125 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
127 do_search(Iter1(ih), Iter
[all...]
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/
H A Ddefault.pass.cpp75 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
76 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
78 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pass.cpp80 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
81 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
83 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
114 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
115 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
117 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pred.pass.cpp93 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
94 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
96 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
127 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
128 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
130 do_search(Iter1(ih), Iter
[all...]
H A Dpred.pass.cpp87 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
88 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
90 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
121 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
122 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
124 do_search(Iter1(ih), Iter
[all...]
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/
H A Ddefault.pass.cpp76 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
77 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
79 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3));
115 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
116 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
118 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pass.cpp82 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
83 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
85 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
116 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
117 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
119 do_search(Iter1(ih), Iter
[all...]
H A Dhash.pred.pass.cpp97 int ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
98 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
100 do_search(Iter1(ih), Iter1(ih+sh), Iter2(ii), Iter2(ii+3), Iter1(ih+3), sh*3);
134 char ih[] = {0, 1, 1, 1, 1, 2, 3, 0, 1, 2, 3, 4}; local
135 const unsigned sh = sizeof(ih)/sizeof(ih[0]);
137 do_search(Iter1(ih), Iter
[all...]

Completed in 1970 milliseconds

1234