| /external/chromium_org/third_party/WebKit/Source/web/tests/data/viewport/ |
| viewport-84.html | 0 <head>
4 </head>
|
| viewport-85.html | 0 <head>
4 </head>
|
| viewport-86.html | 0 <head>
4 </head>
|
| viewport-88.html | 0 <head>
4 </head>
|
| viewport-legacy-ordering-1.html | 0 <head>
5 </head>
|
| viewport-legacy-ordering-2.html | 0 <head>
5 </head>
|
| viewport-legacy-ordering-3.html | 0 <head>
5 </head>
|
| viewport-legacy-ordering-4.html | 0 <head>
5 </head>
|
| viewport-legacy-ordering-5.html | 0 <head>
5 </head>
|
| viewport-legacy-ordering-6.html | 0 <head>
5 </head>
|
| /external/chromium_org/third_party/WebKit/Source/web/tests/data/ |
| viewport-2x-initial-scale.html | 2 <head>
4 </head>
|
| viewport-auto-initial-scale.html | 2 <head>
4 </head>
|
| viewport-height-1000.html | 2 <head>
4 </head>
|
| /external/chromium_org/tools/telemetry/telemetry/core/backends/chrome/chromeos_login_ext/ |
| main.html | 3 <head>
6 </head>
|
| /external/doclava/res/assets/templates/ |
| index.cs | 2 <head>
4 </head>
|
| /frameworks/base/docs/html/reference/ |
| index.html | 2 <head>
5 </head>
|
| /external/chromium_org/third_party/ots/src/ |
| head.cc | 5 #include "head.h"
9 // head - Font Header
10 // http://www.microsoft.com/opentype/otspec/head.htm
16 file->head = new OpenTypeHEAD;
20 !table.ReadU32(&file->head->revision)) {
39 if (!table.ReadU16(&file->head->flags)) {
44 file->head->flags &= 0x381f;
46 if (!table.ReadU16(&file->head->ppem)) {
51 if (file->head->ppem < 16 ||
52 file->head->ppem > 16384)
[all...] |
| /external/chromium/third_party/libevent/compat/sys/ |
| queue.h | 46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /external/chromium_org/third_party/libevent/compat/sys/ |
| queue.h | 46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head of the list, or at the end of the list
[all...] |
| /external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
| test-head.html | 2 <head>
|
| /external/libnl-headers/netlink/ |
| list.h | 38 struct nl_list_head *head)
40 __nl_list_add(obj, head->prev, head);
44 struct nl_list_head *head)
46 __nl_list_add(obj, head, head->next);
55 static inline int nl_list_empty(struct nl_list_head *head)
57 return head->next == head;
67 #define nl_list_at_tail(pos, head, member)
[all...] |
| /external/qemu/ |
| qemu-queue.h | 51 * or after an existing element or at the head of the list. A list
54 * A simple queue is headed by a pair of pointers, one the head of the
57 * head of the list. New elements can be added to the list after
58 * an existing element, at the head of the list, or at the end of the
61 * A tail queue is headed by a pair of pointers, one to the head of the
65 * after an existing element, at the head of the list, or at the end of
68 * A circle queue is headed by a pair of pointers, one to the head of the
72 * an existing element, at the head of the list, or at the end of the list.
87 #define QLIST_HEAD_INITIALIZER(head) \
99 #define QLIST_INIT(head) do {
[all...] |
| /development/ndk/platforms/android-3/include/linux/ |
| circ_buf.h | 17 int head; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/inspector/ |
| heap-snapshot-advanced.html | 2 <head>
20 var head = tail;
22 head = { next: head };
23 head.next.prev = head;
25 return { head: head, tail: tail };
32 </head>
|
| /prebuilts/ndk/4/platforms/android-3/arch-arm/usr/include/linux/ |
| circ_buf.h | 17 int head; member in struct:circ_buf
21 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
23 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
25 #define CIRC_CNT_TO_END(head,tail,size) ({int end = (size) - (tail); int n = ((head) + end) & ((size)-1); n < end ? n : end;})
27 #define CIRC_SPACE_TO_END(head,tail,size) ({int end = (size) - 1 - (head); int n = (end + (tail)) & ((size)-1); n <= end ? n : end+1;})
|
