Searched defs:rec (Results 1 - 25 of 126) sorted by relevance

123456

/external/v8/test/cctest/
H A Dtest-unbound-queue.cc18 Record rec = 0; local
19 cq.Dequeue(&rec);
20 CHECK_EQ(1, rec);
35 Record rec = 0; local
38 cq.Dequeue(&rec);
39 CHECK_EQ(i, rec);
47 cq.Dequeue(&rec);
48 CHECK_EQ(i, rec);
H A Dtest-circular-queue.cc25 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
26 CHECK_NE(NULL, rec);
27 *rec = i;
34 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
35 CHECK_NE(NULL, rec);
36 *rec = i;
40 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
41 CHECK_NE(NULL, rec);
42 *rec = 20;
49 Record* rec local
66 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
97 Record* rec = reinterpret_cast<Record*>(scq_->Enqueue()); local
141 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
153 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
165 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
[all...]
/external/skia/src/views/
H A DSkTagList.cpp16 SkTagList* SkTagList::Find(SkTagList* rec, U8CPU tag) argument
20 while (rec != NULL)
22 if (rec->fTag == tag)
24 rec = rec->fNext;
26 return rec;
33 SkTagList* rec = *head;
36 while (rec != NULL)
38 SkTagList* next = rec->fNext;
40 if (rec
[all...]
H A DSkViewPriv.cpp31 Artist_SkTagList* rec = (Artist_SkTagList*)this->findTagList(kViewArtist_SkTagList); local
32 SkASSERT(rec == NULL || rec->fArtist != NULL);
34 return rec ? rec->fArtist : NULL;
45 Artist_SkTagList* rec = (Artist_SkTagList*)this->findTagList(kViewArtist_SkTagList); local
47 if (rec)
48 SkRefCnt_SafeAssign(rec->fArtist, obj);
77 Layout_SkTagList* rec = (Layout_SkTagList*)this->findTagList(kViewLayout_SkTagList); local
78 SkASSERT(rec
91 Layout_SkTagList* rec = (Layout_SkTagList*)this->findTagList(kViewLayout_SkTagList); local
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3parser.h59 pANTLR3_BASE_RECOGNIZER rec; member in struct:ANTLR3_PARSER_struct
H A Dantlr3treeparser.h57 pANTLR3_BASE_RECOGNIZER rec; member in struct:ANTLR3_TREE_PARSER_struct
H A Dantlr3lexer.h105 pANTLR3_BASE_RECOGNIZER rec; member in struct:ANTLR3_LEXER_struct
H A Dantlr3rewritestreams.h101 pANTLR3_BASE_RECOGNIZER rec; member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct
/external/srec/srec/crec/
H A Dastar_pphash.h43 srec* rec; member in struct:__anon12395
47 void hash_init(FixedSizeHash* hash, srec* rec);
50 int compare_parp(partial_path* parp1, partial_path* parp2, srec* rec);
H A Dastar_pphash.c40 hash->rec = rec_debug;
46 int compare_parp(partial_path* parp1, partial_path* parp2, srec* rec) argument
105 if (compare_parp(p_return, parp, hash->rec) == 0)
128 print_path(parp, hash->rec, "problem in astar_pphash hash_set ");
132 else if (compare_parp(*p_insert, parp, hash->rec) == 0)
135 print_path(*p_insert, hash->rec, "key taken in astar_pphash hash_set ");
143 print_path(parp, hash->rec, "");
160 if (compare_parp(*p_insert, parp, hash->rec) == 0)
165 print_path(parp, hash->rec, "deleted ");
H A Dsrec_debug.c26 static char* sprint_altwords(srec* rec, altword_token* awtoken, char* buf) argument
43 void print_fsmnode_token(srec* rec, ftokenID token_index, char* msg) argument
54 ftoken = &rec->fsmnode_token_array[token_index];
55 printf("%sftoken %d rec %d@%d fsmnode %d cost %d word %d(%s) word_backtrace %d next_token_index %d ", msg, token_index, rec->id, rec->current_search_frame, ftoken->FSMnode_index, ftoken->cost, ftoken->word,
56 sprint_altwords(rec, ftoken->aword_backtrace, buf),
60 if (ftoken->word < rec->context->olabels->num_words)
61 p = rec->context->olabels->words[ftoken->word];
62 sprint_bword_token_backtrace(word_backtrace_trans, sizeof(word_backtrace_trans), rec, ftoke
66 print_fsmnode_token_list(srec* rec, stokenID token_index, char* msg) argument
78 print_search_status(srec* rec) argument
91 print_fsmarc_token(srec* rec, stokenID token_index, char* msg) argument
120 print_fsmarc_token_list(srec* rec, stokenID token_index, char* msg) argument
[all...]
H A Dsrec_initialize.c72 static void allocate_recognition1(srec *rec, argument
91 rec->current_model_scores = (costdata*) CALLOC_CLR(max_model_states, sizeof(costdata), "search.srec.current_model_scores"); /*FIX - either get NUM_MODELS from acoustic models, or check this someplace to make sure we have enough room*/
92 rec->num_model_slots_allocated = (modelID)max_model_states;
94 rec->fsmarc_token_array_size = (stokenID)max_hmm_tokens;
96 rec->fsmarc_token_array = (fsmarc_token*) CALLOC_CLR(rec->fsmarc_token_array_size , sizeof(fsmarc_token), "search.srec.fsmarc_token_array");
97 rec->max_new_states = (stokenID)max_hmm_tokens;
99 rec->word_token_array = (word_token*) CALLOC_CLR(max_word_tokens, sizeof(word_token), "search.srec.word_token_array");
100 rec->word_token_array_size = (wtokenID)max_word_tokens;
102 rec
138 allocate_recognition(multi_srec *rec, int viterbi_prune_thresh, int max_hmm_tokens, int max_fsmnode_tokens, int max_word_tokens, int max_altword_tokens, int num_wordends_per_frame, int max_fsm_nodes, int max_fsm_arcs, int max_frames, int max_model_states, int max_searches) argument
211 free_recognition1(srec *rec) argument
225 free_recognition(multi_srec *rec) argument
[all...]
/external/valgrind/main/memcheck/tests/linux/
H A Dlsframe2.c13 int rec ( int depth ) function
20 zzz = rec(depth-1);
31 sum = rec(N_MBYTES);
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3cyclicdfa.c53 noViableAlt(pANTLR3_BASE_RECOGNIZER rec, pANTLR3_CYCLIC_DFA cdfa, ANTLR3_UINT32 s) argument
59 if (rec->state->backtracking > 0)
61 rec->state->failed = ANTLR3_TRUE;
65 rec->exConstruct(rec);
66 rec->state->exception->type = ANTLR3_NO_VIABLE_ALT_EXCEPTION;
67 rec->state->exception->message = cdfa->description;
68 rec->state->exception->decisionNum = cdfa->decisionNumber;
69 rec->state->exception->state = s;
79 antlr3dfapredict (void * ctx, pANTLR3_BASE_RECOGNIZER rec, pANTLR3_INT_STREA argument
[all...]
/external/clang/test/Parser/
H A Dcxx-ambig-paren-expr.cpp30 struct rec { rec(int); }; struct
34 struct rec { rec(int); }; struct in namespace:ns
39 struct rec { rec(int); }; struct in struct:cls
57 if (result((cls::rec) i).check())
60 if (result((ns::rec) i).check())
63 if (result((::rec) i).check())
/external/openssl/ssl/
H A Dd1_enc.c131 SSL3_RECORD *rec; local
146 rec= &(s->s3->wrec);
152 if ( rec->data != rec->input)
154 fprintf(stderr, "%s:%d: rec->data != rec->input\n",
158 if (RAND_bytes(rec->input, EVP_CIPHER_block_size(ds->cipher)) <= 0)
172 rec= &(s->s3->rrec);
186 memmove(rec->data,rec
[all...]
/external/skia/src/core/
H A DSkRefDict.cpp30 Impl* rec = fImpl; local
31 while (rec) {
32 if (rec->fName.equals(name)) {
33 return rec->fData;
35 rec = rec->fNext;
45 Impl* rec = fImpl; local
47 while (rec) {
48 if (rec->fName.equals(name)) {
52 rec
80 Impl* rec = fImpl; local
[all...]
/external/v8/src/
H A Dunbound-queue-inl.h69 void UnboundQueue<Record>::Dequeue(Record* rec) { argument
72 *rec = next->value;
78 void UnboundQueue<Record>::Enqueue(const Record& rec) { argument
80 next = new Node(rec);
/external/jmdns/src/javax/jmdns/impl/tasks/
H A DDNSTask.java73 * @param rec
78 public DNSOutgoing addQuestion(DNSOutgoing out, DNSQuestion rec) throws IOException { argument
81 newOut.addQuestion(rec);
93 newOut.addQuestion(rec);
105 * @param rec
110 public DNSOutgoing addAnswer(DNSOutgoing out, DNSIncoming in, DNSRecord rec) throws IOException { argument
113 newOut.addAnswer(in, rec);
125 newOut.addAnswer(in, rec);
135 * @param rec
141 public DNSOutgoing addAnswer(DNSOutgoing out, DNSRecord rec, lon argument
171 addAuthoritativeAnswer(DNSOutgoing out, DNSRecord rec) argument
203 addAdditionalAnswer(DNSOutgoing out, DNSIncoming in, DNSRecord rec) argument
[all...]
/external/oprofile/opjitconv/
H A Dparse_dump.c32 struct jr_code_load const * rec = ptr_arg; local
35 end = rec->code_addr ? ptr + size : NULL;
41 ptr += sizeof(*rec);
46 entry->code = rec->code_addr ? ptr : NULL;
47 entry->vma = rec->vma;
48 entry->code_size = rec->code_size;
50 entry->life_start = rec->timestamp;
63 rec_totalsize = sizeof(*rec) + strlen(entry->symbol_name) + 1 + entry->code_size;
88 struct jr_code_unload const * rec = ptr; local
92 rec
119 struct jr_code_debug_info const * rec = ptr; local
141 struct jr_prefix const * rec = ptr; local
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dbb_inode.c60 struct set_badblock_record rec; local
68 rec.bad_block_count = 0;
69 rec.ind_blocks_size = rec.ind_blocks_ptr = 0;
70 rec.max_ind_blocks = 10;
71 retval = ext2fs_get_array(rec.max_ind_blocks, sizeof(blk_t),
72 &rec.ind_blocks);
75 memset(rec.ind_blocks, 0, rec.max_ind_blocks * sizeof(blk_t));
76 retval = ext2fs_get_mem(fs->blocksize, &rec
158 struct set_badblock_record *rec = (struct set_badblock_record *) local
215 struct set_badblock_record *rec = (struct set_badblock_record *) local
[all...]
/external/libselinux/src/
H A Dlabel.c19 typedef int (*selabel_initfunc)(struct selabel_handle *rec,
45 int selabel_validate(struct selabel_handle *rec, argument
50 if (!rec->validating || contexts->validated)
70 struct selabel_handle *rec = NULL; local
80 rec = (struct selabel_handle *)malloc(sizeof(*rec));
81 if (!rec)
84 memset(rec, 0, sizeof(*rec));
85 rec
98 selabel_lookup_common(struct selabel_handle *rec, int translating, const char *key, int type) argument
109 selabel_lookup(struct selabel_handle *rec, security_context_t *con, const char *key, int type) argument
122 selabel_close(struct selabel_handle *rec) argument
128 selabel_stats(struct selabel_handle *rec) argument
[all...]
/external/skia/include/core/
H A DSkTDStack.h25 Rec* rec = fRec; local
26 while (rec != &fInitialRec) {
27 Rec* next = rec->fNext;
28 sk_free(rec);
29 rec = next;
40 Rec* rec = (Rec*)sk_malloc_throw(sizeof(Rec)); local
41 rec->fNext = fRec;
42 fRec = rec;
83 Rec* rec = fRec->fNext; local
86 fRec = rec;
[all...]
/external/skia/src/effects/
H A DSkGroupShape.cpp22 const Rec& rec = fList[index]; local
24 *mr = rec.fMatrixRef;
26 return rec.fShape;
40 Rec* rec; local
42 rec = fList.append();
44 rec = fList.insert(index);
46 rec->fShape = shape;
47 rec->fMatrixRef = mr;
52 Rec& rec = fList[index]; local
53 rec
60 Rec* rec = fList.begin(); local
73 const Rec* rec = fList.begin(); local
95 const Rec* rec = fList.begin(); local
[all...]
/external/webkit/Source/WebKit/android/jni/
H A DJavaSharedClient.cpp105 FuncPtrRec* rec = (FuncPtrRec*)gFuncPtrQ.push_back(); local
106 rec->fProc = proc;
107 rec->fPayload = payload;
119 const FuncPtrRec* rec; local
124 rec = (const FuncPtrRec*)gFuncPtrQ.front();
125 if (rec) {
126 proc = rec->fProc;
127 payload = rec->fPayload;
133 if (rec)

Completed in 4690 milliseconds

123456