Lines Matching defs:it

8 // This program is free software; you can redistribute it and/or modify
9 // it under the terms of the GNU General Public License as published by
13 // This program is distributed in the hope that it will be useful,
218 // computed, we put it in the table, and set PARENT_OFFSET_ to -1
401 // NULL if PARENT is the top-level DIE; otherwise it is the same as PARENT.
421 // it is NULL if the parent DIE is the top-level DIE.
437 // If the DIE is not a declaration, add it to the index.
471 // If the DIE is not a declaration, add it to the index.
472 // Gdb stores a namespace in the index even when it is
656 // the tracker and reset it when we're done.
703 Declaration_map::iterator it = this->declarations_.find(spec);
704 if (it != this->declarations_.end())
706 parent_offset = it->second.parent_offset_;
707 name = it->second.name_;
751 Declaration_map::iterator it = this->declarations_.find(die_offset);
752 if (it != this->declarations_.end())
754 off_t parent_offset = it->second.parent_offset_;
760 if (it->second.name_ != NULL)
761 context.append(it->second.name_);
783 Declaration_map::iterator it = this->declarations_.find(spec);
784 if (it != this->declarations_.end())
786 parent_offset = it->second.parent_offset_;
787 name = it->second.name_;
800 Declaration_map::iterator it = this->declarations_.find(parent_offset);
801 if (it != this->declarations_.end())
802 parent_offset = it->second.parent_offset_;
915 // If die is a TU, then it might correspond to a CU which we
916 // have read. If it does, then no need to read the pubnames.
917 // If it doesn't, then the caller will have to parse the
941 // enough that it isn't worth it. So just look up the offset again.
956 for (Declaration_map::iterator it = this->declarations_.begin();
957 it != this->declarations_.end();
958 ++it)
960 if (it->second.parent_offset_ == -1)
961 delete[] it->second.name_;
1020 // Return the just-read table so it can be cached.
1085 Pubname_offset_map::iterator it = this->cu_pubname_map_.find(cu_offset);
1086 if (it != this->cu_pubname_map_.end())
1087 return it->second;
1097 Pubname_offset_map::iterator it = this->cu_pubtype_map_.find(cu_offset);
1098 if (it != this->cu_pubtype_map_.end())
1099 return it->second;
1150 // if it's not already on the list. We only need to