Home
last modified time | relevance | path

Searched refs:a (Results 1 – 25 of 162) sorted by relevance

1234567

/system/core/fastboot/
Dengine.c76 int (*func)(Action *a, int status, char *resp);
124 static int cb_default(Action *a, int status, char *resp) in cb_default() argument
130 fprintf(stderr,"OKAY [%7.3fs]\n", (split - a->start)); in cb_default()
131 a->start = split; in cb_default()
138 Action *a; in queue_action() local
142 a = calloc(1, sizeof(Action)); in queue_action()
143 if (a == 0) die("out of memory"); in queue_action()
146 cmdsize = vsnprintf(a->cmd, sizeof(a->cmd), fmt, ap); in queue_action()
149 if (cmdsize >= sizeof(a->cmd)) { in queue_action()
150 free(a); in queue_action()
[all …]
Dfastboot_protocol.txt5 The fastboot protocol is a mechanism for communicating with bootloaders
7 allow it to be used across a wide range of devices and from hosts running
24 1. Host sends a command, which is an ascii string in a single
27 2. Client response with a single packet no greater than 64 bytes.
32 a. INFO -> the remaining 60 bytes are an informative message
37 of the response (if present) provide a textual failure message
53 4. Client responds with a single packet no greater than 64 bytes.
57 a. INFO -> display the remaining 60 bytes and return to #4
59 b. FAIL -> display the remaining 60 bytes (if present) as a failure
92 Host: "powerdown" send a command
[all …]
/system/extras/ext4_utils/
Dsha1.c71 void do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
72 void do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
73 void do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
74 void do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *);
83 do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) in do_R01() argument
85 nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3); in do_R01()
86 nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7); in do_R01()
87 nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11); in do_R01()
88 nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15); in do_R01()
89 nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19); in do_R01()
[all …]
/system/core/toolbox/
Ddynarray.c6 dynarray_init( dynarray_t *a ) in dynarray_init() argument
8 a->count = a->capacity = 0; in dynarray_init()
9 a->items = NULL; in dynarray_init()
14 dynarray_reserve_more( dynarray_t *a, int count ) in dynarray_reserve_more() argument
16 int old_cap = a->capacity; in dynarray_reserve_more()
20 int new_count = a->count + count; in dynarray_reserve_more()
25 if (count > max_cap - a->count) in dynarray_reserve_more()
28 new_count = a->count + count; in dynarray_reserve_more()
37 new_items = realloc(a->items, new_cap*sizeof(void*)); in dynarray_reserve_more()
41 a->items = new_items; in dynarray_reserve_more()
[all …]
Dbsd-compatibility.h43 #define __type_fit(t, a) (0 == 0) argument
46 #define __arraycount(a) (sizeof(a) / sizeof(a[0])) argument
/system/extras/ksmutils/
Dlookup3.c115 #define mix(a,b,c) \ argument
117 a -= c; a ^= rot(c, 4); c += b; \
118 b -= a; b ^= rot(a, 6); a += c; \
119 c -= b; c ^= rot(b, 8); b += a; \
120 a -= c; a ^= rot(c,16); c += b; \
121 b -= a; b ^= rot(a,19); a += c; \
122 c -= b; c ^= rot(b, 4); b += a; \
150 #define final(a,b,c) \ argument
153 a ^= c; a -= rot(c,11); \
154 b ^= a; b -= rot(a,25); \
[all …]
/system/core/include/mincrypt/
Dp256.h51 p256_digit a[P256_NDIGITS]; member
59 void p256_init(p256_int* a);
62 void p256_clear(p256_int* a);
65 int p256_get_bit(const p256_int* a, int index);
70 const p256_int* a,
76 const p256_int* a,
85 const p256_int* a,
93 const p256_int* a,
98 p256_digit p256_shl(const p256_int* a, int n, p256_int* b);
101 void p256_shr(const p256_int* a, int n, p256_int* b);
[all …]
/system/core/include/private/pixelflinger/
Dggl_fixed.h87 GGLfixed gglSqrtx(GGLfixed a) CONST;
90 int32_t gglMulDivi(int32_t a, int32_t b, int32_t c);
133 inline GGLfixed gglMulAddx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) CONST;
134 inline GGLfixed gglMulAddx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) { in gglMulAddx() argument
141 : "%[x]"(x), [y]"r"(y), [a]"r"(a), [lshift] "I"(32-shift), [rshift] "I"(shift) in gglMulAddx()
148 : "%[x]"(x), [y]"r"(y), [a]"r"(a), [lshift] "r"(32-shift), [rshift] "r"(shift) in gglMulAddx()
154 inline GGLfixed gglMulSubx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) CONST;
155 inline GGLfixed gglMulSubx(GGLfixed x, GGLfixed y, GGLfixed a, int shift) { in gglMulSubx() argument
162 : "%[x]"(x), [y]"r"(y), [a]"r"(a), [lshift] "I"(32-shift), [rshift] "I"(shift) in gglMulSubx()
169 : "%[x]"(x), [y]"r"(y), [a]"r"(a), [lshift] "r"(32-shift), [rshift] "r"(shift) in gglMulSubx()
[all …]
/system/keymaster/
Dgoogle_keymaster_test_utils.cpp56 bool operator==(const keymaster_key_param_t& a, const keymaster_key_param_t& b) { in operator ==() argument
57 if (a.tag != b.tag) { in operator ==()
61 switch (keymaster_tag_get_type(a.tag)) { in operator ==()
68 return a.integer == b.integer; in operator ==()
71 return a.enumerated == b.enumerated; in operator ==()
73 return a.long_integer == b.long_integer; in operator ==()
75 return a.date_time == b.date_time; in operator ==()
77 return a.boolean == b.boolean; in operator ==()
80 if ((a.blob.data == NULL || b.blob.data == NULL) && a.blob.data != b.blob.data) in operator ==()
82 return a.blob.data_length == b.blob.data_length && in operator ==()
[all …]
/system/core/libpixelflinger/
Dfixed.cpp29 uint32_t a = s ? -x : x; in gglRecipQNormalized() local
32 if (ggl_unlikely(a <= 2LU)) { in gglRecipQNormalized()
40 const int32_t lz = gglClz(a); in gglRecipQNormalized()
41 a <<= lz; // 0.32 in gglRecipQNormalized()
42 uint32_t r = a; in gglRecipQNormalized()
46 if (a != 0x80000000) { in gglRecipQNormalized()
50 r = (((2LU<<30) - uint32_t((uint64_t(a)*r) >> 32)) * uint64_t(r)) >> 30; in gglRecipQNormalized()
51 r = (((2LU<<30) - uint32_t((uint64_t(a)*r) >> 32)) * uint64_t(r)) >> 30; in gglRecipQNormalized()
93 const GGLfixed a = x; in gglSqrtRecipx() local
95 x = ggl_sqrt_reciproc_approx_tab[(a>>(28-lz))&0x7]; in gglSqrtRecipx()
[all …]
/system/core/libmincrypt/
Dp256.c52 void p256_init(p256_int* a) { in p256_init() argument
53 memset(a, 0, sizeof(*a)); in p256_init()
56 void p256_clear(p256_int* a) { p256_init(a); } in p256_clear() argument
63 int p256_is_zero(const p256_int* a) { in p256_is_zero() argument
65 for (i = 0; i < P256_NDIGITS; ++i) result |= P256_DIGIT(a, i); in p256_is_zero()
71 static p256_digit mulAdd(const p256_int* a, in mulAdd() argument
80 carry += (p256_ddigit)P256_DIGIT(a, i) * b; in mulAdd()
89 const p256_digit* a, in subTop() argument
97 borrow -= *a++; in subTop()
144 const p256_int* a, in p256_modmul() argument
[all …]
Drsa.c34 uint32_t* a) { in subM() argument
38 A += (uint64_t)a[i] - key->n[i]; in subM()
39 a[i] = (uint32_t)A; in subM()
46 const uint32_t* a) { in geM() argument
50 if (a[i] < key->n[i]) return 0; in geM()
51 if (a[i] > key->n[i]) return 1; in geM()
59 const uint32_t a, in montMulAdd() argument
61 uint64_t A = (uint64_t)a * b[0] + c[0]; in montMulAdd()
67 A = (A >> 32) + (uint64_t)a * b[i] + c[i]; in montMulAdd()
84 const uint32_t* a, in montMul() argument
[all …]
/system/extras/tests/timetest/
Dtimetest.c26 static struct timespec ts_sub(struct timespec a, struct timespec b) in ts_sub() argument
29 r.tv_sec = a.tv_sec - b.tv_sec; in ts_sub()
30 r.tv_nsec = a.tv_nsec - b.tv_nsec; in ts_sub()
42 static struct timespec ts_min(struct timespec a, struct timespec b) in ts_min() argument
44 if(a.tv_sec < b.tv_sec || (a.tv_sec == b.tv_sec && a.tv_nsec < b.tv_nsec)) in ts_min()
45 return a; in ts_min()
50 static struct timespec ts_max(struct timespec a, struct timespec b) in ts_max() argument
52 if(a.tv_sec < b.tv_sec || (a.tv_sec == b.tv_sec && a.tv_nsec < b.tv_nsec)) in ts_max()
55 return a; in ts_max()
/system/extras/libpagemap/
Dpm_memusage.c23 void pm_memusage_add(pm_memusage_t *a, pm_memusage_t *b) { in pm_memusage_add() argument
24 a->vss += b->vss; in pm_memusage_add()
25 a->rss += b->rss; in pm_memusage_add()
26 a->pss += b->pss; in pm_memusage_add()
27 a->uss += b->uss; in pm_memusage_add()
28 a->swap += b->swap; in pm_memusage_add()
/system/media/audio_utils/
Dfixedfft.cpp87 static inline int32_t mult(int32_t a, int32_t b) in mult() argument
91 __asm__("smuad %0, %0, %1" : "+r" (t) : "r" (a)); in mult()
92 __asm__("smusdx %0, %0, %1" : "+r" (b) : "r" (a)); in mult()
96 return (((a >> 16) * (b >> 16) + (int16_t)a * (int16_t)b) & ~0xFFFF) | in mult()
97 ((((a >> 16) * (int16_t)b - (int16_t)a * (b >> 16)) >> 16) & 0xFFFF); in mult()
101 static inline int32_t half(int32_t a) in half() argument
104 __asm__("shadd16 %0, %0, %1" : "+r" (a) : "r" (0)); in half()
105 return a; in half()
107 return ((a >> 1) & ~0x8000) | (a & 0x8000); in half()
/system/core/debuggerd/
Dcrasher.c94 __attribute__((noinline)) static int crash3(int a) { in crash3() argument
95 *((int*) 0xdead) = a; in crash3()
96 return a*4; in crash3()
99 __attribute__((noinline)) static int crash2(int a) { in crash2() argument
100 a = crash3(a) + 2; in crash2()
101 return a*3; in crash2()
104 __attribute__((noinline)) static int crash(int a) { in crash() argument
105 a = crash2(a) + 1; in crash()
106 return a*2; in crash()
115 int* a = (int *)(&do_action); in sigsegv_non_null() local
[all …]
/system/extras/showslab/
Dshowslab.c9 #define STRINGIFY_ARG(a) #a argument
10 #define STRINGIFY(a) STRINGIFY_ARG(a) argument
169 static struct slab_info *merge_objs(struct slab_info *a, struct slab_info *b) in merge_objs() argument
174 while (a && b) { in merge_objs()
175 if (sort_func(a, b)) { in merge_objs()
176 p->next = a; in merge_objs()
177 p = a; in merge_objs()
178 a = a->next; in merge_objs()
186 p->next = (a == NULL) ? b : a; in merge_objs()
195 struct slab_info *a, *b; in slabsort() local
[all …]
/system/extras/f2fs_utils/
Df2fs_sparseblock.h28 #define ver_after(a, b) (typecheck(unsigned long long, a) && \ argument
30 ((long long)((a) - (b)) > 0))
32 #define ver_equal(a, b) (typecheck(unsigned long long, a) && \ argument
34 ((long long)((a) - (b)) == 0))
/system/core/adb/
DOVERVIEW.TXT8 connected to or running on a given host developer machine
12 DDMS). These commands are what is called a 'service' in ADB.
14 As a whole, everything works through the following components:
18 This is a background process that runs on the host machine. Its purpose
22 It thus maintains a list of "connected devices" and assigns a 'state'
33 The 'adbd' program runs as a background process within an Android device
35 (through USB for devices, through TCP for emulators) and provide a
38 The ADB server considers that a device is ONLINE when it has successfully
40 meaning that the ADB server detected a new device/emulator, but could not
48 The 'adb' command-line program is used to run adb commands from a shell
[all …]
Dprotocol.txt2 --- a replacement for aproto -------------------------------------------
13 The host side becomes a simple comms bridge with no "UI", which will
15 a device or emulator that is connected to the bridge.
27 The transport layer deals in "messages", which consist of a 24 byte
28 header followed (optionally) by a payload. The header consists of 6
47 is represented by a quoted string or an empty string if none should be
51 *sender* of the message, so for a receiver, the meanings are effectively
58 The CONNECT message establishes the presence of a remote system.
65 Both sides send a CONNECT message when the connection between them is
66 established. Until a CONNECT message is received no other messages may
[all …]
/system/extras/tests/fstest/
DREADME3 will cause an error message along with a corresponding explicit (fully
28 that are in subdirectories of /dev/, such as /dev/input/, unlike a
30 a match to a directory name.
37 <min_mode> is a numeric mode mask, and a mode will match it if and only if
40 <max_mode> is a numeric mode mask, and a mode will match it if and only if
43 <min_uid> may be either a numeric user id, or a user name (which must not
44 start with a number). If it is a user name, getpwnam() will be used to
45 translate it to a numeric user id.
59 To get a list of all failing rules:
63 To get a fully specified set of rules for all failing files:
[all …]
/system/keymaster/include/keymaster/
Dgoogle_keymaster_utils.h52 template <typename T, size_t N> inline size_t array_size(const T (&a)[N]) { in array_size()
53 return sizeof(a); in array_size()
68 template <typename T, size_t N> inline T* dup_array(const T (&a)[N]) { in dup_array()
71 memcpy(dup, &a, array_size(a)); in dup_array()
95 template <typename T, size_t N> inline bool array_contains(const T (&a)[N], T val) { in array_contains()
97 if (a[i] == val) { in array_contains()
/system/vold/
DVoldUtil.h22 #define ARRAY_SIZE(a) (sizeof(a) / sizeof(*(a))) argument
/system/core/include/ctest/
Dctest.h49 #define assertSame(a, b) assertTrueWithSource(a == b, __FILE__, __LINE__, "Expected same value."); argument
54 #define assertNotSame(a, b) assertTrueWithSource(a != b, __FILE__, __LINE__,\ argument
/system/core/libsparse/
Dbacked_block.c192 struct backed_block *a, struct backed_block *b) in merge_bb() argument
197 if (!a || !b) { in merge_bb()
201 assert(a->block < b->block); in merge_bb()
204 if (a->type != b->type) { in merge_bb()
209 block_len = a->len / bbl->block_size; /* rounds down */ in merge_bb()
210 if (a->block + block_len != b->block) { in merge_bb()
214 switch (a->type) { in merge_bb()
219 if (a->fill.val != b->fill.val) { in merge_bb()
224 if (a->file.filename != b->file.filename || in merge_bb()
225 a->file.offset + a->len != b->file.offset) { in merge_bb()
[all …]

1234567