HomeSort by relevance Sort by last modified time
    Searched refs:rec (Results 1 - 25 of 282) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/skia/src/views/
SkTagList.cpp 24 SkTagList* SkTagList::Find(SkTagList* rec, U8CPU tag)
28 while (rec != NULL)
30 if (rec->fTag == tag)
32 rec = rec->fNext;
34 return rec;
41 SkTagList* rec = *head;
44 while (rec != NULL)
46 SkTagList* next = rec->fNext;
48 if (rec->fTag == tag
    [all...]
SkViewPriv.cpp 24 Artist_SkTagList* rec = (Artist_SkTagList*)this->findTagList(kViewArtist_SkTagList); local
25 SkASSERT(rec == NULL || rec->fArtist != NULL);
27 return rec ? rec->fArtist : NULL;
38 Artist_SkTagList* rec = (Artist_SkTagList*)this->findTagList(kViewArtist_SkTagList); local
40 if (rec)
41 SkRefCnt_SafeAssign(rec->fArtist, obj);
70 Layout_SkTagList* rec = (Layout_SkTagList*)this->findTagList(kViewLayout_SkTagList); local
71 SkASSERT(rec == NULL || rec->fLayout != NULL)
84 Layout_SkTagList* rec = (Layout_SkTagList*)this->findTagList(kViewLayout_SkTagList); local
    [all...]
  /external/skia/src/core/
SkRefDict.cpp 37 Impl* rec = fImpl; local
38 while (rec) {
39 if (rec->fName.equals(name)) {
40 return rec->fData;
42 rec = rec->fNext;
52 Impl* rec = fImpl; local
54 while (rec) {
55 if (rec->fName.equals(name)) {
59 rec->fData->unref()
87 Impl* rec = fImpl; local
    [all...]
SkGlobals.cpp 21 SkGlobals::Rec::~Rec()
25 SkGlobals::Rec* SkGlobals::Find(uint32_t tag, Rec* (*create_proc)())
29 Rec* rec = bootstrap.fHead; local
30 while (rec)
32 if (rec->fTag == tag)
33 return rec;
34 rec = rec->fNext
79 Rec* rec = head; local
    [all...]
SkMetaData.cpp 54 Rec* rec = fRec; local
55 while (rec) {
56 if (kPtr_Type == rec->fType) {
57 PtrPair* pair = (PtrPair*)rec->data();
62 Rec* next = rec->fNext;
63 Rec::Free(rec);
64 rec = next
73 const Rec* rec = src.fRec; local
128 Rec* rec = Rec::Alloc(sizeof(Rec) + dataSize * count + len + 1); local
155 const Rec* rec = this->find(name, kS32_Type); local
168 const Rec* rec = this->find(name, kScalar_Type); local
181 const Rec* rec = this->find(name, kScalar_Type); local
194 const Rec* rec = this->find(name, kPtr_Type); local
211 const Rec* rec = this->find(name, kString_Type); local
218 const Rec* rec = this->find(name, kBool_Type); local
230 const Rec* rec = this->find(name, kData_Type); local
243 const Rec* rec = fRec; local
254 Rec* rec = fRec; local
    [all...]
  /external/srec/srec/crec/
srec_initialize.c 72 static void allocate_recognition1(srec *rec,
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->word_token_array_flags = (asr_int16_t*) CALLOC_CLR(max_word_tokens, sizeof(asr_int16_t), "search. (…)
    [all...]
srec_debug.h 26 void print_altword_token(srec* rec, altword_token* b, char* msg);
27 #define sanity_check_altwords(ReC,aWtOkEn)
30 void print_fsmnode_token(srec* rec, ftokenID token_index, char* msg);
31 void print_fsmnode_token_list(srec* rec, stokenID token_index, char* msg);
32 void print_search_status(srec* rec);
33 void print_fsmarc_token(srec* rec, stokenID token_index, char* msg);
34 void print_fsmarc_token_list(srec* rec, stokenID token_index, char* msg);
srec_tokens.c 37 int count_fsmarc_token_list(srec* rec, stokenID token_index)
43 fsmarc_token* stoken = &rec->fsmarc_token_array[token_index];
53 void initialize_free_fsmarc_tokens(srec *rec)
58 for (i = 0;i < rec->fsmarc_token_array_size - 1;i++)
60 rec->fsmarc_token_array[i].next_token_index = i + 1;
62 rec->fsmarc_token_array[rec->fsmarc_token_array_size-1].next_token_index = MAXstokenID;
63 rec->fsmarc_token_freelist = 0;
67 stokenID setup_free_fsmarc_token(srec *rec, FSMarc* arc, arcID fsm_arc_index, miscdata what_to_do_if_fails)
73 if (rec->fsmarc_token_freelist == MAXstokenID
    [all...]
srec_tokens.h 34 int count_fsmarc_token_list(srec* rec, stokenID token_index);
35 void initialize_free_fsmarc_tokens(srec *rec);
36 stokenID setup_free_fsmarc_token(srec *rec, FSMarc* arc, arcID fsm_arc_index, miscdata what_to_do_if_fails);
37 void free_fsmarc_token(srec *rec, stokenID old_token_index);
38 void sort_fsmarc_token_list(srec* rec, stokenID* ptoken_index);
44 void initialize_free_word_tokens(srec *rec);
45 wtokenID get_free_word_token(srec *rec, miscdata what_to_do_if_fails);
51 int count_fsmnode_token_list(srec* rec, ftokenID token_index);
52 void initialize_free_fsmnode_tokens(srec *rec);
53 ftokenID get_free_fsmnode_token(srec *rec, miscdata what_to_do_if_fails)
    [all...]
srec_debug.c 26 static char* sprint_altwords(srec* rec, altword_token* awtoken, char* buf)
43 void print_fsmnode_token(srec* rec, ftokenID token_index, char* msg)
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, ftoken->word_backtrace)
    [all...]
word_lattice.c 111 void print_word_token_backtrace(srec* rec, wtokenID wtoken_index, char* tail)
122 wtoken = &rec->word_token_array[wtoken_index];
123 if (wtoken->word < rec->context->olabels->num_words)
124 p = rec->context->olabels->words[wtoken->word];
128 ASSERT(rec->accumulated_cost_offset[ wtoken->end_time] != 0);
129 cost = wtoken->cost + rec->accumulated_cost_offset[ wtoken->end_time];
133 word_token* next_wtoken = &rec->word_token_array[wtoken->backtrace];
134 cost_for_word = cost - next_wtoken->cost - rec->accumulated_cost_offset[ next_wtoken->end_time];
150 int sprint_bword_token_backtrace(char* buf, int buflen, srec* rec, wtokenID wtoken_index)
158 word_token* wtoken = &rec->word_token_array[wtoken_index]
411 srec* rec = WHICH_RECOG(recm); local
447 srec* rec = WHICH_RECOG(recm); local
488 srec* rec = WHICH_RECOG(recm); local
    [all...]
srec_results.c 40 if (current_best_cost > recm->rec[i].current_best_cost)
42 current_best_cost = recm->rec[i].current_best_cost;
43 return_rec = &recm->rec[i];
53 srec* rec = WHICH_RECOG(recm); local
54 if (!rec) *id = -1;
55 else *id = rec->id;
78 srec* rec = WHICH_RECOG(recm); local
80 if (!rec)
82 end_frame = rec->current_search_frame;
83 if (!rec->srec_ended
94 srec* rec = WHICH_RECOG(recm); local
111 srec* rec = WHICH_RECOG(recm); local
143 srec* rec = (srec*)rec_void; local
150 srec* rec = (srec*)rec_void; local
157 srec* rec = (srec*)rec_void; local
172 srec* rec = (srec*)rec_void; local
180 srec* rec = (srec*)rec_void; local
200 srec* rec = (srec*)nbest; local
207 srec* rec = (srec*)rec_void; local
233 const srec* rec = (srec*) rec_void; local
285 const srec* rec = (srec*)rec_void; local
352 srec* rec = (srec*)rec_void; local
459 srec* rec = (srec*)rec_void; local
    [all...]
srec.c 60 static void reset_cost_offsets(multi_srec* rec, frameID current_search_frame,
62 static void update_internal_hmm_states(srec *rec, costdata *pcurrent_prune_delta,
78 static altword_token* reprune_altword_token_batch(srec* rec,
88 free_altword_token(rec, batch);
102 free_altword_token(rec, awtoken);
125 free_altword_token(rec, awtoken);
131 free_altword_token(rec, batch);
137 static void reprune_altword_tokens(srec* rec)
142 bigcostdata current_prune_delta = rec->prune_delta;
146 for (i = rec->active_fsmarc_tokens; i != MAXstokenID; i = stoken->next_token_index
2361 srec* rec = WHICH_RECOG(recm); local
    [all...]
  /dalvik/vm/hprof/
HprofOutput.cpp 128 int hprofFlushRecord(hprof_record_t *rec, FILE *fp)
130 if (rec->dirty) {
134 headBuf[0] = rec->tag;
135 U4_TO_BUF_BE(headBuf, 1, rec->time);
136 U4_TO_BUF_BE(headBuf, 5, rec->length);
142 nb = fwrite(rec->body, 1, rec->length, fp);
143 if (nb != (int)rec->length) {
147 rec->dirty = false;
161 hprof_record_t *rec = &ctx->curRec local
    [all...]
HprofHeap.cpp 124 hprof_record_t *rec = &ctx->curRec; local
133 rec->length >= BYTES_PER_SEGMENT)
152 hprofAddU1ToRecord(rec, heapTag);
153 hprofAddIdToRecord(rec, (hprof_object_id)obj);
160 hprofAddU1ToRecord(rec, heapTag);
161 hprofAddIdToRecord(rec, (hprof_object_id)obj);
162 hprofAddIdToRecord(rec, (hprof_id)jniObj);
172 hprofAddU1ToRecord(rec, heapTag);
173 hprofAddIdToRecord(rec, (hprof_object_id)obj);
174 hprofAddU4ToRecord(rec, ctx->gcThreadSerialNumber)
217 hprof_record_t *rec = &ctx->curRec; local
    [all...]
  /external/clang/test/Parser/
cxx-ambig-paren-expr.cpp 30 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/oprofile/opjitconv/
parse_dump.c 32 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->vma, rec->timestamp)
119 struct jr_code_debug_info const * rec = ptr; local
141 struct jr_prefix const * rec = ptr; local
    [all...]
  /external/e2fsprogs/lib/ext2fs/
bb_inode.c 60 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.block_buf)
158 struct set_badblock_record *rec = (struct set_badblock_record *) local
215 struct set_badblock_record *rec = (struct set_badblock_record *) local
    [all...]
  /external/skia/src/effects/
SkGroupShape.cpp 15 const Rec& rec = fList[index]; local
17 *mr = rec.fMatrixRef;
19 return rec.fShape;
33 Rec* rec; local
35 rec = fList.append();
37 rec = fList.insert(index);
39 rec->fShape = shape;
40 rec->fMatrixRef = mr
45 Rec& rec = fList[index]; local
53 Rec* rec = fList.begin(); local
66 const Rec* rec = fList.begin(); local
88 const Rec* rec = fList.begin(); local
    [all...]
  /external/srec/srec/include/
c42mul.h 45 #define SETUP_RETURN(REC) ((REC)->err_code= setjmp ((REC)->except_buf))
46 #define RETURN_ERROR(CODE) (rec->except_enabled ? longjmp(rec->except_buf, (CODE)) : SERVICE_ERROR(CODE))
47 #define SET_ERROR(CODE) (rec->err_code= CODE)
51 int multi_srec_viterbi(multi_srec *rec,
56 void multi_srec_get_result(multi_srec *rec);
60 void partial_traceback(multi_srec *rec, pattern_info *pattern,
62 void begin_recognition(multi_srec *rec, int begin_syn_node)
    [all...]
word_lattice.h 32 void print_word_token(srec* rec, wtokenID wtoken_index, char* msg);
33 void print_word_token_backtrace(srec* rec, wtokenID wtoken_index, char* tail);
34 void print_word_token_list(srec* rec, wtokenID wtoken_index, char* msg);
35 int sprint_bword_token_backtrace(char *buf, int len, srec* rec, wtokenID wtoken_index);
42 int srec_print_results(multi_srec *rec, int max_choices);
43 int srec_get_top_choice_score(multi_srec* rec, bigcostdata *cost, int do_incsil);
44 int srec_get_top_choice_transcription(multi_srec* rec, char *transcription, int len, int whether_strip_slot_markers) ;
46 int sprint_word_token_backtrace(char *transcription, int len, srec* rec, wtokenID wtoken_index);
47 void sort_word_lattice_at_frame(srec* rec, frameID frame);
48 int reprune_word_tokens(srec* rec, costdata current_best_cost)
    [all...]
  /external/openssl/ssl/
d1_enc.c 131 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->input,rec->length)
    [all...]
  /external/bluetooth/bluez/lib/bluetooth/
sdp_lib.h 155 int sdp_get_int_attr(const sdp_record_t *rec, uint16_t attr, int *value);
156 int sdp_get_string_attr(const sdp_record_t *rec, uint16_t attr, char *value, int valuelen);
164 sdp_data_t *sdp_data_get(const sdp_record_t *rec, uint16_t attr_id);
170 int sdp_attr_add(sdp_record_t *rec, uint16_t attr, sdp_data_t *data);
171 void sdp_attr_remove(sdp_record_t *rec, uint16_t attr);
172 void sdp_attr_replace(sdp_record_t *rec, uint16_t attr, sdp_data_t *data);
173 int sdp_set_uuidseq_attr(sdp_record_t *rec, uint16_t attr, sdp_list_t *seq);
174 int sdp_get_uuidseq_attr(const sdp_record_t *rec, uint16_t attr, sdp_list_t **seqp);
188 int sdp_attr_add_new(sdp_record_t *rec, uint16_t attr, uint8_t dtd, const void *p);
195 void sdp_set_info_attr(sdp_record_t *rec, const char *name, const char *prov, const char *desc)
    [all...]
  /external/skia/src/xml/
SkBML_XMLParser.cpp 94 static void rattr(unsigned verb, SkStream& s, BMLW& rec, SkXMLWriter& writer)
103 nameIndex = rec.fNextName; // record before the ++
104 set(rec.fNames, rec.fNextName++, s, data);
105 valueIndex = rec.fNextValue; // record before the ++
106 set(rec.fValues, rec.fNextValue++, s, 31);
109 nameIndex = rec.fNextName; // record before the ++
110 set(rec.fNames, rec.fNextName++, s, data)
174 BMLW rec; local
176 relem(rbyte(s), s, rec, writer); local
    [all...]
  /external/v8/test/cctest/
test-circular-queue.cc 27 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
28 CHECK_NE(NULL, rec);
29 *rec = i;
36 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
37 CHECK_NE(NULL, rec);
38 *rec = i;
42 Record* rec = reinterpret_cast<Record*>(scq.Enqueue()); local
43 CHECK_NE(NULL, rec);
44 *rec = 20;
51 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()) local
68 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
100 Record* rec = reinterpret_cast<Record*>(scq_->Enqueue()); local
145 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
157 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
169 Record* rec = reinterpret_cast<Record*>(scq.StartDequeue()); local
    [all...]

Completed in 1632 milliseconds

1 2 3 4 5 6 7 8 91011>>